List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Every finite distributive lattice is a set of stable matchings for a small stable marriage instance Journal of Combinatorial Theory. Series A | 1987-01-01 | Paper |
| The Complexity of Counting Stable Marriages SIAM Journal on Computing | 1986-01-01 | Paper |
Research outcomes over time
This page was built for person: Paul Leather
