On the public citation graph
Mathematical Foundations of Computer Science 1980
0 signed · 53 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/bfb0022514openalex-snapshot
On atomic nets and concurrency relations
inferredcites →https://doi.org/10.1007/bfb0022521openalex-snapshot
On a subclass of pseudopolynomial problems
inferredcites →https://doi.org/10.1007/bfb0022528openalex-snapshot
Initially — Restricting algebraic theories
inferredcites →https://doi.org/10.1137/0211024openalex-snapshot
Parallel Algorithms in Graph Theory: Planarity Testing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1991.9999openalex-snapshot
A domain equation for bisimulation
inferred← citeshttps://doi.org/10.1007/3-540-10001-6_31openalex-snapshot
Survey of French research and applications based on Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-13346-1_14openalex-snapshot
F-semantics for intersection type discipline
inferred← citeshttps://doi.org/10.1007/978-3-540-27863-4_31openalex-snapshot
On the Integration of Modular Heterogeneous Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_10openalex-snapshot
On Polymorphic Recursion, Type Systems, and Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_25openalex-snapshot
On the Minimisation of Acyclic Models
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_17openalex-snapshot
Intersection, Universally Quantified, and Reference Types
inferred← citeshttps://doi.org/10.1007/978-3-642-17461-2_16openalex-snapshot
A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n 2logn) Expected Time
inferred← citeshttps://doi.org/10.1007/978-3-642-19805-2_3openalex-snapshot
Similarity Quotients as Final Coalgebras
inferred← citeshttps://doi.org/10.1007/bfb0029643openalex-snapshot
Investigation of finitary calculi for the temporal logics by means of infinitary calculi
inferred← citeshttps://doi.org/10.1016/0020-0190(79)90099-1openalex-snapshot
A note concerning top down program development and restricted exit control structures
inferred← citeshttps://doi.org/10.1016/0020-0255(94)90091-4openalex-snapshot
Insertion anomalies and the justification for 4NF in relational databases
inferred← citeshttps://doi.org/10.1016/0022-0000(85)90049-2openalex-snapshot
Free semiring-representations and nondeterminism
inferred← citeshttps://doi.org/10.1016/0096-0551(88)90005-7openalex-snapshot
Broadcasting buffering communication
inferred← citeshttps://doi.org/10.1016/0165-4896(92)90061-9openalex-snapshot
Some economic applications of Scott domains
inferred← citeshttps://doi.org/10.1016/0304-3975(80)90050-xopenalex-snapshot
On branching and looping, part II
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90004-4openalex-snapshot
A complete logic for reasoning about programs via nonstandard model theory I
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90025-1openalex-snapshot
A complete logic for reasoning about programs via nonstandard model theory II
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90166-7openalex-snapshot
Continuously generated fixed points
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90048-4openalex-snapshot
Universal profinite domains
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90015-6openalex-snapshot
Some general incompleteness results for partial correctness logics
inferred← citeshttps://doi.org/10.1016/j.dam.2012.08.031openalex-snapshot
Ordered direct implicational basis of a finite closure system
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.08.044openalex-snapshot
Nonconvex piecewise linear knapsack problems
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.004openalex-snapshot
A Convenient Category of Domains
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.020openalex-snapshot
Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.10.013openalex-snapshot
Presenting Dcpos and Dcpo Algebras
inferred← citeshttps://doi.org/10.1016/j.jsc.2018.06.007openalex-snapshot
Automating algorithm selection: Checking for matrix properties that can simplify computations
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.07.013openalex-snapshot
Elimination-based certificates for triangular equivalence and rank profiles
inferred← citeshttps://doi.org/10.1016/j.jsc.2020.06.006openalex-snapshot
Verification protocols with sub-linear communication for polynomial matrix operations
inferred← citeshttps://doi.org/10.1016/j.orl.2017.01.009openalex-snapshot
Capacitated assortment and price optimization for customers with disjoint consideration sets
inferred← citeshttps://doi.org/10.1016/j.orl.2017.07.002openalex-snapshot
Greedy algorithms for the single-demand facility location problem
inferred← citeshttps://doi.org/10.1016/j.physleta.2015.01.033openalex-snapshot
Approximation of diagonal line based measures in recurrence quantification analysis
inferred← citeshttps://doi.org/10.1016/j.scico.2006.03.008openalex-snapshot
A calculus of logical relations for over- and underapproximating static analyses
inferred← citeshttps://doi.org/10.1016/j.suscom.2017.10.004openalex-snapshot
Maximizing power production in path and tree riverine networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.052openalex-snapshot
On the construction of free algebras for equational systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.11.007openalex-snapshot
Reductions between scheduling problems with non-renewable resources and knapsack problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.001openalex-snapshot
Remarks on hyperspaces for Priestley spaces
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)91242-6openalex-snapshot
The complexity of the validity problem for dynamic logic
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80032-7openalex-snapshot
Functional behavior of nondeterministic and concurrent programs
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00115-xopenalex-snapshot
An approximate binary search algorithm for the multiple-choice knapsack problem
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00050-9openalex-snapshot
A corrected 5NF definition for relational database design
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70018-4openalex-snapshot
Lambda-Calculus and Combinators in the 20th Century
inferred← citeshttps://doi.org/10.1049/iet-ipr.2016.0229openalex-snapshot
Copy–move forgery detection based on multi‐radius PCET
inferred← citeshttps://doi.org/10.1109/lics.1990.113761openalex-snapshot
A PER model of polymorphism and recursive types
inferred← citeshttps://doi.org/10.1109/lics.1993.287596openalex-snapshot
Full abstraction for a shared variable parallel language
inferred← citeshttps://doi.org/10.1145/130069.130111openalex-snapshot
A note on checking matrix products (extended abstract)
inferred← citeshttps://doi.org/10.1145/6490.6494openalex-snapshot
Countable nondeterminism and random assignment
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.