On the public citation graph

Boltzmann Oracle for Combinatorial Systems

0 signed · 34 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.1016/0001-8708(81)90052-9openalex-snapshot
Une théorie combinatoire des séries formelles
inferredcites →https://doi.org/10.1016/0012-365x(90)90336-gopenalex-snapshot
Dérivées directionnelles et développements de Taylor combinatoires
inferredcites →https://doi.org/10.1016/0097-3165(85)90083-4openalex-snapshot
Éclosions combinatoires appliquées à l'inversion multidimensionnelle des séries formelles
inferredcites →https://doi.org/10.1016/0304-3975(91)90145-ropenalex-snapshot
Automatic average-case analysis of algorithms
inferredcites →https://doi.org/10.1016/s0196-8858(82)80013-4openalex-snapshot
Une approche combinatoire pour l'itération de Newton - Raphson
inferredcites →https://doi.org/10.1017/cbo9780511801655openalex-snapshot
Analytic Combinatorics
inferredcites →https://doi.org/10.1017/s0963548304006315openalex-snapshot
Boltzmann Samplers for the Random Generation of Combinatorial Structures
inferredcites →https://doi.org/10.1017/s0963548304006455openalex-snapshot
Special Issue on Analysis of Algorithms
inferredcites →https://doi.org/10.1126/science.144.3619.697openalex-snapshot
Elementary Theory of Analytic Functions of One or Several Complex Variables
inferredcites →https://doi.org/10.1137/1.9781611972979.5openalex-snapshot
Boltzmann Sampling of Unlabelled Structures
inferredcites →https://doi.org/10.1145/1292414.1292422openalex-snapshot
Uniform random walks in very large models
inferredcites →https://doi.org/10.1201/b19267-16openalex-snapshot
- Analytic combinatorics
inferredcites →https://doi.org/10.2307/2311033openalex-snapshot
Elementary Theory of Analytic Functions of One or Several Complex Variables.
inferredcites →https://doi.org/10.48550/arxiv.0807.0992openalex-snapshot
Random XML sampling the Boltzmann way

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.20275openalex-snapshot
Uniform random sampling of planar graphs in linear time
inferred← citeshttps://doi.org/10.1002/rsa.20379openalex-snapshot
The fraction of large random trees representing a given Boolean function in implicational logic
inferred← citeshttps://doi.org/10.1007/978-3-642-02674-4_10openalex-snapshot
Uniform Random Generation of Huge Metamodel Instances
inferred← citeshttps://doi.org/10.1007/978-3-642-37067-0_9openalex-snapshot
Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes
inferred← citeshttps://doi.org/10.1016/j.dam.2012.05.022openalex-snapshot
Boltzmann samplers for first-order differential specifications
inferred← citeshttps://doi.org/10.1016/j.endm.2017.05.008openalex-snapshot
Taming reluctant random walks in the positive quadrant
inferred← citeshttps://doi.org/10.1016/j.jcta.2012.05.007openalex-snapshot
Algorithms for combinatorial structures: Well-founded systems and Newton iterations
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.010openalex-snapshot
Controlled non-uniform random generation of decomposable structures
inferred← citeshttps://doi.org/10.1017/s0963548309990332openalex-snapshot
Random Sampling of Plane Partitions
inferred← citeshttps://doi.org/10.1109/wsc.2011.6147745openalex-snapshot
Random generation of combinatorial structures: Boltzmann samplers and beyond
inferred← citeshttps://doi.org/10.1137/1.9781611973013.3openalex-snapshot
Lambda terms of bounded unary height
inferred← citeshttps://doi.org/10.1137/1.9781611973020.12openalex-snapshot
Dirichlet Random Samplers for Multiplicative Structures
inferred← citeshttps://doi.org/10.1137/1.9781611973082.15openalex-snapshot
On Buffon Machines and Numbers
inferred← citeshttps://doi.org/10.1145/1596627.1596637openalex-snapshot
Fast and sound random generation for automated testing and benchmarking in objective Caml
inferred← citeshttps://doi.org/10.46298/dmtcs.2793openalex-snapshot
Multi-dimensional Boltzmann Sampling of Languages
inferred← citeshttps://doi.org/10.46298/dmtcs.2989openalex-snapshot
Biased Boltzmann samplers and generation of extended linear languages with shuffle
inferred← citeshttps://doi.org/10.48550/arxiv.1002.0046openalex-snapshot
Multi-dimensional Boltzmann Sampling of Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1112.5071openalex-snapshot
Random generation of combinatorial structures: Boltzmann samplers and beyond
inferred← citeshttps://doi.org/10.48550/arxiv.1304.1881openalex-snapshot
Analytic Samplers and the Combinatorial Rejection Method
inferred← citeshttps://doi.org/10.70675/2bd37edcz2b83z4cb5z97ebz3c7d221f9fa9openalex-snapshot
Efficient computation with structured matrices and arithmetic expressions
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.