A probabilistic analysis of the height of tries and of the complexity of triesort Luc Devroye OriginalPaper Pages: 229 - 237
Using circular programs to eliminate multiple traversals of data R. S. Bird OriginalPaper Pages: 239 - 250
A logic covering undefinedness in program proofs H. BarringerJ. H. ChengC. B. Jones OriginalPaper Pages: 251 - 269
Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles Ralf Hartmut Güting OriginalPaper Pages: 271 - 291
The axiomatic semantics of programs based on Hoare's logic J. A. BergstraJ. V. Tucker OriginalPaper Pages: 293 - 320
