English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Beyond the Worst-Case Bisection Bound: Fast Ranking and Counting on Meshes

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.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Kaufmann, Michael1, Author           
Sibeyn, Jop F.2, Author
Suel, Torsten, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2Max Planck Society, ou_persistent13              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021995
 Publication Status: Issued
 Pages: -
 Publishing info: Berlin, Germany : Springer
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 517805
Other: Local-ID: C1256428004B93B8-9018F46C475D5161C125645A004BAFC0-Kaufmann-Sibeyn-Suel95
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Corfu, Greece
Start-/End Date: 1995-09-25 - 1995-09-27

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithms - ESA'95: 3rd Annual European Symposium
Source Genre: Proceedings
 Creator(s):
Spirakis, Paul1, Editor           
Affiliations:
1 Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019            
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 75 - 88 Identifier: -

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -