]> rg.06.100 Records of the Department of Computer Science 1987-1990 06.100 Aravinda Pillalamarri The Ferdinand Hamburger Archives, The Milton S. Eisenhower Library, The Johns Hopkins University
3400 N. Charles Street Baltimore, MD 21218 USA Phone: (410) 516-8323
Machine-readable finding aid encoded by Marius Stan Finding aid written in English Records of the Department of Computer Science 1987-1990 Record Group Number 06.100 The Ferdinand Hamburger ArchivesThe Milton S. Eisenhower Library The Johns Hopkins University Contact Information The Ferdinand Hamburger Archives The Milton S. Eisenhower Library The Johns Hopkins University 3400 North Charles Street Baltimore, MD 21218 (410) 516-8323 Aravinda Pillalamarri Marius Stan

©2005 The Johns Hopkins University

 Descriptive Summary Record Group Number 06.100 Records of the Department of Computer Science 1987-1990 Department of Computer Science, The Johns Hopkins University The Ferdinand Hamburger Archives, The Milton S. Eisenhower Library, The Johns Hopkins University 1.5 cubic feet (4.5 document cases) English The records of the Department of Computer Science consist solely of Technical Reports published by the Department between 1987 and 1990. These reports are arranged by report number; thus, if a report is numbered 89/14 it is the fourteenth report of the year 1989. A few reports do not have a report number and have been filed at the end of the series in alphabetical order by the author's last name. Administrative Information Provenance

The records were sent to the Archives by the Department of Computer Science.

Accession Number

90.48

 Use Restrictions

none.

 Preferred Citation

The Ferdinand Hamburger Archives of The Johns Hopkins University, Record Group Number 06.100, Department of Computer Science, file title and inclusive dates.

History

In the fall of 1986 the Department of Electrical Engineering and Computer Science split into the Department of Computer Science and the Department of Electrical and Computer Engineering. The Department of Computer Science concentrates on theory, language, programming, and artificial intelligence and systems, whereas the Department of Electrical and Computer Engineering concentrates on computer engineering, systems and communications, quantum electronics, and electromagnetic systems. Recently the Department of Computer Science has expanded to emphasize algorithms, graphics, and geometry. Gerald Masson has been chairperson of the Department of Computer Science since January 1987.

List of Faculty: Richard Beigel, Assistant Professor, 1986-1989 H c, Anna, Assistant Professor, 1986-1987 Simon Kasif, Assistant Professor, 1986- S. Rao Kosaraju, Professor, 1986- Gerald M. Masson, Professor (Chair), 1986- Joseph O'Rourke, Associate Professor, 1986-1988 Michael T. Goodrich, Assistant Professor, 1987- Gregory Sullivan, Assistant Professor, 1987-1988, 1989- Robert E. Glaser, Lecturer, 1987-1990 Terrence J. Sejnowski, Associate Professor, 1987-1989 John K. Johnstone, Assistant Professor, 1987- E.S. Panduranga, Assistant Professor, 1987-1990 Scott F. Smith, Assistant Professor, 1988- Amy E. Zwarico, Assistant Professor, 1988- Steven L. Salzberg, Assistant Professor, 1989- Edward R. Scheinerman, Associate Professor (joint appointment, Mathematical Sciences), 1990- Daniel J. Barrett, Lecturer, 1990-1991 Lawrence B. Wolff, Assistant Professor, 1990- Arimond Winslow, Assistant Professor, (joint appointment, Biomedical Engineering), 1991-

Description of Series/Container List Records of the Department of Computer Science Records of the Department of Computer Science,

