On the public citation graph

Current Trends in Theoretical Computer Science

https://doi.org/10.1142/2085
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.
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.1002/9780470996751.ch23openalex-snapshot
Logic in Finite Structures: Definability, Complexity, and Randomness
inferred← citeshttps://doi.org/10.1007/11593447_11openalex-snapshot
Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
inferred← citeshttps://doi.org/10.1007/11780342_23openalex-snapshot
Enumeration Reducibility with Polynomial Time Bounds
inferred← citeshttps://doi.org/10.1007/11875604_16openalex-snapshot
Triangulation of Bayesian Networks Using an Adaptive Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-18170-9_149openalex-snapshot
Minimal pairs for polynomial time reducibilities
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_18openalex-snapshot
Constraint Satisfaction, Graph Isomorphism, and the Pebbling Comonad
inferred← citeshttps://doi.org/10.1007/978-3-031-86319-6_16openalex-snapshot
Linear Algebraic Quantifiers
inferred← citeshttps://doi.org/10.1007/978-3-540-77312-2_17openalex-snapshot
A Formal Framework for Static (Tissue) P Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-85563-7_18openalex-snapshot
Structural Analysis of Promoter Sequences Using Grammar Inference and Support Vector Machine
inferred← citeshttps://doi.org/10.1007/978-3-642-11467-0_19openalex-snapshot
(Tissue) P Systems with Hybrid Transition Modes
inferred← citeshttps://doi.org/10.1007/978-3-642-11467-0_3openalex-snapshot
Transition and Halting Modes in (Tissue) P Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-20920-8_15openalex-snapshot
Hybrid Logics and NP Graph Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_25openalex-snapshot
Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas
inferred← citeshttps://doi.org/10.1007/bf01195200openalex-snapshot
On completeness for NP via projection translations
inferred← citeshttps://doi.org/10.1007/bfb0022260openalex-snapshot
Is first order contained in an initial segment of PTIME?
inferred← citeshttps://doi.org/10.1007/s11225-012-9462-3openalex-snapshot
IF Modal Logic and Classical Negation
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90177-copenalex-snapshot
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00035-6openalex-snapshot
Linear logic automata
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00107-3openalex-snapshot
First-order linear logic without modalities is NEXPTIME-hard
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.02.001openalex-snapshot
The consequences of eliminating NP solutions
inferred← citeshttps://doi.org/10.1016/j.future.2009.07.013openalex-snapshot
Application and middleware transparent checkpointing with TCKPT on ClusterGrids
inferred← citeshttps://doi.org/10.1016/j.jlap.2008.02.005openalex-snapshot
Canonical completeness of infinitary μ
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.019openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1016/s0168-0072(02)00032-5openalex-snapshot
Thue trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00164-8openalex-snapshot
Institutions for logic programming
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00315-5openalex-snapshot
Equivalence is in the eye of the beholder
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10039-0openalex-snapshot
An algebraic framework for the definition of compositional semantics of normal logic programs
inferred← citeshttps://doi.org/10.1016/s1570-7954(00)80027-3openalex-snapshot
Some aspects of categories in computer science
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80410-4openalex-snapshot
The Complexity of Local Proof Search in Linear Logic
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80591-2openalex-snapshot
Specifying Real-Time Finite-State Systems in Linear Logic (Extended Abstract)
inferred← citeshttps://doi.org/10.1017/s0269888900007566openalex-snapshot
Formal specification languages in knowledge and software engineering
inferred← citeshttps://doi.org/10.1017/s0952675717000203openalex-snapshot
Formal and computational verification of phonological analyses
inferred← citeshttps://doi.org/10.1017/s0956796800001131openalex-snapshot
Lilac: a functional programming language based on linear logic
inferred← citeshttps://doi.org/10.1109/ccc.1996.507666openalex-snapshot
Collapsing oracle-tape hierarchies
inferred← citeshttps://doi.org/10.1109/csss.2011.5974657openalex-snapshot
RRPSS: An architecture for rapid reconstruction of pervasive service composition
inferred← citeshttps://doi.org/10.1109/lics.1994.316091openalex-snapshot
McColm's conjecture [positive elementary inductions]
inferred← citeshttps://doi.org/10.1109/lics.1995.523245openalex-snapshot
Relativized logspace and generalized quantifiers over finite structures
inferred← citeshttps://doi.org/10.1109/sct.1994.315798openalex-snapshot
Logical definability of counting functions
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63543openalex-snapshot
An optimal lower bound on the number of variables for graph identification
inferred← citeshttps://doi.org/10.1145/1953122.1953150openalex-snapshot
From polynomial time queries to graph structure theory
inferred← citeshttps://doi.org/10.1145/2493246.2493249openalex-snapshot
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
inferred← citeshttps://doi.org/10.2307/2586700openalex-snapshot
The Logic of Choice
inferred← citeshttps://doi.org/10.2307/2586810openalex-snapshot
Notions of locality and their logical characterizations over finite models
inferred← citeshttps://doi.org/10.2307/2695103openalex-snapshot
Number of variables is equivalent to space
inferred← citeshttps://doi.org/10.2307/421173openalex-snapshot
Almost Everywhere Equivalence of Logics in Finite Model Theory
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.