On the public citation graph
Trees in Algebra and Programming — CAAP'94
0 signed · 63 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/bfb0017483openalex-snapshot
Nondeterministic automata with concurrency relations and domains
inferredcites →https://doi.org/10.1007/bfb0017485openalex-snapshot
Probabilistic analysis of an election algorithm in a tree
inferredcites →https://doi.org/10.1007/bfb0017486openalex-snapshot
On the first-order equivalence of call-by-name and call-by-value
inferredcites →https://doi.org/10.1007/bfb0017487openalex-snapshot
On the modularity of confluence of constructor-sharing term rewriting systems
inferredcites →https://doi.org/10.1007/bfb0017490openalex-snapshot
A rank hierarchy for deterministic tree-walking transducers
inferredcites →https://doi.org/10.1007/bfb0017491openalex-snapshot
Superposition in picture languages
inferredcites →https://doi.org/10.1007/bfb0017492openalex-snapshot
A grammar-based data-flow analysis to stop deforestation
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.2000.2888openalex-snapshot
Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems
inferred← citeshttps://doi.org/10.1007/10692760_28openalex-snapshot
Minimum Fill-In and Treewidth for Graphs Modularly Decomposable into Chordal Graphs
inferred← citeshttps://doi.org/10.1007/10703163_18openalex-snapshot
Normalization of Typable Terms by Superdevelopments
inferred← citeshttps://doi.org/10.1007/11417170_13openalex-snapshot
Arithmetical Proofs of Strong Normalization Results for the Symmetric λμ-Calculus
inferred← citeshttps://doi.org/10.1007/11523468_82openalex-snapshot
An Accessible Approach to Behavioural Pseudometrics
inferred← citeshttps://doi.org/10.1007/11573036_7openalex-snapshot
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching
inferred← citeshttps://doi.org/10.1007/11590156_17openalex-snapshot
Reachability of Hennessy-Milner Properties for Weakly Extended PRS
inferred← citeshttps://doi.org/10.1007/11601548_22openalex-snapshot
Expression Reduction Systems and Extensions: An Overview
inferred← citeshttps://doi.org/10.1007/11602613_16openalex-snapshot
Revisiting T. Uno and M. Yagiura’s Algorithm
inferred← citeshttps://doi.org/10.1007/11874683_23openalex-snapshot
Infinite State Model-Checking of Propositional Dynamic Logics
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_12openalex-snapshot
Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_3openalex-snapshot
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_13openalex-snapshot
Partial deduction and driving are equivalent
inferred← citeshttps://doi.org/10.1007/978-3-319-12340-0_22openalex-snapshot
Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_20openalex-snapshot
Implementation Results in Classical Constructive Negation
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_17openalex-snapshot
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_25openalex-snapshot
Soundness and Completeness of an “Efficient” Negation for Prolog
inferred← citeshttps://doi.org/10.1007/978-3-540-30477-7_8openalex-snapshot
History Effects and Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_7openalex-snapshot
Linear Time Algorithms for Some NP-Complete Problems on (P 5,Gem)-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_16openalex-snapshot
Tree Schemata and Fair Termination
inferred← citeshttps://doi.org/10.1007/978-3-540-46464-8_2openalex-snapshot
Tree Languages Generated by Context-Free Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-68237-0_8openalex-snapshot
Verifying Dynamic Pointer-Manipulating Threads
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_52openalex-snapshot
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
inferred← citeshttps://doi.org/10.1007/978-3-540-71389-0_4openalex-snapshot
Types and Effects for Resource Usage Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_13openalex-snapshot
A Decidable Temporal Logic of Repeating Values
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_8openalex-snapshot
An Arithmetical Proof of the Strong Normalization for the λ-Calculus with Recursive Equations on Types
inferred← citeshttps://doi.org/10.1007/978-3-540-74621-8_18openalex-snapshot
Proving Termination Using Recursive Path Orders and SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-03466-4_5openalex-snapshot
ν-Types for Effects and Freshness Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_15openalex-snapshot
On Module-Composed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-11486-1_13openalex-snapshot
Extracting the Essence of Distillation
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_11openalex-snapshot
On the Relationship between Spatial Logics and Behavioral Simulations
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_26openalex-snapshot
A Hierarchy for Delimited Continuations in Call-by-Name
inferred← citeshttps://doi.org/10.1007/978-3-642-24288-5_9openalex-snapshot
Decidability of LTL for Vector Addition Systems with One Zero-Test
inferred← citeshttps://doi.org/10.1007/978-3-642-29709-0_15openalex-snapshot
Proving the Correctness of Unfold/Fold Program Transformations Using Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-642-31606-7_11openalex-snapshot
Nominal Automata for Resource Usage Control
inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_29openalex-snapshot
On the Recognition of k-Equistable Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_19openalex-snapshot
Complexity Analysis in Presence of Control Operators and Higher-Order Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-45281-9_14openalex-snapshot
A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian
inferred← citeshttps://doi.org/10.1007/978-3-662-44121-3_12openalex-snapshot
The Cantor-Bendixson Analysis of Finite Trees
inferred← citeshttps://doi.org/10.1016/j.dam.2022.06.042openalex-snapshot
From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-cats
inferred← citeshttps://doi.org/10.1016/j.dam.2023.09.034openalex-snapshot
Resolving prime modules: The structure of pseudo-cographs and galled-tree explainable graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.06.016openalex-snapshot
Subprime and superprime graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2004.04.002openalex-snapshot
Strong normalization of the second-order symmetric λμ-calculus
inferred← citeshttps://doi.org/10.1016/j.ipl.2003.11.002openalex-snapshot
Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.016openalex-snapshot
Asynchronous games 2: The true concurrency of innocence
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.06.029openalex-snapshot
Probe threshold and probe trivially perfect graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.041openalex-snapshot
On the Carathéodory and exchange numbers of geodetic convexity in graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00487-8openalex-snapshot
Structure and stability number of chair-, co-P- and gem-free graphs revisited
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00248-2openalex-snapshot
Periodicity vectors for labelled trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00226-2openalex-snapshot
On Fine and Wilf's theorem for bidimensional words
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00263-6openalex-snapshot
Nondeterministic operations on finite relational structures
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00021-xopenalex-snapshot
Orienting rewrite rules with the Knuth–Bendix order
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.