University of Washington, Department of Computer Science and Engineering records

University of Washington, Department of Computer Science and Engineering records, 1957-1988

Overview of the Collection

Creator

University of Washington. Research Computer Laboratory

Title

University of Washington, Department of Computer Science and Engineering records

Dates

1957-1988 (inclusive)

Quantity

23.94 cubic feet (21 boxes) plus 1 vertical file

Collection Number

UW Resource No. 00339

Summary

Technical reports and departmental memos at the Department of Computer Science and Engineering at the University of Washington, Seattle

Repository

University of Washington Libraries, Special Collections
Special Collections
University of Washington Libraries
Box 352900
Seattle, WA
98195-2900
Telephone: 2065431929
Fax: 2065431931
speccoll@uw.edu

Access Restrictions

Public records, but advance notice is required to allow for screening of materials protected from disclosure by law. Please contact Special Collections for more information.

Some records stored off-site; advance notice required for use.

Languages

English

Historical NoteReturn to Top

Computer Science & Engineering was established at the University of Washington as an inter-college graduate program in 1967. In 1975 an undergraduate program in Computer Science was added and departmental status in the College of Arts and Sciences was conferred. A second undergraduate program, in Computer Engineering, was added in 1989 when CSE moved to the College of Engineering. A Professional Master's Program was added in 1996, and a combined Bachelors/Masters program in 2008. In 2015 CSE had approximately 50 faculty, 75 technical and administrative staff members, 375 graduate students (200 in the full-time program and 175 in the Professional Masters Program, with typically twenty five Ph.D. degrees and thirty five Masters degrees awarded each year), and 700 undergraduate students (225 Bachelors graduates per year).

Content DescriptionReturn to Top

Technical reports and departmental memos.

Use of the CollectionReturn to Top

Restrictions on Use

Public Records (Use is unrestricted after access has been granted)

Administrative InformationReturn to Top

Arrangement

Organized into 3 accessions.

Accession No. 82-115, University of Washington, Research Computer Laboratory records, 1957-1962
Accession No. 16-002, University of Washington Computer Science and Engineering Department records, 1968- 1998
Accession No. 17-019, University of Washington Computer Science and Engineering Department records, circa 1960s-1980s

Preservation Note

Some records stored off-site; advance notice required for use.

Detailed Description of the CollectionReturn to Top

Accession No. 82-115: University of Washington, Research Computer Laboratory records, 1957-1962Return to Top

1 vertical file

Scope and Content: Departmental Memos, 1957-62; Report, 1957

Restrictions on Access: Public records, but advance notice is required to allow for screening of materials protected from disclosure by law. Please contact Special Collections for more information.

Restrictions on Use: Public Records (Use unrestricted when access is granted)

Acquisition Info: Archives holding area, 1982-06-01

Accession No. 16-002: University of Washington Computer Science and Engineering Department records, 1968- 1998Return to Top

22.8 cubic feet (20 boxes)

Scope and Content: Computer Science and Engineering Department technical reports

Restrictions on Access: Open to all users.

Restrictions on Use: Public Records (Use is unrestricted after access has been granted)

Acquisition Info: Sophie Ostlund, UW Computer Science and Engineering Department , 2014-03-19

Container(s)		Description	Dates
		UW CSE Technical Reports
