On the public citation graph
Automata, Languages and Programming
0 signed · 117 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/bfb0036910openalex-snapshot
Wythoff games, continued fractions, cedar trees and Fibonacci searches
inferredcites →https://doi.org/10.1007/bfb0036911openalex-snapshot
Initial index: A new complexity function for languages
inferredcites →https://doi.org/10.1007/bfb0036913openalex-snapshot
Polynomial-time factorization of multivariate polynomials over finite fields
inferredcites →https://doi.org/10.1007/bfb0036916openalex-snapshot
Lower bounds for solving undirected graph problems on VLSI
inferredcites →https://doi.org/10.1007/bfb0036930openalex-snapshot
On the study data structures: Binary tournaments with repeated keys
inferredcites →https://doi.org/10.1007/bfb0036931openalex-snapshot
Minimizing width in linear layouts
inferredcites →https://doi.org/10.1007/bfb0036932openalex-snapshot
Proving precedence properties: The temporal way
inferredcites →https://doi.org/10.1007/bfb0036933openalex-snapshot
An algebraic semantics for busy (data-driven) and lazy (demand-driven) evaluation and its application to a functional language
inferredcites →https://doi.org/10.1007/bfb0036944openalex-snapshot
Enumeration of success patterns in logic programs
inferredcites →https://doi.org/10.1007/bfb0036946openalex-snapshot
Power domains and predicate transformers: A topological view
inferredcites →https://doi.org/10.1007/bfb0036947openalex-snapshot
Recognition and isomorphism of two dimensional partial orders
inferredcites →https://doi.org/10.1007/bfb0036948openalex-snapshot
On the simulation of many storage heads by a single one
inferredcites →https://doi.org/10.1007/bfb0036951openalex-snapshot
Context-free controlled etol systems
inferredcites →https://doi.org/10.1016/0304-3975(84)90117-8openalex-snapshot
Factoring multivariate integral polynomials
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.1006/jagm.1998.0968openalex-snapshot
Time–Work Tradeoffs of the Single-Source Shortest Paths Problem
inferred← citeshttps://doi.org/10.1007/3-540-18508-9_17openalex-snapshot
Categories and effective computations
inferred← citeshttps://doi.org/10.1007/978-1-4612-5196-5_13openalex-snapshot
The Functional Data Model and its Uses for Interaction with Databases
inferred← citeshttps://doi.org/10.1007/bf00970872openalex-snapshot
Role of determinism in query languages for data bases
inferred← citeshttps://doi.org/10.1007/bf01660035openalex-snapshot
Semantics of digital networks containing indeterminate modules
inferred← citeshttps://doi.org/10.1007/s10458-014-9263-3openalex-snapshot
A logic of intention and action for regular BDI agents based on bisimulation of agent programs
inferred← citeshttps://doi.org/10.1007/springerreference_64154openalex-snapshot
Implication of Constraints
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00130-bopenalex-snapshot
Random palindromes: multivariate generating function and Bernoulli density
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00049-iopenalex-snapshot
Fairness and partial order semantics
inferred← citeshttps://doi.org/10.1016/0022-0000(85)90011-xopenalex-snapshot
Speedups of deterministic machines by synchronous parallel machines
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90034-7openalex-snapshot
Relativized alternation and space-bounded computation
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90038-mopenalex-snapshot
On the complexity of ranking
inferred← citeshttps://doi.org/10.1016/0022-4049(93)90059-3openalex-snapshot
Domains arising as algebras for powerspace constructions
inferred← citeshttps://doi.org/10.1016/0164-1212(95)00066-6openalex-snapshot
A formally specified prototyping system
inferred← citeshttps://doi.org/10.1016/0165-0114(93)90367-qopenalex-snapshot
A note on fuzzy power relations
inferred← citeshttps://doi.org/10.1016/0165-4896(92)90061-9openalex-snapshot
Some economic applications of Scott domains
inferred← citeshttps://doi.org/10.1016/0166-8641(95)00013-7openalex-snapshot
Constructing a quasi-uniform function space
inferred← citeshttps://doi.org/10.1016/0167-6423(84)90003-0openalex-snapshot
Adequate proof principles for invariance and liveness properties of concurrent programs
inferred← citeshttps://doi.org/10.1016/0167-6423(93)90024-jopenalex-snapshot
Real-time specification and modeling with joint actions
inferred← citeshttps://doi.org/10.1016/0167-9260(86)90038-6openalex-snapshot
The instruction systolic array — a parallel architecture for VLSI
inferred← citeshttps://doi.org/10.1016/0168-0072(94)00062-8openalex-snapshot
Towards the computational complexity of ℘Rω-terms
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00067-4openalex-snapshot
Effective inseparability in a topological setting
inferred← citeshttps://doi.org/10.1016/0196-6774(84)90022-1openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90102-0openalex-snapshot
Separately continuous algebras
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90032-5openalex-snapshot
A pumping lemma for real-time deterministic context-free languages
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90158-6openalex-snapshot
Robust algorithms: A different approach to oracles
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90043-5openalex-snapshot
A characterization of F-complete type assignments
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90166-0openalex-snapshot
Infinite-word languages and continuous mappings
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90138-7openalex-snapshot
The interchange or pump (DI)lemmas for context-free languages
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90172-copenalex-snapshot
Completions of perpetual logic programs
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90072-2openalex-snapshot
Information systems for continuous posets
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00050-7openalex-snapshot
Domain theory and integration
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00169-7openalex-snapshot
Constructive domain theory as a branch of intuitionistic pointfree topology
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00250-2openalex-snapshot
PCF extended with real numbers
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90048-4openalex-snapshot
Universal profinite domains
inferred← citeshttps://doi.org/10.1016/b978-0-444-89402-1.50025-4openalex-snapshot
An upward compatible timed extension to LOTOS
inferred← citeshttps://doi.org/10.1016/j.aam.2011.03.005openalex-snapshot
Some improvements of the S-adic conjecture
inferred← citeshttps://doi.org/10.1016/j.aam.2014.08.005openalex-snapshot
On the asymptotic abelian complexity of morphic words
inferred← citeshttps://doi.org/10.1016/j.aim.2020.106999openalex-snapshot
Set relations and set systems induced by some families of integral domains
inferred← citeshttps://doi.org/10.1016/j.apal.2005.05.027openalex-snapshot
On the parallel between the suplattice and preframe approaches to locale theory
inferred← citeshttps://doi.org/10.1016/j.apal.2016.04.012openalex-snapshot
Atomicity, coherence of information, and point-free structures
inferred← citeshttps://doi.org/10.1016/j.cogsys.2025.101398openalex-snapshot
Semantic neighborhood in cognitive modeling
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.08.003openalex-snapshot
Convex blocking and partial orders on the plane
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.033openalex-snapshot
A Hofmann-Mislove theorem for Bitopological Spaces
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.023openalex-snapshot
On the Continuity of Effective Multifunctions
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.01.002openalex-snapshot
Semantic Domains for Combining Probability and Non-Determinism
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.015openalex-snapshot
Quasicontinuous Domains and the Smyth Powerdomain
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.01.005openalex-snapshot
A Note on Finitely Derived Information Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.01.007openalex-snapshot
Formal Contexts for Algebraic Domains
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.01.010openalex-snapshot
Representations of Algebraic Domains and Algebraic L-domains by Information Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2015.12.016openalex-snapshot
Healthiness Conditions for Predicate Transformers
inferred← citeshttps://doi.org/10.1016/j.fss.2019.11.004openalex-snapshot
Rough games modeled via L-fuzzy ambiguous representations of semilattices
inferred← citeshttps://doi.org/10.1016/j.geomphys.2022.104730openalex-snapshot
On the geometry of physical measurements: Topological and algebraic aspects
inferred← citeshttps://doi.org/10.1016/j.ic.2015.12.003openalex-snapshot
Re-visiting axioms of information systems
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104657openalex-snapshot
Principal abstract families of weighted tree languages
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104882openalex-snapshot
Bounded game-theoretic semantics for modal mu-calculus
inferred← citeshttps://doi.org/10.1016/j.ijar.2018.04.002openalex-snapshot
Notions from rough set theory in a generalized dependency relation context
inferred← citeshttps://doi.org/10.1016/j.ijar.2023.109046openalex-snapshot
On some generalization of rough sets
inferred← citeshttps://doi.org/10.1016/j.ins.2008.01.016openalex-snapshot
Domain semantics of possibility computations
inferred← citeshttps://doi.org/10.1016/j.ins.2019.05.055openalex-snapshot
Efficient privacy-preserving data merging and skyline computation over multi-source encrypted data
inferred← citeshttps://doi.org/10.1016/j.jda.2013.03.001openalex-snapshot
Infinite words containing the minimal number of repetitions
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.11.004openalex-snapshot
Observationally-induced lower and upper powerspace constructions
inferred← citeshttps://doi.org/10.1016/j.jlamp.2025.101094openalex-snapshot
On the inner structure of multirelations
inferred← citeshttps://doi.org/10.1016/j.jlap.2008.02.007openalex-snapshot
A Hofmann–Mislove theorem for bitopological spaces
inferred← citeshttps://doi.org/10.1016/j.jmp.2020.102435openalex-snapshot
Modeling misconceptions in knowledge space theory
inferred← citeshttps://doi.org/10.1016/j.jss.2021.110908openalex-snapshot
Adaptive distributed monitors of spatial properties for cyber–physical systems
inferred← citeshttps://doi.org/10.1016/j.scico.2019.102323openalex-snapshot
Correct composition in the presence of behavioural conflicts and dephasing
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.01.023openalex-snapshot
Behavioural inverse limit λ-models
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.01.024openalex-snapshot
SOS rule formats for zero and unit elements
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.034openalex-snapshot
A linear translation from CTL* to the first-order modal μ -calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.01.024openalex-snapshot
An analytic approach to the asymptotic variance of trie statistics and related structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.01.024openalex-snapshot
On the largest Cartesian closed category of stable domains
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.01.015openalex-snapshot
Schedulers and finishers: On generating and filtering the behaviours of an event structure
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.01.042openalex-snapshot
Weak algebraic information systems and a new equivalent category of DOM of domains
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.12.015openalex-snapshot
Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.12.044openalex-snapshot
Generalised information systems capture L-domains
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.001openalex-snapshot
Remarks on hyperspaces for Priestley spaces
inferred← citeshttps://doi.org/10.1016/j.topol.2014.09.002openalex-snapshot
Consistent Hoare powerdomains
inferred← citeshttps://doi.org/10.1016/j.topol.2021.107918openalex-snapshot
Two topologies on the lattice of Scott closed subsets
inferred← citeshttps://doi.org/10.1016/j.topol.2022.108066openalex-snapshot
Core-compactness, consonance and the Smyth powerspaces
inferred← citeshttps://doi.org/10.1016/j.topol.2023.108641openalex-snapshot
A generalization of de Vries duality to closed relations between compact Hausdorff spaces
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80024-2openalex-snapshot
Deterministic dynamic logic is strictly weaker than dynamic logic
inferred← citeshttps://doi.org/10.1016/s0166-4115(08)62656-4openalex-snapshot
Chapter 7 Knowledge Assessment Based on Skill Assignment and Psychological Task Analysis
inferred← citeshttps://doi.org/10.1016/s0166-8641(97)00225-3openalex-snapshot
Properly injective spaces and function spaces
inferred← citeshttps://doi.org/10.1016/s0168-0072(99)80002-5openalex-snapshot
Mω considered as a programming language
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00300-0openalex-snapshot
Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00309-7openalex-snapshot
A cartesian closed category in Martin-Löf's intuitionistic type theory
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00704-1openalex-snapshot
Some points in formal topology
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00099-1openalex-snapshot
Induction and recursion on the partial real line with applications to Real PCF
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80007-0openalex-snapshot
Domain Theory in Learning Processes
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80076-8openalex-snapshot
On the Compact-regular Coreflection of a Stably Compact Locale
inferred← citeshttps://doi.org/10.1080/00207168608803501openalex-snapshot
A hierarchy of loop programs over binary trees
inferred← citeshttps://doi.org/10.1086/289370openalex-snapshot
Using Scott Domains to Explicate the Notions of Approximate and Idealized Data
inferred← citeshttps://doi.org/10.1145/2886012openalex-snapshot
Protecting Software through Obfuscation
inferred← citeshttps://doi.org/10.1145/3511808.3557546openalex-snapshot
An Empirical Study on the Membership Inference Attack against Tabular Data Synthesis Models
inferred← citeshttps://doi.org/10.1145/3673971.3673990openalex-snapshot
Federated Learning and Differential Privacy Techniques on Multi-hospital Population-scale Electrocardiogram Data
inferred← citeshttps://doi.org/10.2307/421098openalex-snapshot
Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
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.