English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets

MPS-Authors
/persons/resource/persons45258

Ranjan,  Desh
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45612

Thiel,  Christian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Dubhashi, D. P., Ranjan, D., Mehlhorn, K., & Thiel, C. (1993). Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets. In R. K. Shyamasundar (Ed.), Foundations of Software Technology and Theoretical Computer Science (pp. 436-443). Berlin, Germany: Springer. doi:10.1007/3-540-57529-4_75.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-ADC8-C
Abstract
There is no abstract available