Box Folder Contents 1 1 Beigel, Richard, A Structural Theorem that Depends Quantitatively on the Complexity of SAT, TR87/02 1 2 Delcher & Kasif, Some Results on the Complexity of Exploiting Data-Dependency in Parallel Logic Problems, CS87/3, November 1987 1 3 Beigel, Richard, SATA is Terse with Probability 1 TR 87/04, April 1987 1 4 H c et. al., A Performance Study of Deadlock Prevention a Deduction Algorithms in a Distributed File System, CS 87/6 1 5 Beigel, Richard, Bounded Queries to SAT and the Boolean Hierarchy, TR 87/07, June 1987 1 6 Beigel, Richard, Bi-immunity and Separation Results for Cheatable Sets, TR87/08, June 1987 1 7 Beigel, Richard, Functionally Supportive Sets, TR87/10, June 1987 1 8 Suri, Subhash, Computing geodesic furthest neighbors in a simple polygon, JHU 87/11, June 1987 1 9 H c et. al., Algorithms for File Replication in a Distributed System, TR87/12 1 10 Conn & O'Rourke, Some Restricted Rectangle Covering Problems, JHU87/13, June 1987 1 11 Ke & O'Rourke, Lower Bounds on Moving a Ladder in Two and Three Dimensions, JHU87/14, June 1987 1 12 Beigel, Richard, Supportive Sets--II, 87/15, June 1987 1 13 O'Rourke & Scheven, A Theorem on the Development of Complex Curves, JHU87/16, July 1987 1 14 Goodrich, Michael T., A Polygonal Approach to Hidden Elimination, TR87/18 1 15 Goodrich & Snoeyink, Stabbing Vertical Segments with a Convex Polygon, JHU87/19, August 1987 1 16 O'Rourke & Schevon, A Conjecture on Random Unfoldings, JHU87/20, October 1987 1 17 Orletsky & Masson, The Complexity of General Port Combination Networks, 87/21 1 18 Blough et. al., An Efficient Diagnosis Algorithm for Intermittent Faults, JHU87/22 1 19 Beigel, Richard, Unbounded Searching Algorithms, TR87/23, November 1987 1 20 O'Rourke, Joseph, Finding a Shortest Ladder Path: A Special Case, JHU87/25, November 1987 2 1 Sullivan, Gregory F., An O(t3 + E ) Fault Identification Algorithm for Diagnosable Systems, TR87/26, June 1987 2 2 McKenna & O'Rourke, Arrangements of Lines in 3-Space: A Data Structure with Applications, JHU87/30, December 1987 2 3 Banerjee & Kasif, A Note on the Computational Complexity of Symmetric Connectionist Networks, JHU88/1 2 4 Ke & Yan, An Efficient Algorithm for Link Distance Problems, JHU88/02, June 1988 2 5 Schevon & O'Rourke, The Number of Maximal Edge Sequences on a Convex Polytope, JHU88/03, June 1988 2 6 Beigel, Richard, NP-Hard Sets are P-Superterse unless R=NP, 88/04, August 1988 2 7 Beigel, Richard, Why are Counting Problems Hard to Approximate?, 88/05 2 8 Beigel, Richard, When are k+1 Queries Better than k?, JHU88/06, September 1988 2 9 Delcher & Kasif, Efficient Parallel Term Matching, JHU-CS88/7 2 10 Delcer & Kasif, On the Complexity of Incremental Parallel Computations, JHU-CS88/8, January 1988 2 11 Beigel, Richard, Relativized Counting Classes: Relations among Thresholds, Parity, and Mods, 88/09, September 1988 2 12 Beigel & Gill, Counting Classes: Thresholds, Parity, Mods, and Fewness, 88/10, September 1988 2 13 Goodrich et. al., Constructing the Voronoi Diagram of a Set of Line Segments in Parallel, 88/11 2 14 Cole, Richard, Optimal Parallel Algorithms for Polygon and Point-set Problems, 88/14 2 15 Atallah et. al., Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms, 88/15, July 1988 2 16 Aupperle et. al., Covering Orthogonal Polygons with Squares, JHU88/16, September 1988 2 17 Kontogiorgis et. al., Mathematical Analysis of an Analog VLSI Visual Tracking Array, 88/17 2 18 Goodrich, Michael T., Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation, 88/18 3 1 Johnstone & Goodrich, A Localized Method for Intersecting Plane Algebraic Curve Segments, TR88/20? 3 2 Beigel, On the Relativized Power of Additional Accepting Paths, 88/21, September 1988 3 3 Kontogiorgos, Automatic Letter-to-Phoneme Transcription for Speech Synthesis, JHU88/22, October 1988 3 4 Beigel, Richard, Unbounded Searching Algorithms, 88/23, September 1988 3 5 Beigel, Richard, Irrationality without Number Theory, 88/24, October 1988 3 6 Goodrich, Michael T., A Polygonal Approach to Hidden-Line and Hidden-Surface Elimination, 88/25 3 7 D¡az & O'Rourke, Algorithms for Computing the Center of Area of a Convex Polygon, 88/26, October 1988 3 8 Goodrich, Michael T., Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors, 88/27, Revised September 1990 3 9 Goodrich & Atallah, On Performing Robust Order Statistics in Tree Structured Dictionary Machines, 88/28 3 10 D¡az & O'Rourke, Algorithms for Finding Voracious Circle Points, JHU89/1, January 1989 3 11 Hostetler, A Comparison of Three Hidden-Line Removal Algorithms, 89/02 3 12 D¡az & O'Rourke, Computing the Center of Area Of a Simple Polygon, JHU89/3, April 1989 3 13 Johnstone, Working with Ruled Surfaces in Solid Modeling, JHU89/4, March 1989 3 14 Beigel et. al., Locating Faults in a Constant Number of Parallel Testing Rounds, 89/05 3 15 Goodrich, Michael T., Applying Parallel Techniques to Classification Problems in Constructive Solid Geometry, JHU89/6 3 16 Beigel et. al., On the Power of Probabilistic Polynomial Time: (extended Abstract), JHU89/07 3 17 Goodrich et. al., Parallel Methods for Visibility and Shortest Path problems in Simple Polygons, JHU89/08, Revised September 1990 3 18 Banerjee et. al., Some Results on the Computational Complexity of Symmetric Connectionist Networks, JHU/CS-89/10, November 1989 3 19 Smith, Scott F., From Operational to Denotational Semantics, 89/12, December 1989, Revised January 1990 3 20 Goodrich et. al., Generalized Sweep Methods for Parallel Computational Geometry, JHU89/13 3 21 Atallah et. al., P-Complete Geometric Problems, JHU89/14 3 22 Cole et. al., Merging Trees in Parallel for Efficient Voronoi Diagram Construction, JHU89/15 4 1 Smith, Scott F., Induction Principles for Fixed-Point Computations, 89/16, December 1989 4 2 Johnstone & Bajaj, Sorting Points Along An Algebraic Curve, JHU89/17 4 3 Salzberg, Steven, Nested Hyper Rectangles for Exemplar-Based Learning, JHU89/18 4 4 Panduranga, E.S., Fast Generation of a 4-D Mandelbrot Set, JHU 89/19 4 5 Panduranga, E.S., Circling Around a Circle: A Paradigm for Scan Converting a Family of Curves, JHU 89/20 4 6 Panduranga & Zhu, A Numerical Method for Rendering Sphere Reflections, JHU89/21 4 7 Ke & Panduranga, A Journey into the Fourth Dimension, JHU89/22 4 8 Kosaraju, S. Rao, Efficient Tree Pattern Matching (Preliminary Version), JHU89/23 4 9 Kosaraju, S. Rao, Pipelining Computations in a Tree of Processors, JHU89/24 4 10 Kosaraju, S. Rao, On the Parallel Evaluation of Classes of Circuits, JHU89/25 4 11 Sullivan & Masson, Using Certification Trails to Achieve Software Fault Tolerance, JHU89/26 4 12 Blough & Sullivan, A Comparison of Voting Strategies for Fault-Tolerant Systems, JHU89/27 4 13 Blough et. al., Efficient Diagnosis of Multiprocessor Systems under Probabilistic Models, JHU89/28 4 14 Goodrich et. al., New Output-Sensitive Methods for Rectilinear Hidden Surface Removal, 89/90, October 1989 4 15 Zwarico, Amy, An Improved Semantics for Real-Time Processes (Draft), JHU89/29 4 16 Cost & Salzberg, Exemplar-based Learning to Predict-Protein Folding, 90/03 4 17 Yang & Masson, Nonblocking Broadcast Switching Networks, JHU90/04 4 18 Facello, Improved Raytracing, JHU90/05 4 19 Constructing Arrangements Optimally in Parallel, JHU90/6 4 20 Kasif & Delcher, An Observation on the Computational Complexity of Simple Equation Systems, JHU/CS--90/7 4 21 Johnston & Shene, The Distance Representation of Quadric Ruled Surfaces: Ruled Quadrics, JHU90/08 4 22 Heath et. al., Learning Nested Concept Classes with Limited Storage, JHU90/09 4 23 Blough & Massos, Performance Analysis of a Generalized Concurrent Error Detection Procedure, JHU90/10 4 24 Goodrich et. al., Output-Sensistive Methods for Rectilinear Hidden Surface Removal, JHU90/11 5 1 Cost & Salzberg, A Weighted Nearest neighbor Algorithm for Learning with Symbolic Features, JHU90/11, August 1990 5 2 Atallah, et. al., Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations, JHU90/12, August 1990 5 3 Salzberg et. al., Learning with a Helpful Teacher—Preliminary Draft, JHU90/14, October 1990 5 4 Sullivan et. al., Using Certification Trails to Achieve Software Fault Tolerance, JHU90/15, October 1990 5 5 Goodrich & Tamassia, Dynamic Trees and Dynamic Point Locations, JHU90/16, November 1990 5 6 Beigel & Gill, Sorting n Objects with a k-Sorter, April 1987. 5 7 Goodrich, Michael T., Triangulating a Polygon in Parallel 5 8 H c & Jin, Dynamic Load Balancing in a Distributed System Using a Decentralized Algorithm, c. 1987