A combinatorial study of async/await processes
From MaRDI portal
Publication:6164473
DOI10.1007/978-3-031-17715-6_12MaRDI QIDQ6164473FDOQ6164473
Authors: Matthieu Dien, Antoine Genitrini, Frédéric Peschanski 
Publication date: 28 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Cites Work
- Analytic combinatorics
- Interval graphs and interval orders
- Generating Linear Extensions Fast
- Unfoldings: A partial-order approach to model checking.
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- Fast perfect sampling from linear extensions
- Title not available (Why is that?)
- Uniform generation in trace monoids
- Interval lengths for interval orders: A minimization problem
- Exact counting of unlabeled rigid interval posets regarding or disregarding height
- Counting linear extensions of restricted posets
- Title not available (Why is that?)
- Optimal monomial quadratization for ODE systems
This page was built for publication: A combinatorial study of async/await processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164473)
