403 | -- | 411 | Derek C. Oppen. Reasoning About Recursively Defined Data Structures |
412 | -- | 427 | Doris Altenkamp, Kurt Mehlhorn. Codes: Unequal Probabilities, Unequal Letter Cost |
428 | -- | 444 | Ronald L. Graham, Andrew Chi-Chih Yao, F. Frances Yao. Information Bounds Are Weak in the Shortest Distance Problem |
445 | -- | 456 | Yossi Shiloach. A Polynomial Solution to the Undirected Two Paths Problem |
457 | -- | 473 | Kishor S. Trivedi, Robert A. Wagner, Timothy M. Sigmon. Optimal Selection of CPU Speed, Device Capacities, and File Assignments |
474 | -- | 483 | Haim Mendelson, Uri Yechiali. A New Approach to the Analysis of Linear Probing Schemes |
484 | -- | 498 | Fred G. Abramson, Yuri Breitbart, Forbes D. Lewis. Complex Properties of Grammars |
499 | -- | 518 | Joost Engelfriet, Grzegorz Rozenberg. Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages |
519 | -- | 532 | Guy Fayolle, Isi Mitrani, R. Iasnogorodski. Sharing a Processor Among Many Job Classes |
533 | -- | 549 | Christos H. Papadimitriou, Paris C. Kanellakis. Flowshop scheduling with limited temporary storage |
550 | -- | 563 | Sartaj Sahni, Yookun Cho. Scheduling Independent Tasks with Due Times on a Uniform Processor System |
564 | -- | 579 | Carlo Ghezzi, Dino Mandrioli. Augmenting Parsers to Support Incrementality |
580 | -- | 597 | Ravi Sethi, Adrian Tang. Constructing Call-by-Value Continuation Semantics |