From Algorithms to Working Programs On the Use of Program Checking in LEDA (1998)

Cached

Download Links

by Kurt Mehlhorn , Stefan Näher
Venue:IN PROC. INT. CONF. ON MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE (MFCS 98
Citations:8 - 2 self

Documents Related by Co-Citation

307 Designing Programs That Check Their Work – Manuel Blum, Sampath Kannan - 1989
643 LEDA: A Platform for Combinatorial and Geometric Computing – Kurt Mehlhorn, Stefan Näher, Christian Uhrig - 1999
18 Checking Mergeable Priority Queues – Jonathan Bright, Gregory Sullivan - 1994
307 Maximum Matching and a Polyhedron with (0,1) Vertices – J Edmonds - 1965
27 Checking Linked Data Structures – Nancy M. Amato , Michael C. Loui - 1994
15 Checking priority queues – Ulrich Finkler, Kurt Mehlhorn - 1999
39 P.: A linear time implementation of SPQR-trees – C Gutwenger, Mutzel - 1984
178 Dividing a graph into triconnected components – J E Hopcroft, R E Tarjan - 1973
31 Checking Geometric Programs or Verification of Geometric Structures – Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig - 1996
230 Efficient planarity testing – J E Hopcroft, R E Tarjan - 1974
16 LEDA — A Library of Efficient Data Types and Algorithms – S Naher - 1993
57 A platform for combinatorial and geometric computing – LEDA - 1999
23 On-line graph algorithms with SP QR-trees – G D Battista, R Tamassia - 1990
12 On Steinitz’s theorem concerning convex 3-polytopes and on some properties of 3-connected graphs – D W Barnette, B Grünbaum - 1969
18 Reducing edge connectivity to vertex connectivity – Z Galil, G F Italiano - 1991
25 Parallel Open Ear Decomposition with Applications to Graph Biconnectivity and Triconnectivity – Vijaya Ramachandran - 1992
3 A Time- and Cost-Optimal Algorithm for Interlocking Sets, with Applications – Stephan Olariu, Albert Y. Zomaya
6 The SPQR-tree data structure in graph drawing – P Mutzel - 2003
10 Certifying Algorithms – R. M. McConnell , K. Mehlhorn , S. Näher , P. Schweitzer - 2010