%A B. Chazelle
%A R. Cole
%A F. Preparata
%A C. Yap
%T New upper bounds for neighbor searching
%R Technical report CS-84-11
%I Brown University, Computer Science Department
%D 1984

%A B. Chazelle
%A D. T. Lee
%T On a circle placement problem
%R Technical report CS-84-12
%I Brown University, Computer Science Department
%D 1984

%A B. Chazelle
%T Fast searching in a real algebraic manifold with applications to
geometric complexity
%R Technical report CS-84-13
%I Brown University, Computer Science Department
%D 1984

%A B. Chazelle
%A H. Edelsbrunner
%T Optimal solutions for a class of point retrieval problems
%R Technical report CS-84-16
%I Brown University, Computer Science Department
%D 1984

%A Alessandro. Giacalone
%T Algebraic definitions in programming environments
%R Technical report CS-84-17
%I Brown University, Computer Science Department
%D 1984
%K CCS, Concurrent systems, Distributed systems, Formal definitions,
Integrated programming environments,
Milner's calculus of communicating systems, Program verification
%O PhD Thesis

%A Karen E. Smith
%A Elisabeth A. Waymire
%T Brown University's computerized classroom: an experiment in the
principles of courseware design
%R Technical report CS-84-18
%I Brown University, Computer Science Department
%D 1984

%A John E. Savage
%A Jeffrey Scott Vitter
%T Parallelism in space-time tradeoffs
%R Technical report CS-84-19
%I Brown University, Computer Science Department
%D 1984

%A Wen-Chin Chen
%A Jeffrey Scott Vitter
%T Deletion algorithms for coalesced hashing
%R Technical report CS-84-20
%I Brown University, Computer Science Department
%D 1984
%K Analysis of algorithms, Data structures, Information retrieval,
Preserve randomness, Searching

%A Robert Sedgewick
%A Jeffrey Scott Vitter
%T Shortest paths in Euclidean graphs
%R Technical report CS-84-21
%I Brown University, Computer Science Department
%D 1984

%A Jeffrey Scott Vitter
%T An efficient I/O interface for optical disks
%R Technical report CS-84-15
%I Brown University, Computer Science Department
%D 1985
%K B-trees, Input/output, Magnetic disks, Optical digital disks, Updates

%A Wen-Chin Chen
%T The design and analysis of coalesced hashing
%R Technical report CS-84-22
%I Brown University, Computer Science Department
%D 1985
%K Deletion algorithms, Direct chaining, Early-insertion coalesced hashing,
Late-insertion coalesced hashing, Preserve randomness, Searching,
Varied-insertion coalesced hashing
%O PhD Thesis

%A Eugene Charniak
%T Knowledge representation and the 1/plan-recognition-as-planning
theory
%R Technical report CS-85-01
%I Brown University, Computer Science Department
%D 1985

%A Mark E. Sommer
%A John E. Savage
%T SAS - a systolic array simulator
%R Technical report CS-85-02
%I Brown University, Computer Science Department
%D 1985

%A Karen E. Smith
%T Developing and evaluating a computer-assisted instruction dialogue
on
parameters
%R Technical report CS-85-04
%I Brown University, Computer Science Department
%D 1985

%A Christopher J. Van\ Wyk
%A Jeffrey Scott Vitter
%T The complexity of hashing with lazy deletion
%R Technical report CS-85-05
%I Brown University, Computer Science Department
%D 1985

%A Russell Lee Ellsworth
%T An ideographic system build and execute facility
%R Technical report CS-85-06
%I Brown University, Computer Science Department
%D 1985

%A James A. Hendler
%T Integrating marker-passing and problem-solving
%R Technical report CS-85-08
%I Brown University, Computer Science Department
%D 1985

%A Grace Meejoong Kim
%T A three dimensional graphics system for the stereotactic placement
of heavy-ion beams
%R Technical report CS-85-09
%I Brown University, Computer Science Department
%D 1985

%A Stanley B. Zdonik
%A Peter Wegner
%T A database approach to languages, libraries and environments
%R Technical report CS-85-10
%I Brown University, Computer Science Department
%D 1985

%A ?
%T Research requirement summaries for the comprehensive exam (1985)
%R Technical report CS-85-11
%I Brown University, Computer Science Department
%D 1985

%A George Lipsker
%T DEXEC - a distributed exec system
%R Technical report CS-85-12
%I Brown University, Computer Science Department
%D 1985