André Gronemeier

According to our database, André Gronemeier authored at least 7 papers between 2006 and 2010.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2010

Information Complexity and Data Stream Algorithms for Basic Problems.

André Gronemeier

PhD thesis, 2010

2009

Applying Approximate Counting for Computing the Frequency Moments of Long Data Streams.

André Gronemeier, Martin Sauerhoff

Theory Comput. Syst., 2009

Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information

André Gronemeier

CoRR, 2009

Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness.

André Gronemeier

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2007

Approximating Boolean functions by OBDDs.

André Gronemeier

Discret. Appl. Math., 2007

2006

A note on the decoding complexity of error-correcting codes.

André Gronemeier

Inf. Process. Lett., 2006

NOF-Multiparty Information Complexity Bounds for Pointer Jumping.

André Gronemeier

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006