On the public citation graph

Searching Constant Width Mazes Captures the AC0 Hierarchy

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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1995.1007openalex-snapshot

The Complexity of Iterated Multiplication

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/978-1-4613-2215-3openalex-snapshot

Varieties of Formal Languages

inferredcites →https://doi.org/10.1007/bfb0028550openalex-snapshot

Searching Constant Width Mazes Captures the AC0 Hierarchy

inferredcites →https://doi.org/10.1007/bfb0058024openalex-snapshot

Compilation and equivalence of imperative objects

inferredcites →https://doi.org/10.1016/0022-0000(82)90016-2openalex-snapshot

Classifying regular events in symbolic logic

inferredcites →https://doi.org/10.1016/0022-0000(90)90022-dopenalex-snapshot

On uniformity within NC1

inferredcites →https://doi.org/10.1016/0196-6774(92)90004-vopenalex-snapshot

Maintenance of a minimum spanning forest in a dynamic plane graph

inferredcites →https://doi.org/10.1016/s0020-0190(97)00056-2openalex-snapshot

Dynamic connectivity in digital images

inferredcites →https://doi.org/10.1016/s0168-0072(97)00042-0openalex-snapshot

Classifying toposes for first-order theories

inferredcites →https://doi.org/10.1109/sct.1989.41816openalex-snapshot

The complexity of iterated multiplication

inferredcites →https://doi.org/10.1109/sfcs.1978.30openalex-snapshot

On the power of the compass (or, why mazes are easier to search than graphs)

inferredcites →https://doi.org/10.1109/sfcs.1981.3openalex-snapshot

A complexity theory based on Boolean algebra

inferredcites →https://doi.org/10.1137/0211056openalex-snapshot

Hamilton Paths in Grid Graphs

inferredcites →https://doi.org/10.1137/0216051openalex-snapshot

Languages that Capture Complexity Classes

inferredcites →https://doi.org/10.1145/256303.256309openalex-snapshot

Dynamic word problems

inferredcites →https://doi.org/10.1145/28395.28407openalex-snapshot

Finite monoids and the fine structure of NC 1

inferredcites →https://doi.org/10.1145/3149.3158openalex-snapshot

A complexity theory based on Boolean algebra

inferredcites →https://doi.org/10.1145/48014.63138openalex-snapshot

Finite monoids and the fine structure of NC 1

inferredcites →https://doi.org/10.1145/800061.808733openalex-snapshot

Borel sets and circuit complexity

inferredcites →https://doi.org/10.5555/320176.320177openalex-snapshot

Maintenance of a minimum spanning forest in a dynamic planar graph

inferredcites →https://doi.org/10.7146/brics.v4i21.18947openalex-snapshot

Topological Completeness for Higher-Order Logic

inferredcites →https://doi.org/10.7146/brics.v4i24.18950openalex-snapshot

Relational Reasoning about Contexts

inferredcites →https://doi.org/10.7146/brics.v4i32.18958openalex-snapshot

Hardness Results for Dynamic Problems by Extensions of Fredman and Saks’ Chronogram Method

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11590156_19openalex-snapshot

The Directed Planar Reachability Problem

inferred← citeshttps://doi.org/10.1007/11944836_8openalex-snapshot

One-Input-Face MPCVP Is Hard for L, But in LogDCFL

inferred← citeshttps://doi.org/10.1007/3-540-48523-6_12openalex-snapshot

Bounded Depth Arithmetic Circuits: Counting and Closure

inferred← citeshttps://doi.org/10.1007/978-3-319-09704-6_23openalex-snapshot

On the Complexity of L-reachability

inferred← citeshttps://doi.org/10.1007/978-3-319-09704-6_24openalex-snapshot

Positive and Negative Proofs for Circuits and Branching Programs

inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_35openalex-snapshot

Complexity of Regular Functions

inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_5openalex-snapshot

Constant Width Planar Computation Characterizes ACC0

inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_76openalex-snapshot

Word Problems on Compressed Words

inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_17openalex-snapshot

Circuits on Cylinders

inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_29openalex-snapshot

Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth

inferred← citeshttps://doi.org/10.1007/bfb0026984openalex-snapshot

Presheaf models for the π-calculus

inferred← citeshttps://doi.org/10.1007/bfb0054177openalex-snapshot

Model checking via reachability testing for timed automata

inferred← citeshttps://doi.org/10.1007/bfb0055041openalex-snapshot

Hardness results for dynamic problems by extensions of Fredman and Saks' chronogram method

