scientific article; zbMATH DE number 930345

MaRDI QIDQ4894115zbMATH OpenFDO

Authors Thomas Ottmann, Peter Widmayer

Publication date 1 October 1996

zbMATH Keywords

computational geometrydata structuresgraph algorithmshashingsearchingsortingtrees

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Data structures (68P05) Parallel algorithms in computer science (68W10)

Recommendations

• Algorithms and data structures
• Algorithms and data structures. Basics and probabilistic methods for design and analysis
• Algorithms and data structures. Basics and probabilistic methods for design and analysis
• scientific article; zbMATH DE number 2167065

Cited in

(5)

• A simplified correctness proof for a well-known algorithm computing strongly connected components.
• Algorithms and data structures
• scientific article; zbMATH DE number 53903 (Why is no real title available?)
• Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
• Guaranteed recursive non-linear state bounding using interval analysis

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4894115)