Reconstruction of Partial Orders and List Representation as Random Structures
From MaRDI portal
Publication:4982079
DOI10.1016/j.entcs.2008.12.091zbMath1336.68027OpenAlexW2028628420MaRDI QIDQ4982079
Joseph Manning, Thierry Vallée
Publication date: 23 March 2015
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.091
Combinatorics of partially ordered sets (06A07) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Data structures (68P05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear extensions of infinite posets
- Counting linear extensions
- The number of linear extensions of the Boolean lattice
- The average number of linear extensions of a partial order
- An algorithm to generate all topological sorting arrangements
- The 3-Irreducible Partially Ordered Sets
This page was built for publication: Reconstruction of Partial Orders and List Representation as Random Structures