The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Andre Gronemeier: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andre Gronemeier
    Approximating Boolean Functions by OBDDs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:251-262 [Conf]
  2. Andre Gronemeier
    NOF-Multiparty Information Complexity Bounds for Pointer Jumping. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:459-470 [Conf]
  3. Andre Gronemeier
    Approximating Boolean functions by OBDDs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:2, pp:194-209 [Journal]
  4. Andre Gronemeier
    A note on the decoding complexity of error-correcting codes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:3, pp:116-119 [Journal]

  5. Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness. [Citation Graph (, )][DBLP]


  6. Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.001secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002