On the public citation graph
Communication complexity
0 signed · 346 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1994.1051openalex-snapshot
The Bns Lower-Bound for Multiparty Protocols Is Nearly Optimal
inferredcites →https://doi.org/10.1007/3-540-08353-7_135openalex-snapshot
Graph-theoretic arguments in low-level complexity
inferredcites →https://doi.org/10.1007/3-540-54233-7_176openalex-snapshot
On linear decision trees computing Boolean functions
inferredcites →https://doi.org/10.1007/3-540-59042-0_88openalex-snapshot
Simultaneous messages vs. communication
inferredcites →https://doi.org/10.1007/3-540-61332-3_147openalex-snapshot
Harmonic analysis, real approximation, and the communication complexity of Boolean functions
inferredcites →https://doi.org/10.1007/bf01204170openalex-snapshot
Variation ranks of communication matrices and lower bounds for depth-two circuits having nearly symmetric gates with unbounded fan-in
inferredcites →https://doi.org/10.1007/bf01215351openalex-snapshot
Communication in bounded depth circuits
inferredcites →https://doi.org/10.1007/bf01272517openalex-snapshot
On the power of small-depth threshold circuits
inferredcites →https://doi.org/10.1007/bf01955678openalex-snapshot
Communication Complexity in a 3-Computer Model
inferredcites →https://doi.org/10.1007/bf02579325openalex-snapshot
Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
inferredcites →https://doi.org/10.1016/0020-0190(91)90157-dopenalex-snapshot
Private vs. common random bits in communication complexity
inferredcites →https://doi.org/10.1016/0022-0000(86)90046-2openalex-snapshot
Probabilistic communication complexity
inferredcites →https://doi.org/10.1016/0022-0000(92)90047-mopenalex-snapshot
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
inferredcites →https://doi.org/10.1016/0898-1221(75)90037-1openalex-snapshot
On sparse graphs with dense long paths
inferredcites →https://doi.org/10.1109/18.312169openalex-snapshot
Lower bounds on threshold and related circuits via communication complexity
inferredcites →https://doi.org/10.1109/ccc.1997.612319openalex-snapshot
Randomized simultaneous messages: solution of a problem of Yao in communication complexity
inferredcites →https://doi.org/10.1109/istcs.1993.253488openalex-snapshot
Deterministic approximate counting of depth-2 circuits
inferredcites →https://doi.org/10.1109/sct.1992.215404openalex-snapshot
Some lower and upper bounds for algebraic decision trees and the separation problem
inferredcites →https://doi.org/10.1109/sfcs.1983.30openalex-snapshot
Lower bounds by probabilistic arguments
inferredcites →https://doi.org/10.1109/sfcs.1992.267764openalex-snapshot
Separating the communication complexities of MOD m and MOD p circuits
inferredcites →https://doi.org/10.1109/sfcs.1997.646112openalex-snapshot
Separation of the monotone NC hierarchy
inferredcites →https://doi.org/10.1137/0217015openalex-snapshot
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
inferredcites →https://doi.org/10.1137/0222016openalex-snapshot
Rounds in Communication Complexity Revisited
inferredcites →https://doi.org/10.1137/0403021openalex-snapshot
Monotone Circuits for Connectivity Require Super-Logarithmic Depth
inferredcites →https://doi.org/10.1137/s0097539794264809openalex-snapshot
Boolean Circuits, Tensor Ranks, and Communication Complexity
inferredcites →https://doi.org/10.1145/146637.146684openalex-snapshot
Monotone circuits for matching require linear depth
inferredcites →https://doi.org/10.1145/800135.804414openalex-snapshot
Some complexity questions related to distributive computing(Preliminary Report)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/game.2000.0833openalex-snapshot
On Rational Computability and Communication Complexity
inferred← citeshttps://doi.org/10.1006/inco.2001.3069openalex-snapshot
Communication Complexity Method for Measuring Nondeterminism in Finite Automata
inferred← citeshttps://doi.org/10.1006/jcss.1998.1603openalex-snapshot
A Three-Party Communication Problem
inferred← citeshttps://doi.org/10.1006/jcss.2000.1731openalex-snapshot
The Communication Complexity of Pointer Chasing
inferred← citeshttps://doi.org/10.1006/jcss.2001.1754openalex-snapshot
Sharing the Cost of Multicast Transmissions
inferred← citeshttps://doi.org/10.1006/jcss.2001.1761openalex-snapshot
The Communication Complexity of Enumeration, Elimination, and Selection
inferred← citeshttps://doi.org/10.1006/jcss.2001.1779openalex-snapshot
Protocols for Asymmetric Communication Channels
inferred← citeshttps://doi.org/10.1006/jcss.2001.1818openalex-snapshot
Lower Bounds for Linearly Transformed OBDDs and FBDDs
inferred← citeshttps://doi.org/10.1007/10719839_21openalex-snapshot
Improved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function
inferred← citeshttps://doi.org/10.1007/10719839_27openalex-snapshot
Communication Complexity and Fourier Coefficients of the Diffie–Hellman Key
inferred← citeshttps://doi.org/10.1007/11505877_7openalex-snapshot
Complexity of Quantum Uniform and Nonuniform Automata
inferred← citeshttps://doi.org/10.1007/11523468_87openalex-snapshot
Tight Lower Bounds for Query Processing on Streaming and External Memory Data
inferred← citeshttps://doi.org/10.1007/11593447_7openalex-snapshot
Revealing Additional Information in Two-Party Computations
inferred← citeshttps://doi.org/10.1007/11671541_1openalex-snapshot
On Approximation Algorithms for Data Mining Applications
inferred← citeshttps://doi.org/10.1007/11687238_49openalex-snapshot
Optimizing Monitoring Queries over Distributed Data
inferred← citeshttps://doi.org/10.1007/11821069_40openalex-snapshot
NOF-Multiparty Information Complexity Bounds for Pointer Jumping
inferred← citeshttps://doi.org/10.1007/11874683_28openalex-snapshot
An Algebraic Point of View on the Crane Beach Property
inferred← citeshttps://doi.org/10.1007/11940128_63openalex-snapshot
Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_21openalex-snapshot
On the Representation of Boolean Predicates of the Diffie-Hellman Function
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_1openalex-snapshot
Hyper-Encryption and Everlasting Security
inferred← citeshttps://doi.org/10.1007/978-1-4020-9688-4openalex-snapshot
Fundamental Problems in Computing
inferred← citeshttps://doi.org/10.1007/978-3-030-24922-9_16openalex-snapshot
On Distributed Merlin-Arthur Decision Protocols
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0_11openalex-snapshot
Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices
inferred← citeshttps://doi.org/10.1007/978-3-030-43662-9_6openalex-snapshot
On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-45724-2_15openalex-snapshot
On the Streaming Indistinguishability of a Random Permutation and a Random Function
inferred← citeshttps://doi.org/10.1007/978-3-030-50026-9_14openalex-snapshot
On the Decision Tree Complexity of Threshold Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-79416-3_7openalex-snapshot
Upper Bounds on Communication in Terms of Approximate Rank
inferred← citeshttps://doi.org/10.1007/978-3-031-32733-9_21openalex-snapshot
Energy-Efficient Distributed Algorithms for Synchronous Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-09620-9_8openalex-snapshot
The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism
inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_1openalex-snapshot
Parameterized Compilation Lower Bounds for Restricted CNF-Formulas
inferred← citeshttps://doi.org/10.1007/978-3-319-71069-3_24openalex-snapshot
Time-Space Complexity Advantages for Quantum Computing
inferred← citeshttps://doi.org/10.1007/978-3-319-72050-0_5openalex-snapshot
Approximate Proof-Labeling Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-24638-1_27openalex-snapshot
On Compressing Encrypted Data without the Encryption Key
inferred← citeshttps://doi.org/10.1007/978-3-540-24676-3_3openalex-snapshot
Secure Computation of the k th -Ranked Element
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_3openalex-snapshot
Individual Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_17openalex-snapshot
Approximating Boolean Functions by OBDDs
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_8openalex-snapshot
Algebraic Recognizability of Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_49openalex-snapshot
Robust Polynomials and Quantum Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_1openalex-snapshot
Distributed Quantum Computing
inferred← citeshttps://doi.org/10.1007/978-3-540-69170-9_12openalex-snapshot
On the Average Case Communication Complexity for Detection in Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_10openalex-snapshot
Smallest Formulas for Parity of 2 k Variables Are Essentially Unique
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_11openalex-snapshot
Finding a Duplicate and a Missing Item in a Stream
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_28openalex-snapshot
Quantum Multiparty Communication Complexity and Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_10openalex-snapshot
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_13openalex-snapshot
A Lower Bound on Entanglement-Assisted Quantum Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_14openalex-snapshot
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_61openalex-snapshot
Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_63openalex-snapshot
Checking and Spot-Checking the Correctness of Priority Queues
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_35openalex-snapshot
Element Distinctness and Sorting on One-Tape Off-Line Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_20openalex-snapshot
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_11openalex-snapshot
Fast Private Norm Estimation and Heavy Hitters
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_58openalex-snapshot
Parallel Repetition of the Odd Cycle Game
inferred← citeshttps://doi.org/10.1007/978-3-540-79309-0_19openalex-snapshot
Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_30openalex-snapshot
Improved Separations between Nondeterministic and Randomized Multiparty Communication
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_3openalex-snapshot
On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_7openalex-snapshot
On the Non-deterministic Communication Complexity of Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_21openalex-snapshot
Best-Order Streaming Model
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_24openalex-snapshot
The Communication Complexity of Non-signaling Distributions
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_24openalex-snapshot
A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-642-13284-1_1openalex-snapshot
Communication Complexity: From Two-Party to Multiparty
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_8openalex-snapshot
Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_53openalex-snapshot
Data Stream Algorithms for Codeword Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-32147-4_13openalex-snapshot
Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-32894-7_17openalex-snapshot
Computing with Sand: On the Complexity of Recognizing Two-dimensional Sandpile Critical Configurations
inferred← citeshttps://doi.org/10.1007/978-3-642-55566-4_14openalex-snapshot
A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_32openalex-snapshot
Lower Bounds for Splittings by Linear Combinations
inferred← citeshttps://doi.org/10.1007/978-3-662-49192-8_13openalex-snapshot
On the Power of Laconic Advice in Communication Complexity
inferred← citeshttps://doi.org/10.1007/bfb0028748openalex-snapshot
On the limitations of ordered representations of functions
inferred← citeshttps://doi.org/10.1007/s00037-006-0212-7openalex-snapshot
THE QUANTUM ADVERSARY METHOD AND CLASSICAL FORMULA SIZE LOWER BOUNDS
inferred← citeshttps://doi.org/10.1007/s00037-007-0220-2openalex-snapshot
A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness
inferred← citeshttps://doi.org/10.1007/s00037-008-0255-zopenalex-snapshot
Probabilistic Communication Complexity Over The Reals
inferred← citeshttps://doi.org/10.1007/s00145-010-9059-9openalex-snapshot
Secure Computation of the Median (and Other Elements of Specified Ranks)
inferred← citeshttps://doi.org/10.1007/s00224-018-9880-3openalex-snapshot
Property Testing Lower Bounds via a Generalization of Randomized Parity Decision Trees
inferred← citeshttps://doi.org/10.1007/s00224-023-10136-wopenalex-snapshot
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams
inferred← citeshttps://doi.org/10.1007/s00446-017-0306-2openalex-snapshot
Distributed construction of purely additive spanners
inferred← citeshttps://doi.org/10.1007/s00446-019-00355-1openalex-snapshot
Deciding and verifying network properties locally with few output bits
inferred← citeshttps://doi.org/10.1007/s00446-020-00371-6openalex-snapshot
Communication complexity of approximate maximum matching in the message-passing model
inferred← citeshttps://doi.org/10.1007/s11047-021-09857-zopenalex-snapshot
Communication complexity meets cellular automata: Necessary conditions for intrinsic universality
inferred← citeshttps://doi.org/10.1007/s11047-022-09904-3openalex-snapshot
Exponential separation between quantum and classical ordered binary decision diagrams, reordering method and hierarchies
inferred← citeshttps://doi.org/10.1007/s11432-020-2931-xopenalex-snapshot
A nearly optimal distributed algorithm for computing the weighted girth
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50011-3openalex-snapshot
Computational Complexity
inferred← citeshttps://doi.org/10.1016/b978-0-444-53766-9.00009-4openalex-snapshot
Algorithmic Mechanism Design
inferred← citeshttps://doi.org/10.1016/b978-012620861-0/50014-0openalex-snapshot
Algorithms for Delta Compression and Remote File Synchronization
inferred← citeshttps://doi.org/10.1016/j.adhoc.2017.01.003openalex-snapshot
Enhancing privacy for ad hoc systems with predeployment key distribution
inferred← citeshttps://doi.org/10.1016/j.aml.2006.05.024openalex-snapshot
Communication complexity of some number theoretic functions
inferred← citeshttps://doi.org/10.1016/j.apal.2019.102722openalex-snapshot
Resolution over linear equations modulo two
inferred← citeshttps://doi.org/10.1016/j.automatica.2010.10.015openalex-snapshot
Distributed averaging on digital erasure networks
inferred← citeshttps://doi.org/10.1016/j.dam.2005.05.015openalex-snapshot
Non-independent randomized rounding and coloring
inferred← citeshttps://doi.org/10.1016/j.dam.2006.04.037openalex-snapshot
Approximating Boolean functions by OBDDs
inferred← citeshttps://doi.org/10.1016/j.dam.2010.09.007openalex-snapshot
On the expressive power of CNF formulas of bounded tree- and clique-width
inferred← citeshttps://doi.org/10.1016/j.dam.2013.09.015openalex-snapshot
Some improved bounds on communication complexity via new decomposition of cliques
inferred← citeshttps://doi.org/10.1016/j.dam.2014.10.029openalex-snapshot
Ordered biclique partitions and communication complexity problems
inferred← citeshttps://doi.org/10.1016/j.dam.2022.04.001openalex-snapshot
Upper bounds on the Boolean rank of Kronecker products
inferred← citeshttps://doi.org/10.1016/j.disc.2012.09.015openalex-snapshot
Combinatorial bounds on nonnegative rank and extended formulations
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.02.003openalex-snapshot
Clique versus independent set
inferred← citeshttps://doi.org/10.1016/j.eswa.2018.02.007openalex-snapshot
Fault-tolerant tile mining
inferred← citeshttps://doi.org/10.1016/j.geb.2012.08.007openalex-snapshot
The communication burden of payment determination
inferred← citeshttps://doi.org/10.1016/j.geb.2013.03.005openalex-snapshot
Mechanism design with a restricted action space
inferred← citeshttps://doi.org/10.1016/j.geb.2018.10.013openalex-snapshot
A stable marriage requires communication
inferred← citeshttps://doi.org/10.1016/j.ic.2004.03.002openalex-snapshot
Multiparty communication complexity and very hard functions
inferred← citeshttps://doi.org/10.1016/j.ic.2005.05.004openalex-snapshot
On the influence of the variable ordering for algorithmic learning using OBDDs
inferred← citeshttps://doi.org/10.1016/j.ic.2009.11.001openalex-snapshot
On probabilistic pushdown automata
inferred← citeshttps://doi.org/10.1016/j.ic.2010.11.007openalex-snapshot
Larger lower bounds on the OBDD complexity of integer multiplication
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.08.003openalex-snapshot
On the P versus NP intersected with co-NP question in communication complexity
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.11.011openalex-snapshot
Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.01.014openalex-snapshot
The communication complexity of the Hamming distance problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.10.006openalex-snapshot
A characterization of average case communication complexity
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.08.008openalex-snapshot
A note on the size of OBDDs for the graph of integer multiplication
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.10.017openalex-snapshot
Intractability of min- and max-cut in streaming graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.12.010openalex-snapshot
A note on hardness of diameter approximation
inferred← citeshttps://doi.org/10.1016/j.is.2015.07.006openalex-snapshot
Efficient and flexible algorithms for monitoring distance-based outliers over data streams
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.11.006openalex-snapshot
An information statistics approach to data stream and communication complexity
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.11.007openalex-snapshot
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.03.002openalex-snapshot
On relations between counting communication complexity classes
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.04.012openalex-snapshot
On complexity of single-minded auction
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.06.007openalex-snapshot
Symmetric polynomials over Zm and simultaneous communication protocols
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.10.002openalex-snapshot
On the memory requirements of XPath evaluation over XML streams
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.03.015openalex-snapshot
Individual communication complexity
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.06.002openalex-snapshot
Finding large 3-free sets I: The small n case
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.06.016openalex-snapshot
Lower bounds for predecessor searching in the cell probe model
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.10.004openalex-snapshot
Memory lower bounds for XPath evaluation over XML streams
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.02.002openalex-snapshot
Almost optimal query algorithm for hitting set using a subset query
inferred← citeshttps://doi.org/10.1016/j.jcta.2014.04.005openalex-snapshot
Strict group testing and the set basis problem
inferred← citeshttps://doi.org/10.1016/j.jda.2008.09.009openalex-snapshot
On the guessing number of shift graphs
inferred← citeshttps://doi.org/10.1016/j.jet.2006.09.011openalex-snapshot
The communication requirements of social choice rules and supporting budget sets
inferred← citeshttps://doi.org/10.1016/j.jet.2007.09.015openalex-snapshot
The communication cost of selfishness
inferred← citeshttps://doi.org/10.1016/j.laa.2012.12.025openalex-snapshot
On deterministic sketching and streaming for sparse recovery and norm estimation
inferred← citeshttps://doi.org/10.1016/j.laa.2019.03.027openalex-snapshot
The Boolean rank of the uniform intersection matrix and a family of its submatrices
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2008.09.005openalex-snapshot
Informational requirements of social choice rules
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.12.003openalex-snapshot
Algorithmic complexity of recursive and inductive algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.09.015openalex-snapshot
On the power of randomized multicounter machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.12.031openalex-snapshot
Quantum branching programs and space-bounded nonuniform quantum complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.10.032openalex-snapshot
A note on efficient aggregate queries in sensor networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.062openalex-snapshot
Tight lower bounds for query processing on streaming and external memory data
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.063openalex-snapshot
Comparing the size of NFAs with and without ε -transitions
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.027openalex-snapshot
Two absolute bounds for distributed bit complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.09.007openalex-snapshot
The complexity of fixed point models of trust in distributed networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.06.056openalex-snapshot
New results for finding common neighborhoods in massive graphs in the data stream model
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.03.020openalex-snapshot
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA’s
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.03.022openalex-snapshot
Smallest formulas for the parity of 2k variables are essentially unique
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.03.027openalex-snapshot
On the parity complexity measures of Boolean functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.08.030openalex-snapshot
Adapting parallel algorithms to the W-Stream model, with applications to graph problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.10.005openalex-snapshot
Communication complexity and intrinsic universality in cellular automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.043openalex-snapshot
On the OBDD complexity of the most significant bit of integer multiplication
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.03.008openalex-snapshot
Communication complexity in number-conserving and monotone cellular automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.012openalex-snapshot
Space lower bounds for online pattern matching
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.07.008openalex-snapshot
On communication protocols that compute almost privately
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.015openalex-snapshot
Quantum weakly nondeterministic communication complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.06.005openalex-snapshot
State succinctness of two-way finite automata with quantum and classical states
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.07.026openalex-snapshot
One-round multi-party communication complexity of distinguishing sums
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.08.014openalex-snapshot
Boosting distinct random sampling for basic counting on the union of distributed streams
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.06.020openalex-snapshot
A second look at counting triangles in graph streams (corrected)
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.032openalex-snapshot
Public vs. private randomness in simultaneous multi-party communication complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.11.017openalex-snapshot
Message lower bounds via efficient network synchronization
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113711openalex-snapshot
Superfast coloring in CONGEST via efficient color sampling
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114161openalex-snapshot
Communication costs in a geometric communication network
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114177openalex-snapshot
On (simple) decision tree rank
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00225-5openalex-snapshot
Extremal problems under dimension constraints
inferred← citeshttps://doi.org/10.1016/s0020-0190(03)00334-xopenalex-snapshot
A note on monotone complexity and the rank of matrices
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00112-xopenalex-snapshot
A note on randomized mutual search
inferred← citeshttps://doi.org/10.1016/s0022-0000(02)00019-3openalex-snapshot
A linear lower bound on the unbounded error probabilistic communication complexity
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00037-0openalex-snapshot
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60342-3openalex-snapshot
Communication Complexity
inferred← citeshttps://doi.org/10.1016/s0076-5392(05)80054-2openalex-snapshot
Complexity: What, Why, and How
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00192-6openalex-snapshot
Recognition problems and communication complexity
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00297-xopenalex-snapshot
BDDs—design, analysis, complexity, and applications
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00377-8openalex-snapshot
Quantum communication and complexity
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00569-8openalex-snapshot
On finding common neighborhoods in massive graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00085-9openalex-snapshot
Hardness results for multicast cost sharing
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00184-xopenalex-snapshot
New applications of the incompressibility method: Part II
inferred← citeshttps://doi.org/10.1016/s0304-8853(99)00315-7openalex-snapshot
Quantum computers and quantum coherence
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00118-4openalex-snapshot
A lower bound for integer multiplication on randomized ordered read-once branching programs
inferred← citeshttps://doi.org/10.1016/s1574-0145(06)01004-xopenalex-snapshot
Chapter 4 Organization Structure
inferred← citeshttps://doi.org/10.1017/s0963548314000704openalex-snapshot
Query Complexity of Sampling and Small Geometric Partitions
inferred← citeshttps://doi.org/10.1080/15427951.2006.10129117openalex-snapshot
Estimating Entropy and Entropy Norm on Data Streams
inferred← citeshttps://doi.org/10.1103/physreva.63.052305openalex-snapshot
Classical simulation of quantum entanglement without local hidden variables
inferred← citeshttps://doi.org/10.1103/physreva.65.012318openalex-snapshot
Feasible quantum communication complexity protocol
inferred← citeshttps://doi.org/10.1103/physreva.73.012321openalex-snapshot
Multipartite nonlocal quantum correlations resistant to imperfections
inferred← citeshttps://doi.org/10.1103/physreva.75.032344openalex-snapshot
Communication complexity protocols for qutrits
inferred← citeshttps://doi.org/10.1103/physreva.84.042307openalex-snapshot
Approximate simulation of entanglement with a linear cost of communication
inferred← citeshttps://doi.org/10.1103/physreva.89.052124openalex-snapshot
Information and communication in polygon theories
inferred← citeshttps://doi.org/10.1103/physreva.99.062331openalex-snapshot
Quantum sketching protocols for Hamming distance and beyond
inferred← citeshttps://doi.org/10.1103/physrevlett.121.150504openalex-snapshot
High-Dimensional Quantum Communication Complexity beyond Strategies Based on Bell’s Theorem
inferred← citeshttps://doi.org/10.1109/acc.2012.6315286openalex-snapshot
The control theory of motion-based communication: Problems in teaching robots to dance
inferred← citeshttps://doi.org/10.1109/allerton.2008.4797620openalex-snapshot
Worst-case asymmetric distributed source coding
inferred← citeshttps://doi.org/10.1109/allerton.2008.4797737openalex-snapshot
Continuous-model communication complexity with application in distributed resource allocation in wireless Ad hoc networks
inferred← citeshttps://doi.org/10.1109/allerton.2009.5394497openalex-snapshot
Infinite-message distributed source coding for two-terminal interactive computing
inferred← citeshttps://doi.org/10.1109/allerton.2012.6483456openalex-snapshot
Coding for interactive computation: Progress and challenges
inferred← citeshttps://doi.org/10.1109/allerton.2013.6736498openalex-snapshot
A hard-to-compress interactive task?
inferred← citeshttps://doi.org/10.1109/ccc.2000.856758openalex-snapshot
Characterization of non-deterministic quantum query and quantum communication complexity
inferred← citeshttps://doi.org/10.1109/ccc.2001.933879openalex-snapshot
Communication complexity lower bounds by polynomials
inferred← citeshttps://doi.org/10.1109/ccc.2001.933884openalex-snapshot
On the non-approximability of Boolean functions by OBDDs and read-k-times branching programs
inferred← citeshttps://doi.org/10.1109/ccc.2003.1214411openalex-snapshot
Lower bounds for predecessor searching in the cell probe model
inferred← citeshttps://doi.org/10.1109/ccc.2003.1214414openalex-snapshot
Near-optimal lower bounds on the multi-party communication complexity of set disjointness
inferred← citeshttps://doi.org/10.1109/ccc.2003.1214415openalex-snapshot
Rectangle size bounds and threshold covers in communication complexity
inferred← citeshttps://doi.org/10.1109/ccc.2004.1313853openalex-snapshot
Towards the classical communication complexity of entanglement distillation protocols with incomplete information
showing the first 200 of 316 · page through all 316
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.