 | 2009 |
|---|
| 7 |       | Andre Gronemeier:
Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness.
STACS 2009: 505-516 |
| 6 | | Andre Gronemeier:
Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information
CoRR abs/0902.1609: (2009) |
| 5 | | Andre Gronemeier,
Martin Sauerhoff:
Applying Approximate Counting for Computing the Frequency Moments of Long Data Streams.
Theory Comput. Syst. 44(3): 332-348 (2009) |
| 2007 |
|---|
| 4 | | Andre Gronemeier:
Approximating Boolean functions by OBDDs.
Discrete Applied Mathematics 155(2): 194-209 (2007) |
| 2006 |
|---|
| 3 | | Andre Gronemeier:
NOF-Multiparty Information Complexity Bounds for Pointer Jumping.
MFCS 2006: 459-470 |
| 2 | | Andre Gronemeier:
A note on the decoding complexity of error-correcting codes.
Inf. Process. Lett. 100(3): 116-119 (2006) |
| 2004 |
|---|
| 1 | | Andre Gronemeier:
Approximating Boolean Functions by OBDDs.
MFCS 2004: 251-262 |
Data released under the ODC-BY 1.0 license — See also our legal information page