The VLSI Complexity of Selected Graph Problems
Journal of the ACM (JACM)
Aspects of information flow in VLSI circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A VLSI Solution to the Vertical Segment Visibility Problem
IEEE Transactions on Computers
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
STOC '85 Proceedings of the seventeenth 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
On the communication complexity of graph properties
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
Monotone circuits for connectivity require super-logarithmic depth
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The communication complexity of several problems in matrix computation
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A hundred impossibility proofs for distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed 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
Two messages are almost optimal for conveying information
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Functions with bounded symmetric communication complexity and circuits with mod m gates
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Monotone circuits for matching require linear depth
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Rounds in communication complexity revisited
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Resiliency of interactive distributed tasks (extended abstracts)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
On the value of information in distributed decision-making (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Broadcast with partial knowledge (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Randomized versus nondeterministic communication complexity
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Monotone circuits for matching require linear depth
Journal of the ACM (JACM)
Deterministic coding for interactive communication
STOC '93 Proceedings of the twenty-fifth 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
A weight-size trade-off for circuits with MOD m gates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Pseudorandomness for network algorithms
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A coding theorem for distributed computation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Optimal parallel dictionary matching and compression (extended abstract)
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
On data structures and asymmetric communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On randomized one-round communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Temporal versus first-order logic to query temporal databases
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The linear-array conjecture in communication complexity is false
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The space complexity of approximating the frequency moments
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
Public vs. private coin flips in one round communication games (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Direct product results and the GCD problem, in old and new communication models
STOC '97 Proceedings of the twenty-ninth 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
Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A characterization of span program size and improved lower bounds for monotone span programs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Communication-optimal parallel minimum spanning tree algorithms (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Optimal bounds for the predecessor problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
VLSI design parsing (preliminary version)
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
A probabilistic algorithm for updating files over a communication link
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Lower Bounds on Information Transfer in Distributed Computations
Journal of the ACM (JACM)
Information Transfer in Distributed Computing with Applications to VLSI
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Worst case constant time priority queue
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
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
Communication complexity for file synchronization is undecidable
ACM SIGACT News
Quantum communication and complexity
Theoretical Computer Science - Natural computing
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
Randomized Communication Protocols (A Survey)
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Quantum Entanglement and the Communication Complexity of the Inner Product Function
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
On the Power of Las Vegas II. Two-Way Finite Automata
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Space Time Tradeoffs for Graph Properties
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Measures of Nondeterminism in Finite Automata
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Communication Complexity of Approximate Set Packing and Covering
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Improved Quantum Communication Complexity Bounds for Disjointness and Equality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Functional Inversion and Communication Complexity
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
On the Power of Randomized Pushdown Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
A Discrete Approximation and Communication Complexity Approach to the Superposition Problem
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
IEEE Transactions on Mobile Computing
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
Randomized Simultaneous Messages: Solution Of A Problem Of Yao In Communication Complexity
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
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
Lower bounds on communication complexity
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Communication with secrecy constraints
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
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On notions of information transfer in VLSI circuits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Approximation of boolean functions by combinatorial rectangles
Theoretical Computer Science
A characterization of span program size and improved lower bounds for monotone span programs
Computational Complexity
A lower bound for integer multiplication on randomized ordered read-once branching programs
Information and Computation
Exact communication costs for consensus and leader in a tree
Journal of Discrete Algorithms
The Log-Rank conjecture and low degree polynomials
Information Processing Letters
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata
Journal of Computer and System Sciences
Exponential separation of quantum and classical one-way communication complexity
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Multiparty communication complexity and very hard functions
Information and Computation
Communication complexity as a lower bound for learning in games
ICML '04 Proceedings of the twenty-first international conference on Machine learning
An information statistics approach to data stream and communication complexity
Journal of Computer and System Sciences - Special issue on FOCS 2002
Recent issues in reasoning about knowledge
TARK '90 Proceedings of the 3rd conference on Theoretical aspects of reasoning about knowledge
Cellular automata and communication complexity
Theoretical Computer Science - Discrete applied problems, florilegium for E. Goles
On complexity of single-minded auction
Journal of Computer and System Sciences
Evaluation of the capability of interaction
ACM SIGGROUP Bulletin - Special issue on community-based learning: explorations into theoretical groundings, empirical findings and computer support
On the memory requirements of XPath evaluation over XML streams
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Synopses for query optimization: a space-complexity perspective
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tensor norms and the classical communication complexity of nonlocal quantum measurement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the computational power of iterative auctions
Proceedings of the 6th ACM conference on Electronic commerce
Communication complexity of common voting rules
Proceedings of the 6th ACM conference on Electronic commerce
On the power of randomized multicounter machines
Theoretical Computer Science - Insightful theory
Buffering in query evaluation over XML streams
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Collecting correlated information from a sensor network
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the Communication Complexity of Multilateral Trading: Extended Report
Autonomous Agents and Multi-Agent Systems
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Pricing multicasting in more flexible network models
ACM Transactions on Algorithms (TALG)
Exponential communication inefficiency of demand queries
TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
The communication cost of selfishness: ex post implementation
TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
The Complexity of Online Memory Checking
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Pattern matching with address errors: rearrangement distances
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Synopses for query optimization: A space-complexity perspective
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
The communication complexity of coalition formation among autonomous agents
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
The communication complexity of the Hamming distance problem
Information Processing Letters
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 characterization of average case communication complexity
Information Processing Letters
Tight lower bounds for query processing on streaming and external memory data
Theoretical Computer Science
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Individual communication complexity
Journal of Computer and System Sciences
Computational Complexity
The VLSI Complexity of Sorting
IEEE Transactions on Computers
Bit complexity of breaking and achieving symmetry in chains and rings
Journal of the ACM (JACM)
On the Existence of Unconditionally Privacy-Preserving Auction Protocols
ACM Transactions on Information and System Security (TISSEC)
Algorithms for distributed functional monitoring
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
General theory of information transfer: Updated
Discrete Applied Mathematics
Classical interaction cannot replace a quantum message
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Universal semantic communication I
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Robust lower bounds for communication and stream computation
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Sketching in adversarial environments
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Distributed selection: a missing piece of data aggregation
Communications of the ACM - Enterprise information integration: and other tools for merging data
Theoretical Computer Science
Informational overhead of incentive compatibility
Proceedings of the 9th ACM conference on Electronic commerce
Verifying time, memory and communication bounds in systems of reasoning agents
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Can quantum mechanics help distributed computing?
ACM SIGACT News
On the Average Case Communication Complexity for Detection in Sensor Networks
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Multi-party Quantum Communication Complexity with Routed Messages
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On the Non-deterministic Communication Complexity of Regular Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
The complexity of online memory checking
Journal of the ACM (JACM)
Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Multi-dimensional online tracking
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Inapproximability of Combinatorial Public Projects
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
On Toda's Theorem in Structural Communication Complexity
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Optimized union of non-disjoint distributed data sets
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
On the complexity of communication complexity
Proceedings of the forty-first annual ACM symposium on Theory of computing
Pattern matching with address errors: Rearrangement distances
Journal of Computer and System Sciences
New bounds on classical and quantum one-way communication complexity
Theoretical Computer Science
Negotiation criteria for multiagent resource allocation
The Knowledge Engineering Review
Optimal tracking of distributed heavy hitters and quantiles
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Kolmogorov Complexity and Combinatorial Methods in Communication Complexity
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Theoretical Computer Science
Partition Arguments in Multiparty Communication Complexity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Amortized Communication Complexity of Distributions
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Discrete Applied Mathematics
Electronic Notes in Theoretical Computer Science (ENTCS)
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Complexity Lower Bounds using Linear Algebra
Foundations and Trends® in Theoretical Computer Science
Lower bounds on the size of sweeping automata
Journal of Automata, Languages and Combinatorics
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
On the Tightness of the Buhrman-Cleve-Wigderson Simulation
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Information-theoretic bounds for multiround function computation in collocated networks
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Network computing capacity for the reverse butterfly network
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
On the separation between k-party and (k - 1)-party nondeterministic message complexities
DLT'02 Proceedings of the 6th international conference on Developments in language theory
A direct sum theorem in communication complexity via message compression
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Function matching: algorithms, applications, and a lower bound
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On covering and rank problems for boolean matrices and their applications
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Fast evaluation of union-intersection expressions
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Communication lower bounds via the chromatic number
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Full and local information in distributed decision making
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Distributed function computation in asymmetric communication scenarios
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Infinite-message distributed source coding for two-terminal interactive computing
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
A strong direct product theorem for disjointness
Proceedings of the forty-second ACM symposium on Theory of computing
Information complexity: a tutorial
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximate privacy: foundations and quantification (extended abstract)
Proceedings of the 11th ACM conference on Electronic commerce
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
ACM SIGACT News
About randomised distributed graph colouring and graph partition algorithms
Information and Computation
IEEE Transactions on Information Theory
Inapproximability for VCG-based combinatorial auctions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On the expressive power of CNF formulas of bounded tree- and clique-width
Discrete Applied Mathematics
The arrow of time through the lens of computing
Time for verification
Choosing, agreeing, and eliminating in communication complexity
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Composition theorems in communication complexity
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
Journal of Computer and System Sciences
Communication complexity and intrinsic universality in cellular automata
Theoretical Computer Science
Algorithms for distributed functional monitoring
ACM Transactions on Algorithms (TALG)
A Communication Approach to the Superposition Problem
Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
Market communication in production economies
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Kolmogorov complexity and combinatorial methods in communication complexity
Theoretical Computer Science
Communication complexity in number-conserving and monotone cellular automata
Theoretical Computer Science
Error-free multi-valued consensus with byzantine failures
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Traced communication complexity of cellular automata
Theoretical Computer Science
Tight bounds on communication complexity of symmetric XOR functions in one-way and SMP models
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
The hardness of median in the synchronized bit communication model
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Non-local box complexity and secure function evaluation
Quantum Information & Computation
Distributed construction of quantum fingerprints
Quantum Information & Computation
Quantum and classical message protect identification via quantum channels
Quantum Information & Computation
Classical and quantum fingerprinting with shared randomness and one-sided error
Quantum Information & Computation
A geometric approach to quantum circuit lower bounds
Quantum Information & Computation
Optimal fingerprinting strategies with one-sided error
Quantum Information & Computation
Communication complexities of symmetric XOR functions
Quantum Information & Computation
Quantum communication complexity of block-composed functions
Quantum Information & Computation
Space lower bounds for online pattern matching
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Memory lower bounds for XPath evaluation over XML streams
Journal of Computer and System Sciences
On the power of lower bound methods for one-way quantum communication complexity
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
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
Toward in vivo nanoscale communication networks: utilizing an active network architecture
Frontiers of Computer Science in China
On communication protocols that compute almost privately
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
A little advice can be very helpful
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Networks cannot compute their diameter in sublinear time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The potential of on-chip multiprocessing for QCD machines
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Improved algorithms for polynomial-time decay and time-decay with additive error
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Tight lower bounds for query processing on streaming and external memory data
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Hadamard tensors and lower bounds on multiparty communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Energy-Privacy trade-offs in VLSI computations
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Complexity of quantum uniform and nonuniform automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
NOF-multiparty information complexity bounds for pointer jumping
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Evaluation of analogical proportions through Kolmogorov complexity
Knowledge-Based Systems
Multidimensional online tracking
ACM Transactions on Algorithms (TALG)
The complexity of querying external memory and streaming data
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Noise and the magic square game
Quantum Information Processing
String rearrangement metrics: a survey
Algorithms and Applications
Private capacity of broadcast channels
General Theory of Information Transfer and Combinatorics
An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Quantum online memory checking
TQC'09 Proceedings of the 4th international conference on Theory of Quantum Computation, Communication, and Cryptography
Communication complexity: from two-party to multiparty
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Communication requirements for stable marriages
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
The complexity of classical and quantum branching programs: a communication complexity approach
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
The multiparty communication complexity of set disjointness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A new exponential separation between quantum and classical one-way communication complexity
Quantum Information & Computation
The communication complexity of non-signaling distributions
Quantum Information & Computation
The relationship between inner product and counting cycles
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Sketching in Adversarial Environments
SIAM Journal on Computing
SIAM Journal on Computing
Communication complexity of approximating voting rules
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Trade-Offs Between Time, Space, Cooperation, and Communication Complexity for CD Grammar Systems
Fundamenta Informaticae
The NOF multiparty communication complexity of composed functions
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Streaming and communication complexity of clique approximation
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
On communication protocols that compute almost privately
Theoretical Computer Science
Pattern matching in multiple streams
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Selfish load balancing under partial knowledge
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
A lower bound on entanglement-assisted quantum communication complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Separating deterministic from nondeterministic nof multiparty communication complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
On the communication complexity of approximate nash equilibria
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Space-bounded communication complexity
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Natural Computing: an international journal
Experimental multipartner quantum communication complexity employing just one qubit
Natural Computing: an international journal
Space lower bounds for online pattern matching
Theoretical Computer Science
Theoretical Computer Science
Quantum entanglement and the communication complexity of the inner product function
Theoretical Computer Science
Towards characterizing the non-locality of entangled quantum states
Theoretical Computer Science
From information to exact communication
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hardware Cost Measurement of Lightweight Security Protocols
Wireless Personal Communications: An International Journal
State succinctness of two-way finite automata with quantum and classical states
Theoretical Computer Science
On the time and the bit complexity of distributed randomised anonymous ring colouring
Theoretical Computer Science
Multiparty communication complexity of vector---valued and sum---type functions
Information Theory, Combinatorics, and Search Theory
Derandomized Parallel Repetition Theorems for Free Games
Computational Complexity
Hadamard tensors and lower bounds on multiparty communication complexity
Computational Complexity
Information and Computation
ACM Transactions on Computation Theory (TOCT)
Choosing, Agreeing, and Eliminating in Communication Complexity
Computational Complexity
Optimal Collapsing Protocol for Multiparty Pointer Jumping
Theory of Computing Systems
| Hi-index | 0.21 |
Let M &equil; {0, 1, 2, ..., m—1} , N &equil; {0, 1, 2,..., n—1} , and f:M × N → {0, 1} a Boolean-valued function. We will be interested in the following problem and its related questions. Let i &egr; M, j &egr; N be integers known only to two persons P1 and P2, respectively. For P1 and P2 to determine cooperatively the value f(i, j), they send information to each other alternately, one bit at a time, according to some algorithm. The quantity of interest, which measures the information exchange necessary for computing f, is the minimum number of bits exchanged in any algorithm. For example, if f(i, j) &equil; (i + j) mod 2. then 1 bit of information (conveying whether i is odd) sent from P1 to P2 will enable P2 to determine f(i, j), and this is clearly the best possible. The above problem is a variation of a model of Abelson [1] concerning information transfer in distributive computions.