On the public citation graph
Bounds on tradeoffs between randomness and communication complexity
0 signed · 54 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/3-540-16486-3_108openalex-snapshot
Expanders, randomness, or time versus space
inferredcites →https://doi.org/10.1007/3-540-54099-7_26openalex-snapshot
A time-randomness tradeoff for communication complexity
inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1007/bf01305237openalex-snapshot
Pseudorandom generators for space-bounded computation
inferredcites →https://doi.org/10.1007/bfb0035792openalex-snapshot
Memory versus randomization in on-line algorithms
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(85)90008-xopenalex-snapshot
Routing, merging, and sorting on parallel models of computation
inferredcites →https://doi.org/10.1016/0022-0000(86)90046-2openalex-snapshot
Probabilistic communication complexity
inferredcites →https://doi.org/10.1016/0022-0000(88)90035-9openalex-snapshot
Expanders, randomness, or time versus space
inferredcites →https://doi.org/10.1016/s0747-7171(08)80011-9openalex-snapshot
Factoring polynomials using fewer random bits
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1109/fscs.1990.89577openalex-snapshot
Randomness in interactive proofs
inferredcites →https://doi.org/10.1109/fscs.1990.89599openalex-snapshot
Bounds on tradeoffs between randomness and communication complexity
inferredcites →https://doi.org/10.1109/sfcs.1977.24openalex-snapshot
Probabilistic computations: Toward a unified measure of complexity
inferredcites →https://doi.org/10.1109/sfcs.1982.45openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1982.95openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1985.30openalex-snapshot
Geometrical realization of set systems and probabilistic communication complexity
inferredcites →https://doi.org/10.1109/sfcs.1985.45openalex-snapshot
Random polynomial time is equal to slightly-random polynomial time
inferredcites →https://doi.org/10.1109/sfcs.1989.63449openalex-snapshot
Dispersers, deterministic amplification, and weak random sources
inferredcites →https://doi.org/10.1109/sfcs.1991.185351openalex-snapshot
Simulating BPP using a general weak random source
inferredcites →https://doi.org/10.1109/sfcs.1991.185374openalex-snapshot
Amortized communication complexity
inferredcites →https://doi.org/10.1137/0211027openalex-snapshot
A Scheme for Fast Parallel Communication
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
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/0219017openalex-snapshot
A Time-Randomness Trade-Off for Oblivious Routing
inferredcites →https://doi.org/10.1145/100216.100242openalex-snapshot
Pseudorandom generators for space-bounded computations
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/62212.62221openalex-snapshot
A time-randomness tradeoff for oblivious routing
inferredcites →https://doi.org/10.1145/62212.62242openalex-snapshot
Randomized algorithms and pseudorandom numbers
inferredcites →https://doi.org/10.1145/800070.802208openalex-snapshot
Las Vegas Is better than Determinism in VLSI and Distributed Computing
inferredcites →https://doi.org/10.1145/800135.804414openalex-snapshot
Some complexity questions related to distributive computing(Preliminary Report)
inferredcites →https://doi.org/10.1145/800220.806683openalex-snapshot
Randomized parallel communication (Preliminary Version)
inferredcites →https://doi.org/10.1147/rd.386.0683openalex-snapshot
Memory versus randomization in on-line algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_18openalex-snapshot
On Multipartition Communication Complexity
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_12openalex-snapshot
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs
inferred← citeshttps://doi.org/10.1007/3-540-48658-5_36openalex-snapshot
A Randomness-Rounds Tradeoff in Private Computation
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_72openalex-snapshot
On the number of random bits in totally private computation
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_63openalex-snapshot
Communication Versus Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-38536-0_19openalex-snapshot
Amortized Communication Complexity of an Equality Predicate
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_9openalex-snapshot
Computing (and Life) Is All about Tradeoffs
inferred← citeshttps://doi.org/10.1007/s00037-007-0224-yopenalex-snapshot
Communication vs. Computation
inferred← citeshttps://doi.org/10.1007/s001459910005openalex-snapshot
Randomness versus Fault-Tolerance
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90157-dopenalex-snapshot
Private vs. common random bits in communication complexity
inferred← citeshttps://doi.org/10.1016/j.ic.2004.05.002openalex-snapshot
On multi-partition communication complexity
inferred← citeshttps://doi.org/10.1137/s0097539702414622openalex-snapshot
Nondeterministic Communication with a Limited Number of Advice Bits
inferred← citeshttps://doi.org/10.1137/s089548010135274xopenalex-snapshot
Amortizing Randomness in Private Multiparty Computations
inferred← citeshttps://doi.org/10.1137/s089548019427634xopenalex-snapshot
A Randomness-Rounds Tradeoff in Private Computation
inferred← citeshttps://doi.org/10.1137/s0895480196306130openalex-snapshot
Randomness in Private Computations
inferred← citeshttps://doi.org/10.1145/237814.238003openalex-snapshot
Nondeterministic communication with a limited number of advice bits
inferred← citeshttps://doi.org/10.1145/248052.248089openalex-snapshot
Randomness in private computations
inferred← citeshttps://doi.org/10.1145/277697.277710openalex-snapshot
Amortizing randomness in private multiparty computations
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.