On the public citation graph
The Probabilistic Communication Complexity of Set Intersection
0 signed · 398 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.1007/bfb0032036openalex-snapshot
On the distributional complexity of disjointness
inferredcites →https://doi.org/10.1109/sfcs.1978.22openalex-snapshot
Lower bounds on information transfer in distributed computations
inferredcites →https://doi.org/10.1137/0213052openalex-snapshot
Information Transfer under Different Sets of Protocols
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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.2002.1826openalex-snapshot
Quantum Lower Bounds by Quantum Arguments
inferred← citeshttps://doi.org/10.1007/11507840_13openalex-snapshot
Testing Disjointness of Private Datasets
inferred← citeshttps://doi.org/10.1007/11533719_28openalex-snapshot
Finding Longest Increasing and Common Subsequences in Streaming Data
inferred← citeshttps://doi.org/10.1007/11533719_72openalex-snapshot
New Streaming Algorithms for Counting Triangles in Graphs
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_7openalex-snapshot
Complete Classifications for the Communication Complexity of Regular Languages
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_7openalex-snapshot
Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_24openalex-snapshot
Improved Quantum Communication Complexity Bounds for Disjointness and Equality
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_27openalex-snapshot
On Quantum and Approximate Privacy
inferred← citeshttps://doi.org/10.1007/978-1-4757-6048-4_47openalex-snapshot
Communication Complexity of Functions on Direct Sums
inferred← citeshttps://doi.org/10.1007/978-3-030-26951-7_1openalex-snapshot
The Communication Complexity of Threshold Private Set Intersection
inferred← citeshttps://doi.org/10.1007/978-3-030-43662-9_7openalex-snapshot
On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing
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-54921-3_16openalex-snapshot
Distributed Testing of Distance-k Colorings
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-030-89543-3_45openalex-snapshot
Single-Pass Streaming Algorithms to Partition Graphs into Few Forests
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_39openalex-snapshot
Bounds on Oblivious Multiparty Quantum Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-031-22337-2_14openalex-snapshot
Fine-Grained Complexity Lower Bounds for Problems in Computer Aided Verification
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_13openalex-snapshot
Secure Sampling with Sublinear Communication
inferred← citeshttps://doi.org/10.1007/978-3-031-32733-9_19openalex-snapshot
The Communication Complexity of Functions with Large Outputs
inferred← citeshttps://doi.org/10.1007/978-3-031-60603-8_19openalex-snapshot
On Distributed Computation of the Minimum Triangle Edge Transversal
inferred← citeshttps://doi.org/10.1007/978-3-032-12287-2_15openalex-snapshot
SNARK Lower Bounds via Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-09620-9_12openalex-snapshot
Randomized Lower Bound for Distributed Spanning-Tree Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-09620-9_2openalex-snapshot
Communication Complexity Lower Bounds in Distributed Message-Passing
inferred← citeshttps://doi.org/10.1007/978-3-319-09620-9_24openalex-snapshot
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_5openalex-snapshot
Time Lower Bounds for Distributed Distance Oracles
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_57openalex-snapshot
Evaluating Bayesian Networks via Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-319-42634-1_15openalex-snapshot
The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model
inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_4openalex-snapshot
Fooling Pairs in Randomized Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-49487-6_11openalex-snapshot
Engineering a Bipartite Matching Algorithm in the Semi-Streaming Model
inferred← citeshttps://doi.org/10.1007/978-3-319-71667-1_1openalex-snapshot
Recent Advances in Function and Homomorphic Secret Sharing
inferred← citeshttps://doi.org/10.1007/978-3-319-78381-9_3openalex-snapshot
Memory Lower Bounds of Reductions Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-96151-4_9openalex-snapshot
Approximating the Caro-Wei Bound for Independent Sets in Graph Streams
inferred← citeshttps://doi.org/10.1007/978-3-322-95233-2_15openalex-snapshot
Communication Complexity and Lower Bounds for Sequential Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-24676-3_1openalex-snapshot
Efficient Private Matching and Set Intersection
inferred← citeshttps://doi.org/10.1007/978-3-540-25928-2_14openalex-snapshot
Toward Quantum Computational Agents
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_46openalex-snapshot
On Graph Problems in a Semi-streaming Model
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_90openalex-snapshot
Hardness of String Similarity Search and Other Indexing Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-28608-0_5openalex-snapshot
Top- k $k$ Frequent Item Maintenance over Streams
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_32openalex-snapshot
Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds
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-69733-6_19openalex-snapshot
Multi-party Quantum Communication Complexity with Routed Messages
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_42openalex-snapshot
Testing Properties of Sets of Points in Metric Spaces
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-642-10631-6_45openalex-snapshot
On the Tightness of the Buhrman-Cleve-Wigderson Simulation
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_39openalex-snapshot
Choosing, Agreeing, and Eliminating in Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-16161-2_17openalex-snapshot
CED2: Communication Efficient Disjointness Decision
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_5openalex-snapshot
On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_40openalex-snapshot
The Complexity of Data Aggregation in Directed Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-24508-4openalex-snapshot
Boolean Function Complexity: Advances and Frontiers
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_54openalex-snapshot
The Relationship between Inner Product and Counting Cycles
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_38openalex-snapshot
Streaming and Communication Complexity of Clique Approximation
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-32241-9_39openalex-snapshot
The Complexity of Unary Subset Sum
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_44openalex-snapshot
Sparse and Lopsided Set Disjointness via Information Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_1openalex-snapshot
Distributed Minimum Cut Approximation
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-44522-8_3openalex-snapshot
Communication Complexity Theory: Thirty-Five Years of Set Disjointness
inferred← citeshttps://doi.org/10.1007/978-3-662-45174-8_34openalex-snapshot
On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_88openalex-snapshot
The Simultaneous Communication of Disjointness with Applications to Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-662-48000-7_24openalex-snapshot
Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
inferred← citeshttps://doi.org/10.1007/bf01192527openalex-snapshot
On rank vs. communication complexity
inferred← citeshttps://doi.org/10.1007/bf01680375openalex-snapshot
On the communication complexity oft-intersection problems in generalized Boolean algebras
inferred← citeshttps://doi.org/10.1007/bfb0029950openalex-snapshot
Communication complexity and sequential computation
inferred← citeshttps://doi.org/10.1007/bfb0032036openalex-snapshot
On the distributional complexity of disjointness
inferred← citeshttps://doi.org/10.1007/s00037-001-8193-zopenalex-snapshot
On the size of randomized OBDDs and read-once branching programs for k -stable functions
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-009-0285-1openalex-snapshot
Communication Complexity Under Product and Nonproduct Distributions
inferred← citeshttps://doi.org/10.1007/s00037-010-0292-2openalex-snapshot
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
inferred← citeshttps://doi.org/10.1007/s00037-012-0040-xopenalex-snapshot
Property Testing Lower Bounds via Communication Complexity
inferred← citeshttps://doi.org/10.1007/s00037-013-0075-7openalex-snapshot
Choosing, Agreeing, and Eliminating in Communication Complexity
inferred← citeshttps://doi.org/10.1007/s00037-016-0136-9openalex-snapshot
Non-interactive proofs of proximity
inferred← citeshttps://doi.org/10.1007/s00037-019-00182-7openalex-snapshot
Random resolution refutations
inferred← citeshttps://doi.org/10.1007/s00037-021-00210-5openalex-snapshot
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity
inferred← citeshttps://doi.org/10.1007/s00037-021-00212-3openalex-snapshot
An Exponential Separation Between MA and AM Proofs of Proximity
inferred← citeshttps://doi.org/10.1007/s00037-022-00225-6openalex-snapshot
Disjointness through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond
inferred← citeshttps://doi.org/10.1007/s000370050018openalex-snapshot
On Randomized One-round Communication Complexity
inferred← citeshttps://doi.org/10.1007/s00145-014-9190-0openalex-snapshot
Efficient Set Intersection with Simulation-Based Security
inferred← citeshttps://doi.org/10.1007/s00224-003-1113-7openalex-snapshot
Quantum and Approximate Privacy
inferred← citeshttps://doi.org/10.1007/s00224-004-1190-2openalex-snapshot
Complete Classifications for the Communication Complexity of Regular Languages
inferred← citeshttps://doi.org/10.1007/s00224-007-9097-3openalex-snapshot
Exponential Separation of Quantum and Classical Online Space Complexity
inferred← citeshttps://doi.org/10.1007/s00224-022-10098-5openalex-snapshot
The Complexity of Grid Coloring
inferred← citeshttps://doi.org/10.1007/s00224-023-10158-4openalex-snapshot
Upper Bounds on Communication in Terms of Approximate Rank
inferred← citeshttps://doi.org/10.1007/s00446-005-0147-2openalex-snapshot
Efficient algorithms for constructing (1+∊,β)-spanners in the distributed and streaming models
inferred← citeshttps://doi.org/10.1007/s00446-019-00368-wopenalex-snapshot
Detecting cliques in CONGEST networks
inferred← citeshttps://doi.org/10.1007/s00446-021-00398-3openalex-snapshot
A distributed algorithm for directed minimum-weight spanning tree
inferred← citeshttps://doi.org/10.1007/s00446-024-00475-3openalex-snapshot
($$\Delta + 1$$) vertex coloring in O(n) communication
inferred← citeshttps://doi.org/10.1007/s00453-004-1105-2openalex-snapshot
Computing Diameter in the Streaming and Sliding-Window Models
inferred← citeshttps://doi.org/10.1007/s00453-013-9846-4openalex-snapshot
Streaming Algorithms for Extent Problems in High Dimensions
inferred← citeshttps://doi.org/10.1007/s00453-016-0163-6openalex-snapshot
Certifying Equality With Limited Interaction
inferred← citeshttps://doi.org/10.1007/s00453-021-00816-9openalex-snapshot
Correlation Clustering in Data Streams
inferred← citeshttps://doi.org/10.1007/s00493-011-2580-0openalex-snapshot
The Unbounded-Error Communication Complexity of Symmetric Functions
inferred← citeshttps://doi.org/10.1007/s00778-004-0135-3openalex-snapshot
Tracking set-expression cardinalities over continuous update streams
inferred← citeshttps://doi.org/10.1007/s10107-014-0755-3openalex-snapshot
Extended formulations, nonnegative factorizations, and randomized communication protocols
inferred← citeshttps://doi.org/10.1007/s10207-011-0133-6openalex-snapshot
CASSANDRA: a probabilistic, efficient, and privacy-preserving solution to compute set intersection
inferred← citeshttps://doi.org/10.1007/s10878-006-7125-xopenalex-snapshot
Finding longest increasing and common subsequences in streaming data
inferred← citeshttps://doi.org/10.1007/s10916-019-1158-zopenalex-snapshot
Smart Home-based IoT for Real-time and Secure Remote Health Monitoring of Triage and Priority System using Body Sensors: Multi-driven Systematic Review
inferred← citeshttps://doi.org/10.1007/s11432-008-0112-3openalex-snapshot
Comparing two sets without disclosing them
inferred← citeshttps://doi.org/10.1007/s11537-018-1727-9openalex-snapshot
Information complexity and applications
inferred← citeshttps://doi.org/10.1007/s11856-023-2517-5openalex-snapshot
Around the log-rank conjecture
inferred← citeshttps://doi.org/10.1016/j.apal.2019.102722openalex-snapshot
Resolution over linear equations modulo two
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.2009.11.001openalex-snapshot
On probabilistic pushdown automata
inferred← citeshttps://doi.org/10.1016/j.ins.2016.01.051openalex-snapshot
Distributed error estimation of functional dependency
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.2006.01.014openalex-snapshot
The communication complexity of the Hamming distance problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.01.012openalex-snapshot
Hash challenges: Stretching the limits of compare-by-hash in distributed data deduplication
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.jet.2021.105207openalex-snapshot
On the existence of Pareto Efficient and envy-free allocations
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.2005.09.013openalex-snapshot
On graph problems in a semi-streaming model
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.2021.05.030openalex-snapshot
Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114161openalex-snapshot
Communication costs in a geometric communication network
inferred← citeshttps://doi.org/10.1016/s0024-3795(99)00226-8openalex-snapshot
Matrix rank and communication complexity
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60342-3openalex-snapshot
Communication Complexity
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00377-8openalex-snapshot
Quantum communication and complexity
inferred← citeshttps://doi.org/10.1017/9781108135252openalex-snapshot
Introduction to Property Testing
inferred← citeshttps://doi.org/10.1017/9781108671644.016openalex-snapshot
Extension Complexity of Polytopes
inferred← citeshttps://doi.org/10.1017/s0960129515000158openalex-snapshot
Generalizations of the distributed Deutsch–Jozsa promise problem
inferred← citeshttps://doi.org/10.1070/im2003v067n01abeh000422openalex-snapshot
Quantum communication complexity of symmetric predicates
inferred← citeshttps://doi.org/10.1090/dimacs/050/02openalex-snapshot
Synopsis data structures for massive data sets
inferred← citeshttps://doi.org/10.1103/revmodphys.82.665openalex-snapshot
Nonlocality and communication complexity
inferred← citeshttps://doi.org/10.1109/allerton.2013.6736498openalex-snapshot
A hard-to-compress interactive task?
inferred← citeshttps://doi.org/10.1109/allerton.2017.8262764openalex-snapshot
Two-party function computation on the reconciled data
inferred← citeshttps://doi.org/10.1109/ccc.2000.856734openalex-snapshot
The communication complexity of enumeration, elimination, and selection
inferred← citeshttps://doi.org/10.1109/ccc.2001.933879openalex-snapshot
Communication complexity lower bounds by polynomials
inferred← citeshttps://doi.org/10.1109/ccc.2002.1004344openalex-snapshot
Information theory methods in communication complexity
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.2005.1openalex-snapshot
A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness
inferred← citeshttps://doi.org/10.1109/ccc.2008.29openalex-snapshot
Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model
inferred← citeshttps://doi.org/10.1109/ccc.2009.24openalex-snapshot
Lower Bounds on Quantum Multiparty Communication Complexity
inferred← citeshttps://doi.org/10.1109/ccc.2009.32openalex-snapshot
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
inferred← citeshttps://doi.org/10.1109/ccc.2009.39openalex-snapshot
On the Communication Complexity of Read-Once AC^0 Formulae
inferred← citeshttps://doi.org/10.1109/ccc.2010.31openalex-snapshot
The Partition Bound for Classical Communication Complexity and Query Complexity
inferred← citeshttps://doi.org/10.1109/ccc.2011.33openalex-snapshot
On Arthur Merlin Games in Communication Complexity
inferred← citeshttps://doi.org/10.1109/ccc.2013.12openalex-snapshot
Towards a Reverse Newman's Theorem in Interactive Information Complexity
inferred← citeshttps://doi.org/10.1109/ccc.2014.22openalex-snapshot
A Composition Theorem for Parity Kill Number
inferred← citeshttps://doi.org/10.1109/focs.2004.14openalex-snapshot
Approximating Edit Distance Efficiently
inferred← citeshttps://doi.org/10.1109/focs.2004.52openalex-snapshot
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs
inferred← citeshttps://doi.org/10.1109/focs.2009.15openalex-snapshot
The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection
inferred← citeshttps://doi.org/10.1109/focs.2011.13openalex-snapshot
Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy
inferred← citeshttps://doi.org/10.1109/focs.2012.10openalex-snapshot
Approximation Limits of Linear Programs (Beyond Hierarchies)
inferred← citeshttps://doi.org/10.1109/focs.2013.77openalex-snapshot
A Tight Bound for Set Disjointness in the Message-Passing Model
inferred← citeshttps://doi.org/10.1109/focs.2013.78openalex-snapshot
On the Communication Complexity of Sparse Set Disjointness and Exists-Equal Problems
inferred← citeshttps://doi.org/10.1109/focs.2015.53openalex-snapshot
Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness
inferred← citeshttps://doi.org/10.1109/focs.2016.39openalex-snapshot
The Multiparty Communication Complexity of Interleaved Group Products
inferred← citeshttps://doi.org/10.1109/focs.2016.66openalex-snapshot
Separations in Communication Complexity Using Cheat Sheets and Information Complexity
inferred← citeshttps://doi.org/10.1109/focs.2017.12openalex-snapshot
Distributed PCP Theorems for Hardness of Approximation in P
inferred← citeshttps://doi.org/10.1109/focs.2017.21openalex-snapshot
Query-to-Communication Lifting for BPP
inferred← citeshttps://doi.org/10.1109/focs.2017.22openalex-snapshot
A Rounds vs. Communication Tradeoff for Multi-Party Set Disjointness
inferred← citeshttps://doi.org/10.1109/focs.2018.00095openalex-snapshot
Near Log-Convexity of Measured Heat in (Discrete) Time and Consequences
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00041openalex-snapshot
Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00069openalex-snapshot
Constructive Separations and Their Consequences
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00088openalex-snapshot
The Orthogonal Vectors Conjecture and Non-Uniform Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195624openalex-snapshot
A simpler and better design of error estimating coding
inferred← citeshttps://doi.org/10.1109/ipdps.2015.109openalex-snapshot
Cooperative Computing for Autonomous Data Centers
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174331openalex-snapshot
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption
inferred← citeshttps://doi.org/10.1109/sct.1989.41821openalex-snapshot
Results on communication complexity classes
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63535openalex-snapshot
Probabilistic communication complexity of Boolean relations
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267764openalex-snapshot
Separating the communication complexities of MOD m and MOD p circuits
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365711openalex-snapshot
On rank vs. communication complexity
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646132openalex-snapshot
Lower bounds for the signature size of incremental schemes
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959903openalex-snapshot
Lower bounds for quantum communication complexity
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181944openalex-snapshot
An information statistics approach to data stream and communication complexity
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238196openalex-snapshot
A lower bound for the bounded round quantum communication complexity of set disjointness
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814607openalex-snapshot
Bounds for small-error and zero-error quantum algorithms
inferred← citeshttps://doi.org/10.1109/skg.2009.52openalex-snapshot
Developing Reliable Web Services Using Independent Replicas
inferred← citeshttps://doi.org/10.1109/tac.2023.3241237openalex-snapshot
Distributed Algorithms for Boolean Equations Over Networks
inferred← citeshttps://doi.org/10.1109/tit.2017.2734103openalex-snapshot
Communication With Imperfectly Shared Randomness
showing the first 200 of 394 · page through all 394
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.