On the public citation graph
Lower bounds for constant depth circuits for prefix problems
0 signed · 45 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/bfb0105127openalex-snapshot
Finding the maximum, merging and sorting in a parallel computation model
inferredcites →https://doi.org/10.1016/0196-6774(81)90010-9openalex-snapshot
Finding the maximum, merging, and sorting in a parallel computation model
inferredcites →https://doi.org/10.1016/0196-6774(83)90033-0openalex-snapshot
Implementation of simultaneous memory address access in models that forbid it
inferredcites →https://doi.org/10.1109/sfcs.1979.16openalex-snapshot
Explicit constructions of linear size superconcentrators
inferredcites →https://doi.org/10.1109/sfcs.1981.35openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1109/sfcs.1982.3openalex-snapshot
A complexity theory for unbounded fan-in parallelism
inferredcites →https://doi.org/10.1145/800061.808731openalex-snapshot
Superconcentrators, generalizers and generalized connectors with limited depth
inferredcites →https://doi.org/10.1145/800061.808732openalex-snapshot
Unbounded fan-in circuits and associative functions
inferredcites →https://doi.org/10.1145/800070.802196openalex-snapshot
Bounds on the time for parallel RAM's to compute simple functions
inferredcites →https://doi.org/10.1145/800116.803752openalex-snapshot
On non-linear lower bounds in computational complexity
inferredcites →https://doi.org/10.1145/800133.804336openalex-snapshot
A unified approach to models of synchronous parallel machines
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.1997.2654openalex-snapshot
The Complexity of Parallel Prefix Problems on Small Domains
inferred← citeshttps://doi.org/10.1007/11681878_15openalex-snapshot
Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_49openalex-snapshot
Prefix graphs and their applications
inferred← citeshttps://doi.org/10.1007/978-3-540-71677-8_23openalex-snapshot
Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_44openalex-snapshot
Circuit Complexity of Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_34openalex-snapshot
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
inferred← citeshttps://doi.org/10.1007/978-3-642-17373-8_28openalex-snapshot
Multiparty Computation for Modulo Reduction without Bit-Decomposition and a Generalization to Bit-Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_64openalex-snapshot
Steiner Transitive-Closure Spanners of Low-Dimensional Posets
inferred← citeshttps://doi.org/10.1007/978-981-96-5566-3_16openalex-snapshot
Simultaneous Multiplication Protocol Based on Packed Linear Secret Sharing and Its Applications
inferred← citeshttps://doi.org/10.1007/bf01200429openalex-snapshot
Randomized range-maxima in nearly-constant parallel time
inferred← citeshttps://doi.org/10.1007/s00224-009-9180-zopenalex-snapshot
Circuit Complexity of Regular Languages
inferred← citeshttps://doi.org/10.1007/s00493-014-2833-9openalex-snapshot
Steiner transitive-closure spanners of low-dimensional posets
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50020-5openalex-snapshot
Communication Networks
inferred← citeshttps://doi.org/10.1016/j.jairtraman.2016.02.005openalex-snapshot
Towards a secure trading of aviation CO2 allowance
inferred← citeshttps://doi.org/10.1093/ietfec/e90-a.5.960openalex-snapshot
Constant-Round Multiparty Computation for Interval Test, Equality Test, and Comparison
inferred← citeshttps://doi.org/10.1109/ccc.2000.856748openalex-snapshot
Average case complexity of unbounded fanin circuits
inferred← citeshttps://doi.org/10.1109/ccc.2012.39openalex-snapshot
Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators
inferred← citeshttps://doi.org/10.1109/focs.2006.46openalex-snapshot
Lower bounds for circuits with MOD_m gates
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/sfcs.1992.267787openalex-snapshot
The complexity of parallel prefix problems on small domains
inferred← citeshttps://doi.org/10.1109/tit.2013.2270275openalex-snapshot
Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates
inferred← citeshttps://doi.org/10.1137/s0097539792225303openalex-snapshot
The Serial Transitive Closure Problem for Trees
inferred← citeshttps://doi.org/10.1145/113379.113385openalex-snapshot
Tight bounds for the chaining problem
inferred← citeshttps://doi.org/10.1145/1706591.1706594openalex-snapshot
Amplifying lower bounds by means of self-reducibility
inferred← citeshttps://doi.org/10.1145/2213977.2214023openalex-snapshot
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
inferred← citeshttps://doi.org/10.1145/28395.28442openalex-snapshot
Size-time complexity of Boolean networks for prefix computations
inferred← citeshttps://doi.org/10.1145/2902251.2902299openalex-snapshot
Schema Validation via Streaming Circuits
inferred← citeshttps://doi.org/10.1145/62044.62052openalex-snapshot
Size-time complexity of Boolean networks for prefix computations
inferred← citeshttps://doi.org/10.1145/800057.808717openalex-snapshot
On monotone formulae with restricted depth
inferred← citeshttps://doi.org/10.1145/800061.808731openalex-snapshot
Superconcentrators, generalizers and generalized connectors with limited depth
inferred← citeshttps://doi.org/10.1147/rd.312.0235openalex-snapshot
The complexity of computations by networks
inferred← citeshttps://doi.org/10.1561/0400000063openalex-snapshot
Complexity of Linear Boolean Operators
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.