Box	Accession
1	16-002	A Formal Deductive Problem-Solving System // The Fortran Deductive System; 68-01-01	1968-01
1	16-002	WRITEACOURSE: An Educational Programming Language; 68-01-02	1968-01
1	16-002	An Experience-Gathering Problem-Solving System; 68-01-03	1968-01
1	16-002	Experiments in Large Scale Computer Direct Access Storage Manipulation; 69-01-01	1969-01
1	16-002	Context-Sensitive Immediate Constituent Analysis: Context-Free Languages Revisited; 69-02-02	1969-02
1	16-002	On the Generative Power of Transformational Grammars; 69-02-03	1969-02
1	16-002	Lexical Ambiguity in Programming Language Implementations; 69-02-04	1969-02
1	16-002	Programming Language Descriptions; 69-03-05	1969-03
1	16-002	An Information Storage and Retrieval Capability; 69-04-06	1969-04
1	16-002	The WRITEACOURSE Language: Programming Manual (Revised Edition); 69-01-03	1969-01
1	16-002	A User's Guide to the Operation of an Information Storage and Retrieval System on the B5500 Computer; 70-01-03	1970-01
1	16-002	On Programs and Partial Recursive Functions; 70-09-02	1970-09
1	16-002	A Note on Representation of Operating Systems; 70-09-03	1970-09
1	16-002	APL\B5500: The Language and Its Implementations; 70-09-04	1970-09
1	16-002	Who are the Users? An analysis of Computer Use in a University Computer Center; 70-09-05	1970-09
1	16-002	A Syntax-Directed Approach to the Recognition and Description of Visual Images; 70-10-06	1970-10
1	16-002	The Shifted QR Algorithm for Hermitian Matrices; 70-11-07	1970-11
1	16-002	An Analysis of the Shifted LR Algorithm; 70-11-08	1970-11
1	16-002	A Heathkit Method for Building Data Management Programs; 70-12-09	1970-12
1	16-002	University of Washington APL/B5500 Manual; 71-01-10	1971-01
1	16-002	Some Formal Properties of the Syntax of Algol 68; 71-02-02	1971-02
1	16-002	A Petri Net Model of the CDC 6400; 71-04-03	1971-04
1	16-002	Measurements and Improvements of Programs Running Under a Paging System; 71-07-04	1971-07
1	16-002	SIM6000 Program Description and Use; 71-07-05	1971-07
1	16-002	Validation of a Trac-Driven CDC 6400 Simulation; 71-07-06	1971-07
1	16-002	A Formal Grammar for the Representation of Modes and Its Application to Algol 68; 71-10-07	1971-10
1	16-002	Eyeball Parameter Estimation with a Computer; 71-11-08	1971-11
1	16-002	A Code Synthesis "Filter" for Basic Block Optimization; 72-03-01	1972-03
1	16-002	Extensions of Linear Resolution and Paramodulation in Theorem Proving ; 72-03-02	1972-03
1	16-002	Evaluation Nets for Computing System Performance Evaluation; 72-04-03	1972-04
1	16-002	A Survey on Multiprocessing; 72-05-01	1972-05
1	16-002	A Computer Model of Learning Semantics of Language With a Teacher; 72-06-01	1972-06
1	16-002	Global Expression Optimization during Completion; 72-06-02	1972-06
1	16-002	Partial Recursive Computation; 72-07-01	1972-07
1	16-002	The Formulation and Application of Evaluation Nets; 72-07-02	1972-07
1	16-002	Dynamic Storage Allocation in a Paged Virtual Memory; 72-08-03	1972-08
2	16-002	A Multiprogramming Nucleus for Real and Virtual Computer Systems; 72-12-04	1972-12
2	16-002	Recognizing a Continuous Spoken Language Using Analytic Cepstrum Encoding; 72-12-05	1972-12
2	16-002	University of Washington XPL Compiler [OUT OF DATE]; 72-12-06	1972-12
2	16-002	Some Evaluation Net Macro Structures; 73-01-07	1973-01
2	16-002	Multiprogramming and Multiprocessing System Description; 73-01-08	1973-01
2	16-002	Refinement Capabilities and Extensions for use with the Resolution Principle; 73-09-01	1973-09
2	16-002	Hammiltonian Circuits on Simple 3-Polytopes ; 73-01-10	1973-01
2	16-002	On Program Placement in a Directly Executable Hierarchy of Memories; 73-01-11	1973-01
2	16-002	Design for a Stack-Collapsing Micro-Processor for an "Intelligent" Multiplexer; 73-02-12	1973-02
2	16-002	Subrecursive Reducibilities; 73-03-13	1973-03
2	16-002	On the Efficiency of Extensible Languages; 73-06-15	1973-06
2	16-002	Sibyl: A Formally Defined Interactive Programming System Containing an Extensible Block-Structured Language; 73-06-16	1973-06
2	16-002	Strategies for Theorem Proving and Applications in a Parallel Environment ; 73-07-01	1973-07
2	16-002	A Multiprogramming Nucleus with Dynamic Resource Facilities; 73-11-15	1973-11
2	16-002	High-Level Language Cooperative Processing in a Network Environment ; 73-11-16	1973-11
2	16-002	XPL/S: A Systems Implementation Language for the Xerox Sigma Computers ; 74-02-12	1974-02
2	16-002	Elaboration: A System for Varying Program and Data Structures and Its Application to the Dimensional Expansion of Arrays; 74-03-17	1974-03
2	16-002	Interactive Picture Generation and Manipulation Through Formal Descriptions; 74-05-22	1974-05
2	16-002	XPLG - Experiences in Implementing an Experimental Interactive Graphics Programming System; 74-06-08	1974-06
2	16-002	Why a Separate Computer Facility for Computer Science Education? Experiences at the UW Computer Science Teaching Laboratory; 74-06-11	1974-06
2	16-002	COPS - A Mechanism for Computer Protection; 74-06-23	1974-06
2	16-002	COPS - A Protection Mechanism for Computer Systems; 74-07-12	1974-07
2	16-002	An Interactive Graphic Programming Language with Application to Text and Picture Formatting; 74-07-29	1974-07
2	16-002	The Design of an Interactive Graphical Net Editor; 74-07-03	1974-07
2	16-002	Develop your Computer Performance Pattern; 74-09-31	1974-09
2	16-002	Representation of Concurrent Processes; 75-01-32	1975-01
2	16-002	Pro-Nets: For Modeling Processes and Processors; 75-07-15	1975-07
2	16-002	A Comparison of Tree Balancing Algorithms; 75-08-08	1975-08
2	16-002	A Petri Net Model of a Modular, Microprogrammable Computer (LM2); 75-09-01	1975-09
2	16-002	C2: A "Super-Complier" Approach to Automatic Programming; 76-01-01	1976-01
2	16-002	Concatenating Transformations in Hierarchic Graphics; 76-02-02	1976-02
2	16-002	Compilation in Distributed Function Systems; 76-02-03	1976-02
3	16-002	Analysis and Simulation of Graph Models; 76-03-04	1976-03
3	16-002	A Language for Formal Problem Specifications; 76-04-05	1976-04
3	16-002	A Path Notion for Describing Software; 76-04-06	1976-04
3	16-002	[n/a]; 76-08-07	1976-08
3	16-002	On the Efficiency of Some List Marking Algorithms; 76-8-08	1976-8
3	16-002	Making Infinite Structures Appear Finite in First Order Logic; 76-10-09	1976-10
3	16-002	Design Directed Program Synthesis; 77-02-01	1977-02
3	16-002	Propositional Modal Logic of Programs (extended abstract); 77-02-02	1977-02
3	16-002	Economical Solutions for the Critical Section Problem in a Distributed System; 77-02-03	1977-02
3	16-002	Abstraction Levels with Pro Nets: an Algorithm and Examples; 77-03-01	1977-03
3	16-002	Parallel Prefix Computation; 77-03-02	1977-03
3	16-002	Straight-Line Programs to Compute Finite Languages; 77-06-01	1977-06
3	16-002	On the Minimization of the Width of the Control Memory of Microprogrammed Processors; 77-08-01	1977-08
3	16-002	Programming by Abstract Demonstration (extended abstract); 77-08-02	1977-08
3	16-002	Test-Free Propositional Dynamic Logic is Strictly Weaker than PDL; 77-10-02	1977-10
3	16-002	Software Descriptions with Flow Expressions; 77-10-03	1977-10
3	16-002	Design of a Single Language Multiprogramming System; 77-10-04	1977-10
3	16-002	The Design of a Metasystem for Image Analysis; 77-10-05	1977-10
3	16-002	Image Transmission with Gross Information First; 77-10-06	1977-10
3	16-002	Graphical Transformations and Hierarchic Picture Structures; 77-12-01	1977-12
3	16-002	CGOL User Manual; 77-12-02	1977-12
3	16-002	Progress Report on Vissys: Software Support for Computer Vision; 78-01-01	1978-01
3	16-002	A Comparison of Query Costs in AVL and 2-3 Trees; 78-02-01	1978-02
3	16-002	An Upper Bound on the Size of Formulae for Symmetric Boolean Functions; 78-03-01	1978-03
3	16-002	Programming by Abstract Demonstration; 78-03-02	1978-03
3	16-002	Quark: A Performance Evaluation Package for an Operating Systems Course ; 78-04-01	1978-04
3	16-002	Approximating Response Time Distributions in Queuing Networks; 78-04-02	1978-04
3	16-002	O(Log N) Insertion and Deletion in One-Sided Height-Balanced Trees; 78-04-03	1978-04
3	16-002	A Hybrid Paradigm for Computer Programming and Its Investigation in the Context of Electronic Circuit Simulation by Means of an Extensible Language; 78-05-02	1978-05
3	16-002	CGOLG: An Extension of CGOL for Manipulating Directed Graphs; 78-06-01	1978-06
3	16-002	Stylization as a Means of Compacting Pictoral Databases; 78-07-01	1978-07
3	16-002	Reflections on a Graphics Language and Its Implementation; 78-07-02	1978-07
3	16-002	On the Complexity of 2-Output Boolean Networks; 78-08-01	1978-08
3	16-002	Applications of Boolean Variables to Automata Theory and Dynamic Logic (extended abstract); 78-08-02	1978-08
3	16-002	Shared Data Requirements for Implementation of Mutual Exclusion Using a Test-and-Set Primitive; 78-08-03	1978-08
3	16-002	Selecting Parameter Values for Servers of the Phase Type; 78-08-04	1978-08
3	16-002	Concurrent Search and Insertion in 2-3 Trees; 78-05-01	1978-05
3	16-002	Expressiveness Hierarchy for PDL With Rich Tests; 78-11-01	1978-11
3	16-002	Ambiguity and LR Parsing; 78-11-02	1978-11
3	16-002	Notes on Tuning VAX/VMS; 78-12-01	1978-12
3	16-002	A Time-Space Tradeoff for Sorting on Non-Oblivious Machines; 79-01-01	1979-01
3	16-002	The Complexity of Problems in Systems of Communicating Sequential Processes; 79-03-01	1979-03
3	16-002	Tree-Size Bounded Alternation (extended abstract); 79-03-02	1979-03
3	16-002	The Benchmarking, Tuning and Analytic Modelling of VAX/VMS; 79-04-01	1979-04
3	16-002	On the Complexity of General Context-Free Language Parsing and Recognition; 79-04-02	1979-04
3	16-002	Effective Solution of General Queuing Networks Via Decomposability; 79-04-03	1979-04
3	16-002	A Compiler Design for Multiple Independent Processor Computers; 79-04-04	1979-04
3	16-002	The Behavior of Ethernet-Like Computer Communications Networks; 79-05-01	1979-05
3	16-002	Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable; 79-05-02	1979-05
3	16-002	On Describing the Behavior and Implementation of Distributed Systems; 79-06-01	1979-06
3	16-002	The Application of Formal Models to a Fully Adaptive General Purpose Digital Data Compression System; 79-06-04	1979-06
3	16-002	Shuffle Languages, Petri Nets, and Context-Sensitive Grammars; 79-06-05	1979-06
3	16-002	Modal Logic of Concurrent Nondeterministic Programs; 79-06-06	1979-06
3	16-002	Two Familiar Transitive Closure Algorithms which Admit No Polynomial Time, Sublinear Space Implementations; 79-06-07	1979-06
3	16-002	Data Structures for Efficient Implementation of Sticky Pointers in Text Editors (extended abstract); 79-06-08	1979-06
4	16-002	The Design and Evaluation of Algorithms for Parallel Processing ; 79-07-01	1979-07
4	16-002	System Diagnosis with Repair; 79-07-02	1979-07
4	16-002	Generalized Iterative Arrays (extended abstract); 79-07-03	1979-07
4	16-002	The Complexity of the Inequivalence Problem for Regular Expressions with Intersection; 79-07-04	1979-07
4	16-002	Syntactic and Semantic Structure in Propositional Dynamic Logic; 79-07-05	1979-07
4	16-002	Oct-Trees and Their Use in Representing Three Dimensional Objects; 79-07-06	1979-07
4	16-002	Image Data Structures ; 79-07-07	1979-07
4	16-002	On Uniform Circuit Complexity; 79-08-01	1979-08
4	16-002	Resource Allocation with Immunity to Limited Process Failure (preliminary report); 79-09-01	1979-09
4	16-002	Near-Complete Decomposability of Queueing Networks with Clusters of Strongly Interactive Servers; 79-10-01	1979-10
4	16-002	Sequential Control Structure Abstractions for Programming Languages; 79-10-02	1979-10
4	16-002	Finding Lowest Common Ancestors in Trees; 79-10-03	1979-10
4	16-002	Research in Integrated Distributed Computing; 79-10-04	1979-10
4	16-002	An Improvement on the Extension of Savitch's Theorem to Small Space Bounds; 79-12-02	1979-12
4	16-002	Shape Measures for Polygons Based Upon the Distributions of Angles, Slopes and Lengths of Sides; 80-01-01	1980-01
4	16-002	The CSL Switch: A Microcomputer-Controlled Multicomputer Front-End; 80-01-02	1980-01
4	16-002	Color-Mapping Techniques for Computer-Aided Design and Verification of VLSI Systems; 80-02-01	1980-02
4	16-002	An Optimal Solution to a Wire-Routing Problem; 80-03-01	1980-03
4	16-002	Optimal Tree Layout (preliminary version); 80-03-02	1980-03
4	16-002	Design and Evaluation of Distributed Communication Primitives; 80-04-01	1980-04
4	16-002	A Model for Document Preparation Systems; 80-04-02	1980-04
4	16-002	The Method of Surrogate Delays: Simultaneous Resource Possession in Analytic Models of Computer Systems; 80-04-03	1980-04
4	16-002	Formal Specification of Graphical Data Types; 80-04-04	1980-04
4	16-002	Qualitative Matrices: Strong Sign-Solvability and Weak Satisfiability; 80-05-01	1980-05
4	16-002	The Complexity of Packaging and Covering in the Plane and Related Intersection Graph Problems; 80-05-02	1980-05
4	16-002	Template Matching in Pyramids; 80-05-03	1980-05
4	16-002	A Method for Detecting Structure in Polygons; 80-06-01	1980-06
4	16-002	An Implementation of Probabilistic Algorithms in Finite Fields; 80-06-02	1980-06
4	16-002	Link Binding Grammars: Their Motivation and Generative Power; 80-06-03	1980-06
4	16-002	Decidability and Expressiveness of Logics of Processes (Ph.D. Thesis); 80-08-01	1980-08
4	16-002	Boolean Variables in Regular Expressions and Finite Automata; 80-08-02	1980-08
4	16-002	Optimal Resource Placement in a Distributed System (extended abstract); 80-08-03	1980-08
4	16-002	Techniques to Exploit Parallelism; 80-09-01	1980-09
4	16-002	On Developing a Theory of Distributed Computing: Summary of Current Research ; 80-09-03	1980-09
4	16-002	Eden Project Proposal // Research in Integrated Distributed Computing; 80-10-01	1980-10
4	16-002	Document Formatting Systems: Survey, Concepts and Issues (extended abstract); 80-10-02	1980-10
4	16-002	Binary Search in a Multiprocessing Environment; 80-11-01	1980-11
4	16-002	Systolic Cellular Logic: Inexpensive Parallel Image Processors; 80-11-02	1980-11
4	16-002	NETED with Graphical I/O; 81-01-01	1981-01
4	16-002	Observations on the Development of an Information Interchange Standard for Arabic and the Arabic Script Languages; 81-01-02	1981-01
4	16-002	Optimal Placement of Identical Resources in a Distributed Network; 81-01-03	1981-01
4	16-002	Balanced Job Bound Analysis of Queueing Networks; 81-01-04	1981-01
4	16-002	The Solution of Separable Queueing Network Models Using Mean Value Analysis; 81-01-05	1981-01
4	16-002	ADA And Distributed Systems; 81-01-06	1981-01
4	16-002	Towards Hierarchical Cellular Logic: Design Considerations for Pyramid Machines; 81-02-01	1981-02
4	16-002	A Difference in Efficiency Between Synchronous and Asynchronous Systems; 81-03-01	1981-03
4	16-002	Bounds on Minimax Edge Length for Complete Binary Trees; 81-03-02	1981-03
4	16-002	Prospects for the Automatic Organization of Pictoral and Geometrical Information; 81-03-03	1981-03
4	16-002	The Architecture of the Eden System; 81-04-01	1981-04
4	16-002	Using Matching in Algebraic Equation Solving; 81-05-01	1981-05
4	16-002	Global States of a Distributed System; 81-05-02	1981-05
4	16-002	Embedded Subalphabets in the Theories of Languages and Semigroups; 81-05-03	1981-05
4	16-002	Natural Language Analysis within the Link Tree Framework; 81-05-04	1981-05
4	16-002	Analyzing Queueing Networks with Simultaneous Resource Possession; 81-07-01	1981-07
4	16-002	The Design of an Instruction Set for a Pyramid Cellular Logic Image Processor; 81-07-02	1981-07
4	16-002	A Composition Approach to Modelling High Service Time Variability; 81-07-04	1981-07
4	16-002	Lithe: A Language Combining a Flexible Syntax and Classes; 81-07-05	1981-07
4	16-002	The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem; 81-08-01	1981-08
4	16-002	Some Design and Analysis Problems for Parallel Processing; 81-08-03	1981-08
4	16-002	A Type Declaration and Inference System for Smalltalk; 81-08-02	1981-08
4	16-002	Cache Structures Based on the Execution Stack for High Level Languages; 81-08-04	1981-08
4	16-002	Efficient Parallel Algorithms for Linear Recurrence Computation; 81-08-05	1981-08
4	16-002	Formal Specification of Interactive Graphics Programming Languages; 81-09-01	1981-09
4	16-002	Document Formatting Systems: Survey, Concepts and Issues ; 81-10-01	1981-10
4	16-002	Editing as a Paradigm for User Interaction: A Thesis Proposal; 81-11-01	1981-11
4	16-002	A Comparative Study of Capability-Based Computer Architectures; 81-12-01	1981-12
4	16-002	Concurrency Control in a Dynamic Search Structure; 82-01-01	1982-01
4	16-002	Exceptional handling: The Case Against ; 82-01-02	1982-01
5	16-002	Inductive Analysis of Plane Figures; 82-02-01	1982-02
5	16-002	Quad-Trees, Oct-Trees and K-Trees: A Generalized Approach to Recursive Decomposition of Euclidean Space; 82-02-02	1982-02
5	16-002	Multiple Class Memory Constrained Queueing Networks; 82-02-03	1982-02
5	16-002	Space-Bounded Hierarchies and Probabilistic Computations; 82-02-04	1982-02
5	16-002	An Introduction to the Eden Transactional File System; 82-02-05	1982-02
5	16-002	Probabilistic, Nondeterministic, and Alternating Decision Trees; 82-03-01	1982-03
5	16-002	On Computing Weak Transitive Closure in O (Log N) Expected Random Parallel Time; 82-03-02	1982-03
5	16-002	Programs Made of Pictures: Interactive Graphics Makes Programming Easy; 82-03-03	1982-03
5	16-002	Two Pyramid Machine Algorithms for Edge Detection in Noisy Binary Images; 82-03-04	1982-03
5	16-002	ESP: A Director Access Editor; 82-04-01	1982-04
5	16-002	On the Time Complexibility of Broadcast Communication Schemes; 82-04-02	1982-04
5	16-002	Signsolvability Revisited; 82-04-04	1982-04
5	16-002	Analysis of Queueing Networks Using Decomposition; 82-05-01	1982-05
5	16-002	Transactions on Objects of Arbitrary Type; 82-05-02	1982-05
5	16-002	The Distribution of Network States During Residence Times in Product Form Queueing Networks; 82-05-03	1982-05
5	16-002	Analysis of Queueing Networks Using Decomposition; 82-05-04	1982-05
5	16-002	A Kernel for Distributed and Shared Memory Communication; 82-06-01	1982-06
5	16-002	Multiple Inheritance in Smalltalk-80; 82-06-02	1982-06
5	16-002	Robust Balancing in B-Trees; 82-08-01	1982-08
5	16-002	Sorting, Histogramming, and Other Statistical Operations on a Pyramid Machine; 82-08-02	1982-08
5	16-002	Whither a Taxonomy of Computer Systems; 82-01-01	1982-01
5	16-002	Northwest VLSI Consortium Semi-Annual Technical Report No. 1; 82-11-01	1982-11
5	16-002	A Reduction Technique for Evaluating Queueing Networks with Serialization Delays; 82-11-02	1982-11
5	16-002	A Comparison of Four Object-Oriented Systems; 82-11-03	1982-11
5	16-002	Algebraic Specification and Prolog; 82-12-02	1982-12
5	16-002	A Language Combining a Flexible Syntax with Classes; 82-12-03	1982-12
5	16-002	A Large Font Virtual Terminal Interface - A Software Prosthesis for the Visually Impaired ; 83-01-01	1983-01
5	16-002	Integration and Distribution in the Eden System; 83-01-02	1983-01
5	16-002	The Evolution of the Eden Invocation Mechanism ; 83-01-03	1983-01
5	16-002	Algorithms for Median Filtering of Images on a Pyramid Machine; 83-01-04	1983-01
5	16-002	A Lower Bound on the Time Needed to Resolve Conflicts Deterministically in Multiple Access Channels; 83-01-05	1983-01
5	16-002	A Pyramidal Approach to Parallel Processing ; 83-01-06	1983-01
5	16-002	Workload Representations in Queueing Models of Computer Systems; 83-03-01	1983-03
5	16-002	Speedups of Deterministic Machines by Synchronous Parallel Machines; 83-02-02	1983-02
5	16-002	Finding the Convex Hull Facet by Facet ; 83-04-01	1983-04
5	16-002	Axiomatic Verification of Concurrent Programs; 83-04-02	1983-04
5	16-002	Northwest VLSI Consortium Semi-Annual Technical Report No. 2; 83-04-03	1983-04
5	16-002	A Net-Based Uniform Approach for Sequential and Concurrent Control Abstractions; 83-04-08	1983-04
5	16-002	Alternation Bounded Auxiliary Pushdown Automata; 83-05-01	1983-05
5	16-002	Edmas: A Locally Distributed Mail System; 83-07-01	1983-07
5	16-002	An Asymmetric Stream Communication System; 83-07-02	1983-07
5	16-002	Efficient Algorithms for Reporting Intersections ; 83-07-03	1983-07
5	16-002	Efficient Algorithms for Multiple Access Channels; 83-08-01	1983-08
5	16-002	[n/a]; 83-08-02	1983-08
5	16-002	Probabilistic Factoring Algorithms Can Be Made Errorless; 83-09-01	1983-09
5	16-002	The Structure of Abstract Document Objects; 83-09-02	1983-09
5	16-002	Reductions Amoung Polynomial Isomorphism Types; 83-09-03	1983-09
5	16-002	A Survey of Some Recent Results on Computational Complexity in Weak Theories of Arithmetic ; 83-10-01	1983-10
5	16-002	The Impact of Computing Technology on Human Perception of Time; 83-10-02	1983-10
5	16-002	Godel Theorems, Exponential Difficulty and Undecidability of Arithmetic Theories: An Exposition; 83-10-03	1983-10
5	16-002	A Remark on Witness Functions for Non-Polynomial and Non-Complete Sets in NP; 83-10-04	1983-10
5	16-002	The Eden System: A Technical Review ; 83-10-05	1983-10
5	16-002	A Hierarchical Cellular Logic; 83-10-06	1983-10
5	16-002	An Economical Solution to the Cache Coherence Problem ; 83-10-07	1983-10
5	16-002	Constraining-Unification and the Programming Language Unicorn; 83-11-01	1983-11
5	16-002	Northwest VLSI Consortium Semi-Annual Technical Report No. 3; 83-11-02	1983-11
5	16-002	Networks for Deaf-Blind People; 83-12-01	1983-12
5	16-002	VCI2LGP: An Output Translator for TEX Output ; 83-12-02	1983-12
5	16-002	A Protocol for Optimistic Transactions on Abstract Data Types ; 83-12-04	1983-12
5	16-002	Biased B-Trees; 83-12-05	1983-12
5	16-002	Specification of Human-Machine Interfaces: Some Problems, Tools and Approaches ; 84-01-01	1984-01
5	16-002	Incorporating Load Dependent Servers in Approximate Mean Value Analysis ; 84-02-01	1984-02
5	16-002	Effective Operators in a Topological Setting ; 84-03-01	1984-03
5	16-002	Approximate Solution Techniques for Queueing Networks with Simultaneous Resource Possession; 84-03-02	1984-03
5	16-002	Parallel Programming and the Poker Programming Environment; 84-04-02	1984-04
5	16-002	Solitaire Automata; 84-04-03	1984-04
5	16-002	The Evolution of Computer Architecture ; 84-04-04	1984-04
5	16-002	On the I/O Performance of Multi-Way Mergesort and Tag Sort; 84-04-05	1984-04
5	16-002	Formal Specification of User Interfaces: A Comparison and Evaluation of Four Axiomatic Approaches ; 84-05-01	1984-05
5	16-002	Reductions Amoung Number Theoretic Problems ; 84-05-02	1984-05
6	16-002	File Access Performance of Diskless Work Stations ; 84-06-01	1984-06
6	16-002	Netlist/Presim/RNL V4.2 (UW) Tutorial; 84-07-01	1984-07
6	16-002	Decreasing the Nesting Depth of Expressions Involving Square Roots; 84-07-02	1984-07
6	16-002	A Structure Editor and Model for Abstract Document Objects; 84-07-04	1984-07
6	16-002	A Prototype Electronic Encyclopedia ; 84-08-01	1984-08
6	16-002	The Analysis of a Simple Distributed Resource Finding Protocol; 84-08-02	1984-08
6	16-002	Edmas: An Object-Oriented, Locally Distributed Mail System; 84-08-03	1984-08
6	16-002	Propagation and Its Variations in Pyramidal Arrays ; 84-09-01	1984-09
6	16-002	Estimating the Multiplicities of Conflicts in Multiple Access Channels ; 84-09-02	1984-09
6	16-002	Dynamic Load Sharing on Homogenous Distributed Systems ; 84-10-01	1984-10
6	16-002	Data Structures and Languages in Support of Parallel Image Processing for Astronomy; 84-11-01	1984-11
6	16-002	Heterogeneous Microregister Allocation in Tuning Microprogrammable Machines; 84-12-01	1984-12
6	16-002	PICT: Experiments in the Design of Interactive, Graphical Programming Environments ; 85-01-01	1985-01
6	16-002	Efficient Algorithms for Computing Geometric Intersections ; 85-01-02	1985-01
6	16-002	Parallel Tag-Distribution Sort; 85-01-03	1985-01
6	16-002	The Parallel Complexity of Exponentiating Polynomials over Finite Fields ; 85-03-01	1985-03
6	16-002	Supporting Distributed Applications: Experience with Eden; 85-03-02	1985-03
6	16-002	An Annotated Bibliography on Computer Reliability and Nuclear War; 85-03-03	1985-03
6	16-002	A Comparison of Receiver-Initiated and Sender-Initiated Dynamic Load Sharing ; 85-04-01	1985-04
6	16-002	Regeneration of Replicated Objects: A Technique for Increased Availability; 85-04-02	1985-04
6	16-002	A Classification of Distributed Operating Systems ; 85-05-01	1985-05
6	16-002	The Eden Shared Calendar System ; 85-05-02	1985-05
6	16-002	Implementing Ada Exceptions ; 85-06-01	1985-06
6	16-002	Virtually Addressed Caches for Multiprogramming and Multiprocessing Environments; 85-06-02	1985-06
6	16-002	An Inquiry into the Benefits of Multigauge Parallel Computation; 85-06-03	1985-06
6	16-002	An Architecture for Real-Time Software Systems ; 85-06-04	1985-06
6	16-002	An Ada Runtime System Interface ; 85-06-05	1985-06
6	16-002	A Three-Dimensional Graphical Paradigm for Representing Programs ; 85-07-01	1985-07
6	16-002	A Model and Notation for Specifying User Interfaces ; 85-07-02	1985-07
6	16-002	VLSI Design Tools: Reference Manual ; 85-07-03	1985-07
6	16-002	The Quarter Horse: A Case Study in Rapid Prototyping of a 32-bit Microprocessor Chip; 85-07-04	1985-07
6	16-002	Designing Iconic Programming Systems: Representation and Learnability; 85-07-05	1985-07
6	16-002	Proving Monitor Proof Rules ; 85-08-01	1985-08
6	16-002	Reasoning about Interactive Systems ; 85-08-02	1985-08
6	16-002	Tensor Rank and the Computational Complexity of Straight Line Programs ; 85-08-03	1985-08
6	16-002	A Simple Algorithm for Automated Braille Translation; 85-08-04	1985-08
6	16-002	Distribution and Abstract Types in Emerald ; 85-08-05	1985-08
6	16-002	Replication in Distributed Systems: The Eden Experience ; 85-08-06	1985-08
6	16-002	User Interface Components based on a Multiple Window Package; 85-08-07	1985-08
6	16-002	A User Interface Design for Deaf-Blind Users (preliminary report); 85-08-09	1985-08
6	16-002	Editing as a Paradigm for User Interaction ; 85-08-10	1985-08
6	16-002	Architectural Issues for Intermediate-Level Vision; 85-08-11	1985-08
7	16-002	The Eden Programming Language ; 85-09-01	1985-09
7	16-002	Playing Poker: A Full Programming Example Using the Poker Environment ; 85-09-02	1985-09
7	16-002	Poker 3.1: A Programmer's Reference Guide; 85-09-03	1985-09
7	16-002	Constraints and Functional Programming ; 85-09-05	1985-09
7	16-002	Defining Constraints Graphically ; 85-09-06	1985-09
7	16-002	Computer System Reliability and Nuclear War ; 85-10-01	1985-10
7	16-002	The PyramidCalc System for Research in Pyramid Machine Algorithms ; 85-10-02	1985-10
7	16-002	UW/NW VLSI Consortium Semiannual Technical Report No. 1; 85-10-03	1985-10
7	16-002	An Approach to Accommodating Heterogeneity; 85-10-04	1985-10
7	16-002	An Evaluation of Cache Coherence Solutions in Shared-Bus Multiprocessors; 85-10-05	1985-10
7	16-002	A Dual-Purpose Module Interconnection Language; 85-10-06	1985-10
7	16-002	STEREO: A New System for Improving Accuracy of Radiation Therapy Planning ; 85-11-01	1985-11
7	16-002	A Non-Systolic Matrix Product Algorithm ; 85-11-02	1985-11
7	16-002	PLAY: An Iconic Programming System for Children; 85-11-03	1985-11
7	16-002	Decentralized Object Finding Using Forwarding Addresses; 85-12-01	1985-12
7	16-002	Automated Generation of Microcontrollers; 85-12-02	1985-12
7	16-002	Nested Transactions for General Objects: The Eden Implementation ; 85-12-03	1985-12
7	16-002	Replects: Data Replication in the Eden System; 85-12-04	1985-12
7	16-002	Research in Real-Time Systems ; 85-12-05	1985-12
7	16-002	External Sorting: I/O Analysis and Parallel Processing Techniques ; 86-01-01	1986-01
7	16-002	Animated Graphical Interfaces using Temporal Constraints ; 86-01-02	1986-01
7	16-002	Report on the ACM SIGOPS Work on Accommodating Heterogeneity; 86-02-01	1986-02
7	16-002	Programming Environments for Systolic Arrays ; 86-02-02	1986-02
7	16-002	1985-1986 Research Review ; 86-02-03	1986-02
7	16-002	Distribution and Abstract Types in Emerald ; 86-02-04	1986-02
7	16-002	Concurrent Programming and Slice-Based Scheduling ; 86-02-05	1986-02
7	16-002	Poker on the Cosmic Cube: The First Retargetable Parallel Programming Language and Environment ; 86-02-06	1986-02
7	16-002	Computer System Performance Evaluation Using Queueing Network Models ; 86-02-07	1986-02
7	16-002	Using Conditional Information in Queueing Models: Analysis of the IMS Scheduler; 86-02-08	1986-02
7	16-002	Bright-Spot Detection in Pyramids; 86-03-01	1986-03
7	16-002	Programming Solutions to the Algorithm Contraction Problem; 86-03-02	1986-03
7	16-002	A Pyramid Machine Simulator for the Symbolics 3600; 86-03-03	1986-03
7	16-002	Type Architectures, Shared Memory and the Corollary of the Modest Potential ; 86-03-04	1986-03
7	16-002	A Structure Editor for Documents, Programs, and Other Structured Data; 86-04-01	1986-04
7	16-002	A Hierarchical Cellular Logic for Byte-Pyramids; 86-04-02	1986-04
7	16-002	Object Structure in the Emerald System ; 86-04-03	1986-04
7	16-002	Imbalance between Growth and Funding in Academic Computer Science: Two Trends Colliding ; 86-04-05	1986-04
7	16-002	Probabilistic Game Automata; 86-05-01	1986-05
7	16-002	Notes on Boolean Circuit Complexity ; 86-05-02	1986-05
7	16-002	Using Flow Expressions to Specify Timing Constraints in Concurrent Programs ; 86-05-03	1986-05
7	16-002	An Investigation into the Design Costs of a Single Chip Multigauge Machine; 86-06-01	1986-06
7	16-002	High Performance Cache Coherence Protocols for Shared-Bus Multiprocessors; 86-06-02	1986-06
7	16-002	Declarative Descriptions for VLSI Generators ; 86-06-03	1986-06
7	16-002	Modelling Architectural Features with Petri Nets; 86-06-04	1986-06
7	16-002	Effectiveness of Replication in Distributed Computer Networks ; 86-06-05	1986-06
7	16-002	Coordinate Free LAP; 86-07-01	1986-07
7	16-002	MOS Circuit Models in Network C; 86-07-02	1986-07
7	16-002	File Sessions: A Technique and its Applications in the UNIX File System; 86-07-03	1986-07
7	16-002	An Investigation of Multiple Inheritance in the Smalltalk-80 Programming Language ; 86-07-04	1986-07
7	16-002	An Improved Ada Runtime System Interface ; 86-07-05	1986-07
7	16-002	An Architectural Analysis of Branch Instructions ; 86-07-06	1986-07
7	16-002	Speedup Versus Efficiency in Parallel Systems ; 86-08-01	1986-08
7	16-002	Replication and Nested Transactions in the Eden Distributed System; 86-08-02	1986-08
7	16-002	The Use of Approximations in Production Performance Evaluation Software ; 86-08-03	1986-08
7	16-002	The Use of Temporal Coherence in Computer Animation; 86-08-04	1986-08
7	16-002	Characterizations of Parallel Complexity Classes; 86-08-06	1986-08
7	16-002	Accuracy, Speed and Convergence of Approximate Mean Values Analysis ; 86-08-07	1986-08
7	16-002	Constraint-Based Animation: Temporal Constraints in the Animus System; 86-09-01	1986-09
7	16-002	A User Interface for ThingLab Based on Direct Manipulation of Physical Objects; 86-09-02	1986-09
7	16-002	The Iterated Mod Problem; 86-09-03	1986-09
7	16-002	Geometric Continuity: A Parameterization Independent Measure of Continuity for Computer Aided Geometric Design ; 86-09-04	1986-09
7	16-002	A Corset for Ada; 86-09-05	1986-09
7	16-002	A Lace for Ada's Corset; 86-09-06	1986-09
7	16-002	The Energy Complexity of Transitive Functions ; 86-09-07	1986-09
8	16-002	An Integrated, but not Exact-Representation, Editor/Formatter; 86-09-08	1986-09
8	16-002	A Comparison of Performance Petri Nets and Queueing Network Models ; 86-09-09	1986-09
8	16-002	A Remote Procedure Call Facility for Interconnecting Heterogeneous Computer Systems ; 86-09-10	1986-09
8	16-002	Simple Universe Parallel Computers Based on Hypercube Interconnections ; 86-09-11	1986-09
8	16-002	Interconnecting Heterogeneous Computer Systems ; 86-10-02	1986-10
8	16-002	A Load Sharing Algorithm for A Workstation Environment; 86-10-03	1986-10
8	16-002	The Eden Project: A Final Report ; 86-11-01	1986-11
8	16-002	Constrains and Logic Programming ; 86-12-01	1986-12
8	16-002	Programming N-Cubes with a Graphical Parallel Programming Environment Versus an Extended Sequential Language ; 86-12-02	1986-12
8	16-002	Emerald: An Object-Based Language for Distributed Programming; 87-01-01	1987-01
8	16-002	Interconnecting Heterogeneous Computer Systems ; 87-01-02	1987-01
8	16-002	Garbage Collection: An Exercise in Distributed, Fault-Tolerant Programming ; 87-01-03	1987-01
8	16-002	Architectural Choices for Multi-Level Cache Hierarchies; 87-01-04	1987-01
8	16-002	An Evaluation of Branch Architectures; 87-01-05	1987-01
8	16-002	Near-Optimal Speedup of Graphics Algorithms Using Multigauge Parallel Computers ; 87-01-06	1987-01
8	16-002	Garbage Collection: An Exercise in Distributed, Fault-Tolerant Programming ; 87-01-07	1987-01
8	16-002	Architectural Support for Data Breakpointing ; 87-02-02	1987-02
8	16-002	Fine-Grained Mobility in the Emerald System; 87-02-03	1987-02
8	16-002	A Name Services for Evolving Heterogeneous Systems ; 87-02-05	1987-02
8	16-002	The Cache Coherence Problem in Shared-Memory Multiprocessors; 87-02-06	1987-02
8	16-002	Selection Matrices: An Algebraic System for Representing File Versions; 87-02-07	1987-02
8	16-002	Polynomial Space Counting Problems ; 87-03-01	1987-03
8	16-002	Integrating High Level and Low Level Computer Vision; 87-03-02	1987-03
8	16-002	Enhancement through Extension: Analysis and Experiments ; 87-03-03	1987-03
8	16-002	The Hough Transform Has O(N) Complexity on SIMD NxN Mesh Array Architecture; 87-03-04	1987-03
8	16-002	Using the Semantics of Abstract Data Types to Improve Concurrency in Transaction Systems (Revised); 87-03-05	1987-03
8	16-002	Allocation Strategies for APL on the CHiP Computer ; 87-03-06	1987-03
8	16-002	A Transparent Coprocessor for Interprocessor Communication in an MIMD Computer ; 87-03-07	1987-03
8	16-002	Dynamically Quantized Pyramids for Hough Vote Collection ; 87-03-08	1987-03
8	16-002	Cache Coherence in MIMD Systems: A Petri Net Model for a Minimal State Solution ; 87-04-01	1987-04
8	16-002	The Design and Implementation of Distributed Smalltalk ; 87-04-02	1987-04
8	16-002	Hypercube, Shuffle-Exchange and PRAM Algorithms for Image Component Labeling ; 87-04-03	1987-04
8	16-002	Computational Models of Games ; 87-04-04	1987-04
8	16-002	Effective Use of Parallel Computing (CER Proposal); 87-04-05	1987-04
8	16-002	Natural Representations for Straight Lines and The Hough Transform on Discrete Arrays ; 87-04-06	1987-04
8	16-002	Pessimal Guesses May Be Optimal: A Counterintuitive Search Result ; 87-05-01	1987-05
8	16-002	From Contours to Surfaces: Testbed and Initial Results ; 87-05-02	1987-05
8	16-002	Ordered Vertex Removal and Subgraph Problems ; 87-05-03	1987-05
8	16-002	Space Bounded Probabilistic Games ; 87-05-04	1987-05
8	16-002	Improving Quicksort Performance with a Codeword Data Structure ; 87-06-01	1987-06
8	16-002	Self-Reducible, P-Selective, Near-Testable, and P-Cheatable Sets: The Effect of Internal Structure on the Complexity of a Set ; 87-06-02	1987-06
8	16-002	The Planar Topology of Functional Programs ; 87-06-03	1987-06
9	16-002	Remote Computation in a Heterogeneous Environment ; 87-06-04	1987-06
9	16-002	Constraint Hierarchies ; 87-06-05	1987-06
9	16-002	The Hough Transform Has O(N) Complexity on SIMD NxN Mesh Array Architectures; 87-07-01	1987-07
9	16-002	Parallel Programming Paradigms ; 87-07-02	1987-07
9	16-002	Heterogeneous Remote Procedure Call for Franz Lisp; 87-07-03	1987-07
9	16-002	Adaptive Progress Refinement ; 87-07-05	1987-07
9	16-002	Mail Systems for Personal Computers ; 87-07-06	1987-07
9	16-002	Code Generation by Table Lookup; 87-07-07	1987-07
9	16-002	Automatic Layout of Large Directed Graphs ; 87-07-08	1987-07
9	16-002	Naming in Large, Heterogeneous Systems ; 87-08-01	1987-08
9	16-002	An Evaluation of Load Sharing in Locally Distributed Systems ; 87-08-02	1987-08
9	16-002	A Tool for Analyzing Compiler Error Messages ; 87-08-03	1987-08
9	16-002	The CODEGEN User's Manual ; 87-08-04	1987-08
9	16-002	Reasoning About Time In Higher-Level Language Software ; 87-08-05	1987-08
9	16-002	Composing Bezier Simplices; 87-08-06	1987-08
9	16-002	The Triangle: A Multiprocessor Architecture for Fast Curve and Surface Generation ; 87-08-07	1987-08
9	16-002	PRESTO: A System for Object-Oriented Parallel Programming ; 87-09-01	1987-09
9	16-002	A Prototype Pyramid Machine for Hierarchical Cellular Logic; 87-09-02	1987-09
9	16-002	Achieving Speedups for a Shared Memory Language on an SIMD Parallel Computer ; 87-09-03	1987-09
9	16-002	Two Applications of Complementation via Inductive Counting ; 87-10-01	1987-10
9	16-002	The Specification and Implementation of a User Interface Management System Based on a Uniform Output Model; 87-10-02	1987-10
9	16-002	Concurrent Programming with Time ; 87-10-03	1987-10
9	16-002	The Commit/Abort Problem in Type-Specific Locking ; 87-10-04	1987-10
9	16-002	An Investigation of Multigauge Architectures ; 87-10-05	1987-10
9	16-002	Extension and Software Development; 87-10-06	1987-10
9	16-002	The Emerald Programming Language ; 87-10-07	1987-10
9	16-002	Anyone can understand MetaClasses ; 87-11-02	1987-11
9	16-002	Measurement of On-Chip Parallelism in CMOS VLSI Circuits ; 87-11-03	1987-11
9	16-002	Cook is Faster than Karp: A Study of Reducibilities in NP (an extended abstract); 87-11-04	1987-11
9	16-002	A Note on Bi-immunity and P-closeness of P-Cheatable Sets in P/poly; 87-11-05	1987-11
9	16-002	Near-Testable Sets; 87-11-06	1987-11
9	16-002	On the Inclusion Properties for Multi-Level Cache Hierarchies ; 87-11-08	1987-11
9	16-002	A Simulation Study of Two-Level Caches ; 87-11-09	1987-11
9	16-002	Hercules: A Power Analyzer for MOS VLSI Circuits ; 87-11-10	1987-11
9	16-002	Using Self-Reducibilities to Characterize Polynomial Time; 87-11-11	1987-11
9	16-002	A Mail System for Local, Heterogeneous Environments ; 87-12-01	1987-12
9	16-002	Evaluating Dynamic Placement of Data in Multiprocessor Interconnection Networks under a Favorite Module Workload Model; 87-12-02	1987-12
9	16-002	Computer Methods for Sampling, Reconstruction, Display and Analysis of Retinal Whole Mounts; 87-12-03	1987-12
9	16-002	Distributed Smalltalk: Inheritance and Reactiveness in Distributed Systems; 87-12-04	1987-12
9	16-002	Practical Algorithms for Image Component Labeling on SIMD Mesh Connected Computers ; 87-12-05	1987-12
9	16-002	Watchdogs - Extending the UNIX File System; 87-12-06	1987-12
9	16-002	Adding Packet Radio to the Ultrix Kernel; 87-12-07	1987-12
9	16-002	An RPC/LWP Implementation for Interconnecting Heterogeneous Systems; 87-12-08	1987-12
9	16-002	The Limited Performance Benefits of Migrating Active Processes for Load Sharing ; 87-12-10	1987-12
9	16-002	Software Engineering of Real-Time Operating Systems ; 88-01-01	1988-01
9	16-002	Parallel Trace-Driven Simulation of Multiprocessor Cache Performance: Algorithms and Analysis; 88-01-02	1988-01
9	16-002	An Open Environment for Building Parallel Programming Systems ; 88-01-03	1988-01
9	16-002	The PRESTO User's Manual ; 88-01-04	1988-01
9	16-002	Spinning Versus Blocking in Parallel Systems with Uncertainty; 88-03-01	1988-03
9	16-002	Tailoring a Parallel Trace-Driven Simulation Technique to Specific Multiprocessor Cache Coherence Protocols ; 88-03-02	1988-03
9	16-002	Poker (4.1) Programmer's Reference Guide ; 88-03-03	1988-03
9	16-002	An Accurate and Efficient Performance Analysis Technique for Multiprocessor Snooping Cache-Consistency Protocols ; 88-03-04	1988-03
10	16-002	Debugging Parallel Programs using Graphical Views; 88-03-05	1988-03
10	16-002	The Heterogeneous Computer Systems Project: Collected Papers; 88-03-06	1988-03
10	16-002	Design and Implementation of the UW Illustrated Compiler ; 88-03-07	1988-03
10	16-002	Valiant's Maximum Algorithm with Sequential Memory Access ; 88-03-08	1988-03
10	16-002	The Iterated Mod Problem; 88-09-03	1988-09
10	16-002	A Model for Architectural Comparison; 88-04-01	1988-04
10	16-002	Multiple Solutions from Constraint Hierarchies ; 88-04-02	1988-04
10	16-002	Voyeur: Graphical Views of Parallel Programs; 88-04-03	1988-04
10	16-002	Partial Instantiation: A Data Model for Versioning Software Databases; 88-04-04	1988-04
10	16-002	Techniques for Efficient Shared-Memory Parallel Simulation; 88-04-05	1988-04
10	16-002	The Cyclic Executive Model and Ada; 88-04-07	1988-04
10	16-002	An Experimental Study Parallel Merge Sort ; 88-05-01	1988-05
10	16-002	S-patches: A Class of Representations for Multi-Sided Surface Patches; 88-05-02	1988-05
10	16-002	Super Registers ; 88-05-03	1988-05
10	16-002	3D I/O; 88-06-01	1988-06
10	16-002	Juris Hartmanis: Fundamental Contributions to Isomorphism Problems ; 88-06-02	1988-06
10	16-002	Benchmarking File Differencing Algorithms ; 88-06-03	1988-06
10	16-002	The Characteristics of a Large Multi-LAN Network; 88-06-04	1988-06
10	16-002	The Role of Energy in VLSI Computations ; 88-06-05	1988-06
10	16-002	Interconnected LANS: Performance Tools and Performance Measurements; 88-06-06	1988-06
10	16-002	High-Level Synthesis: Current Status and Future Directions ; 88-07-01	1988-07
10	16-002	An Empirical Study of On-Chip Parallelism; 88-07-02	1988-07
10	16-002	A Notation for Describing Multiple Views of VLSI Circuits; 88-07-03	1988-07
10	16-002	Programming Parallel Vision Algorithms: A Dataflow Language Approach; 88-07-04	1988-07
10	16-002	Parallel Complexity Results about Greedy Breadth and Depth First Search; 88-07-05	1988-07
10	16-002	The Benefits of Dynamic Routing and Placement of Data in Multiprocessor Interconnection Networks [WITHDRAWN]; 88-07-06	1988-07
10	16-002	Parallel Computational Geometry of Rectangles; 88-07-07	1988-07
10	16-002	Automatic Layout of Large Directed Graphs ; 88-07-08	1988-07
10	16-002	A Heterogeneous Remote File System ; 88-08-08	1988-08
10	16-002	On the Criteria to be Used in Composing Tools into Systems; 88-08-09	1988-08
10	16-002	The Heuristic Discovery of Concept Descriptors; 88-09-02	1988-09
10	16-002	A Software Structure For Accommodating Heterogeneity; 88-09-03	1988-09
10	16-002	The Performance Implications of Thread Management Alternatives for Shared-Memory Multiprocessors; 88-09-04	1988-09
10	16-002	Parallel Simulation of Queueing Networks: Limitations and Potentials ; 88-09-05	1988-09
10	16-002	Dynamically Quantized Hough Vote Generation ; 88-10-01	1988-10
10	16-002	Zero Knowledge Proofs and Secret Sharing Problems ; 88-10-02	1988-10
10	16-002	On Optimal, Non-Preemptive Scheduling of Periodic Tasks; 88-10-03	1988-10
10	16-002	A General Sequential Time-Space Tradeoff for Finding Unique Elements ; 88-10-04	1988-10
10	16-002	Poker (4.2) Programmer's Reference Guide; 88-10-05	1988-10
10	16-002	The Emerald Approach to Programming ; 88-11-01	1988-11
10	16-002	Organization and Performance of a Two-Level Virtual-Real Cache Hierarchy; 88-11-02	1988-11
10	16-002	Extending Memory Hierarchy into Multiprocessor Interconnection Networks; 88-11-03	1988-11
10	16-002	Extending the Memory Hierarchy into Multiprocessor Interconnection Networks: A Performance Analysis ; 88-11-04	1988-11
10	16-002	Introducing Memory into the Switch Elements of Multiprocessor Interconnection Networks; 88-11-05	1988-11
10	16-002	On Optimal, Non-Preemptive Scheduling of Periodic and Sporadic Tasks; 88-11-06	1988-11
10	16-002	Representing Geometric Structures in d Dimensions: Topology and Order; 88-11-07	1988-11
10	16-002	Towards a Unified Theory of the Parallelism Available for Circuit Simulation ; 88-11-08	1988-11
10	16-002	The DeltaBlue Algorithm: An Incremental Constraint Hierarchy Solver; 88-11-09	1988-11
10	16-002	Constraint Hierarchies and Logic Programming; 88-11-10	1988-11
10	16-002	The Influence of On-Chip Parallelism in the Performance of Event-Based Parallel Simulation; 88-11-11	1988-11
10	16-002	The Complexity of Parallel Computations: Inherently Sequential Algorithms and P-Complete Problems; 88-12-01	1988-12
10	16-002	Some Topics in Communication Complexity Theory; 88-12-02	1988-12
10	16-002	Parallel Algorithms for Searching Game Trees; 88-12-03	1988-12
10	16-002	Apex: Two Architectures for Generating Parametric Curves and Surfaces; 88-12-04	1988-12
10	16-002	A Timestamp-based Cache Coherence Scheme; 88-12-05	1988-12
10	16-002	Object Mobility in a Distributed Object-Oriented System; 88-12-06	1988-12
10	16-002	Real Time Systems = Processes + Abstract Data Types ; 88-12-07	1988-12
10	16-002	Research Review 1989-1990; 89-01-01	1989-01
10	16-002	The Measured Performance of Parallel Dynamic Programming Implementations; 89-01-03	1989-01
10	16-002	A Compositional Model for Software Reuse; 89-01-04	1989-01
10	16-002	The Renaissance Modeling System: A Tutorial with Man Pages; 89-01-05	1989-01
10	16-002	A Lower Bound on the Size of Shellsort Sorting Networks ; 89-01-06	1989-01
11	16-002	The Virtual System Model for Large Distributed Operating Systems ; 89-01-07	1989-01
11	16-002	Theoretical Aspects of VLSI Pin Limitations ; 89-02-01	1989-02
11	16-002	Lower Bounds on the Length of Universal Traversal Sequences; 89-03-02	1989-03
11	16-002	The Electrical Resistance of a Graph Captures its Commute and Cover Times (detailed abstract); 89-03-03	1989-03
11	16-002	Results on Communication Complexity Classes (detailed abstract); 89-03-05	1989-03
11	16-002	The Amber System: Parallel Programming on a Network of Multiprocessors; 89-04-01	1989-04
11	16-002	Lightweight Remote Procedure Call; 89-04-02	1989-04
11	16-002	The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors; 89-04-03	1989-04
11	16-002	On the Non-Duality of Modules and Objects for Distributed Programming ; 89-04-04	1989-04
11	16-002	Algorithms for Reduced Hypercubes and Related Computers; 89-04-05	1989-04
11	16-002	Constraint Imperative Programming: A Research Proposal; 89-04-06	1989-04
11	16-002	The Power of Parallel Pointer Manipulation; 89-05-01	1989-05
11	16-002	Constraint Technology for User-Interface Construction in ThingLab II; 89-05-02	1989-05
11	16-002	A Module Mechanism for Constraints in Smalltalk; 89-05-03	1989-05
11	16-002	Extending Hierarchical Constraint Logic Programming: Nonmonotonicity and Inter-Hierarchy Comparison; 89-05-04	1989-05
11	16-002	An O(Log1.5N) Time Algorithm for Sorting on Hypercubes and Related Computers ; 89-05-05	1989-05
11	16-002	Using Processor-Cache Affinity Information in Shared-Memory Multiprocessor Scheduling [WITHDRAWN]; 89-06-01	1989-06
11	16-002	Tight Bounds for Weakly-Bounded Protocols ; 89-07-01	1989-07
11	16-002	Analysis of Synchronization and Scheduling Discipline for Real-Time Tasks with Preemption Constraints; 89-07-02	1989-07
11	16-002	The Effect of Scheduling Discipline on Spin Overhead in Shared Memory Parallel Processors; 89-07-03	1989-07
11	16-002	Building a Real-Time Kernel: First Steps in Validating a Pure Process/ Adt Model; 89-07-04	1989-07
11	16-002	Optimality Considerations for "Time Warp" Parallel Simulation; 89-07-05	1989-07
11	16-002	Parallel Trace-Driven Simulation of Multiprocessor Cache Performance: Algorithms and Analysis; 89-07-06	1989-07
11	16-002	Conservative Parallel Simulation for Systems with No Lookahead Prediction; 89-07-07	1989-07
11	16-002	Design and Analysis of a Scalable Cache Coherence Scheme ; 89-07-08	1989-07
11	16-002	Automated Model Switching: Discrepancy Selection of Approximation Reformulations; 89-08-01	1989-08
11	16-002	Architectures and Algorithms for Iconic-to Symbolic Transformations; 89-08-02	1989-08
11	16-002	Design of an Integrated Programming Language and Data Management System for Knowledge-Based Computer Vision; 89-08-03	1989-08
11	16-002	Assessment and Focus: An Approach to Parallel Computer Vision ; 89-08-04	1989-08
11	16-002	The On-Chip Parallelism of VLSI Circuits; 89-08-05	1989-08
11	16-002	The DeltaBlue Algorithm: An Incremental Constraint Hierarchy Solver; 89-08-06	1989-08
11	16-002	Memory Hierarchy Management Schemes in Large Scale Shared-Memory Multiprocessors; 89-08-07	1989-08
11	16-002	Size-Depth Trade-Offs for Synchronous Strictly Non-Blocking Fixed Ratio Concentrators; 89-09-01	1989-09
11	16-002	Efficient Trace-Driven Simulation Methods for Cache Performance Analysis ; 89-09-02	1989-09
11	16-002	Conservative Parallel Discrete-Event Simulation: Principles and Practice; 89-09-03	1989-09
11	16-002	Quartz: A Tool for Tuning Parallel Program Performance ; 89-09-05	1989-09
11	16-002	Comparing Synchronization Protocols for Parallel Logic-Level Simulation ; 89-09-06	1989-09
11	16-002	A Study of Time Warp Rollback Mechanisms; 89-09-07	1989-09
11	16-002	Effective Parallel Portability; 89-09-08	1989-09
11	16-002	Simplicity v. Accuracy in a Model of Cache Coherence Overhead ; 89-09-09	1989-09
11	16-002	An Algorithm Producing Balanced Partitioning of Data Arrays; 89-09-10	1989-09
11	16-002	Proceedings of CS 568 PHM - A Programmable Hardware Monitor; 89-09-11	1989-09
11	16-002	A Source-Level Tool for Predicting Deterministic Execution Times of Programs ; 89-09-12	1989-09
12	16-002	Multilevel Cache Hierarchies; 89-09-13	1989-09
12	16-002	Abstractions for Scalable Parallel Programming; 89-09-14	1989-09
12	16-002	The Real-Time Producer/Consumer Paradigm: Towards Verifiable Real-Time Computations; 89-09-15	1989-09
12	16-002	Coordinate-Free Geometric Programming; 89-09-16	1989-09
12	16-002	Processor Scheduling in Shared Memory Multiprocessors; 89-09-17	1989-09
12	16-002	Techniques for Efficient Inline Tracing on a Shared-Memory Multiprocessor; 89-09-18	1989-09
12	16-002	A Critical Evaluation of Lenat's AM Program; 89-09-19	1989-09
12	16-002	Experimental Analysis of Optimal k-d Trees and Their Use in Region Searching ; 89-10-01	1989-10
12	16-002	Proceedings of CS 568 PHM - A Programmable Hardware Monitor; 89-10-03	1989-10
12	16-002	Parallel Distance Transforms on Pyramid Machines: Theory and Implementation; 89-10-04	1989-10
12	16-002	Normalized Time and its Use in Architectural Design; 89-10-05	1989-10
12	16-002	Exploiting Lookahead in Parallel Simulation; 89-10-06	1989-10
12	16-002	A Fully Testable CMOS Asynchronous Counter; 89-10-07	1989-10
12	16-002	[WITHDRAWN]; 89-10-08	1989-10
12	16-002	Multi-Language Support for Heterogeneous Remote Procedure Call [WITHDRAWN]; 89-10-09	1989-10
12	16-002	Workstations and the Virtual System Model; 89-10-10	1989-10
12	16-002	Adaptive, minimal routing in hypercubes; 89-11-01	1989-11
12	16-002	An Illumination Model for Machine Vision; 89-11-02	1989-11
12	16-002	Automatic Sensor and Light Source Positioning for Machine Vision; 89-11-03	1989-11
12	16-002	Safety and Liveness of w-Context-Free-Languages; 89-11-04	1989-11
12	16-002	Report of the Workshop on Scientific Computing Performance Analysis ; 89-11-05	1989-11
12	16-002	Analysis of Contention in Multiprocessor Scheduling; 89-11-06	1989-11
12	16-002	Extending the SIMPLE Program in Poker; 89-11-07	1989-11
12	16-002	UW VLSI Chip Tester; 89-12-01	1989-12
12	16-002	WireLisp Manual; 89-12-02	1989-12
12	16-002	Drawing Wirelisp; 89-12-03	1989-12
12	16-002	Balance in Architectural Design; 89-12-04	1989-12
12	16-002	Timing Optimization of Multi-Phase Sequential Logic ; 89-12-05	1989-12
12	16-002	GemeniII: A Second Generation Layout Validation Program; 89-12-06	1989-12
12	16-002	WireLisp: Combining Graphics and Procedures in a Circuit Specification Language ; 89-12-07	1989-12
12	16-002	Parallel Algorithms for Arrangements; 89-12-08	1989-12
12	16-002	Chaos Router: An Adaptive, Probabilistically Livelock Free Router; 89-12-09	1989-12
12	16-002	Research Review 1990-1991; 90-01-00	1990-01
12	16-002	The Complexity of Computing Symmetric Functions Using Threshold Circuits; 90-01-01	1990-01
12	16-002	Determining the Global Virtual Time in a Distributed Simulation; 90-01-02	1990-01
12	16-002	Hard-Coding Bottom-Up Code Generation Tables to Save Time and Space; 90-01-03	1990-01
12	16-002	Optimal Parallel Algorithms on Sorted Intervals; 90-01-04	1990-01
12	16-002	Parallel Algorithms for the Segment Dragging Problem; 90-01-05	1990-01
13	16-002	A Parallel Algorithm for Finding a Maximum Clique of a Set of Circular-Arcs of a Circle; 90-01-06	1990-01
13	16-002	Optimal Parallel Algorithms on Sorted Circular Arcs; 90-01-07	1990-01
13	16-002	Parallel Computational Geometry of Rectangles; 90-01-09	1990-01
13	16-002	Generalized B-spline Surfaces of Arbitrary Topology; 90-01-10	1990-01
13	16-002	Port Ensembles: A Communication Abstraction for Nonshared Memory Parallel Programming; 90-01-11	1990-01
13	16-002	Communication-Space Tradeoffs for Unrestricted Protocols ; 90-01-12	1990-01
13	16-002	Training Connectionist Networks with Queries and Selective Sampling ; 90-01-13	1990-01
13	16-002	Practical Dictionary Management for Hardware Data Compression (development of a theme by Ziv and Lempel) (revision of 89-10-08); 90-01-14	1990-01
13	16-002	A Formal Model of the Processor Memory Interface ; 90-01-15	1990-01
13	16-002	On Synchronous Strictly non-blocking Concentrators ; 90-01-16	1990-01
13	16-002	Operation/Event Graphs and OESIM; 90-01-17	1990-01
13	16-002	Simulating Neural Networks on SIMD Mesh and Pyramid Machines ; 90-02-01	1990-02
13	16-002	Agreement is Harder Than Consensus: Set Consensus Problems in Totally Asynchronous Systems; 90-02-02	1990-02
13	16-002	Reducing the State Saving Overhead for Time Warp Parallel Simulation; 90-02-03	1990-02
13	16-002	VIVA: A Visual Language for Image Processing ; 90-02-04	1990-02
13	16-002	A CMOS Chip for Systolic Cellular Logic; 90-02-05	1990-02
13	16-002	Efficient Iteration in Data-Parallel Programs with Irregular and Dynamically Distributed Data Structures; 90-02-06	1990-02
13	16-002	Spot: A Data Parallel Language for Iterative Algorithms; 90-03-01	1990-03
13	16-002	A Dynamic Processor Allocation Policy for Multiprogrammed, Shared Memory Multiprocessors; 90-03-02	1990-03
13	16-002	Processor Scheduling for Time Warp Parallel Simulation; 90-03-03	1990-03
13	16-002	Controlling Inference in Planning Systems: Who, What, When, Why, and How; 90-04-01	1990-04
13	16-002	Schedule Activations: Effective Kernel Support for the User-Level Management of Parallelism; 90-04-02	1990-04
13	16-002	Low Overhead Parallel Schedules for Task Graphs ; 90-04-03	1990-04
13	16-002	The Virtual System Model: A Scalable Approach to Organizing Large Systems (a thesis proposal); 90-05-01	1990-05
13	16-002	DeltaStar, How I Wonder What You Are: A General Algorithm for Incremental Satisfaction of Constraint Hierarchies ; 90-05-02	1990-05
13	16-002	Parallel Algorithms for Generating Random Permutations on a Shared Memory Machine ; 90-05-03	1990-05
13	16-002	A Time-Division Algorithm for Parallel Simulation ; 90-05-04	1990-05
13	16-002	Reject Arbiter and Self-Timed Design Paradigm; 90-05-05	1990-05
13	16-002	Deterministic Timing Schema for Parallel Programs ; 90-05-06	1990-05
13	16-002	User-Level Interprocess Communication for Shared Memory Multiprocessors; 90-05-07	1990-05
13	16-002	Some Properties of Conservative Parallel Discrete Event Simulation; 90-05-08	1990-05
13	16-002	MAGIC: A Computer Performance Modeling Tool Based on Matrix-Geometric Techniques ; 90-05-09	1990-05
13	16-002	A Study on Internet Management: SNMP and Internet MIB; 90-06-01	1990-06
13	16-002	High Performance Cross-Address Space Communication; 90-06-02	1990-06
13	16-002	Scheduling a Mixed Interactive and Batch Workload on a Parallel, Shared Memory Supercomputer ; 90-06-03	1990-06
13	16-002	The University of Washington Illustrating Compiler ; 90-07-01	1990-07
13	16-002	Lower Bounds on Universal Traversal Sequences for Cycles and Higher Degree Graphs ; 90-07-02	1990-07
13	16-002	Generic Software Configuration Management; Theory and Design ; 90-07-03	1990-07
13	16-002	Parallel Algorithms for Geometric Intersection Graphs ; 90-07-04	1990-07
13	16-002	Analysis of Task Migration in Shared-Memory Multiprocessor Scheduling; 90-07-05	1990-07
13	16-002	The Interaction of Architecture and Operating System Design ; 90-08-01	1990-08
13	16-002	Understanding the Limits of Optimistic and Conservative Parallel Simulation; 90-08-02	1990-08
13	16-002	Representation of d-Dimensional Geometric Objects ; 90-08-03	1990-08
13	16-002	Dynamic Network Management Using the Simple Network Management Protocol; 90-08-04	1990-08
13	16-002	Program Restructuring to Aid Software Maintenance ; 90-08-05	1990-08
13	16-002	An Experiment on Predicting and Measuring the Deterministic Execution Times of Parallel Programs on a Multiprocessor ; 90-09-01	1990-09
13	16-002	Integrate Register Allocation and Instruction Scheduling for RISCs; 90-09-02	1990-09
13	16-002	Network Protocols for non-FIFO Channels ; 90-09-03	1990-09
13	16-002	Dynamic Node Reconfiguration in a Parallel-Distributed Environment ; 90-09-04	1990-09
13	16-002	Extending the Mach External Pager Interface to Allow User-Level Page Replacement Policies ; 90-09-05	1990-09
13	16-002	Two Approaches to Casual Interaction Over Computer and Video Networks ; 90-10-01	1990-10
13	16-002	Memory Systems for Highly Parallel Computers ; 90-10-02	1990-10
13	16-002	Construcid: Combining Constraints and Lucid ; 90-10-03	1990-10
13	16-002	Issues in Shared-Memory Multiprocessor Scheduling: A Performance Evaluation ; 90-10-04	1990-10
13	16-002	The Evolution of Constraint Imperative Programming; 90-10-05	1990-10
14	16-002	Abstractions for Effectively Portable Shared Memory Parallel Programs ; 90-10-06	1990-10
14	16-002	Abstracting Data-Representation and Partitioning-Scheduling ; 90-10-07	1990-10
14	16-002	A Scheduling Problem Arising from Loop Parallelization on MIMD Machines; 90-10-08	1990-10
14	16-002	Abstractions for Effectively Portable Shared Memory Parallel Programs ; 90-10-09	1990-10
14	16-002	Topics in the Theory of Distributed Computing ; 90-10-10	1990-10
14	16-002	Single-Layer Cylindrical Compaction; 90-10-11	1990-10
14	16-002	Detecting Repeated Patterns on Mesh Computers ; 90-11-01	1990-11
14	16-002	The Marion System for Retargetable Instruction Scheduling; 90-11-02	1990-11
14	16-002	Remote Procedure Call Design for Flexibility and Performance in Heterogeneous Environments ; 90-11-03	1990-11
14	16-002	Eliminating False Sharing ; 90-12-01	1990-12
14	16-002	Query-Directed Approximation; 90-12-02	1990-12
14	16-002	Research Review 1991; 91-01-00	1991-01
		Parallel Quicksand: Fast Sorting on the Sequent; 91-01-01	1991-01
