|
Student |
Advisor |
Thesis |
| 99 |
Czajkowski,
Grzegorz |
von
Eicken |
Resource
Control for Internet Servers |
|
Kotlyar,
Vladimir |
Pingali |
Relational
Algebraic Techniques for the Synthesis of Sparse Matrix Programs |
|
Mitra,
Mandar |
Cardie |
High-Precision
Information Retrieval |
|
Veksler,
Olga |
Zabih |
Efficient
Graph-based Energy Minimization Methods in Computer Vision |
| 98 |
Caldwell,
James |
Constable |
Decidability
Extracted: Synthesizing "Correct-by-Construction"
Decision Procedures form Constructive Proofs |
|
Crary,
Carl |
Constable |
Type-Theoretic
Methodology for Practical Programming Languages |
|
Ergun,
Ayse |
Rubinfeld |
General methods for
extending the scope of program testing |
|
Hayden, Mark |
Birman |
The Ensemble System |
|
Heng,
Wee-Liang |
Tardos |
Approximately
Optimal Elimination Orderings for Sparce Matrices |
|
Hickey,
Takako |
Schneider |
Availability
and Consistency in a Partitionable Low Bandwidth Network |
|
Huang,
Jing |
Zabih |
Color-Spatial
Image Indexing and Applications |
|
Kodukula,
Induprakas |
Pingali |
Data-Centric
Compilation |
|
Marschner,
Stephen |
Greenberg |
Inverse
Rendering for Computer Graphics |
|
Naumov,
Pavel |
Constable |
Formalizing
Reference Types in NuPRL |
|
Ravikumar, S |
Rubinfeld |
New Methods in Program
Checking |
|
Sharma,
Rosen |
S. Keshav |
Internet
TV |
|
Summers,
Kristen |
Hopcroft |
Automatic
Discovery of Logical Document Structure |
|
van den
Berg, Aswin |
Teitelbaum |
Data
Abstraction by Program Transformation in
a Higher-Order Attribute-Grammar Framework |
|
Viswanath,
Divakar |
Trefethen |
Lyapunov
Exponents from Random Fibonacci Sequences to the Lorenz Equations |
|
Walter,
Bruce |
Greenberg |
Density
Estimation Techniques fro Global Illumination |
| 97 |
Basu, Anindya |
Von Eicken |
A Language-Based Approach
to Protocol Construction |
|
Bohringer,
Karl-Friedrich |
Donald |
Programmable
Force Fields for Distributed Manipulation, and Their Implementation Using Micro-fabricated
Actuator Arrays |
|
Dean,
Dawson |
Zippel |
Integrating
Compound Documents, File Systems, and Object Stores IN A Microstorage Architecture |
|
Hunter,
Scott |
Subramanian |
The
Solution and Application of Safety MDPs |
|
Jennings,
James |
Donald |
Distributed
Manipulation with Mobile Robots |
|
Karr,
David |
Birman |
Specification,
Composition, and Automated Verification of Layered Communication Protocols |
|
Moten,
Roderick |
Constable |
Concurrent
Refinement in Nuprl |
|
Pitsianis,
Nikos |
Van
Loan |
The
Kronecker Product in Approximation and Fast Transform Geration |
|
Scharstein,
Daniel |
Huttenlocher |
View
Synthesis Using Sterio Vision |
|
Singhal,
Amitabh |
Cardie |
Term
Weighting Revisited |
|
Stodghill,
Paul |
Pingali |
A
Relational Approach to the Automatic Generation of Sequential Sparse matrix Codes |
|
Stoller, Scott |
Schneider |
A Method and Tool for Analyzing
Faulty-Tolerance in Systems |
 |
