References
- [Atkinson et al. 87] M. D. Atkinson, H. W. Chang. “Computing the Number of Mergings with Constraints.” Inform. Process. Lett. 24:5 (1987), 289–292.
- [Brightwell 99] G. Brightwell.“Balanced Pairs in Partial Orders.” Discrete Math. 201:1–3 (1999), 25–52.
- [Kislitsyn 68] S. S. Kislitsyn.“Finite Partially Ordered Sets and Their Associated Sets of Permutations.” Mat. Zametki 4:5 (1968), 511–518.
- [Linial 84] N. Linial.“The Information Theoretic Bound is Good for Merging.” SIAM J. Comput. 13:4 (1984), 795–801.
- [Loof et al. 06] K. De Loof, H. De Meyer, B. De Baets.“Exploiting the Lattice of Ideals Representation of a Poset.” Fund. Inform. 71:2–3 (2006), 309–321.
- [Peczarski 06a] M. Peczarski. “Komputerowo wspomagane badanie zbiorów częściowo uporządkowanych (Computer Assisted Research of Posets).” Ph.D. thesis, University of Warsaw, 2006.
- [Peczarski 06b] M. Peczarski.“The Gold Partition Conjecture.” Order 23:1 (2006), 89–95.
- [Peczarski 12] M. Peczarski.“Towards Optimal Sorting of 16 Elements.” Acta Univ. Sapientiae, Inform. 4:2 (2012), 215–224.
- [Saks 85] M. Saks.“Unsolved Problems: Balancing Linear Extensions of Ordered Sets.” Order 2:3 (1985), 327–330.
- [Peczarski 17] Source code available online (http://mimuw.edu.pl/∼marpe/research/src/wbp.zip), (2017).