On the public citation graph
Object grammars and random generation
0 signed · 26 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/978-3-319-44543-4openalex-snapshot
On Maximal Chain Subgraphs and Covers of Bipartite Graphs.
inferredcites →https://doi.org/10.1007/978-3-7091-6461-7_10openalex-snapshot
Computation and images in combinatorics
inferredcites →https://doi.org/10.1007/bfb0028829openalex-snapshot
Enumerative combinatorics and algebraic languages
inferredcites →https://doi.org/10.1016/0001-8708(76)90164-xopenalex-snapshot
Combinatorial algorithms
inferredcites →https://doi.org/10.1016/0001-8708(77)90059-7openalex-snapshot
A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
inferredcites →https://doi.org/10.1016/0304-3975(84)90116-6openalex-snapshot
Algebraic languages and polyominoes enumeration
inferredcites →https://doi.org/10.1016/0304-3975(92)90380-xopenalex-snapshot
Attribute grammars are useful for combinatorics
inferredcites →https://doi.org/10.1016/s0167-5060(08)70327-3openalex-snapshot
A Unified Setting for Selection Algorithms (II)
inferredcites →https://doi.org/10.1016/s0304-3975(02)00368-7openalex-snapshot
Object grammars and bijections
inferredcites →https://doi.org/10.1137/0212044openalex-snapshot
Uniform Random Generation of Strings in a Context-Free Language
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-0348-8405-1_10openalex-snapshot
Random generation of words of context-free languages according to the frequencies of letters
inferred← citeshttps://doi.org/10.1007/s00026-004-0202-xopenalex-snapshot
An Object Grammar for Column-Convex Polyominoes
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.037openalex-snapshot
From object grammars to ECO systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.08.011openalex-snapshot
On computing the coefficients of bivariate holonomic formal series
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.06.010openalex-snapshot
A framework for generating some discrete sets with disjoint components by using uniform distributions
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.1016/s0196-8858(02)00505-5openalex-snapshot
A clustering algorithm for huge trees
inferred← citeshttps://doi.org/10.1016/s0196-8858(02)00542-0openalex-snapshot
Attribute grammars and automatic complexity analysis
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00368-7openalex-snapshot
Object grammars and bijections
inferred← citeshttps://doi.org/10.1017/s0963548304006315openalex-snapshot
Boltzmann Samplers for the Random Generation of Combinatorial Structures
inferred← citeshttps://doi.org/10.37236/1305openalex-snapshot
Bijective Census and Random Generation of Eulerian Planar Maps with Prescribed Vertex Degrees
inferred← citeshttps://doi.org/10.37236/1813openalex-snapshot
On the Generation and Enumeration of some Classes of Convex Polyominoes
inferred← citeshttps://doi.org/10.70675/d1ed6f08z1af9z410bzb56bz9edd52f845dfopenalex-snapshot
Enumeration of polyominoes defined in terms of pattern avoidance or convexity constraints
inferred← citeshttps://doi.org/10.70675/faa4dde0z33baz4c03z93bdzf7d87ba7879eopenalex-snapshot
Gray codes and efficient exhaustive generation for several classes of restricted words
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.