Sturgill, David |
Segre |
Nagging: A General, Fault-Tolerant Approach to
Parallel Search Pruning |
| 96 |
Alvisi, Lorenzo |
Toueg |
Understanding the Message Logging Paradigm for
Masking Process Crashes |
|
Branch, Mary Ann |
Coleman |
Inexact Reflective Newton Methods for
Large-Scale Optimization Subject to Bound Constraints |
|
Bressoud, Thomas |
Schneider |
Building a Virtually Fault-Tolerant System |
|
Dsourza, Ashvin |
Bloom |
Model Checking and Expressiveness for First
Order Process Algebras |
|
Glade, Bradford |
Birman |
A Scalable Architecture for Publish/Subscribe
Communication in Distributed Systems |
|
Kopke, Peter |
Henzinger |
The Theory of Rectangular Hybrid Automata |
|
Liu, Yanhong |
Teitelbaum |
Incremental Computation: A Semantics-Based
Systematic Transformational Approach |
|
Sabel, Laura |
Marzullo |
Approximating Perfect Failure Detectors in
Asynchronous Distributed Systems |
| 95 |
Allan, James |
Salton |
Automatic Hypertext Construction |
|
Briggs, Amy |
Donald |
Efficient Geometric Algorithms for Robot
Sensing and Control |
 |
Brown, Russell |
Donald |
Localization, Mapmaking, and Distributed
Manipulation wiht Flexible, Robust Mobile Robots |
|
Buckley, Christopher |
Salton |
Massive Query Expansion for Relevance Feedback |
|
Cooper, David |
Birman |
The Design and Implementation of a Private
Message Service for Mobile Computers |
|
Ho, Pei-Hsin |
Henzinger |
Automatic Analysis of Hybrid Systems |
|
Hopcroft, Michael |
Huttenlocher |
A Geometrical Approach to Model-Based Vision |
|
Hoppe,
Bruce |
Tardos-OR
|
Efficient
Dynamic Network Flow Algorithms |
|
Hunt,
Guerney |
Birman |
Multicast
Flow Control on Local Area Networks |
|
Jackson,
Paul |
Constable |
Enhancing
the NUPRL Proof Development System and Applying it to Computational Abstract Algebra |
|
Kalanfar,
Michael |
Birman |
Issues
in Ordered Multicast Performance: A Simulation Study |
|
Rucklidge,
William |
Huttenlocher |
Efficient
Computation of the Minimum Hausdorff Distance for Visual Recognition |
|
Stefansson,
Kjartan |
Kozen |
Newtonian
Graphs, Riemann Surfaces and Computation |
|
Weber,
Samuel |
Bloom |
Process
Algebras and Meta-algebras: Theory and Practice |
| 94 |
Chapman,
Richard |
Brown-EE |
Verified
High Level Synthesis |
 |
Chari,
Suresh |
Hartmanis |
Randomness
as a Computational Resource: Issues in Efficient Computation |
|
Chen,
Ze-Wei |
Constable |
Efficient
Access to Knowledge Via Forward Chaining Tactics |
|
Efremidis,
Sofoklis |
Gries |
On
Program Transformations |
|
Jayanti,
Prasad |
Toueg |
Fault-Tolerant
Wait-Free Implementations and Robust Wait-Free Hierarchies |
|
Johnson,
Richard |
Pingali |
Efficient
Program Analysis Using Dependence Flow Graphs |
|
Lischinski,
Daniel |
Greenberg |
Accurate
and Reliable Algorithms for Global Illumination |
|
Moudgill,
Mayan |
Pingali |
Implementing
and Exploiting Static Speculation on Multiple Instruction Issue Processors. |
|
Novins,
Kevin |
Greenberg |
Towards
Accurate and Efficient Volume Rendering |
|
Rohatgi,
Pankaj |
Hartmanis |
On
Properties of Random Reductions |
|
Smits,
Brian |
Greenberg |
Efficient
Hierarchical Radiosity in Complex Environments |
|
Underwood,
Judith |
Constable |
Aspects
of the Computational Content of Proofs |
| 93 |
Budhiraja,
Navin |
Marzullo |
The
Primary Backup Approach: Lower and Upper Bounds. |
|
Chandra,
Tushar |
Toueg |
Unreliable
Failure Detectors for Asynchronous Distributed Systems |
|
Feldman,
Ronen |
Segre |
Probabilistic
Revision of Logical Doman Theories |
|
Krumvieda,
Clifford |
Bloom |
Distributed
ML: Abstractions for Efficient & Fault-Tolerant Programming |
|
Li,
Wei |
Pingali |
Compiling
for NUMA Parallel Machines |
|
Panconesi,
Alessandro |
Shmoys-OR |
Locality
in distributed computing |
|
Piatko,
Christine |
J.
Mitchell |
Geometric
Bicriteria Optimal Path Problems |
|
Reiter,
Michael |
Birman |
A
Security Architecture for Fault-Tolerant Systems |
 |
