On the public citation graph
Mathematical Foundations of Computer Science 1990
0 signed · 73 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/bfb0029601openalex-snapshot
Implementation of parallel graph reduction by explicit annotation and program transformation
inferredcites →https://doi.org/10.1007/bfb0029604openalex-snapshot
Separating sets of hyperrectangles
inferredcites →https://doi.org/10.1007/bfb0029605openalex-snapshot
On preemptive scheduling of periodic, real-time tasks on one processor
inferredcites →https://doi.org/10.1007/bfb0029614openalex-snapshot
Event structures, causal trees, and refinements
inferredcites →https://doi.org/10.1007/bfb0029618openalex-snapshot
Generalized kolmogorov complexity in relativized separations
inferredcites →https://doi.org/10.1007/bfb0029620openalex-snapshot
Speed-up theorem without tape compression
inferredcites →https://doi.org/10.1007/bfb0029623openalex-snapshot
Quality criteria for partial order semantics of place/transition-nets
inferredcites →https://doi.org/10.1007/bfb0029626openalex-snapshot
The membership problem for context-free chain code picture languages
inferredcites →https://doi.org/10.1007/bfb0029632openalex-snapshot
Vector language: Simple description of hard instances
inferredcites →https://doi.org/10.1007/bfb0029633openalex-snapshot
Separating ⊕L from L, NL, co-NL and AL (=P) for Oblivious turing machines of linear access time
inferredcites →https://doi.org/10.1007/bfb0029639openalex-snapshot
Semi-commutation and deterministic petri nets
inferredcites →https://doi.org/10.1007/bfb0029640openalex-snapshot
Internal labellings in lambda-calculus
inferredcites →https://doi.org/10.1007/bfb0029641openalex-snapshot
A sup-preserving completion of ordered partial algebras
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11539452_12openalex-snapshot
A New Modality for Almost Everywhere Properties in Timed Automata
inferred← citeshttps://doi.org/10.1007/11590156_32openalex-snapshot
Bisimulation Quantified Logics: Undecidability
inferred← citeshttps://doi.org/10.1007/978-3-319-10882-7_27openalex-snapshot
A Decidable Recursive Logic for Weighted Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_12openalex-snapshot
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_24openalex-snapshot
Intuitionistic LTL and a New Characterization of Safety and Liveness
inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_18openalex-snapshot
Bounded Model Checking for Region Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-30476-0_7openalex-snapshot
Toward Unbounded Model Checking for Region Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-30570-5_1openalex-snapshot
Model Checking for Database Theoreticians
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_1openalex-snapshot
Model Checking for Nominal Calculi
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_14openalex-snapshot
Fault Diagnosis Using Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-39866-0_26openalex-snapshot
Open Maps and Trace Semantics for Timed Partial Order Models
inferred← citeshttps://doi.org/10.1007/978-3-540-40018-9_21openalex-snapshot
Translating a Continuous-Time Temporal Logic into Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_10openalex-snapshot
Deciding Bisimilarity between BPA and BPP Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_12openalex-snapshot
More Precise Partition Abstractions
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_8openalex-snapshot
An Incremental Technique for Automata-Based Decision Procedures
inferred← citeshttps://doi.org/10.1007/978-3-540-74510-5_32openalex-snapshot
Symmetry of Information and Nonuniform Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-540-75221-9_22openalex-snapshot
Expansive-Bisimulation for Context-Free Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-75227-1_8openalex-snapshot
A Tool for the Synthesis of Controller Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-75292-9_23openalex-snapshot
Deciding Weak Bisimilarity of Normed Context-Free Processes Using Tableau
inferred← citeshttps://doi.org/10.1007/978-3-540-75454-1_3openalex-snapshot
Efficient On-the-Fly Algorithms for Partially Observable Timed Games
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_34openalex-snapshot
Normed BPA vs. Normed BPP Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_4openalex-snapshot
Selected Ideas Used for Decidability and Undecidability of Bisimilarity
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_12openalex-snapshot
Continuous Fragment of the mu-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_30openalex-snapshot
Deciding Bisimilarity of Full BPA Processes Locally
inferred← citeshttps://doi.org/10.1007/978-3-642-02979-0_26openalex-snapshot
Amount of Nonconstructivity in Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-04912-5_11openalex-snapshot
Teaching Concurrency: Theory in Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_94openalex-snapshot
The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-11486-1_3openalex-snapshot
Compositional and Quantitative Model Checking (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_16openalex-snapshot
On the Expressiveness of Refinement Settings
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_23openalex-snapshot
Coalgebraic Correspondence Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-13523-1_5openalex-snapshot
Finite State Transducers with Intuition
inferred← citeshttps://doi.org/10.1007/978-3-642-13754-9_11openalex-snapshot
An Automata-Theoretic Approach to Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_34openalex-snapshot
Frame Definability for Classes of Trees in the μ-calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-15297-9_17openalex-snapshot
Simulation and Bisimulation for Probabilistic Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-15349-5_2openalex-snapshot
Symbolic and Compositional Reachability for Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-20877-5_33openalex-snapshot
On the Amount of Nonconstructivity in Learning Recursive Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-22303-7_3openalex-snapshot
A Note on Uniform Interpolation Proofs in Modal Deep Inference Calculi
inferred← citeshttps://doi.org/10.1007/978-3-642-24154-3_29openalex-snapshot
Worst-Case Temperature Analysis for Different Resource Availabilities: A Case Study
inferred← citeshttps://doi.org/10.1007/978-3-642-27375-9_1openalex-snapshot
Union and Intersection Types for Secure Protocol Implementations
inferred← citeshttps://doi.org/10.1007/978-3-642-29952-0_41openalex-snapshot
On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_33openalex-snapshot
On Decidability of Prebisimulation for Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-31464-3_17openalex-snapshot
FFTs and Multiple Collective Communication on Multiprocessor-Node Architectures
inferred← citeshttps://doi.org/10.1007/978-3-642-33654-6_9openalex-snapshot
Borrowed Contexts for Attributed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-35722-0_8openalex-snapshot
Sub-computable Bounded Pseudorandomness
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_8openalex-snapshot
Checking Bisimilarity for Attributed Graph Transformation
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_23openalex-snapshot
Checking Equality and Regularity for Normed BPA with Silent Moves
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_28openalex-snapshot
Complexity of Checking Bisimilarity between Sequential and Parallel Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-54830-7_1openalex-snapshot
Equivalences of Pushdown Systems Are Hard
inferred← citeshttps://doi.org/10.1007/978-3-642-55606-7_2openalex-snapshot
Evolutionary Computation as a Paradigm for DNA-Based Computing
inferred← citeshttps://doi.org/10.1016/j.ic.2012.02.002openalex-snapshot
Approximate all-pairs suffix/prefix overlaps
inferred← citeshttps://doi.org/10.1145/2505821.2505824openalex-snapshot
Finding frequent sub-trajectories with time constraints
inferred← citeshttps://doi.org/10.2200/s00717ed1v01y201605hlt034openalex-snapshot
Linked Lexical Knowledge Bases: Foundations and Applications
inferred← citeshttps://doi.org/10.3390/quantum2010010openalex-snapshot
Heterogeneous Network Architecture for Integration of AI and Quantum Optics by Means of Multiple-Valued Logic
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.