inferred← citeshttps://doi.org/10.1007/s.00037-006-0207-4openalex-snapshot

Circuits on cylinders

inferred← citeshttps://doi.org/10.1007/s00037-006-0207-4openalex-snapshot

Circuits on cylinders

inferred← citeshttps://doi.org/10.1007/s00037-010-0287-zopenalex-snapshot

A New Characterization of ACC0 and Probabilistic CC0

inferred← citeshttps://doi.org/10.1007/s00224-005-1258-7openalex-snapshot

Constant Width Planar Computation Characterizes ACC0

inferred← citeshttps://doi.org/10.1007/s00224-009-9172-zopenalex-snapshot

Planar and Grid Graph Reachability Problems

inferred← citeshttps://doi.org/10.1007/s00224-018-9871-4openalex-snapshot

Better Complexity Bounds for Cost Register Automata

inferred← citeshttps://doi.org/10.1016/j.tcs.2006.03.011openalex-snapshot

Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.08.041openalex-snapshot

Positive and negative proofs for circuits and branching programs

inferred← citeshttps://doi.org/10.1016/j.tcs.2017.01.017openalex-snapshot

On Boolean combinations forming piecewise testable languages

inferred← citeshttps://doi.org/10.1109/ccc.1999.766259openalex-snapshot

On monotone planar circuits

inferred← citeshttps://doi.org/10.1109/ccc.2006.22openalex-snapshot

Grid Graph Reachability Problems

inferred← citeshttps://doi.org/10.1109/ccc.2007.9openalex-snapshot

Directed Planar Reachability is in Unambiguous Log-Space

inferred← citeshttps://doi.org/10.1109/ccc.2008.30openalex-snapshot

Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size

inferred← citeshttps://doi.org/10.1109/ccc.2009.15openalex-snapshot

A New Characterization of ACC^0 and Probabilistic CC^0

inferred← citeshttps://doi.org/10.1109/ccc.2010.36openalex-snapshot

A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources

inferred← citeshttps://doi.org/10.1109/real.1997.641264openalex-snapshot

Formal modeling and analysis of an audio/video protocol: an industrial case study using UPPAAL

inferred← citeshttps://doi.org/10.1137/s0097539701391592openalex-snapshot

New Lower Bound Techniques for Dynamic Partial Sums and Related Problems

inferred← citeshttps://doi.org/10.1137/s0097539704445950openalex-snapshot

Word Problems and Membership Problems on Compressed Words

inferred← citeshttps://doi.org/10.1145/1490270.1490274openalex-snapshot

Directed Planar Reachability Is in Unambiguous Log-Space

inferred← citeshttps://doi.org/10.3233/fi-2016-1371openalex-snapshot

On the Complexity of L-reachability

inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2021.58openalex-snapshot

Pseudorandom Generators for Read-Once Monotone Branching Programs

inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2016.10openalex-snapshot

Trading Determinism for Time in Space Bounded Computations

inferred← citeshttps://doi.org/10.7146/brics.v4i26.18952openalex-snapshot

A Characterization of Finitary Bisimulation

inferred← citeshttps://doi.org/10.7146/brics.v4i27.18953openalex-snapshot

Zero-Knowledge Proofs for Finite Field Arithmetic or: Can Zero-Knowledge be for Free?

inferred← citeshttps://doi.org/10.7146/brics.v4i28.18954openalex-snapshot

Span Programs and General Secure Multi-Party Computation

inferred← citeshttps://doi.org/10.7146/brics.v4i29.18955openalex-snapshot

Model Checking via Reachability Testing for Timed Automata

inferred← citeshttps://doi.org/10.7146/brics.v4i30.18956openalex-snapshot

Proof Theory and Computational Analysis

inferred← citeshttps://doi.org/10.7146/brics.v4i31.18957openalex-snapshot

Formal Modeling and Analysis of an Audio/Video Protocol: An Industrial Case Study Using UPPAAL

inferred← citeshttps://doi.org/10.7146/brics.v4i32.18958openalex-snapshot

Hardness Results for Dynamic Problems by Extensions of Fredman and Saks’ Chronogram Method

inferred← citeshttps://doi.org/10.7146/brics.v4i33.18959openalex-snapshot

A Note on Frame Distributions

inferred← citeshttps://doi.org/10.7146/brics.v4i34.18960openalex-snapshot

Presheaf Models for the pi-Calculus

inferred← citeshttps://doi.org/10.7146/brics.v9i50.21765openalex-snapshot

Circuits on Cylinders

showing the first 45 of 46 · page through all 46

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.