Ressler,
Eugene |
Kozen |
ALEX
--- A Paradigm for Expressing and Compiling Matrix Functions |
|
Ricciardi,
Aleta |
Birman |
The
Group Membership Problem in Asynchronous Systems |
|
Srinivasan,
Aravind |
Shmoys |
Techniques
for Probabilistic Analysis and Randomness-Efficient Computation |
|
Sundaram,
Sridhar |
Hopcroft |
Fast
Algorithms for N-Body Simulation |
|
Tampieri,
Filippo |
Greenberg |
Discontinuity
Meshing for Radiosity Image Synthesis |
|
Wayner,
Peter |
Huttenlocher |
Using
Algebraic Invariants and Grouping to Speed Object Recognition in a Single, Two-dimensional
Image |
|
Webber,
Adam |
Subramanian |
Principled
Optimization of Functional Programs |
| 92 |
Baraff,
David |
Greenberg |
Dynamic
Simulation of Non-penetrating Rigid Bodies |
|
Bay,
Paul |
Bilardi |
Area-Universal
Interconnection Networks for VLSI Parallel Computers |
|
Beck,
Micha |
Pingali |
Translating
FORTRAN to Dataflow Graphs |
|
Dubhashi,
Devdatt |
Kozen |
Algorithmic
Investigations In P-adic Fields |
|
Gopal,
Ajei |
Toueg |
Fault-tolerant
Broadcasts and Multicasts: The Problem of Inconsistency and Contamination |
|
Kapur,
Shyam |
Bilardi |
Computational
Learning of Languages |
|
Moore,
Douglas |
Vavasis |
Simplicial
Mesh Generation with Applications |
|
Ranjan,
Desh |
Hartmanis |
Issues
in NP-optimization and Approximation |
|
Reppy,
John |
Teitelbaum |
Higher-Order
Concurrency |
|
Rus,
Daniela |
Hopcroft |
Fine
Motion Planning for Dexterous Manipulation |
|
Siegel,
Alexander |
Marzullo |
Performance
in Flexible Distributed File Systems |
 |
Wilk,
Michael |
Hopcroft |
Efficient
Object-Oriented Constraint Solving for Complex Models |
|
Wood,
Mark |
Marzullo |
Fault-Tolerant
Management of Distributed Applications Using the Reactive System Architecture |
|
Xavier,
Patrick |
Donald |
Provably-Good
Approximation Algorithms For Optimal Kinodynamic Robot Motion Plans |
| 91 |
Chang,
Richard |
Hartmanis |
On
the Structure of NP Computations under Boolean Operators |
|
Field,
John |
Teitelbaum |
Incremental
Reduction and Semantics |
|
Hendrickson,
Bruce |
Coleman |
The
Molecule Problem: Combinatorial Ideas in a Continuous Setting |
|
Jagadeesan,
Radhakrishnan |
Panangaden |
Investigations
Into Abstraction And Concurrency |
|
Lutz,
Earlin |
Ingraffea-CEE |
Numerical
Methods for Hypersingular and Near-Singular Boundary Integrals in Fracture Mechanics |
 |
