Increasing diamonds

DOI10.1007/978-3-662-49529-2_16MaRDI QIDQ2802941zbMATH OpenOpenAlexWikidataFDO

Authors Olivier Bodini, Matthieu Dien, Xavier Fontaine, Antoine Genitrini, Hsien-Kuei Hwang

Publication date 3 May 2016

Published in LATIN 2016: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-49529-2_16

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Random Generation of Directed Acyclic Graphs
• On bucket increasing trees, clustered increasing trees and increasing diamonds
• Beyond series-parallel concurrent systems: the case of arch processes
• scientific article; zbMATH DE number 1989998
• The Combinatorics of Non-determinism

Cited in

(12)

• More on weak diamond
• Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study
• Beyond series-parallel concurrent systems: the case of arch processes
• Quantitative and algorithmic aspects of barrier synchronization in concurrency
• Combinatorial analysis of growth models for series-parallel networks
• Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
• Tree evolution processes for bucket increasing trees
• Enumerating Diamond Cuts
• Detecting diamond necklaces in labeled dags (a problem from distributed debugging)
• Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
• On the histories of B-trees
• A bijection for the evolution of B-trees

This page was built for publication: Increasing diamonds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802941)