A combinatorial study of async/await processes
From MaRDI portal
Publication:6164473
DOI10.1007/978-3-031-17715-6_12MaRDI QIDQ6164473
Frédéric Peschanski, Matthieu Dien, Antoine Genitrini
Publication date: 28 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- Interval lengths for interval orders: A minimization problem
- Interval graphs and interval orders
- Exact counting of unlabeled rigid interval posets regarding or disregarding height
- Optimal monomial quadratization for ODE systems
- Counting linear extensions of restricted posets
- Fast perfect sampling from linear extensions
- Unfoldings: A partial-order approach to model checking.
- Uniform Generation in Trace Monoids
- Generating Linear Extensions Fast
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS