A combinatorial study of async/await processes

DOI10.1007/978-3-031-17715-6_12MaRDI QIDQ6164473zbMATH OpenFDO

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)

zbMATH Keywords

enumerative combinatoricsuniform random generationasync/await

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 7524075 (Why is no real title available?)
• scientific article; zbMATH DE number 7204953 (Why is no real title available?)
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• Analytic combinatorics
• Counting linear extensions of restricted posets
• ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
• Exact counting of unlabeled rigid interval posets regarding or disregarding height
• Fast perfect sampling from linear extensions
• Generating Linear Extensions Fast
• Interval graphs and interval orders
• Interval lengths for interval orders: A minimization problem
• Optimal monomial quadratization for ODE systems
• Unfoldings: A partial-order approach to model checking.
• Uniform generation in trace monoids

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)