On the public citation graph

Chicago Journal of Theoretical Computer Science

https://doi.org/10.4086/cjtcs
0 signed · 96 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 points at this work

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

inferred← citeshttps://doi.org/10.1007/11534273_36openalex-snapshot
Subquadratic Algorithms for 3SUM
inferred← citeshttps://doi.org/10.1007/11577327_10openalex-snapshot
Stabilizing Certificate Dispersal
inferred← citeshttps://doi.org/10.1007/11785231_120openalex-snapshot
Self-stabilizing Algorithms for Graph Coloring with Improved Performance Guarantees
inferred← citeshttps://doi.org/10.1007/3-540-40992-0_17openalex-snapshot
Sharper Bounds for the Hardness of Prototype and Feature Selection
inferred← citeshttps://doi.org/10.1007/3-540-45032-7_10openalex-snapshot
A Framework of Safe Stabilization
inferred← citeshttps://doi.org/10.1007/3-540-45032-7_5openalex-snapshot
Self-Stabilizing Group Communication in Directed Networks (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-45438-1_6openalex-snapshot
Communication Adaptive Self-Stabilizing Group Membership Service
inferred← citeshttps://doi.org/10.1007/978-3-319-03850-6_10openalex-snapshot
Self-stabilizing Resource Discovery Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-13129-0_4openalex-snapshot
Limiting Price Discrimination when Selling Products with Positive Network Externalities
inferred← citeshttps://doi.org/10.1007/978-3-319-32162-2_1openalex-snapshot
$$P\mathop{ =}\limits^{?}NP$$
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_19openalex-snapshot
The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_25openalex-snapshot
The Enumerability of P Collapses P to NC
inferred← citeshttps://doi.org/10.1007/978-3-540-28639-4_25openalex-snapshot
Space and Time Complexity of Exact Algorithms: Some Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-45234-8_95openalex-snapshot
FPGAs for High Accuracy Clock Synchronization over Ethernet Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-49823-0_21openalex-snapshot
Fault Masking in Tri-redundant Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_52openalex-snapshot
Faster Combinatorial Algorithms for Determinant and Pfaffian
inferred← citeshttps://doi.org/10.1007/978-3-540-89335-6_14openalex-snapshot
Stabilization of Max-Min Fair Networks without Per-flow State
inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_11openalex-snapshot
Approximability Distance in the Space of H-Colourability Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_31openalex-snapshot
Collusion-Free Multiparty Computation in the Mediated Model
inferred← citeshttps://doi.org/10.1007/978-3-642-13182-0_12openalex-snapshot
Frameworks for Logically Classifying Polynomial-Time Optimisation Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_21openalex-snapshot
Formal Theories for Linear Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_33openalex-snapshot
Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-24550-3_24openalex-snapshot
Space-Efficient Fault-Containment in Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_35openalex-snapshot
Lower Bounds against Weakly Uniform Circuits
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_36openalex-snapshot
On TC0 Lower Bounds for the Permanent
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_35openalex-snapshot
Finding Social Optima in Congestion Games with Positive Externalities
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_10openalex-snapshot
Time-Efficient Quantum Walks for 3-Distinctness
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_34openalex-snapshot
The Power of Choice for Random Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_69openalex-snapshot
Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_15openalex-snapshot
An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_38openalex-snapshot
Two Results about Quantum Messages
inferred← citeshttps://doi.org/10.1007/bfb0054375openalex-snapshot
Determinant: Old algorithms, new insights
inferred← citeshttps://doi.org/10.1007/s00224-018-9880-3openalex-snapshot
Property Testing Lower Bounds via a Generalization of Randomized Parity Decision Trees
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.1007/s00440-025-01380-xopenalex-snapshot
Shotgun assembly of random graphs
inferred← citeshttps://doi.org/10.1007/s00453-025-01339-3openalex-snapshot
Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States
inferred← citeshttps://doi.org/10.1007/s00493-014-2367-1openalex-snapshot
Constructing Ramsey Graphs from Boolean Function Representations
inferred← citeshttps://doi.org/10.1007/s10849-015-9218-3openalex-snapshot
Dependence Logic with a Majority Quantifier
inferred← citeshttps://doi.org/10.1007/s11424-019-9008-0openalex-snapshot
Quantum Algorithm Design: Techniques and Applications
inferred← citeshttps://doi.org/10.1007/s11424-024-1313-6openalex-snapshot
On the Probability of Generating a Primitive Matrix
inferred← citeshttps://doi.org/10.1080/09720529.2009.10698252openalex-snapshot
Some algorithms related to matrices with entries in a finite field
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.001.0001openalex-snapshot
The Nature of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0003openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0004openalex-snapshot
Dedication
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0006openalex-snapshot
Figure Credits
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0007openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0001openalex-snapshot
Prologue
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0002openalex-snapshot
The Basics
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0003openalex-snapshot
Insights and Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0004openalex-snapshot
Needles in a Haystack: the Class NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0005openalex-snapshot
Who is the Hardest One of All? NP-Completeness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0006openalex-snapshot
The Deep Question: P vs. NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0007openalex-snapshot
The Grand Unified Theory of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0008openalex-snapshot
Memory, Paths, and Games
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0009openalex-snapshot
Optimization and Approximation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0010openalex-snapshot
Randomized Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0011openalex-snapshot
Interaction and Pseudorandomness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0012openalex-snapshot
Random Walks and Rapid Mixing
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0013openalex-snapshot
Counting, Sampling, and Statistical Physics
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0014openalex-snapshot
When Formulas Freeze: Phase Transitions in Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0015openalex-snapshot
Quantum Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.005.0001openalex-snapshot
Mathematical Tools
inferred← citeshttps://doi.org/10.1103/physreva.79.032343openalex-snapshot
Error rates of Belavkin weighted quantum measurements and a converse to Holevo’s asymptotic optimality theorem
inferred← citeshttps://doi.org/10.1109/ecmdd.1999.776408openalex-snapshot
Efficient dissemination of mobile agents
inferred← citeshttps://doi.org/10.1109/slfstb.1999.777481openalex-snapshot
Stabilization of maximal metric trees
inferred← citeshttps://doi.org/10.1142/s0129054100000272openalex-snapshot
MOD-2 INDEPENDENCE AND DOMINATION IN GRAPHS
inferred← citeshttps://doi.org/10.1142/s0129054104002327openalex-snapshot
ON THE MINIMAL POLYNOMIAL OF A MATRIX
inferred← citeshttps://doi.org/10.1142/s012905410500284xopenalex-snapshot
SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
inferred← citeshttps://doi.org/10.1142/s0129054105003182openalex-snapshot
CASCADING RANDOM WALKS
inferred← citeshttps://doi.org/10.1142/s0129054111008581openalex-snapshot
RELIABLE COMMUNICATION ON EMULATED CHANNELS RESILIENT TO TRANSIENT FAULTS
inferred← citeshttps://doi.org/10.1142/s0129626405002143openalex-snapshot
A SILENT SELF-STABILIZING ALGORITHM FOR FINDING CUT-NODES AND BRIDGES
inferred← citeshttps://doi.org/10.1145/1007352.1007391openalex-snapshot
Linear FPT reductions and computational lower bounds
inferred← citeshttps://doi.org/10.1145/1160633.1160894openalex-snapshot
Nogood based asynchronous distributed optimization (ADOPT ng)
inferred← citeshttps://doi.org/10.1145/1250790.1250868openalex-snapshot
On the impossibility of a quantum sieve algorithm for graph isomorphism
inferred← citeshttps://doi.org/10.1145/1450058.1450061openalex-snapshot
State space abstraction for parameterized self-stabilizing embedded systems
inferred← citeshttps://doi.org/10.1145/1806689.1806772openalex-snapshot
Towards polynomial lower bounds for dynamic problems
inferred← citeshttps://doi.org/10.1145/1993806.1993877openalex-snapshot
Time bounds for shared objects in partially synchronous systems
inferred← citeshttps://doi.org/10.1145/2484239.2484278openalex-snapshot
Brief announcement
inferred← citeshttps://doi.org/10.1145/2840728.2840768openalex-snapshot
Satisfiability on Mixed Instances
inferred← citeshttps://doi.org/10.1145/3188745.3188842openalex-snapshot
Distribution-free junta testing
inferred← citeshttps://doi.org/10.1145/3798129.3800897openalex-snapshot
Monte Carlo to Las Vegas for Recursively Composed Functions
inferred← citeshttps://doi.org/10.1145/384101.384126openalex-snapshot
Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures
inferred← citeshttps://doi.org/10.1145/967900.968045openalex-snapshot
On the semantics and expressive power of Datalog-like languages for NP search and optimization problems
inferred← citeshttps://doi.org/10.1201/b16132-73openalex-snapshot
Drawings of Graphs
inferred← citeshttps://doi.org/10.1214/24-aop1699openalex-snapshot
Linear cover time is exponentially unlikely
inferred← citeshttps://doi.org/10.1524/9783486710885.bmopenalex-snapshot
Back Matter
inferred← citeshttps://doi.org/10.2200/s00908ed1v01y201903dct015openalex-snapshot
Introduction to Distributed Self-Stabilizing Algorithms
inferred← citeshttps://doi.org/10.2514/1.19833openalex-snapshot
Stabilizing Certificate Dispersal
inferred← citeshttps://doi.org/10.26686/wgtn.16985293openalex-snapshot
Randomness and Computability
inferred← citeshttps://doi.org/10.3934/jimo.2022031openalex-snapshot
An adaptive algorithm for maximization of non-submodular function with a matroid constraint
inferred← citeshttps://doi.org/10.4086/cjtcs.2010.002openalex-snapshot
inferred← citeshttps://doi.org/10.4086/cjtcs.2010.003openalex-snapshot
inferred← citeshttps://doi.org/10.4086/cjtcs.2010.011openalex-snapshot
An algorithm for affine approximation of binary decision diagrams
inferred← citeshttps://doi.org/10.4086/cjtcs.2014.002openalex-snapshot
inferred← citeshttps://doi.org/10.4086/cjtcs.2015.001openalex-snapshot
inferred← citeshttps://doi.org/10.4086/cjtcs.2018.004openalex-snapshot
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.