NOF-Multiparty Information Complexity Bounds for Pointer Jumping. - André Gronemeier (MFCS, 2006)

A note on the decoding complexity of error-correcting codes. - André Gronemeier (Inf. Process. Lett., 2006)

Approximating Boolean functions by OBDDs. - André Gronemeier (Discret. Appl. Math., 2007)

Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness. - André Gronemeier (STACS, 2009)

Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information - André Gronemeier (CoRR, 2009)

Applying Approximate Counting for Computing the Frequency Moments of Long Data Streams. - André Gronemeier; Martin Sauerhoff (Theory Comput. Syst., 2009)

Information Complexity and Data Stream Algorithms for Basic Problems. - André Gronemeier (2010)