List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Asymptotically optimal lower bounds on the NIH-multi-party information complexity of the AND-function and disjointness | 2012-04-24 | Paper |
| A note on the decoding complexity of error-correcting codes Information Processing Letters | 2010-01-29 | Paper |
| Applying approximate counting for computing the frequency moments of long data streams Theory of Computing Systems | 2009-08-06 | Paper |
| NOF-Multiparty Information Complexity Bounds for Pointer Jumping Lecture Notes in Computer Science | 2007-09-05 | Paper |
| Approximating Boolean functions by OBDDs Discrete Applied Mathematics | 2007-02-19 | Paper |
| Mathematical Foundations of Computer Science 2004 Lecture Notes in Computer Science | 2005-08-22 | Paper |
Research outcomes over time
This page was built for person: André Gronemeier