Box	Accession
14	16-002	Proxy-Based Authorization and Accounting for Distributed Systems ; 91-02-01	1991-02
14	16-002	Monotonic Enumerations of Complete Sets ; 91-02-02	1991-02
14	16-002	Evaluating Nonlinear Planning ; 91-02-03	1991-02
14	16-002	The Semantics of Hierarchical Constraint Logic Programming ; 91-02-04	1991-02
14	16-002	Rapid Low-Cost Display of Spline Surfaces ; 91-03-01	1991-03
14	16-002	The Implications of Cache Affinity on Processor Scheduling for Multiprogrammed, Shared Memory Multiprocessors; 91-03-03	1991-03
14	16-002	How tight are the Vapnik-Chervonenkis bounds?; 91-03-04	1991-03
14	16-002	Complexity Issues in Strictly Non-Blocking Networks ; 91-03-05	1991-03
14	16-002	Composition and Reuse in Object-Oriented Languages ; 91-03-06	1991-03
14	16-002	An Effective On-Chip Preloading Scheme to Reduce Data Access Penalty ; 91-03-07	1991-03
14	16-002	Issues in the Implementation of a Remote Memory Paging System ; 91-03-09	1991-03
14	16-002	Supporting Cooperation on Wide-Address Computers ; 91-03-10	1991-03
14	16-002	On Synchronization Patterns in Parallel Programs ; 91-04-01	1991-04
14	16-002	Parallel Simulation of Performance Petri Nets: Extending the Domain of Parallel Simulation; 91-04-02	1991-04
14	16-002	Parallel Architectures for Fast Curve and Surface Generation ; 91-04-03	1991-04
14	16-002	Mesh and Torus Chaotic Routing ; 91-04-04	1991-04
14	16-002	Wait-Free Parallel Algorithms for The Union-Find Problem; 91-04-05	1991-04
14	16-002	Reasoning about Model Accuracy ; 91-05-02	1991-05
14	16-002	Programming SIMPLE for Parallel Portability; 91-05-03	1991-05
14	16-002	Composition Algorithms via Blossoming: Theory, Applications, and Implementation; 91-05-04	1991-05
14	16-002	Parallel Simulation of Petri Nets; 91-05-05	1991-05
14	16-002	The Effect of Step-Order Representations on Planning; 91-05-06	1991-05
14	16-002	Limits to Low-Latency RPC; 91-06-01	1991-06
14	16-002	Deterministic Algorithms for Undirected s-t Connectivity Using Polynomial Time and Sublinear Space ; 91-06-02	1991-06
14	16-002	Supporting fine-grain computation on distributed memory parallel computers ; 91-07-01	1991-07
14	16-002	Constraint Imperative Programming; 91-07-02	1991-07
15	16-002	Flexible Hardware for Computing Complex Evaluation Functions ; 91-07-03	1991-07
15	16-002	Lecture Notes on Probabilistic Algorithms and Pseudorandom Generators; 91-07-05	1991-07
15	16-002	Register Windows and User-Space Threads on the SPARC; 91-08-01	1991-08
15	16-002	Computer-Aided vs. Manual Program Restructuring ; 91-08-02	1991-08
15	16-002	Semantic Manipulation of Program Source; 91-08-03	1991-08
15	16-002	Program Restructuring as an Aid to Software Maintenance; 91-08-04	1991-08
15	16-002	Chores: Enhanced Run-Time Support for Shared-Memory Parallel Computing ; 91-08-05	1991-08
15	16-002	A Probabilistic Algorithm for Verifying Matrix Products Using O(n2) Time and log2n+O(1) Random Bits.; 91-08-06	1991-08
15	16-002	Retargetable Instruction Scheduling for Pipelined Processors ; 91-08-07	1991-08
15	16-002	Reconciling Environment Integration and Software Evaluation; 91-08-08	1991-08
15	16-002	Communicating Real-Time State Machines ; 91-08-09	1991-08
15	16-002	Operating System Support for High Performance Multiprocessing; 91-08-10	1991-08
15	16-002	Time-Sensitive Objects: A Data-Oriented Approach to Real-Time Systems Design; 91-08-11	1991-08
15	16-002	Using Constraints for User Interface Construction; 91-08-12	1991-08
15	16-002	Surfaces from Contours; 91-09-01	1991-09
15	16-002	A Structural Theory of Explanation-Based Learning ; 91-09-02	1991-09
15	16-002	Behavioral Relationships in Object-Oriented Analysis ; 91-09-03	1991-09
15	16-002	Scaling Shared-bus Multiprocessors with Multiple Busses and Shared Caches: A Performance Study ; 91-09-04	1991-09
15	16-002	TRIPTYCH: A New FPGA Architecture; 91-09-05	1991-09
15	16-002	Optimal Retiming of Multi-Phase Level-Clocked Circuits; 91-10-01	1991-10
15	16-002	MacTester: A Low-Cost Functional Tester for Interactive Testing and Debugging; 91-10-02	1991-10
15	16-002	Systematic Adaptation for Case-Based Planning: Algorithm Description, Formal Properties, and Empirical Results ; 91-10-03	1991-10
15	16-002	Critiquing the Tileworld: Agent Architectures, Planning Benchmarks, and the Experimental Methodology; 91-11-01	1991-11
15	16-002	Real-Time Processing of Moving Data; 91-11-02	1991-11
15	16-002	Computing Per-Process Summary Side-Effect Information; 91-11-03	1991-11
15	16-002	A Case for Runtime Code Generation ; 91-11-04	1991-11
15	16-002	The Protection Lookaside Buffer: Efficient Protection for Single-Address Space Computers ; 91-11-05	1991-11
15	16-002	Predicting Program Execution Times by Analyzing Static and Dynamic Program Paths ; 91-12-01	1991-12
15	16-002	On the Convergence of a Pyramidal Euclidian Distance Transform ; 91-12-02	1991-12
15	16-002	Surface Reconstruction from Unorganized Points ; 91-12-03	1991-12
15	16-002	Adaptive Guided Self-Scheduling ; 92-01-01	1992-01
15	16-002	A Performance Study of Memory Consistency Models ; 92-01-02	1992-01
15	16-002	Managing Applications Using the Simple Network Management Protocol - A SYBASE Monitoring Prototype; 92-01-03	1992-01
15	16-002	Performance Issues in Non-Blocking Synchronization on Shared-Memory Multiprocessors; 92-02-01	1992-02
15	16-002	A Centralized Token-Based Algorithm for Distributed Mutual Exclusion; 92-02-02	1992-02
15	16-002	Computer Science and Engineering Research Review 1992; 92-03-00	1992-03
15	16-002	Distributed Shared Memory with Versioned Objects; 92-03-01	1992-03
15	16-002	How to Use a 64-Bit Virtual Address Space ; 92-03-02	1992-03
15	16-002	Improving Fault Tolerance and Supporting Partial Writes in Structured Coterie Protocols for Replicated Objects; 92-03-03	1992-03
16	16-002	Color Photometric Stereo; 92-03-04	1992-03
16	16-002	A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity; 92-03-05	1992-03
16	16-002	An Expanded System for Coordinate-Free Geometric Programming ; 92-03-06	1992-03
16	16-002	How Reductions to Sparse Sets Collapse the Polynomial-time Hierarchy: A Primer; 92-03-07	1992-03
16	16-002	Behavioral Abstraction; 92-03-08	1992-03
16	16-002	Lightweight Shared Objects in a 64-Bit Operating System; 92-03-09	1992-03
16	16-002	Architectural Support for Single Address Space Operating Systems ; 92-03-10	1992-03
16	16-002	The Case for Application-Specific Communication Protocols ; 92-03-11	1992-03
16	16-002	Acquiring Search-Control Knowledge via Static Analysis ; 92-04-01	1992-04
16	16-002	Computer Science in Japanese Universities ; 92-04-02	1992-04
16	16-002	Learning Mathematics via Image Processing: A Rationale and a Research Direction ; 92-04-03	1992-04
16	16-002	A Performance Analysis of Network I/O in Shared-Memory Multiprocessors; 92-04-04	1992-04
16	16-002	An Algorithm of Choices for Solving QR Factorization ; 92-04-05	1992-04
16	16-002	Index Assignment for Progressive Transmission of Full Search Vector Quantization; 92-04-06	1992-04
16	16-002	Interactive Proof Systems with Polynomially Bounded Strategies ; 92-04-07	1992-04
16	16-002	Electronic "How Things Work" Articles: A Preliminary Report; 92-04-08	1992-04
16	16-002	Partial-Order Planning: Evaluating Possible Efficiency Gains ; 92-05-01	1992-05
16	16-002	High Performance Parallel/Distributed Computing: A Proposal to the CISE Institute Infrastructure Program; 92-05-02	1992-05
16	16-002	The Keystone Benchmark for Parallel Performance Prediction ; 92-06-01	1992-06
16	16-002	Weyl: A Language for Computer Graphics and Computer Aided Geometric Design ; 92-06-02	1992-06
16	16-002	Reducing Memory Latency via Non-blocking and Prefetching Caches; 92-06-03	1992-06
16	16-002	The Virtual System Model: A Scalable Approach to Organizing Large Systems ; 92-06-04	1992-06
16	16-002	Multi-Garnet: Integrating Multi-Way Constraints with Garnet; 92-07-01	1992-07
16	16-002	The SkyBlue Constraint Solver ; 92-07-02	1992-07
16	16-002	An Efficient and Highly Available Read-One Write-All Protocol for Replicated Data Management ; 92-07-04	1992-07
16	16-002	Multi-way versus One-way Constraints in User Interfaces: Experience with the DeltaBlue Algorithm ; 92-07-05	1992-07
16	16-002	Non-Uniformities Introduced by Virtual Channel Deadlock Prevention ; 92-07-07	1992-07
16	16-002	Beyond the Naivety of Grades: Educational Record Keeping for the Twenty-First Century; 92-07-09	1992-07
16	16-002	Papers Presented at the Microelectric System Education Conference 1989-1991; 92-08-01	1992-08
16	16-002	Predicting Deterministic Execution Times of Real-Time Programs ; 92-08-02	1992-08
16	16-002	Adding Scheduler Activations to Mach 3.0; 92-08-03	1992-08
16	16-002	Double Exponential Inseparability of Robinson Subsystem Q+ from the Unsatisfiable Sentences in the Language of Addition; 92-09-01	1992-09
16	16-002	Monitoring Timing Constraints in Distributed Real-time Systems ; 92-09-03	1992-09
16	16-002	The Systematic Plan Adaptor: A Formal Foundation for Case-Based Planning ; 92-09-04	1992-09
16	16-002	Implementations and Variations of a Maximum-Flow Algorithm ; 92-09-06	1992-09
16	16-002	Improving the Performance of Message-Passing Applications by Multithreading; 92-09-07	1992-09
16	16-002	Techniques for Files System Simulation; 92-09-08	1992-09
16	16-002	Generalized B-spline Surfaces of Arbitrary Topological Type; 92-10-01	1992-10
16	16-002	Time-Space Tradeoffs for Graph s-t Connectivity ; 92-10-02	1992-10
16	16-002	A Prototyping Environment for Specifying, Executing and Checking Communicating Real-time State Machines ; 92-10-03	1992-10
16	16-002	A Multi-Level Hierarchical Cache Coherence Protocol for Multiprocessors ; 92-10-04	1992-10
16	16-002	Improving the Performance of Runtime Parallelization; 92-10-05	1992-10
16	16-002	Counting Protocols for Reliable End-to-End Transmission; 92-10-06	1992-10
16	16-002	The UW MacTester: A Low-Cost Functional Tester for Interactive Testing and Debugging ; 92-10-08	1992-10
16	16-002	Timing Analysis of Concurrent Systems: An Algorithm for Determining Time Separation of Events ; 92-11-01	1992-11
16	16-002	Balanced Scheduling: Instruction Scheduling when Memory Latency is Uncertain ; 92-11-03	1992-11
16	16-002	Message Logging and Data-Parallel Languages ; 92-11-04	1992-11
16	16-002	An Investigation of the Therac-25 Accidents ; 92-11-05	1992-11
16	16-002	Surface Approximation Using Geometric Hermite Patches ; 92-11-06	1992-11
16	16-002	A Self-Timed Counter II; 92-11-07	1992-11
16	16-002	A Self-Timed Comparand Register ; 92-11-08	1992-11
16	16-002	Bounds on Sample Space Size for Matrix Product Verification ; 92-12-01	1992-12
16	16-002	Asynchronous Epoch Management in Replicated Databases; 92-12-02	1992-12
16	16-002	A High-Speed Channel Controller for the Chaos Router ; 92-12-03	1992-12
17	16-002	The Portability of Parallel Programs Across MIMD Computers ; 92-12-04	1992-12
17	16-002	Relaxed Consistency and Synchronization in Parallel Processors ; 92-12-05	1992-12
17	16-002	A Direct Version of Shamir and Snir's Lower Bounds on Monotone Circuit Depth; 92-12-06	1992-12
17	16-002	Reordering Iterations in Runtime Loop Parallelization ; 92-12-07	1992-12
17	16-002	Theory and Practice of Vector Quantizers Trained on Small Training Sets; 92-12-08	1992-12
17	16-002	Mesh Optimization; 93-01-01	1993-01
17	16-002	Hierarchical Constraint Logic Programming ; 93-01-02	1993-01
17	16-002	Time-Space Tradeoffs for Undirected Graph Traversal; 93-02-01	1993-02
17	16-002	Building FIFO and Priority-Queueing Spin Locks from Atomic Swap; 93-02-02	1993-02
17	16-002	User-Level Threads and Interprocess Communication ; 93-02-03	1993-02
17	16-002	A Note on the Least Common Multiples of Dense Sets of Integers ; 93-02-04	1993-02
17	16-002	Simulation of Multiprefix PRAMs by Unbounded Fan-in Circuits ; 93-02-05	1993-02
17	16-002	Implementing Network Protocols at User Level ; 93-03-01	1993-03
17	16-002	A Performance Study of a New Grid Protocol and General Grid Structures for Replicated Data; 93-03-02	1993-03
17	16-002	Latency Analysis of TCP on an ATM Network ; 93-03-03	1993-03
17	16-002	Communication Complexity: Interactive Techniques for Lower Bounds ; 93-03-04	1993-03
17	16-002	Pointers Versus Arithmetic in PRAMs; 93-03-06	1993-03
17	16-002	How Reductions to Sparse Sets Collapse the Polynomial-time Hierarchy: A Primer; 93-03-07	1993-03
17	16-002	Adhara: Runtime Support for Dynamic Space-Based Applications on Distributed Memory MIMD Multiprocessors; 93-04-01	1993-04
17	16-002	Sharing and Protection in a Single Address Space Operating System ; 93-04-02	1993-04
17	16-002	Efficient Support for Multicomputing on ATM Networks ; 93-04-03	1993-04
17	16-002	OS Agents: Using AI Techniques in the Operating System Environment; 93-04-04	1993-04
17	16-002	Vector Prefix Addition on Sub-Bus Mesh Computers; 93-04-05	1993-04
17	16-002	Fast Data Breakpoints ; 93-04-06	1993-04
17	16-002	An Exponential Separation between the Matching Principle and the Pigeonhole Principle; 93-04-07	1993-04
17	16-002	An Automatic Verification Technique for Communicating Real-Time State Machines ; 93-04-08	1993-04
17	16-002	Building Counting Networks from Larger Balancers ; 93-04-09	1993-04
17	16-002	Hierarchical Constraint Logic Programming (PhD Dissertation); 93-05-01	1993-05
17	16-002	A Periodic Object Model for Real-Time Systems; 93-05-02	1993-05
17	16-002	The Practical Application of Retiming to the Design of High-Performance Systems ; 93-05-03	1993-05
17	16-002	Minimizing the Effect of Clock Skew via Circuit Retiming ; 93-05-04	1993-05
17	16-002	Training Compilers for Better Inlining Decisions; 93-05-05	1993-05
17	16-002	Tools and Techniques for Building Fast Portable Threads Packages ; 93-05-06	1993-05
17	16-002	Asynchronous Design Methodologies: An Overview; 93-05-07	1993-05
17	16-002	Performance of Chaos and Oblivious Routers Under Non-uniform Traffic; 93-06-01	1993-06
17	16-002	Managing Abstraction-Induced Complexity ; 93-06-02	1993-06
17	16-002	An Algorithm for Probabilistic Planning ; 93-06-03	1993-06
17	16-002	Shade: A Fast Instruction-Set Simulator for Execution Profiling ; 93-06-06	1993-06
17	16-002	Data Locality on Shared Memory Computers Under Two Programming Models ; 93-06-08	1993-06
17	16-002	A Beginner's Guide to the Truckworld Simulator ; 93-06-09	1993-06
17	16-002	Data Prefetching for High-Performance Processors; 93-07-01	1993-07
17	16-002	Specification, Simulation, and Verification of Timing Behavior ; 93-07-02	1993-07
17	16-002	A More Formal Definition of Communicating Real-Time State Machines ; 93-08-01	1993-08
17	16-002	Three-Dimensional Shape From Color Photometric Stereo; 93-08-02	1993-08
17	16-002	Building Softbots for UNIX (Preliminary Report); 93-09-01	1993-09
17	16-002	The Interaction Between Static Typing and Frameworks ; 93-09-02	1993-09
17	16-002	Prism: A Case Study in Behavioral Entity-Relationship Modeling and Design; 93-09-03	1993-09
17	16-002	Kaleidoscope: A Constraint Imperative Programming Language ; 93-09-04	1993-09
17	16-002	The Meerkat Multicomputer ; 93-09-05	1993-09
17	16-002	UCPOP User's Manual (Version 2.0); 93-09-06	1993-09
17	16-002	The Truckworld Manual ; 93-09-08	1993-09
17	16-002	Protocol Compilation: High-Performance Communication for Parallel Programs ; 93-09-09	1993-09
17	16-002	On the Recognition of Arabic Documents ; 93-10-01	1993-10
17	16-002	Complexity of Sub-Bus Mesh Computations ; 93-10-02	1993-10
17	16-002	Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five; 93-10-03	1993-10
17	16-002	Impact of Sharing-Based Thread Placement on Multithread Architectures ; 93-10-04	1993-10
17	16-002	Multiresolution Analysis for Surfaces of Arbitrary Topological Type ; 93-10-05	1993-10
17	16-002	Processor Allocation Policies for Message-Passing Parallel Computers ; 93-11-01	1993-11
17	16-002	Evaluating Runtime-Compiled Value-Specific Optimizations; 93-11-02	1993-11
17	16-002	The Challenges of Mobile Computing ; 93-11-03	1993-11
17	16-002	Planning with Continuous Change ; 93-12-01	1993-12
17	16-002	Multiresolution Tiling ; 93-12-02	1993-12
17	16-002	Multicomputer Interconnection Network Channel Design ; 93-12-03	1993-12
18	16-002	Probabilistic Planning with Information Gathering and Contingent Execution; 93-12-04	1993-12
18	16-002	Concord: Re-Thinking the Division of Labor in a Distributed Shared Memory System; 93-12-05	1993-12
18	16-002	Performance of User-Level Communication on Distributed-Memory Multiprocessors with an Optimistic Protocol; 93-12-06	1993-12
18	16-002	Codebook Organization to Enhance Maximum A Posteriori Detection of Progressive Transmission of Vector Quantized Images over Noisy Channels ; 93-12-07	1993-12
18	16-002	Faster Dynamic Linking for SPARC VS and System V.4; 93-12-08	1993-12
18	16-002	Abstractions for Portable, Scalable Parallel Programming ; 93-12-09	1993-12
18	16-002	Piecewise Smooth Surface Reconstruction; 94-01-01	1994-01
18	16-002	Tractable Closed World Reasoning with Updates; 94-01-02	1994-01
18	16-002	To Sense or Not to Sense? (A Planner's Question); 94-01-03	1994-01
18	16-002	A Parallel Trace-Driven Simulator: Implementation and Performance ; 94-01-04	1994-01
18	16-002	Importance-Driven Wavelet Radiance ; 94-01-05	1994-01
18	16-002	Multiresolution Curves; 94-01-06	1994-01
18	16-002	Interactive Pen-and-Ink Illustration; 94-01-07	1994-01
18	16-002	Computer-Generated Pen-and-Ink Illustration; 94-01-08	1994-01
18	16-002	Multiresolution Painting and Compositing ; 94-01-09	1994-01
18	16-002	Restructuring Arrays for Efficient Parallel Loop Execution; 94-02-01	1994-02
18	16-002	An Algorithm for Exact Bounds on the Time Separation of Events in Concurrent Systems; 94-02-02	1994-02
18	16-002	On Scalable State-Based Specifications for Real-Time Systems ; 94-02-03	1994-02
18	16-002	The Case for Chaotic Adaptive Routing ; 94-02-04	1994-02
18	16-002	Identifying Profitable Specialization in Object-Oriented Languages ; 94-02-05	1994-02
18	16-002	Typechecking and Modules for Multi-Methods; 94-03-01	1994-03
18	16-002	A New Data Structure for Fast Approximate Matching ; 94-03-02	1994-03
18	16-002	SPIN - An Extensible Microkernel for Application-Specific Operating System Services; 94-03-03	1994-03
18	16-002	Interface Timing Verification with Combined Max and Linear Restraints; 94-03-04	1994-03
18	16-002	Measurement and Application of Dynamic Receiver Class Distributions ; 94-03-05	1994-03
18	16-002	Testing Asynchronous Circuits: A Survey; 94-03-06	1994-03
18	16-002	Constraints and Object Identity ; 94-03-07	1994-03
18	16-002	Pin Assignment for Multi-FPGA Systems ; 94-04-01	1994-04
18	16-002	A Group Structuring Mechanism for a Distributed Object-Oriented Language ; 94-04-02	1994-04
18	16-002	An Architecture-Adaptive, Performance-Driven Router for FPGAs; 94-05-01	1994-05
18	16-002	Design and Evaluation of a Subblock Cache Coherence Protocol for Bus-Based Multiprocessors; 94-05-02	1994-05
18	16-002	Self-Tuned Clocks and Crystal Clocks ; 94-05-03	1994-05
18	16-002	Using Assertions for Validating, Verifying and Monitoring Real-Time Systems ; 94-05-04	1994-05
18	16-002	A Performance Evaluation of Lock-Free Synchronization Protocols ; 94-05-05	1994-05
18	16-002	The Design of an Interactive Visualization Tool for Exploring Image Convolution; 94-05-06	1994-05
18	16-002	A Self-Accelerating Packet Service Discipline for Low-Delay Service to Bursty Flows ; 94-05-07	1994-05
18	16-002	Surface Reconstruction from Unorganized Points ; 94-06-01	1994-06
18	16-002	Experiences with the UWTester in Computer Science and Engineering Education; 94-06-02	1994-06
18	16-002	Exploiting Shared Memory for Protected Services; 94-06-03	1994-06
18	16-002	Automatic Synthesis of Device Drivers for Hardware/Software Co-design; 94-06-04	1994-06
18	16-002	Lecture Notes on Message Routing in Parallel Machines; 94-06-05	1994-06
18	16-002	The Meerkat Multicomputer: Tradeoffs in Multicomputer Architecture; 94-06-06	1994-06
18	16-002	Minimal Adaptive Routing on the Mesh with Bounded Queue Size; 94-07-03	1994-07
18	16-002	Self-Explanatory Simulation for an Electronic Encyclopedia; 94-07-06	1994-07
18	16-002	Mediators: Easing the Design and Evolution of Integrated Systems; 94-08-01	1994-08
18	16-002	The PRESTO Application Suite; 94-09-01	1994-09
18	16-002	Optimizing Static Calendar Queues ; 94-09-02	1994-09
18	16-002	Reflecting Source Code Relations in Higher-Level Models of Software Systems; 94-09-03	1994-09
18	16-002	Scheduling the Issues in the Co-Synthesis of Reactive Real-time Systems ; 94-09-04	1994-09
18	16-002	Reducing False Sharing on Shared Memory Multiprocessors Through Compile Time Data Transformations; 94-09-05	1994-09
18	16-002	A Framework for Selective Recompilation in the Presence of Complex Intermodule Dependencies ; 94-09-07	1994-09
18	16-002	Efficient Replication Management in Distributed Systems ; 94-09-08	1994-09
18	16-002	Constraint Satisfaction and Debugging for Interactive User Interfaces ; 94-09-10	1994-09
19	16-002	Wavelets for Computer Graphics: A Primer; 94-09-11	1994-09
19	16-002	Integrating Coherency and Recoverability in Distributed Systems; 94-09-12	1994-09
19	16-002	Global Illumination of Glossy Environments using Wavelets and Importance ; 94-10-01	1994-10
19	16-002	Northwest Laboratory for Integrated Systems Department of Computer Science and Engineering University of Washington Semiannual Technical Report No. 6; 94-10-02	1994-10
19	16-002	Optimistic Trace-Driven Simulation; 94-10-03	1994-10
19	16-002	A Comparative Study of Conservative and Optimistic Trace-driven Simulations; 94-10-04	1994-10
19	16-002	Scheduling Memory Constrained Jobs on Distributed Memory Parallel Computers ; 94-10-05	1994-10
19	16-002	Optimal One-Way Sorting on a One-Dimensional Sub-Bus Array; 94-11-01	1994-11
19	16-002	Wirec 3.2 Tutorial and Reference Manual; 94-11-02	1994-11
19	16-002	A Characterization of the Dynamic Markov Compression FSM with Finite Conditioning Contexts; 94-11-03	1994-11
19	16-002	Determination of DRAM Operating Limits with Applications in Self-Tuning; 94-11-07	1994-11
19	16-002	Wit: An Infrastructure for Wireless Palmtop Computing ; 94-11-08	1994-11
19	16-002	Optimization of Object-Oriented Programs Using Static Class Hierarchy Analysis ; 94-12-01	1994-12
19	16-002	A ZPL Programming Guide; 94-12-02	1994-12
19	16-002	Runtime Support for Dynamic Space-Based Applications on Distributed Memory Multiprocessors; 94-12-03	1994-12
19	16-002	TRIBORS: A Triplet-Based Object Recognition System; 95-01-01	1995-01
19	16-002	Multiresolution Analysis of Arbitrary Meshes; 95-01-02	1995-01
19	16-002	Declarative Camera Control for Automatic Cinematography; 95-01-03	1995-01
19	16-002	Automated Bargaining Agents (Preliminary Results); 95-01-04	1995-01
19	16-002	Fast Multiresolution Image Querying ; 95-01-06	1995-01
19	16-002	Clustering for Glossy Global Illumination; 95-01-07	1995-01
19	16-002	Extending the Applicability and Improving the Performance of Runtime Parallelization; 95-01-08	1995-01
19	16-002	Implementing Lightweight Remote Procedure Calls on the Mach 3 Operating System; 95-02-01	1995-02
19	16-002	Lightweight Source Model Extraction; 95-02-03	1995-02
19	16-002	Simultaneous Place and Route for Wire-Constrained FPGAs; 95-03-01	1995-03
19	16-002	Software Reflexion Models: Bridging the Gap Between Source and High-Level Models; 95-03-02	1995-03
19	16-002	Cost Effective Fault Tolerance for Network Routing ; 95-03-03	1995-03
19	16-002	The Chinook Hardware/Software Co-Synthesis System; 95-03-04	1995-03
19	16-002	Fast Median Filtering Algorithms for Mesh Computers; 95-03-05	1995-03
19	16-002	Packet Routing in Multiprocessor Networks; 95-03-06	1995-03
19	16-002	Mobisaic: An Information System for a Mobile Wireless Computing Environment ; 95-04-01	1995-04
19	16-002	Cost-Effective Data-Parallel Load Balancing ; 95-04-02	1995-04
19	16-002	Multiplayer Activities that Develop Mathematical Coordination; 95-04-03	1995-04
19	16-002	Achieving High-Latency, Low-Bandwidth Communication: Logic Emulation Interface ; 95-04-04	1995-04
19	16-002	High-Performance Embedded Systems: From Specification to Implementation Semiannual Technical Report No. 1; 95-05-01	1995-05
19	16-002	Fast Rendering of Complex Environments using a Spatial Hierarchy; 95-05-02	1995-05
19	16-002	Using C++ Templates to Implement Role-Based Designs; 95-07-02	1995-07
19	16-002	An Empirical Study of Static Call Graph Extractors ; 95-08-01	1995-08
19	16-002	Some Topics in Parallel Computation and Branching Programs ; 95-08-02	1995-08
19	16-002	Time Sensitive Objects: A Data-Oriented View of Real-Time Systems; 95-08-03	1995-08
19	16-002	A Sound, Fast, and Empirically-Tested Goal Recognizer; 95-08-04	1995-08
19	16-002	Maximizing Speedup Through Self-Tuning of Processor Allocation; 95-09-02	1995-09
19	16-002	Using Runtime Measured Workload Characteristics in Parallel Processor Scheduling; 95-10-01	1995-10
19	16-002	Improving Performance of Bus-Based Multiprocessors; 95-10-02	1995-10
20	16-002	ZPL vs. HFP: A Comparison of Performance and Programming Style ; 95-11-05	1995-11
20	16-002	An Overview of Compiler Techniques for Interprocedural Array Section Analysis ; 95-11-06	1995-11
20	16-002	On the Performance of a Bus-Based Multiprocessor Cluster Architecture; 95-12-01	1995-12
20	16-002	A Resolution-Independent Representation for Pen-and-Ink Illustrations ; 96-01-02	1996-01
20	16-002	A Scalable Comparison-Shopping Agent for the World-Wide Web; 96-01-03	1996-01
20	16-002	Planning to Gather Information ; 96-01-04	1996-01
20	16-002	Rendering Free-Form Surfaces in Pen and Ink; 96-01-05	1996-01
20	16-002	Rendering Parametric Surfaces in Pen and Ink; 96-01-05b	1996-01-
20	16-002	Hierarchical Image Caching for Accelerated Walkthroughs of Complex Environments; 96-01-06	1996-01
20	16-002	Near-optimal parallel prefetching and Caching ; 96-01-10	1996-01
20	16-002	Declarative Camera Control for Automatic Cinematography; 96-02-01	1996-02
20	16-002	Localized Partial Evaluation of Belief Networks ; 96-02-02	1996-02
20	16-002	The Influence of Caches on the Performance of Heaps ; 96-02-03	1996-02
20	16-002	Semi-automatic Update of Applications in Response to Library Changes; 96-03-01	1996-03
20	16-002	Fast Rendering of Subdivision Surfaces; 96-03-02	1996-03
20	16-002	Using Role Components to Implement Collaboration-Based Designs; 96-04-01	1996-04
20	16-002	Model Checking Large Software Specifications ; 96-04-02	1996-04
20	16-002	The Indigo Algorithm ; 96-05-01	1996-05
20	16-002	Real-Time Programming with Time-Stamped Event Histories; 96-05-02	1996-05
20	16-002	Optimization of Linear Max-Plus Systems with Application to Timing Analysis ; 96-05-04	1996-05
20	16-002	Whole-Program Optimization of Object-Oriented Languages ; 96-06-02	1996-06
20	16-002	A Value-Directed Approach to Planning; 96-06-03	1996-06
20	16-002	Assisting an Experimental Reengineering of Excel with Reflexion Models ; 96-07-01	1996-07
20	16-002	On the Use and Performance of Explicit Communication Primitives in Cache-coherent Multiprocessor Systems ; 96-07-02	1996-07
20	16-002	Reducing Network Latency Using Subpages in a Global Memory Environment; 96-07-03	1996-07
20	16-002	Array Restructuring for Cache Locality; 96-08-01	1996-08
20	16-002	Analysis and Application of Subdivision Surfaces; 96-08-02	1996-08
20	16-002	A Trace-Driven Comparison of Algorithms for Parallel Prefetching and Caching; 96-09-01	1996-09
20	16-002	Sorting by Parallel Insertion on a One-Dimensional Sub-Bus Array; 96-09-02	1996-09
20	16-002	On the Limitations of Ordered Representations of Functions; 96-09-03	1996-09
20	16-002	The Influence of Caches on the Performance of Sorting ; 96-10-01	1996-10
20	16-002	A User-Level Unix Server for the SPIN Operating System; 96-11-01	1996-11
20	16-002	Frameworks for Intra- and Interprocedural Dataflow Analysis ; 96-11-02	1996-11
20	16-002	RaPiD - A Configurable Computing Architecture from Compute-Intensive Applications ; 96-11-03	1996-11
20	16-002	Whole Program Optimization of Object-Oriented Languages; 96-11-05	1996-11
20	16-002	Interleaving sequences to maximize the minimum prefix sum; 96-12-01	1996-12
20	16-002	BeCecil, A Core Object-Oriented Language with Block Structure and Multimethods: Semantics and Typing; 96-12-02	1996-12
20	16-002	Orientable Textures for Image-Based Pen-And-Ink Illustration; 97-01-01	1997-01
20	16-002	A Performance Evaluation of Cluster Architectures ; 97-01-02	1997-01
20	16-002	A Generalization and Improvement to PPM's "Blending"; 97-01-10	1997-01
20	16-002	On the Limitations of Ordered Representations of Functions (Revised Version); 97-02-01	1997-02
20	16-002	Random Striping for News on Demand Servers ; 97-02-02	1997-02
20	16-002	Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition; 97-02-03	1997-02
20	16-002	The Cranium Network Interface Architecture: Support for Message Passing on Adaptive Packet Routing Networks ; 97-02-04	1997-02
20	16-002	An Executable Taxonomy of On-Line Modeling Algorithms; 97-02-05	1997-02
20	16-002	A Percolating State Selector for Suffix-Tree Context Models ; 97-02-06	1997-02
20	16-002	Adaptive Sites: Automatically Learning from User Access Patterns; 97-03-01	1997-03
20	16-002	On-Line Stochastic Processes in Data Compression; 97-03-02	1997-03
20	16-002	View-Based Rendering: Visualizing Real Objects from Scanned Range and Color Data; 97-04-01	1997-04
20	16-002	An Empirical Analysis of C Preprocessor Use ; 97-04-06	1997-04
20	16-002	Hierarchical Editing and Rendering of Subdivision Surfaces; 97-04-07	1997-04
20	16-002	Parallel Prefetching and Caching ; 97-07-03	1997-07
20	16-002	Access Control in Extensible Systems; 97-11-01	1997-11
20	16-002	Scheduling Policies to Support Distributed 3D Multimedia Applications; 97-11-03	1997-11
20	16-002	Providing Policy-Neutral and Transparent Access Control in Extensible Systems; 98-02-02	1998-02

Accession No. 17-019: University of Washington Computer Science and Engineering Department records, circa 1960s-1980sReturn to Top

1.14 cubic feet (1 box)

Scope and Content: Technical reports from the University of Washington Computer Science Department's Computer Information Center.

Restrictions on Access: Open to all users.

Restrictions on Use: Public Records (Use is unrestricted after access has been granted)

Acquisition Info: Hollis Near, 1994-06-24

Names and SubjectsReturn to Top

Subject Terms

Computer engineering--Study and teaching--Washington (State)--Seattle
Computer science--Study and teaching--Washington (State)--Seattle
Computer software--Study and teaching--Washington (State)--Seattle
Computer systems--Study and teaching--Washington (State)--Seattle
Technical reports--Washington (State)--Seattle--Specimens

Corporate Names

University of Washington. Department of Computer Science and Engineering--Archives
University of Washington. Research Computer Laboratory--Archives

Form or Genre Terms

Records (Documents)
Technical reports

Other Creators

Corporate Names
- University of Washington. University Archives

Names and SubjectsReturn to Top

Subject Terms

University Archives/Faculty Papers (University of Washington)

Archives West Finding Aid

Table of Contents