Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Gronemeier, André - Fakultät für Informatik, Technische Universität Dortmund
Approximating Boolean Functions by OBDDs Andre Gronemeier
Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the
NOF-Multiparty Information Complexity Bounds for Pointer Jumping
