On the public citation graph

Mathematical Foundations of Computer Science 1997

https://doi.org/10.1007/bfb0029943
0 signed · 44 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.1007/bfb0029972openalex-snapshot
A topological generalization of propositional linear time temporal logic
inferredcites →https://doi.org/10.1007/bfb0029974openalex-snapshot
Complexity of finding short resolution proofs
inferredcites →https://doi.org/10.1007/bfb0029976openalex-snapshot
A characterization of abstract families of algebraic power series
inferredcites →https://doi.org/10.1007/bfb0029982openalex-snapshot
Two-level contextual grammars: The internal case
inferredcites →https://doi.org/10.1007/bfb0029984openalex-snapshot
On the influence of the state encoding on OBDD-representations of finite state machines
inferredcites →https://doi.org/10.1007/bfb0029985openalex-snapshot
Decomposition of TrPTL formulas
inferredcites →https://doi.org/10.1007/bfb0029987openalex-snapshot
Deciding verbose languages with linear advice
inferredcites →https://doi.org/10.1007/bfb0029994openalex-snapshot
Partial order semantics and read arcs
inferredcites →https://doi.org/10.1016/s0304-3975(01)00239-0openalex-snapshot
Optimal algorithms for complete linkage clustering in d dimensions

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11415787_3openalex-snapshot
Non-atomic Refinement in Z and CSP
inferred← citeshttps://doi.org/10.1007/11527862_13openalex-snapshot
Approximate Model-Based Diagnosis Using Preference-Based Compilation
inferred← citeshttps://doi.org/10.1007/11538363_12openalex-snapshot
On the Role of Type Decorations in the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1007/11561071_70openalex-snapshot
Greedy Routing in Tree-Decomposed Graphs
inferred← citeshttps://doi.org/10.1007/11591191_34openalex-snapshot
Treewidth in Verification: Local vs. Global
inferred← citeshttps://doi.org/10.1007/978-3-319-09039-9_15openalex-snapshot
Real-Time Prime Generators Implemented on Small-State Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-28639-4_15openalex-snapshot
A Structural View on Parameterizing Problems: Distance from Triviality
inferred← citeshttps://doi.org/10.1007/978-3-540-30232-2_20openalex-snapshot
Petri Net Semantics of the Finite π-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-31954-2_32openalex-snapshot
On Transfinite Hybrid Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-44616-3_17openalex-snapshot
History Preserving Bisimulation for Contextual Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_17openalex-snapshot
Periodicity and Transitivity for Cellular Automata in Besicovitch Topologies
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_18openalex-snapshot
Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-45208-9_21openalex-snapshot
Algebraic Theories for Contextual Pre-nets
inferred← citeshttps://doi.org/10.1007/978-3-540-46464-8_22openalex-snapshot
A Fully Abstract Model for Graph-Interpreted Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-49020-3_5openalex-snapshot
Executable Tile Specifications for Process Calculi
inferred← citeshttps://doi.org/10.1007/978-3-540-69995-8_26openalex-snapshot
Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-73094-1_13openalex-snapshot
Complete Process Semantics for Inhibitor Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-73094-1_18openalex-snapshot
Synthesis of Elementary Net Systems with Context Arcs and Localities
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_27openalex-snapshot
How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-79709-8_4openalex-snapshot
Twelve Problems in Proof Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_3openalex-snapshot
On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes
inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_27openalex-snapshot
Distance d-Domination Games
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_27openalex-snapshot
Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_31openalex-snapshot
Capacitated Confluent Flows: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_14openalex-snapshot
The Complexity Status of Problems Related to Sparsest Cuts
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_12openalex-snapshot
Gate Elimination for Linear Functions and New Feebly Secure Constructions
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_29openalex-snapshot
Parity Games on Graphs with Medium Tree-Width
inferred← citeshttps://doi.org/10.1007/978-3-642-28332-1_15openalex-snapshot
Covering Space in the Besicovitch Topology
inferred← citeshttps://doi.org/10.1007/978-3-642-29822-6_5openalex-snapshot
Compiling a Functional Logic Language: The Basic Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-29952-0_53openalex-snapshot
FPT Results for Signed Domination
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_12openalex-snapshot
Fixed-Parameter Tractability of Treewidth and Pathwidth
inferred← citeshttps://doi.org/10.1007/s00453-008-9180-4openalex-snapshot
Approximation Algorithms for Treewidth
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113702openalex-snapshot
A proof system for unified temporal logic
inferred← citeshttps://doi.org/10.1145/2983990.2984017openalex-snapshot
Type inference for static compilation of JavaScript
inferred← citeshttps://doi.org/10.2200/s00596ed1v01y201409qmc009openalex-snapshot
Approximability of Optimization Problems through Adiabatic Quantum Computation
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.