On the public citation graph
Evaluating Monotone Circuits on Cylinders, Planes and Tori
0 signed · 40 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/11590156_19openalex-snapshot
The Directed Planar Reachability Problem
inferredcites →https://doi.org/10.1007/3-540-53487-3_48openalex-snapshot
On the parallel evaluation of classes of circuits
inferredcites →https://doi.org/10.1007/978-3-540-24595-7_37openalex-snapshot
Radial Level Planarity Testing and Embedding in Linear Time
inferredcites →https://doi.org/10.1007/978-3-540-24749-4_5openalex-snapshot
Constant Width Planar Computation Characterizes ACC0
inferredcites →https://doi.org/10.1007/978-3-662-03927-4openalex-snapshot
Introduction to Circuit Complexity
inferredcites →https://doi.org/10.1007/bf02187705openalex-snapshot
A unified approach to visibility representations of planar graphs
inferredcites →https://doi.org/10.1016/0012-365x(87)90008-2openalex-snapshot
Fundamentals of planar ordered sets
inferredcites →https://doi.org/10.1016/0020-0190(80)90117-9openalex-snapshot
A space efficient algorithm for the monotone planar circuit value problem
inferredcites →https://doi.org/10.1016/0022-0000(91)90020-6openalex-snapshot
Properties that characterize LOGCFL
inferredcites →https://doi.org/10.1016/0304-3975(88)90123-5openalex-snapshot
Algorithms for plane representations of acyclic digraphs
inferredcites →https://doi.org/10.1016/0890-5401(89)90009-6openalex-snapshot
Complexity theory of parallel time and hardware
inferredcites →https://doi.org/10.1016/j.ic.2003.09.002openalex-snapshot
The complexity of planarity testing
inferredcites →https://doi.org/10.1016/s0022-0000(05)80070-4openalex-snapshot
Planarity testing in parallel
inferredcites →https://doi.org/10.1016/s0304-0208(08)x7063-xopenalex-snapshot
Graphs, Groups and Surfaces
inferredcites →https://doi.org/10.1109/spdp.1991.218279openalex-snapshot
An NC algorithm for the general planar monotone circuit value problem
inferredcites →https://doi.org/10.1137/0217044openalex-snapshot
Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits
inferredcites →https://doi.org/10.1137/s0097539792226278openalex-snapshot
An ${\mathcal{N} \mathcal{C}}$ Algorithm for Evaluating Monotone Planar Circuits
inferredcites →https://doi.org/10.1137/s0097539794277123openalex-snapshot
On the Computational Complexity of Upward and Rectilinear Planarity Testing
inferredcites →https://doi.org/10.1137/s0097539794279626openalex-snapshot
Optimal Upward Planarity Testing of Single-Source Digraphs
inferredcites →https://doi.org/10.1145/1008354.1008356openalex-snapshot
The monotone and planar circuit value problems are log space complete for P
inferredcites →https://doi.org/10.1145/1060590.1060647openalex-snapshot
Undirected ST-connectivity in log-space
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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/978-3-642-02930-1_20openalex-snapshot
LTL Path Checking Is Efficiently Parallelizable
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_39openalex-snapshot
Classification of Planar Upward Embedding
inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_13openalex-snapshot
The Duals of Upward Planar Graphs on Cylinders
inferred← citeshttps://doi.org/10.1007/978-3-642-45043-3_5openalex-snapshot
Rolling Upward Planarity Testing of Strongly Connected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_8openalex-snapshot
On the Complexity of Temporal-Logic Path Checking
inferred← citeshttps://doi.org/10.1007/s00037-009-0265-5openalex-snapshot
Upper Bounds for Monotone Planar Circuit Value and Variants
inferred← citeshttps://doi.org/10.1007/s00224-009-9172-zopenalex-snapshot
Planar and Grid Graph Reachability Problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.08.003openalex-snapshot
Upward planar drawings on the standing and the rolling cylinders
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.003openalex-snapshot
Upward planar graphs and their duals
inferred← citeshttps://doi.org/10.2168/lmcs-8(4:10)2012openalex-snapshot
Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds
inferred← citeshttps://doi.org/10.22028/d291-26025openalex-snapshot
Model checking finite paths and trees
inferred← citeshttps://doi.org/10.48550/arxiv.1312.7603openalex-snapshot
On the Complexity of Temporal-Logic Path Checking
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.