|
1
|
Certifying Algorithms
– R. M. McConnell , K. Mehlhorn , S. Näher , P. Schweitzer
- 2010
|
|
2
|
The reliable algorithmic software challenge RASC : dedicated to Thomas Ottmann on the occassion of his 60th birthday
– Kurt Mehlhorn
- 2003
|
|
2
|
Checking and Certifying Computational Results
– Jonathan D. Bright
- 1994
|
|
|
Formal Correctness of Result Checking for Priority Queues
– Ruzica Piskac
- 2005
|
|
9
|
Checking the Integrity of Trees
– Jonathan D. Bright, Gregory F. Sullivan, Gerald M. Masson
- 1995
|
|
8
|
On-line Error Monitoring for Several Data Structures
– Jonathan Bright, Gregory F. Sullivan
- 1995
|
|
|
Black-Box Correctness Tests for Basic Parallel Data Structures ∗
– Phillip B. Gibbons, John L. Bruno, Steven Phillips
|
|
24
|
Checking Linked Data Structures
– Nancy M. Amato , Michael C. Loui
- 1994
|
|
43
|
Authenticated Data Structures for Graph and Geometric Searching
– Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos, Robert Cohen
- 2001
|
|
11
|
Indexing Information for Data Forensics
– Mikhail J. Atallah, Michael T. Goodrich, Roberto Tamassia
- 2005
|
|
17
|
Radial Level Planarity Testing and Embedding in Linear Time
– Christian Bachmaier, Franz J. Brandenburg, Michael Forster
- 2005
|
|
5
|
A Linear Time Algorithm For Finding Maximal Planar Subgraphs
– Wen-lian Hsu
- 1995
|
|
5
|
Planar Graphs with Topological Constraints
– Christoph Dornheim
- 2002
|
|
|
PQ Trees, PC Trees, and Planar Graphs
– Wen-Lian Hsu, Ross M. McConnell
- 2001
|
|
3
|
I/O-Efficient Planar Separators and Applications
– Norbert Zeh
- 2001
|
|
12
|
I/O-Efficient Algorithms for Shortest Path Related Problems
– Norbert Ralf Zeh
- 2002
|
|
|
Planarity Testing and Embedding
– Pier Francesco Cortese, Maurizio Patrignani
- 2004
|
|
1
|
An algorithm for embedding graphs in the torus
– Martin Juvan, Bojan Mohar
|
|
4
|
Elimination of local bridges
– Martin Juvan, Bojan Mohar
- 1997
|
