A Transformation System for Developing Recursive Programs (1977)

Cached

Download Links

by R. M. Burstall , John Darlington
Citations:570 - 3 self

Active Bibliography

6 Context-Moving Transformations for Function Verification – Jürgen Giesl - 1999
A System for Assisting Transformation – Martin S. Feather
Programming Languages – B. Wegbreit
5 Practical Program Verification by Forward Symbolic Execution: Correctness and Examples – Tudor Jebelean - 2008
Fast Exchange Sorts – Nachum Dershowitz, Hon-wai Leong
Divide-and-Conquer Recurrences Associated with Generalized Heaps, Optimal Merge, and Related Structures – Wei-mei Chen, Gen-Huey Chen - 2001
1 Comparator Networks for Binary Heap Construction – Gerth Stølting Brodal, M. Cristina Pinotti - 1998
5 Optimal in-place planar convex hull algorithms – Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Godfried Toussaint - 2002
1 Computational Biology – Rune B. Lyngsø, Rune B. Lyngs, Rune Bang Lyngs - 2000
7 Performance Engineering Case Study: Heap Construction – Jesper Bojesen, Jyrki Katajainen, Maz Spork - 1999
1 A New Data Structure for Heapsort with Improved Number of Comparisons (Extended Abstract) – Md. Shahjalal, M. Kaykobad
Potential-function-based Analysis of an off-line Heap Construction Algorithm – Alan Roberts, Antonios Symvonis - 2000
Implicit Heaps – unknown authors
Analysis of Modified Heap Sort Algorithm on Different Environment – Ana Sharma, Parvinder S. S, Satwinder Singh, Baljit Saini
8 The complexity of constructing evolutionary trees using experiments – Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Anna Östlin - 2001
1 Analysis of Sorting Algorithms by Kolmogorov Complexity -- A Survey – Paul Vitanyi - 2003
3 Interval Heaps – D. Wood, Vakgreep Informatica, Budapestlean Cd H, J. Van Leeuwen, J. Van Leeuwen - 1987
9 Enumerating Solutions to P(a) + Q(b) = R(c) + S(d) – Daniel J. Bernstein - 1999
Aarhus University – Claus Andersen, Gerth Stølting Brodal - 2008