Smith,
Geoffrey |
Gries |
Polymorphic
Type Inference for Languages with Overloading and Subtyping |
|
Stephenson,
Patrick |
Birman |
Fast
Ordered Multicast |
|
Stewart,
James |
Hopcroft |
The
Theory and Practice of Robust Geometric Computation, or, How To Build Robust Solid
Modelers |
| 90 |
Aizikowitz,
Jacob |
Schneider |
Replicated
Objects-Design and Verification |
|
Araya,
Jose |
Salton |
Interactive
Query Formulation and Feedback Experiments in Information Retrieval |
|
Basin,
David |
Constable |
Building
Problem Solving Environments in Constructive Type Theory |
|
Elkan,
Charles |
Panangaden |
Automated
Inductive Reasoning about Logic Programs |
|
Hendren,
Laurie |
Nicolau |
Parallelizing
Programs with Recursive Data Structures |
|
Herley,
Kieran |
Bilardi |
Simulating
Shared Memory on Distributed Models of Parallel Computation |
|
Kane,
Kenneth |
Birman |
Log-Based
Recovery in Asynchronous Distributed Systems |
|
Khuller,
Samir |
Vazirani |
Efficient
Parallel Algorithms for Disjoint Paths and Connectivity |
 |
Klarlund,
Nils |
Kozen |
Progress
Measures and Finite Arguments for Infinite Computations |
|
Murthy,
Chetan |
Constable |
Extracting
Constructive Content From Classical Proofs |
|
Novick,
Mark |
Kozen |
Parallel
Algorithms for Intersection Graphs |
|
Peckhan,
Stephen |
Teitelbaum |
Incremental
Attribute Evaluation and Multiple Subtree Replacements |
|
Rogers,
Anne |
Pingali |
Process
Decomposition through Locality of Reference |
|
Russell,
James |
Panangaden |
Full
Abstraction and Fixed-Point Principles for Indeterminate Computation |
|
Shah,
Amitabh |
Marzullo |
Exploiting
Trade-Offs in the Design of Fault-Tolerant Distributed Databases |
|
Shanbhogue,
Vasant |
Panandaden |
The
Expressiveness of Indeterminate Dataflow Primitives |
|
Smith,
Marla |
Salton |
Aspects
of the P-Norm Model of Information Retrieval: Syntactic Query Generation, Efficiency, And
Theoretical |
 |
Taylor,
Kimberly |
Panangaden |
Knowledge
and Inhibition in Asynchronous Distributed Systems |
|
Zaring,
Alan |
Teiltelbaum |
Parallel
Evaluation in Attribute Grammar-Based Systems |
| 89 |
Cremer,
James |
Hopcroft |
An
Architecture for General Purpose Physical System Simulation-Integrating Geometry,
Dynamics, and Control |
|
Curtis,
Pavel |
Demers |
Constrained
Quantification in Polymorphic Type Analysis |
|
Dickerson,
Matthew |
Kozen |
The
Functional Decomposition of Polynomials |
|
Hafsteinsson,
Hjaimtyr |
Gilbert |
Parallel
Sparse Cholesky Factorization |
|
Ierardi,
Douglas |
Kozen |
Solving
systems of polynomial equations, with applications to computational algebraic geometry |
|
Kochevar,
Peter |
Greenberg |
Computer
Graphics on Massively Parallel Machines |
|
Moitra,
Dipen |
Bilardi |
Parallel
Algorithms for Image Processing |
|
Smith,
Scott |
Constable |
Partial
Objects in Type Theory |
|
Torgersen,
Solveig |
Bitton |
Automatic
Design of Relational Databases |
 |
Vander
Zanden, Bradley |
Kozen |
Incremental
Constraint Satisfaction & its Application to Graphical Interface |
|
Walz,
Janet |
Johnson |
Extending
Attribute Grammar and Type Inference Algorithms |
| 88 |
Aiken,
Alexander |
Nicolau |
Compaction-Based
Parallelization |
|
Bischof,
Christian |
Van
Loan |
QR
Factorization Algorithms for Coarse-Grained Distributed Systems |
|
Griffin,
Timothy |
Constable |
Notational
Definition and Top-Down Refinement for Interactive Proof Development Systems |
|
Hook,
James |
Demers |
Abstract
Types & Dependence in Programming Languages |
|
Howe,
Douglas |
Constable |
Automating
Reasoning in an Implementation of Constructive Type Theory |
|
Kadin,
James |
Hartmanis |
Restricted
Turing Reducibilities & the Structure of the Polynomial Time Hierarchy |
|
Knoblock,
Todd |
Constable |
Metamathematical
Extensibility in Type Theory |
|
Mc
Curley, Ernest |
Schneider |
An
Assertional Characterization of Serializability and Locking |
|
Neiger,
Gilbert |
Toueg |
Techniques
for Simplifying the Design of Distributed Systems |
|
Neirnyck,
Anne |
Panangaden |
Static
Analysis of Aliases & Side Effects in Higher Order Languages |
|
Pugh,
William |
Teitelbaum |
Incremental
Computation and the Incremental Evaluation of Functional Programs |
|
Schmuck,
Frank |
Birman |
The
Use of Efficient Broadcast Protocols in Asynchronous Distributed Systems |
|
Turbyfill,
Carolyn |
Biffon |
The
Use of Efficient Broadcast Protocols in Asynchronous Distributed Systems |
| 87 |
Allen,
Stuart |
Constable |
A
Non-Type-Theoretic Semantics for Type-Theoretic Language |
|
Barford,
Lee |
Hopcroft |
A
Graphical, Language-Based Editor for Generic Solid Models Represented by Constraints |
|
Cleaveland,
Walter |
Constable |
Type-Theoretic
Models of Concurrency |
 |
El
Abbadi, Amr |
Toueg |
A
Paradigm for Concurrency Control Protocol for Distributed Databases |
|
Hemachandra,
Lane |
Hartmanis |
Counting
in Structural Complexity Theory |
|
Hoover,
Roger |
Teitelbaum |
Incremental
Graph Evaluation |
|
Johnson,
Edward |
Schneider |
Symmetry
in Distributed Systems |
|
Johnstone,
John |
Hopcroft |
The
Sorting of Points Along an Algebraic Curve |
|
Koo,
Richard |
Toueg |
Techniques
for Simplifying the programming of Distributed Systems |
|
Krentel,
Mark |
Vazirani |
The
Complexity of Optimization Problems |
|
Mendler,
Paul |
Constable |
Inductive
Definition in Type Theory |
|
Palmer,
Richard |
Demers |
Computational
Complexity of Motion and Stability of Polygons |
|
Park,
Haesun |
Luk |
On
the equivalence and convergence of parallel Jacobi SVD algorithms |
|
Prins,
Jan |
Gries |
Partial
Implementations in Program Derivation |
|
Schwartzbach,
Michael |
Panangaden |
A
Category Theoretic Analysis of Predicative Type Theory |
|
Seidel,
Raimund |
Gilbert |
Output-Size
Sensitive Algorithms For Constructive Problems In Computational Geometry |
 |
Widom,
Jennifer |
Gries |
Trace-based
Networks Proof Systems: Expressiveness & Completeness |
|
Zmijewski,
Earl |
Gilbert |
Sparse
Cholesky Factorization on a Multiprocessor |
| 86 |
Alpern,
Bowen |
Schneider |
Proving
Temporal Properties of Concurrent ProgramsP: A Non-Temporal Approach |
|
Cai,
Jing-Yi |
Hartmanis |
On
Some Most Probable Separations of Complexity Classes |
|
Drummond,
Rogerio |
Babaoglu |
Impact
of Communication Networks on Fault-Tolerant Distributed Computing |
|
Joseph,
Thomas |
Birman |
Impact
of Communication Networks on Fault-Tolerant Distributed Computing |
|
Longpre,
Luc |
Hartmanis |
Resource
Bounded Kolmogorov Complexity, A Link between Computational Complexity & Information
Theory |
|
Natatajan,
Balas |
Hopcroft |
On
Moving and Orienting Objects |
|
Raeuchle,
Thomas |
Birman |
Efficient
Concurrency Control for Libraries of Typed Objects |
|
Sasaki,
James |
Constable |
Extracting
Efficient Programs From Constructive Proofs |
 |
