On the public citation graph

A Quantitative Study of Pure Parallel Processes

0 signed · 50 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/sapm19553411openalex-snapshot
Non‐linear Transformations of Divergent and Slowly Convergent Sequences
inferredcites →https://doi.org/10.1006/eujc.1995.0095openalex-snapshot
Twelve Countings with Rooted Plane Trees
inferredcites →https://doi.org/10.1007/3-540-51542-9_5openalex-snapshot
Optimal algorithms for List Indexing and Subset Rank
inferredcites →https://doi.org/10.1007/3-540-55251-0_2openalex-snapshot
Varieties of increasing trees
inferredcites →https://doi.org/10.1007/978-3-319-14974-5_21openalex-snapshot
Associativity for Binary Parallel Processes: A Quantitative Study
inferredcites →https://doi.org/10.1007/978-3-540-31980-1_18openalex-snapshot
Monte Carlo Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-74407-8_2openalex-snapshot
The Saga of the Axiomatization of Parallel Composition
inferredcites →https://doi.org/10.1007/978-3-662-00061-8openalex-snapshot
Aufgaben und Lehrsätze aus der Analysis
inferredcites →https://doi.org/10.1007/978-94-010-2196-8openalex-snapshot
Advanced Combinatorics: The Art of Finite and Infinite Expansions
inferredcites →https://doi.org/10.1007/978-94-011-4542-8_4openalex-snapshot
Hopf Algebras, Renormalization and Noncommutative Geometry
inferredcites →https://doi.org/10.1007/bf00140664openalex-snapshot
Random sampling from databases: a survey
inferredcites →https://doi.org/10.1007/bf00383170openalex-snapshot
On computing the number of linear extensions of a tree
inferredcites →https://doi.org/10.1007/bf02546665openalex-snapshot
Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
inferredcites →https://doi.org/10.1007/s00026-011-0115-4openalex-snapshot
Noncommutative Symmetric Functions VII: Free Quasi-Symmetric Functions Revisited
inferredcites →https://doi.org/10.1007/s002200050499openalex-snapshot
Hopf Algebras, Renormalization and Noncommutative Geometry
inferredcites →https://doi.org/10.1007/s10801-011-0316-2openalex-snapshot
Linear extension sums as valuations on cones
inferredcites →https://doi.org/10.1016/0016-0032(67)90120-2openalex-snapshot
Asymptotic expansions for ordinary differential equations
inferredcites →https://doi.org/10.1016/0095-8956(79)90073-xopenalex-snapshot
On the number of trees in a random forest
inferredcites →https://doi.org/10.1016/0166-218x(92)90177-copenalex-snapshot
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
inferredcites →https://doi.org/10.1016/0377-0427(90)90042-xopenalex-snapshot
A holonomic systems approach to special functions identities
inferredcites →https://doi.org/10.1016/j.disc.2006.01.003openalex-snapshot
Fast perfect sampling from linear extensions
inferredcites →https://doi.org/10.1016/j.entcs.2008.11.002openalex-snapshot
Coverage-biased Random Exploration of Models
inferredcites →https://doi.org/10.1016/j.jcta.2013.09.008openalex-snapshot
Dyck tilings, increasing trees, descents, and inversions
inferredcites →https://doi.org/10.1016/s0012-365x(99)00259-9openalex-snapshot
An extension of Zeilberger's fast algorithm to general holonomic functions
inferredcites →https://doi.org/10.1016/s0195-6698(80)80051-5openalex-snapshot
Differentiably Finite Power Series
inferredcites →https://doi.org/10.1137/0209009openalex-snapshot
An Efficient Method for Weighted Sampling without Replacement
inferredcites →https://doi.org/10.1142/8439openalex-snapshot
An Introduction to the Analysis of Algorithms
inferredcites →https://doi.org/10.1145/103418.103441openalex-snapshot
Counting linear extensions is #P-complete
inferredcites →https://doi.org/10.1145/178365.178368openalex-snapshot
GFUN
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
inferredcites →https://doi.org/10.1201/b19267-16openalex-snapshot
- Analytic combinatorics
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
inferredcites →https://doi.org/10.4153/cjm-1978-085-0openalex-snapshot
On the Altitude of Nodes in Random Trees
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2013.425openalex-snapshot
The Combinatorics of Non-determinism
inferredcites →https://doi.org/10.4230/lipics.stacs.2008.1317openalex-snapshot
Analytic aspects of the shuffle product
inferredcites →https://doi.org/10.46298/dmtcs.2986openalex-snapshot
Enumeration and Random Generation of Concurrent Computations
inferredcites →https://doi.org/10.5860/choice.46-6858openalex-snapshot
Analytic combinatorics
inferredcites →https://doi.org/10.7146/brics.v14i11.21933openalex-snapshot
The Saga of the Axiomatization of Parallel Composition

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rsa.21056openalex-snapshot
Compaction for two models of logarithmic‐depth trees: Analysis and experiments
inferred← citeshttps://doi.org/10.1007/978-3-030-21571-2_21openalex-snapshot
The Combinatorics of Barrier Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-030-64276-1_5openalex-snapshot
Statistical Analysis of Non-deterministic Fork-Join Processes
inferred← citeshttps://doi.org/10.1016/j.endm.2017.05.014openalex-snapshot
Extended boxed product and application to synchronized trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.01.014openalex-snapshot
A quantitative study of fork-join processes with non-deterministic choice: Application to the statistical exploration of the state-space
inferred← citeshttps://doi.org/10.1137/1.9781611974775.2openalex-snapshot
The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes
inferred← citeshttps://doi.org/10.3390/a14030097openalex-snapshot
Lexicographic Unranking of Combinations Revisited
inferred← citeshttps://doi.org/10.4230/lipics.aofa.2018.14openalex-snapshot
Beyond Series-Parallel Concurrent Systems: The Case of Arch Processes
inferred← citeshttps://doi.org/10.46298/dmtcs.5820openalex-snapshot
Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency
inferred← citeshttps://doi.org/10.70675/60226166z21f7z466bza708zc6843ea30b77openalex-snapshot
Quantitative and algorithmic analysis of concurrent programs
inferred← citeshttps://doi.org/10.70675/782124a1z4de9z4e2azb5a6zb4cf1830a85eopenalex-snapshot
Combinatorics of trees under increasing labellings : asymptotics, bijections and algorithms
inferred← citeshttps://doi.org/10.70675/d11cf190z1b74z4d88zb2b3zda9a05d9ccb1openalex-snapshot
Concurrent process and combinatorics of increasingly labeled structures : quantitative analysis and random generation algorithms
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.