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