Andre Gronemeier

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2009
j3		Andre Gronemeier, Martin Sauerhoff: Applying Approximate Counting for Computing the Frequency Moments of Long Data Streams. Theory Comput. Syst. 44(3): 332-348 (2009)
c3		Andre Gronemeier: Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness. STACS 2009: 505-516
i1		Andre Gronemeier: Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information. CoRR abs/0902.1609 (2009)
	2007
j2		Andre Gronemeier: Approximating Boolean functions by OBDDs. Discrete Applied Mathematics 155(2): 194-209 (2007)
	2006
j1		Andre Gronemeier: A note on the decoding complexity of error-correcting codes. Inf. Process. Lett. 100(3): 116-119 (2006)
c2		Andre Gronemeier: NOF-Multiparty Information Complexity Bounds for Pointer Jumping. MFCS 2006: 459-470
	2004
c1		Andre Gronemeier: Approximating Boolean Functions by OBDDs. MFCS 2004: 251-262

Coauthor Index

Last update Mon May 20 14:09:57 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page