The following pages link to André Gronemeier (Q845842):
Displayed 6 items.
- A note on the decoding complexity of error-correcting codes (Q845843) (← links)
- Approximating Boolean functions by OBDDs (Q867861) (← links)
- Applying approximate counting for computing the frequency moments of long data streams (Q2272207) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311101) (← links)
- Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness (Q5390003) (← links)
- NOF-Multiparty Information Complexity Bounds for Pointer Jumping (Q5756702) (← links)