Hauptinhalt
André Gronemeier
| Address: |
|
Informatik 2, Technische Universität Dortmund, D-44221 Dortmund, Germany |
| Office: |
|
Campus Nord, Otto-Hahn-Straße 14, room 307 |
| E-mail: |
|
Andre.Gronemeier cs.uni-dortmund.de
|
| Phone: |
|
+49 (0)231 755-7729 |
| Fax: |
|
+49 (0)231 755-2047
|
Research Interests: Communication Complexity, Information Theory, Branching Programs, Complexity Theory
Publications
-
André Gronemeier, Martin Sauerhoff (2007):
Applying Approximate Counting for Computing the Frequency Moments of Long Data Streams.
To appear in Theory of Computing Systems, 2006.
-
André Gronemeier (2007):
Approximating Boolean Functions by OBDDs.
Discrete Applied Mathematics, Volume 155, Issue 2,15 January 2007, Pages 194-209.
Conference Version from MFCS 2004:Approximating Boolean Functions by OBDDs, with appendix (PDF)
-
André Gronemeier (2006):
A Note on the Decoding Complexity of Error-Correcting Codes.
Information Processing Letters, Volume 100, Issue 3, 15 November 2006, Pages 116-119.
-
André Gronemeier (2006):
NOF-Multiparty Information Complexity Bounds for Pointer Jumping.
MFCS 2006, in LNCS Volume 4162, Pages 459-470.
Draft Version (PDF)