Srikanth,
T. |
Toueg |
Designing
Fault-tolerant Algorithms for Distributed Systems using Communication Primitives |
|
Voorhees,
Ellen |
Salton |
The
Effectiveness & Efficiency of Agglomerative Hierarchic Clustering in Document
Retrieval |
|
Warren,
Joe |
Hopcroft |
On
Algebraic Surfaces Meeting with Geometric Continuity |
| 85 |
Bracha,
Gabriel |
Toueg |
Randomized
Agreement Protocols & Distributed Deadlock Detection |
|
Edenbrandt,
Anders |
Gilbert |
Combinatorial
Problems in Matrix Computation |
|
Harper,
Robert |
Constable |
Aspects
of the Implementation of Type Theory |
|
Horowtiz,
Susan |
Teitelbaum |
Generating
Language-Based Editors: A Relationally-Attributed Approach |
 |
Jacobs,
Dean |
Gries |
General
Correctness: A Unification of Partial and Total Correctness |
|
Li,
Ming |
Hartmanis |
Lower
Bounds in Computational Complexity |
|
Nguyen,
Van |
Gries |
A
Theory of Processes |
|
Perry,
Kenneth |
Toueg |
Early
Stopping Protocols for Fault-Tolerant Distributed Agreement |
|
Stansifer,
Ryan |
Constable |
Representing
Constructive Theories in High-Level Programming Languages |
| 84 |
Bajaj,
Chanderjit |
Hopcroft |
Geometric
Optimization and Computational Complexity |
|
Boehm,
Hans-Juerge |
Demers |
A
Logic for the Russell Programming Language |
|
Dietz,
Paul |
Hopcroft |
Intersection
Graph Algorithms |
|
Vanderbilt,
Peter |
Gries |
Program
Development Using Refinement Logic |
|
Wilfong,
Gordon |
Hopcroft |
Multiple
Object Motion Planning |
|
Wright,
David |
Skeen |
Managing
Distributed Databases in Partitioned Networks |
| 83 |
Dwork,
Cynthia |
Hopcroft |
Bounds
on Fundamental Problems in Parallel and Distributed Computation |
 |
Fox,
Edward |
Salton |
Extending
the Boolean & Vector Space Models of Information Retrieval w/P-Norm Queries &
Multiple Concept Types |
|
Murtagh,
Thomas |
Andrews |
A
Data Abstraction Language for Concurrent Programming |
|
Sewelson,
Vivian |
Hartmanis |
A
Study of the Structure N |
| 82 |
Cole,
Richard |
Hopcroft |
Two
Problems in Graph Theory |
|
Hood,
Robert |
Cartwright |
The
Efficient Implementation of Very-high-level Programming Language Constructs |
|
Reps,
Thomas |
Teitelbaum |
Generating
Language-Based Environments |
|
Schlichting,
Richard |
Schneider |
Axiomatic
Verification to Enhance Software Reliability |
| 81 |
Archer,
James |
Conway |
The
Design and Implementation of a Cooperative Program Development Environment |
|
Johnson,
Scott |
Constable |
A
Computer System for Checking Proofs |
 |
