On the public citation graph
Lower bounds for randomized read-k-times branching programs
0 signed · 34 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-54458-5_49openalex-snapshot
Lower bounds for deterministic and nondeterministic branching programs
inferredcites →https://doi.org/10.1007/3-540-61440-0_141openalex-snapshot
On the power of randomized branching programs
inferredcites →https://doi.org/10.1007/3-540-63165-8_177openalex-snapshot
Randomization and nondeterminism are comparable for ordered read-once branching programs
inferredcites →https://doi.org/10.1007/bf01200404openalex-snapshot
On lower bounds for read-k-times branching programs
inferredcites →https://doi.org/10.1007/bfb0029975openalex-snapshot
On P versus NP∩co-NP for decision trees and read-once branching programs
inferredcites →https://doi.org/10.1007/bfb0035834openalex-snapshot
The power of polynomial size Ω-branching programs
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.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1137/0217015openalex-snapshot
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2001.3040openalex-snapshot
On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata
inferred← citeshttps://doi.org/10.1006/inco.2002.3174openalex-snapshot
On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs
inferred← citeshttps://doi.org/10.1007/11571155_11openalex-snapshot
On Some Bounds on the Size of Branching Programs (A Survey)
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_28openalex-snapshot
Randomness versus Nondeterminism for Read-Once and Read-k Branching Programs
inferred← citeshttps://doi.org/10.1007/3-540-45322-9_4openalex-snapshot
Randomized Branching Programs
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_46openalex-snapshot
On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions
inferred← citeshttps://doi.org/10.1007/978-1-4757-6048-4_49openalex-snapshot
Communication Complexity and BDD Lower Bound Techniques
inferred← citeshttps://doi.org/10.1007/978-3-322-84823-9_19openalex-snapshot
Komplexitätstheoretische Ergebnisse für Randomisierte Branchingprogramme
inferred← citeshttps://doi.org/10.1007/978-3-642-18381-2_11openalex-snapshot
Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size
inferred← citeshttps://doi.org/10.1007/bfb0055830openalex-snapshot
Communication complexity and lower bounds on multilective computations
inferred← citeshttps://doi.org/10.1007/s00224-020-09996-3openalex-snapshot
Satisfiability Algorithm for Syntactic Read-k-times Branching Programs
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.2010.11.013openalex-snapshot
Randomized OBDDs for the most significant bit of multiplication need exponential space
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/s0890-5401(02)93174-3openalex-snapshot
On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs
inferred← citeshttps://doi.org/10.1051/ita:1999108openalex-snapshot
On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
inferred← citeshttps://doi.org/10.1051/ita:1999113openalex-snapshot
Communication Complexity and Lower Bounds on Multilective Computations
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.2011.35openalex-snapshot
Making Branching Programs Oblivious Requires Superlogarithmic Overhead
inferred← citeshttps://doi.org/10.1145/276698.276881openalex-snapshot
On separating the read-k-times branching program hierarchy
inferred← citeshttps://doi.org/10.48550/arxiv.1709.08890openalex-snapshot
Partial matching width and its application to lower bounds for branching programs
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.