STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
The entropic limitations on VLSI computations(Extended Abstract)
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Aspects of information flow in VLSI circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The power of randomness for communication complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Lower bounds on communication complexity in distributed computer networks
Journal of the ACM (JACM)
On different modes of communication
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Energy consumption in VLSI circuits
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Expressing combinatorial optimization problems by linear programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty protocols and logspace-hard pseudorandom sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Tradeoffs between communication and space
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Randomized versus nondeterministic communication complexity
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the communication complexity of distributed algebraic computation
Journal of the ACM (JACM)
Non-deterministic communication complexity with few witnesses
Journal of Computer and System Sciences
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The linear-array conjecture in communication complexity is false
STOC '96 Proceedings of the twenty-eighth 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
The linear-array problem in communication complexity resolved
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Information and Computation
Communication complexity method for measuring nondeterminism in finite automata
Information and Computation
Randomized Communication Protocols (A Survey)
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
On the Power of Las Vegas II. Two-Way Finite Automata
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On the Power of Randomized Pushdown Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Two applications of information complexity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Lower bounds on communication complexity
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
On monotone formulae with restricted depth
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Approximation of boolean functions by combinatorial rectangles
Theoretical Computer Science
A note on monotone complexity and the rank of matrices
Information Processing Letters
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata
Journal of Computer and System Sciences
Multiparty communication complexity and very hard functions
Information and Computation
On relations between counting communication complexity classes
Journal of Computer and System Sciences
On the power of randomized multicounter machines
Theoretical Computer Science - Insightful theory
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
Robust lower bounds for communication and stream computation
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Learning complexity vs communication complexity
Combinatorics, Probability and Computing
On the complexity of communication complexity
Proceedings of the forty-first annual ACM symposium on Theory of computing
Concatenation of Regular Languages and Descriptional Complexity
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
Theoretical Computer Science
Deterministic blow-ups of minimal nondeterministic finite automata over a fixed alphabet
DLT'07 Proceedings of the 11th international conference on Developments in language theory
On the parity complexity measures of Boolean functions
Theoretical Computer Science
Complexity in union-free regular languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
ACM Transactions on Computation Theory (TOCT)
Computing a nonnegative matrix factorization -- provably
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Space-bounded communication complexity
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |
Several papers have recently dealt with techniques for proving area-time lower bounds for VLSI computation by “crossing sequence” methods. A number of natural questions are raised by these definitions. 1.Is the fooling set approach the most powerful way to get information-transfer-based lower bounds? We shall show it is not, and offer a candidate for the title “most powerful.” Of course, without a precise definition of “information transfer argument,” there could be other contenders. 2.Are the notions of the three papers cited equivalent? We shall exhibit certain inequivalences among the three notions, although open questions remain. However, we can resolve an open question of Papadimitriou and Sipser [PS] concerning the relationship between nondeterministic and deterministic communication complexity.