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
The linear-array problem in communication complexity resolved
STOC '97 Proceedings of the twenty-ninth 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
Efficient search for approximate nearest neighbor in high dimensional spaces
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On separating the read-k-times branching program hierarchy
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
One-way functions are essential for single-server private information retrieval
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Chinese remaindering with errors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Lower bounds for high dimensional nearest neighbor search and related problems
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
Communication-processor tradeoffs in limited resources PRAM
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
ACM Computing Surveys (CSUR)
Sharing the cost of muliticast transmissions (preliminary version)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On quantum and probabilistic communication: Las Vegas and one-way protocols
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Learning functions represented as multiplicity automata
Journal of the ACM (JACM)
Testing and spot-checking of data streams (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Communication complexity of document exchange
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Estimating simple functions on the union of data streams
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Communication preserving protocols for secure function evaluation
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Information and Computation
Lower bounds for dynamic algebraic problems
Information and Computation
Communication complexity method for measuring nondeterminism in finite automata
Information and Computation
Space lower bounds for distance approximation in the data stream model
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximate counting of inversions in a data stream
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On communication over an entanglement-assisted quantum channel
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reductions in streaming algorithms, with an application to counting triangles in graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed streams algorithms for sliding windows
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
On the nonapproximability of boolean Function by OBDDs and read-k-times Branching Programs
Information and Computation
Quantum communication and complexity
Theoretical Computer Science - Natural computing
Constructing set systems with prescribed intersection sizes
Journal of Algorithms
Time-space trade-off lower bounds for randomized computation of decision problems
Journal of the ACM (JACM)
A linear lower bound on the unbounded error probabilistic communication complexity
Journal of Computer and System Sciences - Complexity 2001
Lower bounds for linearly transformed OBDDs and FBDDs
Journal of Computer and System Sciences
Communication Complexity for Asynchronous Systems of Finite Devices
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Multiparty Communication Complexity: Very Hard Functions
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
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
Approximations by OBDDs and the Variable Ordering Problem
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
New Applications of the Incompressibility Method
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
Secure Multiparty Computation of Approximations
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
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
On Quantum and Approximate Privacy
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Hyper-Encryption and Everlasting Security
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On the Representation of Boolean Predicates of the Diffie-Hellman Function
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Complete Classifications for the Communication Complexity of Regular Languages
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Hardness Results for Multicast Cost Sharing
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Communication Adaptive Self-Stabilizing Group Membership Service
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
On the Power of Randomized Pushdown Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Geometric Searching over the Rationals
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Optimal, Distributed Decision-Making: The Case of No Communication
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation 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
On Multipartition Communication Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Information Processing Letters
On the power of quantum fingerprinting
Proceedings of the thirty-fifth annual ACM symposium on Theory of 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
On finding common neighborhoods in massive graphs
Theoretical Computer Science
Bounds for Small-Error and Zero-Error Quantum Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
An Approximate L1-Difference Algorithm for Massive Data Streams
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximation of boolean functions by combinatorial rectangles
Theoretical Computer Science
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines
Journal of Computer and System Sciences
A characterization of span program size and improved lower bounds for monotone span programs
Computational Complexity
Processing set expressions over continuous update streams
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Hardness results for multicast cost sharing
Theoretical Computer Science
A note on monotone complexity and the rank of matrices
Information Processing Letters
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
Triangle-Freeness is Hard to Detect
Combinatorics, Probability and Computing
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
BDDs: design, analysis, complexity, and applications
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
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
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Algorithmic complexity of recursive and inductive algorithms
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
A note on efficient aggregate queries in sensor networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed 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
Towards proving strong direct product theorems
Computational Complexity
On the difficulty of scalably detecting network attacks
Proceedings of the 11th ACM conference on Computer and communications security
On relations between counting communication complexity classes
Journal of Computer and System Sciences
Cellular automata and communication complexity
Theoretical Computer Science - Discrete applied problems, florilegium for E. Goles
On multi-partition communication complexity
Information and Computation
Tracking set-expression cardinalities over continuous update streams
The VLDB Journal — The International Journal on Very Large Data Bases
On complexity of single-minded auction
Journal of Computer and System Sciences
Distributed approximation: a survey
ACM SIGACT News
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
Bounded-depth circuits: separating wires from gates
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Tensor norms and the classical communication complexity of nonlocal quantum measurement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
What's hot and what's not: tracking most frequent items dynamically
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
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
Join-distinct aggregate estimation over update streams
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Graph distances in the streaming model: the value of space
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
Pricing multicasting in more flexible network models
ACM Transactions on Algorithms (TALG)
Quantum branching programs and space-bounded nonuniform quantum complexity
Theoretical Computer Science
Summarizing and mining inverse distributions on data streams via dynamic inverse sampling
VLDB '05 Proceedings of the 31st international conference on Very large data bases
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
On the influence of the variable ordering for algorithmic learning using OBDDs
Information and Computation
Lower bounds for asymmetric communication channels and distributed source coding
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Trading off space for passes in graph streaming problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Sampling algorithms for l2 regression and applications
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
Limits on the ability of quantum states to convey classical messages
Journal of the ACM (JACM)
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
Bounded-error quantum state identification and exponential separations in communication complexity
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
To randomize or not to randomize: space optimal summaries for hyperlink analysis
Proceedings of the 15th international conference on World Wide Web
Information Processing Letters
Data streaming algorithms for estimating entropy of network traffic
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Non-independent randomized rounding and coloring
Discrete Applied Mathematics - Special issue: Efficient algorithms
Symmetric polynomials over Zm and simultaneous communication protocols
Journal of Computer and System Sciences - Special issue on FOCS 2003
Exponential separation of quantum and classical online space complexity
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Spatial scan statistics: approximations and performance study
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Secure multiparty computation of approximations
ACM Transactions on Algorithms (TALG)
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
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Bell: bit-encoding online memory leak detection
Proceedings of the 12th international conference on Architectural support for programming languages and operating systems
Comparing the size of NFAs with and without ε-transitions
Theoretical Computer Science
Tight lower bounds for query processing on streaming and external memory data
Theoretical Computer Science
Separating AC0 from depth-2 majority circuits
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Limitations of VCG-based mechanisms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The communication complexity of uncoupled nash equilibrium procedures
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Negative weights make adversaries stronger
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Lower bounds in communication complexity based on factorization norms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Practical Algorithms and Lower Bounds for Similarity Search in Massive Graphs
IEEE Transactions on Knowledge and Data Engineering
A broader view on the limitations of information processing and communication by nature
Natural Computing: an international journal
Machine models and lower bounds for query processing
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Individual communication complexity
Journal of Computer and System Sciences
Computational Complexity
Probabilistic abstraction for model checking: An approach based on property testing
ACM Transactions on Computational Logic (TOCL)
Time-decaying sketches for sensor data aggregation
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Two absolute bounds for distributed bit complexity
Theoretical Computer Science
The complexity of fixed point models of trust in distributed networks
Theoretical Computer Science
Bit complexity of breaking and achieving symmetry in chains and rings
Journal of the ACM (JACM)
Lower bounds for predecessor searching in the cell probe model
Journal of Computer and System Sciences
Matroid intersection, pointer chasing, and Young's seminormal representation of Sn
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On distance to monotonicity and longest increasing subsequence of a data stream
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Finding large 3-free sets I: The small n case
Journal of Computer and System Sciences
The pattern matrix method for lower bounds on quantum communication
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Classical interaction cannot replace a quantum message
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Evolvability from learning algorithms
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
Communication in the presence of replication
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On the communication requirements of verifying the VCG outcome
Proceedings of the 9th ACM conference on Electronic commerce
Informational overhead of incentive compatibility
Proceedings of the 9th ACM conference on Electronic commerce
Computational Complexity
Distributed computation of the mode
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Can quantum mechanics help distributed computing?
ACM SIGACT News
A Short Introduction to Computational Social Choice
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
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
Smallest Formulas for Parity of 2k Variables Are Essentially Unique
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Multi-party Quantum Communication Complexity with Routed Messages
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Improved Separations between Nondeterministic and Randomized Multiparty Communication
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
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
Theoretical Computer Science
New results for finding common neighborhoods in massive graphs in the data stream model
Theoretical Computer Science
A note on the size of OBDDs for the graph of integer multiplication
Information Processing Letters
On Finding Frequent Elements in a Data Stream
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Finding duplicates in a data stream
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
Tight results for clustering and summarizing data streams
Proceedings of the 12th International Conference on Database Theory
The average-case complexity of counting distinct elements
Proceedings of the 12th International Conference on Database Theory
Guest Column: correlation bounds for polynomials over {0 1}
ACM SIGACT News
Quantum multiparty communication complexity and circuit lower bounds
Mathematical Structures in Computer Science
Learning complexity vs communication complexity
Combinatorics, Probability and Computing
On the guessing number of shift graphs
Journal of Discrete Algorithms
Larger Lower Bounds on the OBDD Complexity of Integer Multiplication
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Numerical linear algebra in the streaming model
Proceedings of the forty-first annual ACM symposium on Theory of computing
On the complexity of communication complexity
Proceedings of the forty-first annual ACM symposium on Theory of computing
An axiomatic approach to algebrization
Proceedings of the forty-first annual ACM symposium on Theory of computing
New bounds on classical and quantum one-way communication complexity
Theoretical Computer Science
Estimating the confidence of conditional functional dependencies
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
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
Small synopses for group-by query verification on outsourced data streams
ACM Transactions on Database Systems (TODS)
Theoretical Computer Science
Secure Function Collection with Sublinear Storage
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
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
Limits and Applications of Group Algebras for Parameterized Problems
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Improved Separations between Nondeterministic and Randomized Multiparty Communication
ACM Transactions on Computation Theory (TOCT)
Discrete Applied Mathematics
Auctions with severely bounded communication
Journal of Artificial Intelligence Research
Automated design of multistage mechanisms
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
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
Trading off space for passes in graph streaming problems
ACM Transactions on Algorithms (TALG)
Compiling the votes of a subelectorate
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
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 Power of Small-Depth Computation
Foundations and Trends® in Theoretical Computer Science
Non-independent randomized rounding and coloring
Discrete Applied Mathematics - Special issue: Efficient algorithms
On the influence of the variable ordering for algorithmic learning using OBDDs
Information and Computation
On multi-partition communication complexity
Information and Computation
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
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
Pushdown automata and multicounter machines, a comparison of computation modes
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A direct sum theorem in communication complexity via message compression
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A new rank technique for formula size lower bounds
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Languages with bounded multiparty communication complexity
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
On the size of randomized OBDDs and read-once branching programs for k-stable functions
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Multi-party finite computations
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Finding a duplicate and a missing item in a stream
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Quantum multiparty communication complexity and circuit lower bounds
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Improved lower bounds for tree-like resolution over linear inequalities
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
A lower bound for agnostically learning disjunctions
COLT'07 Proceedings of the 20th annual conference on Learning theory
Unbounded-error classical and quantum communication complexity
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
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
Exact OBDD bounds for some fundamental functions
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Element distinctness and sorting on one-tape off-line turing machines
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
On the parity complexity measures of Boolean functions
Theoretical Computer Science
Note: Smallest formulas for the parity of 2 k variables are essentially unique
Theoretical Computer Science
Aggregate message authentication codes
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
On the OBDD complexity of the most significant bit of integer multiplication
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Optimal lower bounds on regular expression size using communication complexity
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Parallel repetition of the odd cycle game
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
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
Fast private norm estimation and heavy hitters
TCC'08 Proceedings of the 5th conference on Theory of cryptography
How to compress interactive communication
Proceedings of the forty-second ACM symposium on Theory of computing
A strong direct product theorem for disjointness
Proceedings of the forty-second ACM symposium on Theory of computing
Hardness amplification in proof complexity
Proceedings of the forty-second ACM symposium on Theory of computing
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
On probabilistic pushdown automata
Information and Computation
Machine models for query processing
ACM SIGMOD Record
IEEE Transactions on Information Theory
The communication complexity of correlation
IEEE Transactions on Information Theory
Towards efficient designs for in-network computing with noisy wireless channels
INFOCOM'10 Proceedings of the 29th conference on Information communications
ACM SIGACT News
About randomised distributed graph colouring and graph partition algorithms
Information and Computation
Adapting parallel algorithms to the W-Stream model, with applications to graph problems
Theoretical Computer Science
ACM Transactions on Computation Theory (TOCT)
Inapproximability for VCG-based combinatorial auctions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On the exact space complexity of sketching and streaming small norms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Lower bounds for sparse recovery
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Streaming algorithms for extent problems in high dimensions
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
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
Data stream algorithms for codeword testing
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Better gap-hamming lower bounds via better round elimination
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Depth-independent lower bounds on the communication complexity of read-once Boolean formulas
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
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
Comparing multiagent systems research in combinatorial auctions and voting
Annals of Mathematics and Artificial Intelligence
Intractability of min- and max-cut in streaming graphs
Information Processing Letters
A Communication Approach to the Superposition Problem
Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Larger lower bounds on the OBDD complexity of integer multiplication
Information and Computation
Randomized OBDDs for the most significant bit of multiplication need exponential size
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
On the OBDD complexity of the most significant bit of integer multiplication
Theoretical Computer Science
Time-decaying Sketches for Robust Aggregation of Sensor Data
SIAM Journal on Computing
SIAM Journal on Computing
Kolmogorov complexity and combinatorial methods in communication complexity
Theoretical Computer Science
Theoretical Computer Science
Communication complexity in number-conserving and monotone cellular automata
Theoretical Computer Science
Theory of data stream computing: where to go
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Finding heavy distinct hitters in data streams
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Quantum one-way communication can be exponentially stronger than classical communication
Proceedings of the forty-third annual ACM symposium on Theory of computing
Strong direct product theorems for quantum communication and query complexity
Proceedings of the forty-third annual ACM symposium on Theory of computing
An optimal lower bound on the communication complexity of gap-hamming-distance
Proceedings of the forty-third annual ACM symposium on Theory of computing
Towards coding for maximum errors in interactive communication
Proceedings of the forty-third annual ACM symposium on Theory of computing
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Near-optimal private approximation protocols via a black box transformation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Proceedings of the forty-third annual ACM symposium on Theory of computing
A tight unconditional lower bound on distributed randomwalk computation
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Traced communication complexity of cellular automata
Theoretical Computer Science
Compilation and communication protocols for voting rules with a dynamic set of candidates
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
ACM Transactions on Computation Theory (TOCT)
Lower bounds for testing computability by small width OBDDs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
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
On quantum-classical equivalence for composed communication problems
Quantum Information & 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
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
Secret-sharing schemes: a survey
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Jump number of two-directional orthogonal ray graphs
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
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
Limitations on quantum dimensionality reduction
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Continuous distributed monitoring: a short survey
Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing
Streaming algorithms with one-sided estimation
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Everywhere-tight information cost tradeoffs for augmented index
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Correlation bounds for poly-size AC0 circuits with n1-o(1) symmetric gates
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Lower bounds for linear decision trees via an energy complexity argument
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Verifying computations with streaming interactive proofs
Proceedings of the VLDB Endowment
On communication protocols that compute almost privately
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Exploiting functional dependence in bayesian network inference
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Trading bit, message, and time complexity of distributed algorithms
DISC'11 Proceedings of the 25th international conference on Distributed computing
The complexity of data aggregation in directed networks
DISC'11 Proceedings of the 25th international conference on Distributed computing
SIAM Journal on Computing
Lower bounds for number-in-hand multiparty communication complexity, made easy
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
Estimating entropy and entropy norm on data streams
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Revealing additional information in two-party computations
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
NFAs with and without ε-transitions
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
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
Achieving fairness in private contract negotiation
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
Testing computability by width-two OBDDs
Theoretical Computer Science
An algebraic point of view on the crane beach property
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Optimizing monitoring queries over distributed data
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
A larger lower bound on the OBDD complexity of the most significant bit of multiplication
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Complexity of quantum uniform and nonuniform automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with sub-constant error
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Efficient algorithms for some special cases of the polynomial equivalence problem
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
NOF-multiparty information complexity bounds for pointer jumping
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Robust polynomials and quantum algorithms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
The complexity of querying external memory and streaming data
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Two absolute bounds for distributed bit complexity
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Quantum and classical communication-space tradeoffs from rectangle bounds
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Multi-query computationally-private information retrieval with constant communication rate
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Algorithmics – is there hope for a unified theory?
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
On approximation algorithms for data mining applications
Efficient Approximation and Online Algorithms
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Communication complexity: from two-party to multiparty
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication 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
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Interactive information complexity
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The multiparty communication complexity of set disjointness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Affine projections of polynomials: extended abstract
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Tight bounds for distributed functional monitoring
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
On black-box reductions between predicate encryption schemes
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
The relationship between inner product and counting cycles
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Towards optimal error-estimating codes through the lens of Fisher information analysis
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Validating XML documents in the streaming model with external memory
Proceedings of the 15th International Conference on Database Theory
The cost of fault tolerance in multi-party communication complexity
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
The communication complexity of distributed task allocation
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
SIAM Journal on Computing
SIAM Journal on Computing
Tensor rank and strong quantum nondeterminism in multiparty communication
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Communication complexity of approximating voting rules
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches
Foundations and Trends in Databases
The smoothed complexity of edit distance
ACM Transactions on Algorithms (TALG)
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
Extended formulations, nonnegative factorizations, and randomized communication protocols
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Approximate answers to OLAP queries on streaming data warehouses
Proceedings of the fifteenth international workshop on Data warehousing and OLAP
Adapting parallel algorithms to the W-stream model, with applications to graph problems
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Unbounded-error one-way classical and quantum communication complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
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
Lower bounds for quantile estimation in random-order and multi-pass streaming
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Checking and spot-checking the correctness of priority queues
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Efficient communication protocols for deciding edit distance
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata
Theoretical Computer Science
Quantum speed-up for unsupervised learning
Machine Learning
Natural Computing: an international journal
Implausible consequences of superstrong nonlocality
Natural Computing: an international journal
Experimental multipartner quantum communication complexity employing just one qubit
Natural Computing: an international journal
Communication steps for parallel query processing
Proceedings of the 32nd symposium on Principles of database systems
Space lower bounds for online pattern matching
Theoretical Computer Science
The continuous distributed monitoring model
ACM SIGMOD Record
Multipartite entanglement in XOR games
Quantum Information & Computation
Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Theoretical Computer Science
Quantum entanglement and the communication complexity of the inner product function
Theoretical Computer Science
Quantum weakly nondeterministic communication complexity
Theoretical Computer Science
From information to exact communication
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
An information complexity approach to extended formulations
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Validating XML documents in the streaming model with external memory
ACM Transactions on Database Systems (TODS) - Invited papers issue
Learning Cycle Length Through Finite Automata
Mathematics of Operations Research
State succinctness of two-way finite automata with quantum and classical states
Theoretical Computer Science
Journal of the ACM (JACM)
Note: One-round multi-party communication complexity of distinguishing sums
Theoretical Computer Science
On the time and the bit complexity of distributed randomised anonymous ring colouring
Theoretical Computer Science
Cancellation-Free circuits in unbounded and bounded depth
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Deterministic compression with uncertain priors
Proceedings of the 5th conference on Innovations in theoretical computer science
Direct sum fails for zero error average communication
Proceedings of the 5th conference on Innovations in theoretical computer science
Multiparty communication complexity of vector---valued and sum---type functions
Information Theory, Combinatorics, and Search Theory
Counting and sampling triangles from a graph stream
Proceedings of the VLDB Endowment
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)
Note: Some improved bounds on communication complexity via new decomposition of cliques
Discrete Applied Mathematics
Tradeoff lower lounds for stack machines
Computational Complexity
Choosing, Agreeing, and Eliminating in Communication Complexity
Computational Complexity
Optimal Collapsing Protocol for Multiparty Pointer Jumping
Theory of Computing Systems
| Hi-index | 0.15 |