1. Probabilistic Possible Winner Determination
2. Graham R. Brightwell and Peter Winkler. 1991. Counting Linear Extensions is #P-Complete . In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 5--8 , 1991 , New Orleans, Louisiana, USA. 175--181. https://doi.org/10.1145/103418.103441 10.1145/103418.103441 Graham R. Brightwell and Peter Winkler. 1991. Counting Linear Extensions is #P-Complete. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 5--8, 1991, New Orleans, Louisiana, USA. 175--181. https://doi.org/10.1145/103418.103441
3. Average heights in partially ordered sets;Bruggemann Rainer;MATCH Commun Math Comput Chem,2014
4. Algorithmic Techniques for Necessary and Possible;Chakraborty Vishal;Winners. Trans. Data Sci.,2021
5. Approximation of average ranks in posets;Loof Karel De;Match Commun Math Comput Chem,2011