dblp.uni-trier.dewww.uni-trier.de

Andre Gronemeier

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
6EEAndre Gronemeier: Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness. STACS 2009: 505-516
5EEAndre Gronemeier: Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information CoRR abs/0902.1609: (2009)
2007
4EEAndre Gronemeier: Approximating Boolean functions by OBDDs. Discrete Applied Mathematics 155(2): 194-209 (2007)
2006
3EEAndre Gronemeier: NOF-Multiparty Information Complexity Bounds for Pointer Jumping. MFCS 2006: 459-470
2EEAndre Gronemeier: A note on the decoding complexity of error-correcting codes. Inf. Process. Lett. 100(3): 116-119 (2006)
2004
1EEAndre Gronemeier: Approximating Boolean Functions by OBDDs. MFCS 2004: 251-262

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)