Fault tolerant planar communication networks
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Nondeterministic communication with a limited number of advice bits
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A lower bound theorem for indexing schemes and its application to multidimensional range queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACM Computing Surveys (CSUR)
Learning functions represented as multiplicity automata
Journal of the ACM (JACM)
Cellular automata: energy consumption and physical feasibility
Fundamenta Informaticae - Special issue on cellular automata
The Communication Complexity of the Universal Relation
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
Algorithms and theory of computation handbook
Parallel computation: models and complexity issues
Algorithms and theory of computation handbook
Theoretical Computer Science
Cellular Automata: Energy Consumption and Physical Feasibility
Fundamenta Informaticae - Cellular Automata
Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata
Theoretical Computer Science
Hi-index | 0.00 |