de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Beyond the Worst-Case Bisection Bound: Fast Ranking and Counting on Meshes

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44745

Kaufmann,  Michael
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Sibeyn,  Jop F.
Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Kaufmann, M., Sibeyn, J. F., & Suel, T. (1995). Beyond the Worst-Case Bisection Bound: Fast Ranking and Counting on Meshes. In P. Spirakis (Ed.), Algorithms - ESA'95: 3rd Annual European Symposium (pp. 75-88). Berlin, Germany: Springer.


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