On the public citation graph
On the distributional complexity of disjointness
0 signed · 70 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.1109/sfcs.1983.30openalex-snapshot
Lower bounds by probabilistic arguments
inferredcites →https://doi.org/10.1109/sfcs.1986.15openalex-snapshot
Complexity classes in communication complexity theory
inferredcites →https://doi.org/10.1137/0405044openalex-snapshot
The Probabilistic Communication Complexity of Set Intersection
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/jcss.1997.1545openalex-snapshot
The Space Complexity of Approximating the Frequency Moments
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_74openalex-snapshot
The Communication Complexity of Approximate Set Packing and Covering
inferred← citeshttps://doi.org/10.1007/978-0-387-39940-9_373openalex-snapshot
Stream Similarity Mining
inferred← citeshttps://doi.org/10.1007/978-1-4614-8265-9_373openalex-snapshot
Stream Similarity Mining
inferred← citeshttps://doi.org/10.1007/978-1-4615-2696-4_3openalex-snapshot
Communication Complexity and Lower Bounds for Threshold Circuits
inferred← citeshttps://doi.org/10.1007/978-1-4899-7993-3_373-2openalex-snapshot
Stream Similarity Mining
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-031-48618-0_9openalex-snapshot
Combinatorially Homomorphic Encryption
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-322-95233-2_15openalex-snapshot
Communication Complexity and Lower Bounds for Sequential Computation
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-642-02927-1_20openalex-snapshot
Annotations in Data Streams
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-27848-8_799-1openalex-snapshot
Communication Complexity
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-41527-2_2openalex-snapshot
When Distributed Computation Is Communication Expensive
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-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/s00224-018-9880-3openalex-snapshot
Property Testing Lower Bounds via a Generalization of Randomized Parity Decision Trees
inferred← citeshttps://doi.org/10.1007/s00446-014-0218-3openalex-snapshot
When distributed computation is communication expensive
inferred← citeshttps://doi.org/10.1007/s10773-019-04209-1openalex-snapshot
Quantum Online Streaming Algorithms with Logarithmic Memory
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00005-4openalex-snapshot
Geometric arguments yield better bounds for threshold circuits and distributed computing
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.1109/fscs.1990.89562openalex-snapshot
Communication-space tradeoffs for unrestricted protocols
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206473openalex-snapshot
The Learning and Communication Complexity of Subsequence Containment
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365711openalex-snapshot
On rank vs. communication complexity
inferred← citeshttps://doi.org/10.1137/0405044openalex-snapshot
The Probabilistic Communication Complexity of Set Intersection
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch134openalex-snapshot
Communication Complexity of Permutation-Invariant Functions
inferred← citeshttps://doi.org/10.1137/1.9781611975482.112openalex-snapshot
Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation
inferred← citeshttps://doi.org/10.1137/1.9781611975994.109openalex-snapshot
Vertex Ordering Problems in Directed Graph Streams
inferred← citeshttps://doi.org/10.1137/1.9781611977585.ch20openalex-snapshot
Tight Bounds for Vertex Connectivity in Dynamic Streams
inferred← citeshttps://doi.org/10.1137/s0097539791196883openalex-snapshot
Communication-Space Tradeoffs for Unrestricted Protocols
inferred← citeshttps://doi.org/10.1145/100216.100253openalex-snapshot
Monotone circuits for matching require linear depth
inferred← citeshttps://doi.org/10.1145/129712.129771openalex-snapshot
The history and status of the P versus NP question
inferred← citeshttps://doi.org/10.1145/146637.146684openalex-snapshot
Monotone circuits for matching require linear depth
inferred← citeshttps://doi.org/10.1145/1855118.1855133openalex-snapshot
The story of set disjointness
inferred← citeshttps://doi.org/10.1145/1855118.1886592openalex-snapshot
SIGACT News Complexity Theory Column 67
inferred← citeshttps://doi.org/10.1145/2090236.2090245openalex-snapshot
Practical verified computation with streaming interactive proofs
inferred← citeshttps://doi.org/10.1145/2213977.2214063openalex-snapshot
Tight bounds for distributed functional monitoring
inferred← citeshttps://doi.org/10.1145/258533.258620openalex-snapshot
Direct product results and the GCD problem, in old and new communication models
inferred← citeshttps://doi.org/10.1145/2591796.2591834openalex-snapshot
The matching polytope has exponential extension complexity
inferred← citeshttps://doi.org/10.1145/276698.276713openalex-snapshot
Quantum vs. classical communication and computation
inferred← citeshttps://doi.org/10.1145/3127497openalex-snapshot
The Matching Polytope has Exponential Extension Complexity
inferred← citeshttps://doi.org/10.1145/3406325.3451081openalex-snapshot
Universally-optimal distributed algorithms for known topologies
inferred← citeshttps://doi.org/10.1145/3406325.3451106openalex-snapshot
The communication complexity of multiparty set disjointness under product distributions
inferred← citeshttps://doi.org/10.1145/3519270.3538413openalex-snapshot
A Framework for Distributed Quantum Queries in the CONGEST Model
inferred← citeshttps://doi.org/10.1145/3625225openalex-snapshot
Quantum Communication Complexity of Linear Regression
inferred← citeshttps://doi.org/10.1145/3649435openalex-snapshot
Sketching Approximability of All Finite CSPs
inferred← citeshttps://doi.org/10.1145/3662158.3662795openalex-snapshot
Multi-Party Set Disjointness and Intersection with Bounded Dependence
inferred← citeshttps://doi.org/10.1145/3801916openalex-snapshot
Towards Output-Optimal Uniform Sampling and Approximate Counting for Join-Project Queries
inferred← citeshttps://doi.org/10.1145/636865.636867openalex-snapshot
Time-space trade-off lower bounds for randomized computation of decision problems
inferred← citeshttps://doi.org/10.32657/10356/66033openalex-snapshot
Contributions to the study of probabilistic communication complexity classes
inferred← citeshttps://doi.org/10.3390/e23010017openalex-snapshot
On the Interactive Capacity of Finite-State Protocols
inferred← citeshttps://doi.org/10.3390/math10010143openalex-snapshot
Quantum and Classical Log-Bounded Automata for the Online Disjointness Problem
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2021.27openalex-snapshot
Lower Bounds and Improved Algorithms for Asymmetric Streaming Edit Distance and Longest Common Subsequence
inferred← citeshttps://doi.org/10.46298/theoretics.24.3openalex-snapshot
Constructive Separations and Their Consequences
inferred← citeshttps://doi.org/10.48550/arxiv.1304.4636openalex-snapshot
When Distributed Computation is Communication Expensive
inferred← citeshttps://doi.org/10.48550/arxiv.1304.6685openalex-snapshot
Distance-Sensitive Property Testing Lower Bounds
inferred← citeshttps://doi.org/10.48550/arxiv.1311.2369openalex-snapshot
The matching polytope has exponential extension complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1704.06507openalex-snapshot
Exploring the bounds on the positive semidefinite rank
inferred← citeshttps://doi.org/10.48550/arxiv.2110.00741openalex-snapshot
Lower Bounds for Induced Cycle Detection in Distributed Computing
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.