An Application of Hindman's Theorem to a Problem on Communication Complexity
Combinatorics, Probability and Computing
Approximating Boolean functions by OBDDs
Discrete Applied Mathematics
On the memory requirements of XPath evaluation over XML streams
Journal of Computer and System Sciences
A note on efficient aggregate queries in sensor networks
Theoretical Computer Science
A characterization of average case communication complexity
Information Processing Letters
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
On covering and rank problems for boolean matrices and their applications
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Multiparty equality function computation in networks with point-to-point links
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Streaming algorithms for recognizing nearly well-parenthesized expressions
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Streaming computations with a loquacious prover
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Streaming algorithms for language recognition problems
Theoretical Computer Science
| Hi-index | 0.00 |