Technical Reports 1982
| Number | Title | Authors | Date | Download |
|---|---|---|---|---|
| TR-01 | The Design of CP-6 Pascal | Jim des Rivieres & Wilf R. LaLonde | June 1982 | TR-01.pdf |
| TR-02 | Single Production Elimination in LR(1) PARSERS: A Synthesis | Wilf R. LaLonde | June 1982 | TR-02.pdf |
| TR-03 | A Flexible Compiler Structure That Allows Dynamic Phase Ordering | Wilf R. LaLonde & Jim des Rivieres | June 1982 | TR-03.pdf |
| TR-04 | A Practical Longest Common Subsequence Algorithm for Text Collation | Jim des Rivieres | June 1982 | TR-04.pdf |
| TR-05 | A School Bus Routing and Scheduling Problem | Wolfgang Lindenberg & Frantisek Fiala | July 1982 | TR-05.pdf |
| TR-06 | Routing Without Routing Tables: Labelling and Implicit Routing in Networks | Nicola Santoro & Ramez Khatib | July 1982 | N/A |
| TR-07 | Concurrency Control in Large Computer Networks | Nicola Santoro & Jeffrey B. Sidney | July 1982 | N/A |
| TR-08 | Order Statistics on Distributed Sets | Nicola Santoro & Jeffrey B. Sidney | July 1982 | N/A |
| TR-09 | Oligarchical Control of Distributed Processing Systems | Moshe Krieger & Nicola Santoro | August 1982 | N/A |
| TR-10 | Communication Bounds for Selection in Distributed Sets | Nicola Santoro & Jeffrey B. Sidney | September 1982 | N/A |
| TR-11 | A Simple Technique for Converting from a Pascal Shop to a C Shop | Wilf R. LaLonde & John R. Pugh | November 1982 | N/A |
| TR-12 | Efficient Abstract Implementations for Relational Data Structures | Nicola Santoro | December 1982 | N/A |
| TR-13 | On The Message Complexity of Distributed Problems | Nicola Santoro | December 1982 | N/A |