Kraftt,
Dean |
Constable |
Avid:
A System for the Interactive Development of Verifiably Correct Programs |
|
Mahaney,
Stephen |
Hartmanis |
Sparse
NP-Complete Sets |
|
Melville,
Robert |
Gries |
Asymptotic
Complexity of Iterative Computation |
|
Smith,
Douglas |
Salton |
Switched
Broadcast Communication Networks |
|
Wu,
Harry |
Salton |
On
Query Formulation in Information Retrieval |
| 80 |
Chan,
Tat-Hung |
Constable |
Reversal-Bounded
Computations |
|
Furst,
Merrick |
Hopcroft |
A
Subexponential Algorithm for Trivalent Graph Isomorphism |
|
Hauser,
Carl |
Constable |
Specification
and Verification of Communication in Parallel Systems |
|
Holm,
John |
Gries |
Floating-Point
Arithmetic and Program Correctness Proofs |
|
Immerman,
Neil |
Hartmanis |
First
Order Expressibility as a New Complexity Measure |
|
Levin,
Gary |
Gries |
Proof
rules for Communicating Sequential Processes |
|
Siegel,
Morris |
Donahue |
Proving
Properties of Snobol4 Patterns |
| 79 |
Bates,
Joseph |
Demers |
A
Logic for Correct Program Development |
|
Brassard,
Gilles |
Hopcroft |
Relativized
Cryptography |
|
Fortune,
Steven |
Hopcroft |
Topics
in Computational Complexity |
|
Liu,
Lishing |
Demers |
Essential
Uses of Expressions in Set-Oriented Languages |
 |
Orr,
Patrick |
Donahue |
Verification
of Encapsulated Implementations of Algebraically Specified Data Types |
|
Wyllie,
James |
Hopcroft |
The
Complexity of Parallel Computations |
| 78 |
Eland,
Nancy |
Conway |
Language-Based
Access Control Mechanisms for Shared Databases |
|
Reitman,
Richard |
Andrews |
Information
Flow in Parallel Programs: An Axiomatic Approach |
|
Schmidt,
Erik |
Hartmanis |
Succinctness
of Descriptions of Context-Free, Regular and Finite Languages |
|
Wong,
Yinchun |
Salton |
Studies
on Clustered Files |
| 77 |
Berman,
Leonard |
Moore |
Polynomial
Reducibilities and Complete Sets |
|
Duhne,
Ricardo |
Severance |
Optimal
Design of a Generalized File Organization |
|
Jones,
Gerald |
Williams |
Formal
Semantic Descriptions of Applicative Languages |
|
Kozen,
Dexter |
Hartmanis |
Complexity
of Finitely Presented Algebras |
|
London,
Thomas |
Donahue |
The
Semantics of Information Flow |
 |
McGraw,
James |
Andres |
Languages
Faeatures for Process Interaction & Access Control |
|
Mei,
Howell |
Dennis |
An
Analysis & Implementation of Davidon's Techniques for Unconstrained Optimization |
|
Schnabel,
Robert |
Dennis |
Analyzing
and Improving Quasi-Newton Methods for Unconstrained Optimization |
|
Solomon,
Marvin |
Demers |
Theoretical
Issues in the Implementation of Programming Languages |
|
Tai,
Kuo-chung |
Gries |
Syntactic
Error Correction In Programming Languages |
| 76 |
Clarke,
Edmund |
Constable |
Completeness
and Incompleteness Theorems for Hoare-like Axiom Systems |
|
Crawford,
Robert |
Salton |
Automatic
Dictionary Construction & Updating |
|
Howell,
Thomas |
Hopcroft |
Tensor
Rank and the Complexity of Bilinear Forms |
|
Lafuente,
Juan |
Gries |
The
Specification of Data-Directed Interactive User-Computer Dialogues |
|
O'Donnell,
Michael |
Constable |
Reduction
Strategies in Subtree Replacement Systems |
 |
Pansiot,
Jean-Jacques |
Hopcroft |
Some
Decidable Cases of the Reachability Problem for Vector Addition Systems |
|
Yang,
Chung-shu |
Salton |
Directory
design & Record Allocation for List & Cluster Files |
| 75 |
Fischer,
Charles |
Conway |
On
Parsing Context Free Languages in Parallel Environments |
|
Galil,
Zvi |