On the public citation graph
Automata, Languages and Programming
0 signed · 62 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/3-540-57880-3_25openalex-snapshot
A π-calculus specification of prolog
inferredcites →https://doi.org/10.1007/3-540-60688-2_43openalex-snapshot
Constraints for free in concurrent computation
inferredcites →https://doi.org/10.1007/3-540-63165-8_189openalex-snapshot
A proof theoretical approach to communication
inferredcites →https://doi.org/10.1007/978-3-642-60858-2_23openalex-snapshot
The Oz Programming Model
inferredcites →https://doi.org/10.1007/978-3-642-60858-2_24openalex-snapshot
A Foundation for Higher-order Concurrent Constraint Programming
inferredcites →https://doi.org/10.1016/0890-5401(92)90008-4openalex-snapshot
A calculus of mobile processes, I
inferredcites →https://doi.org/10.1016/0890-5401(92)90009-5openalex-snapshot
A calculus of mobile processes, II
inferredcites →https://doi.org/10.1109/lics.1998.705654openalex-snapshot
The fusion calculus: expressiveness and symmetry in mobile processes
inferredcites →https://doi.org/10.1145/99583.99627openalex-snapshot
The semantic foundations of concurrent constraint programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45446-2_1openalex-snapshot
A LTS Semantics of Ambients via Graph Synchronization with Mobility
inferred← citeshttps://doi.org/10.1007/3-540-49366-2_19openalex-snapshot
Bisimulation Lattice of Chi Processes
inferred← citeshttps://doi.org/10.1007/978-3-032-02602-6_10openalex-snapshot
Engineering an $$\mathsf {LTL_f}$$ Synthesis Tool
inferred← citeshttps://doi.org/10.1007/978-3-319-24644-4_10openalex-snapshot
A Behavioural Theory for a π-calculus with Preorders
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_34openalex-snapshot
Strong Bisimulation for the Explicit Fusion Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-40018-9_2openalex-snapshot
Observing Asymmetry and Mismatch
inferred← citeshttps://doi.org/10.1007/978-3-540-77505-8_2openalex-snapshot
A Symbolic Intruder Model for Hash-Collision Attacks
inferred← citeshttps://doi.org/10.1007/978-3-662-49498-1_30openalex-snapshot
The Expressive Power of Monotonic Parallel Composition
inferred← citeshttps://doi.org/10.1007/978-94-010-0654-5_12openalex-snapshot
Axiomatization Without Prefix Combinator
inferred← citeshttps://doi.org/10.1007/bfb0022471openalex-snapshot
An approach to fair applicative multiprogramming
inferred← citeshttps://doi.org/10.1007/s10586-017-1444-9openalex-snapshot
Lossy trapdoor functions based on the PLWE
inferred← citeshttps://doi.org/10.1007/s10601-013-9145-3openalex-snapshot
Models and emerging trends of concurrent constraint programming
inferred← citeshttps://doi.org/10.1007/s11390-007-9063-1openalex-snapshot
Barbed Congruence of Asymmetry and Mismatch
inferred← citeshttps://doi.org/10.1016/b978-0-32-385515-0.00021-0openalex-snapshot
Computational aspects
inferred← citeshttps://doi.org/10.1016/j.cosrev.2011.09.002openalex-snapshot
Confronting intractability via parameters
inferred← citeshttps://doi.org/10.1016/j.cpc.2023.108909openalex-snapshot
Quantum algorithm for smoothed particle hydrodynamics
inferred← citeshttps://doi.org/10.1016/j.dam.2016.03.002openalex-snapshot
(Total) Vector domination for graphs with bounded branchwidth
inferred← citeshttps://doi.org/10.1016/j.dam.2024.01.004openalex-snapshot
Listing the bonds of a graph in O˜(n) –delay
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.01.010openalex-snapshot
A closer look at constraints as processes
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.12.001openalex-snapshot
Cutwidth I: A linear time fixed parameter algorithm
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.03.007openalex-snapshot
Three-valued abstraction for probabilistic systems
inferred← citeshttps://doi.org/10.1016/j.scico.2005.02.008openalex-snapshot
Abstract interpretation of programs as Markov decision processes
inferred← citeshttps://doi.org/10.1016/j.scico.2022.102775openalex-snapshot
Inverse problems, constraint satisfaction, reversible logic, invertible logic and Grover quantum oracles for practical problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.032openalex-snapshot
A bisimulation for dynamic sealing
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.013openalex-snapshot
Component identification in biochemical pathways
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.07.016openalex-snapshot
A domain-theoretic approach to Brownian motion and general continuous stochastic processes
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00283-8openalex-snapshot
Bisimulations in the join-calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00373-0openalex-snapshot
Understanding the mismatch combinator in chi calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00037-7openalex-snapshot
Variations on mobile processes
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00061-0openalex-snapshot
Bisimulation congruence of chi calculus
inferred← citeshttps://doi.org/10.1038/s41598-024-74587-yopenalex-snapshot
A concept of controlling Grover diffusion operator: a new approach to solve arbitrary Boolean-based problems
inferred← citeshttps://doi.org/10.1103/physreva.67.042301openalex-snapshot
Effect of unitary noise on Grover’s quantum search algorithm
inferred← citeshttps://doi.org/10.1103/physreva.68.022326openalex-snapshot
Analysis of Grover’s quantum search algorithm as a dynamical system
inferred← citeshttps://doi.org/10.1103/physrevd.105.076012openalex-snapshot
Quantum speedup for track reconstruction in particle accelerators
inferred← citeshttps://doi.org/10.1103/physrevresearch.6.033325openalex-snapshot
Simulating the quantum Fourier transform, Grover's algorithm, and the quantum counting algorithm with limited entanglement using tensor networks
inferred← citeshttps://doi.org/10.1103/physrevresearch.6.043014openalex-snapshot
Randomized SearchRank: A semiclassical approach to a quantum search engine
inferred← citeshttps://doi.org/10.1109/lics.1998.705654openalex-snapshot
The fusion calculus: expressiveness and symmetry in mobile processes
inferred← citeshttps://doi.org/10.3390/app9173584openalex-snapshot
Performance Analysis and Parameter Optimization of the Optimal Fixed-Point Quantum Search
inferred← citeshttps://doi.org/10.4018/978-1-60566-402-6.ch010openalex-snapshot
Rules Capturing Events and Reactivity
inferred← citeshttps://doi.org/10.4204/eptcs.17.1openalex-snapshot
Towards a Unified Framework for Declarative Structured Communications
inferred← citeshttps://doi.org/10.70675/d9876feez8666z4209z936bz4c82f1fe825bopenalex-snapshot
Vers des outils efficaces pour la vérification de systèmes concurrents
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.