Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets. Dubhashi, D. P.; Mehlhorn, K.; Ranjan, D.; and Thiel, C. In Foundations of Software Technology and Theoretical Computer Science, 13th Conference, Bombay, India, December 15-17, 1993, Proceedings, pages 436-443, 1993.
Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets [link]Link  bibtex   
@inproceedings{ DBLP:conf/fsttcs/DubhashiMRT93,
  author    = {Devdatt P. Dubhashi and Kurt Mehlhorn and Desh Ranjan and Christian Thiel},
  title     = {Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets},
  booktitle   = {Foundations of Software Technology and Theoretical Computer Science, 13th Conference, Bombay, India, December 15-17, 1993, Proceedings},
  pages   = {436-443},
  ee   = {http://dx.doi.org/10.1007/3-540-57529-4_75} ,
  year   = {1993}
}
Downloads: 0