Browse

ftp://das-ftp.harvard.edu (147)

	ftp://das-ftp.harvard.edu/techreports/tr-08-92.ps.gz, 19940318 An Alternative Conception of Tree-Adjoining Derivation Yves Schabes Stuart M. Shiebery Mitsubishi Electric Harvard University Research Laboratory The precise formulation of derivation for tree-adjoining grammars has important ramifications for a wide variety of uses of the formalism, from syntactic
	ftp://das-ftp.harvard.edu/techreports/tr-19-92.ps.gz, 19940318 Lessons from a Restricted Turing Test Stuart M. Shieber Aiken Computation Laboratory Division of Applied Sciences Harvard University April 15, 1993 (Revision 5)
	ftp://das-ftp.harvard.edu/techreports/tr-24-93.ps.gz, 19940318 Annotating Floor Plans Using Deformable Polygons Kathy Ryall Joe Marks Harvard University Digital Equipment Corporation Murray Mazer Stuart Shieber Digital Equipment Corporation Harvard University December 16, 1993
	ftp://das-ftp.harvard.edu/techreports/tr-27-92.ps.gz, 19940318 Variations on Incremental Interpretation Stuart Shieber Mark Johnson Computer Science Department Department of Division of Applied Sciences Cognitive and Linguistic Sciences Harvard University Brown University Cambridge, MA Providence, RI January 22, 1993
	ftp://das-ftp.harvard.edu/techreports/tr-05-91.ps.gz, 19940322 The Computational Complexity of Cartographic Label Placement Joe Marks and Stuart Shieber March 22, 1991 Revised April 11, 1993
	ftp://das-ftp.harvard.edu/techreports/tr-17-93.ps.gz, 19940325 Stochastic Approximation Algorithms for Number Partitioning Wheeler Ruml April 12, 1993
	ftp://das-ftp.harvard.edu/techreports/tr-13-93.ps.gz, 19940325 Compaction and Separation Algorithms for Non-Convex Polygons and Their Applications Harvard University Center for Research in Computing Technology Aiken Computational Laboratory 33 Oxford Street Cambridge, MA 02138 Zhenyu Li y Victor Milenkovicz
	ftp://das-ftp.harvard.edu/techreports/tr-21-93.ps.gz, 19940325 Evolving Line Drawings October 29, 1993 1 Evolving Line Drawings Ellie Baker Margo Seltzer Aiken Computation Laboratory1 Harvard University 33 Oxford Street Cambridge, MA 02139
	ftp://das-ftp.harvard.edu/techreports/tr-17-91.ps.gz, 19940328 Computational Complexity of a Problem in Molecular-Structure Prediction Running title Complexity of Molecular-Structure Prediction Key words intractability NP-completeness peptide backbone conformation potential-energy minimization protein-structure prediction J. Thomas Ngo1 Committee on Higher Degrees
	ftp://das-ftp.harvard.edu/techreports/tr-10-93.ps.gz, 19940328 Constraint-Driven Diagram Layout Ed Dengler Univ. of Waterloo Mark Friedell Lotus Development Corp. Joe Marks DEC CRL
	ftp://das-ftp.harvard.edu/techreports/tr-05-94.ps.gz, 19940331 Motion-Synthesis Techniques for 2D Articulated Figures Alex Fukunaga Harvard University Lloyd Hsu Harvard University Peter Reiss Harvard University Andrew Shuman Harvard University Jon Christensen Harvard University Joe Marks Digital Equipment Corporation J. Thomas Ngo Harvard University
	ftp://das-ftp.harvard.edu/techreports/tr-06-94.ps.gz, 19940331 Motion Synthesis for 3D Articulated Figures and Mass-Spring Models Hadi Partovi Harvard University Jon Christensen Harvard University Amir Khosrowshahi Harvard University Joe Marks DEC CRL J. Thomas Ngo Harvard University
	ftp://das-ftp.harvard.edu/techreports/tr-10-94.ps.gz, 19940426 Easily Searched Encodings for Number Partitioning 1 Wheeler Ruml ruml@cs.ucla.edu Harvard University, Cambridge, Massachusetts J. Thomas Ngo ngo@interval.com Interval Research Corporation, Palo Alto, California Joe Marks marks@merl.com Digital Equipment Corporation, Cambridge Research Lab, Cambridge,
	ftp://das-ftp.harvard.edu/techreports/tr-11-94.ps.gz, 19940426 Principles and Implementation of Deductive Parsing Stuart M. Shieber Division of Applied Sciences Harvard University, Cambridge, MA 02138 Yves Schabes Mitsubishi Electric Research Laboratories Cambridge, MA 02139 Fernando C. N. Pereira AT&T Bell Laboratories Murray Hill, NJ 07974 April 26, 1994
	ftp://das-ftp.harvard.edu/techreports/tr-12-92.ps.gz, 19940509 Algebraic Optimization of Outerjoin Queries A thesis presented by C esar Alejandro Galindo-Legaria to The Division of Applied Sciences in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the subject of Computer Science. Harvard University Cambridge, Massachusetts June,
	ftp://das-ftp.harvard.edu/techreports/tr-13-94.ps.gz, 19940524 A Recursive Coalescing Method for Bisecting Graphs Bryan Mazlish, Stuart M. Shieber, and Joe Marks TR-13-94 A Recursive Coalescing Method for Bisecting Graphs Bryan Mazlish Harvard University Stuart Shieber Harvard University Joe Marks Mitsubishi Electric Research Laboratories, Inc. May 24, 1994
	ftp://das-ftp.harvard.edu/techreports/tr-16-93.ps.gz, 19940607 Actions, Beliefs and Intentions in Multi-Action Utterances A thesis presented by Cecile Tiberghien Balkanski to The Division of Applied Sciences in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the subject of Computer Science Harvard University Cambridge,
	ftp://das-ftp.harvard.edu/techreports/tr-15-94.ps.gz, 19940617 Compaction Algorithms for Non-Convex Polygons and Their Applications A thesis presented by Zhenyu Li to The Division of Applied Sciences in partial fulfillment of the requirement for the degree of Doctor of Philosophy in the subject of Computer Science Harvard University Cambridge, Massachusetts May,
	ftp://das-ftp.harvard.edu/techreports/tr-25-92.ps.gz, 19940620 1 Labeling Point Features on Maps and Diagrams Jon Christensen Joe Marks Harvard University Mitsubishi Electric Research Laboratories Cambridge, Massachusetts Cambridge, Massachusetts Stuart Shieber Harvard University Cambridge, Massachusetts
	ftp://das-ftp.harvard.edu/techreports/tr-02-94.ps.gz, 19940705 Learning to Reason Roni Khardony Dan Rothz Aiken Computation Laboratory, Harvard University, Cambridge, MA 02138. froni,danrg@das.harvard.edu January 1994 (Revised June 30, 1994)
	ftp://das-ftp.harvard.edu/techreports/tr-01-94.ps.gz, 19940705 Reasoning with Models Roni Khardony Dan Rothz Aiken Computation Laboratory, Harvard University, Cambridge, MA 02138. froni,danrg@das.harvard.edu January 1994 (Revised June 30, 1994)
	ftp://das-ftp.harvard.edu/techreports/tr-12-94.ps.gz, 19940715 Multiple Containment Methods Karen Daniels, Zhenyu Li, Victor Milenkovic y Aiken Computation Laboratory, Harvard University, Cambridge, MA 02138. July 15, 1994
	ftp://das-ftp.harvard.edu/techreports/tr-17-94.ps.gz, 19940816 Improved Noise-Tolerant Learning and Generalized Statistical Queries Javed A. Aslam Scott E. Decatury Aiken Computation Laboratory Harvard University Cambridge, MA 02138 July 1994
	ftp://das-ftp.harvard.edu/techreports/tr-23-94.ps.gz, 19940825 A Comparative Study of Search and Optimization Algorithms for the Automatic Control of Physically Realistic 2-D Animated Figures Alex Fukunaga1 Harvard University Jon Christensen Harvard University J. Thomas Ngo2 Harvard University Joe Marks3 Digital Equipment Corp. 1Current affiliation: Computer
	ftp://das-ftp.harvard.edu/techreports/tr-07-93.ps.gz, 19940920 All{to{all Communication Algorithms for Distributed BLAS Kapil K. Mathur S. Lennart Johnsson TR-07-93 March 1993 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To be presented at the 6th SIAM Conference on Parallel Processing for
	ftp://das-ftp.harvard.edu/techreports/tr-11-93.ps.gz, 19940920 An Efficient Communication Strategy for Finite Element Methods on the Connection Machine CM-5 System Zden<=ek Johan Kapil K. Mathur S. Lennart Johnsson Thomas J.R. Hughes TR-11-93 April 1993 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge,
	ftp://das-ftp.harvard.edu/techreports/tr-29-92.ps.gz, 19940920 Massively Parallel Computing: Data distribution and communication S. Lennart Johnsson TR-29-92 December 1992 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts This work has in part been supported by the Air Force Office of
	ftp://das-ftp.harvard.edu/techreports/tr-23-92.ps.gz, 19940920 Communication Primitives for Unstructured Finite Element Simulations on Data Parallel Architectures Kapil K. Mathur S. Lennart Johnsson TR-23-92 November 1992 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts This work has in part
	ftp://das-ftp.harvard.edu/techreports/tr-19-93.ps.gz, 19940920 High Performance, Scalable Scientific Software Libraries S. Lennart Johnsson Kapil K. Mathur TR-19-93 October 1993 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in Portability and High Performance Parallel Processing,
	ftp://das-ftp.harvard.edu/techreports/tr-04-92.ps.gz, 19940920 Block{Cyclic Dense Linear Algebra Woody Lichtenstein S. Lennart Johnsson TR-04-92 January 1992 Revised August 1992 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Block{Cyclic Dense Linear Algebra Woody Lichtenstein and S. Lennart
	ftp://das-ftp.harvard.edu/techreports/tr-18-94.ps.gz, 19940920 Finite Element Techniques for Computational Fluid Dynamics on the Connection Machine CM-5 System Z. Johan K.K. Mathur S.L. Johnsson T.J.R. Hughes TR-18-94 August 1994 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in
	ftp://das-ftp.harvard.edu/techreports/tr-18-91.ps.gz, 19940920 Optimal All-to-All Personalized Communication with Minimum Span on Boolean Cubes S. Lennart Johnsson Ching-Tien Ho TR-18-91 April 1991 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in Proceedings of the 6th Distributed
	ftp://das-ftp.harvard.edu/techreports/tr-16-92.ps.gz, 19940920 Optimal Communication Channel Utilization for Matrix Transposition and Related Permutations on Binary Cubes S. Lennart Johnsson Ching-Tien Ho TR-16-92 August 1992 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts This work has in
	ftp://das-ftp.harvard.edu/techreports/tr-08-94.ps.gz, 19940920 Mesh Decomposition and Communication Procedures for Finite Element Applications on the Connection Machine CM-5 System Zden<=ek Johan Kapil K. Mathur S. Lennart Johnsson Thomas J.R. Hughes TR-08-94 April 1994 Parallel Computing Research Group Center for Research in Computing Technology Harvard University
	ftp://das-ftp.harvard.edu/techreports/tr-07-92.ps.gz, 19940920 Index Transformation Algorithms in a Linear Algebra Framework Alan Edelman Steve Heller S. Lennart Johnsson TR-07-92 April 1992 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Index Transformation Algorithms in a Linear Algebra
	ftp://das-ftp.harvard.edu/techreports/tr-09-94.ps.gz, 19940920 Data Motion and High Performance Computing S. Lennart Johnsson TR-09-94 April 1994 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in the First International Workshop on Massively Parallel Processing Using Optical
	ftp://das-ftp.harvard.edu/techreports/tr-10-91.ps.gz, 19940920 Performance Modeling of Distributed Memory Architectures S. Lennart Johnsson TR-10-91 April 1991 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in The Journal of Parallel and Distributed Computing. Performance Modeling
	ftp://das-ftp.harvard.edu/techreports/tr-01-93.ps.gz, 19940920 Massively Parallel Computing: Mathematics and communications libraries S. Lennart Johnsson Kapil K. Mathur TR-01-93 January 1993 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in Parallel Supercomputing in Atmospheric
	ftp://das-ftp.harvard.edu/techreports/tr-02-92.ps.gz, 19940920 A Data Parallel Finite Element Method for Computational Fluid Dynamics on the Connection Machine System Zden<=ek Johan Thomas J.R. Hughes Kapil K. Mathur S. Lennart Johnsson TR-02-92 January 1992 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge,
	ftp://das-ftp.harvard.edu/techreports/tr-01-92.ps.gz, 19940920 Multiplication of Matrices of Arbitrary Shape on a Data Parallel Computer Kapil K. Mathur S. Lennart Johnsson TR-01-92 January 1992 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Multiplication of Matrices of Arbitrary Shape on a
	ftp://das-ftp.harvard.edu/techreports/tr-24-91.ps.gz, 19940920 Cooley-Tukey FFT on the Connection Machine S. Lennart Johnsson Robert L. Krawitz TR-24-91 September 1991 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Cooley-Tukey FFT on the Connection Machine S. Lennart Johnsson1 and Robert L.
	ftp://das-ftp.harvard.edu/techreports/tr-22-94.ps.gz, 19940920 Issues in High Performance Computer Networks Position Paper S. Lennart Johnsson TR-22-94 August 1994 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in IEEE Technical Committee on Computer Architecture (TCCA) Newsletter,
	ftp://das-ftp.harvard.edu/techreports/tr-06-93.ps.gz, 19940920 An Efficient Communication Strategy for Finite Element Methods on the Connection Machine CM-5 System Zden<=ek Johan Kapil K. Mathur S. Lennart Johnsson Thomas J.R. Hughes TR-06-93 March 1993 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge,
	ftp://das-ftp.harvard.edu/techreports/tr-04-91.ps.gz, 19940920 Generalized Shuffle Permutations on Boolean Cubes S. Lennart Johnsson Ching-Tien Ho TR-04-91 February 1991 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Air Force Office of Scientific Research grant: 44-752-9000-2. National
	ftp://das-ftp.harvard.edu/techreports/tr-21-94.ps.gz, 19940920 ROMM Routing: A Class of Efficient Minimal Routing Algorithms Ted Nesson S. Lennart Johnsson TR-21-94 August 1994 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts This technical report is an edited version of ROMM Routing: A Class
	ftp://das-ftp.harvard.edu/techreports/tr-23-91.ps.gz, 19940920 Minimizing the Communication Time for Matrix Multiplication on Multiprocessors S. Lennart Johnsson TR-23-91 September 1991 Revised August 1992 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Minimizing the Communication Time for
	ftp://das-ftp.harvard.edu/techreports/tr-25-91.ps.gz, 19940920 Communication Efficient Multi-processor FFT S. Lennart Johnsson Michel Jacquemin Robert L. Krawitz TR-25-91 October 1991 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Communication Efficient Multi-processor FFT S. Lennart
	ftp://das-ftp.harvard.edu/techreports/tr-09-92.ps.gz, 19940920 Local Basic Linear Algebra Subroutines (LBLAS) for Distributed Memory Architectures and Languages with Array Syntax S. Lennart Johnsson Luis F. Ortiz TR-09-92 April 1992 Revised September 1992 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge,
	ftp://das-ftp.harvard.edu/techreports/tr-16-94.ps.gz, 19940920 Scalability of Finite Element Applications on Distributed-Memory Parallel Computers Zden<=ek Johan Kapil K. Mathur S. Lennart Johnsson Thomas J.R. Hughes TR-16-94 June 1994 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts
	ftp://das-ftp.harvard.edu/techreports/tr-20-94.ps.gz, 19940920 Load{Balanced LU and QR Factor and Solve Routines for Scalable Processors with Scalable I/O Jean-Philippe Brunet Palle Pedersen S. Lennart Johnsson TR-20-94 August 1994 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in
	ftp://das-ftp.harvard.edu/techreports/tr-04-94.ps.gz, 19940920 Data Parallel Finite Element Techniques for Compressible Flow Problems Z. Johan K.K. Mathur S.L. Johnsson T.J.R. Hughes TR-04-94 January 1994 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in CFD '94, Japan, 1994. Data
	ftp://das-ftp.harvard.edu/techreports/tr-08-93.ps.gz, 19940920 Massively Parallel Computing: Unstructured Finite Element Simulations Kapil K. Mathur Zden<=ek Johan S. Lennart Johnsson Thomas J.R. Hughes TR-08-93 March 1993 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in
	ftp://das-ftp.harvard.edu/techreports/tr-19-91.ps.gz, 19940920 Matrix Multiplication on Hypercubes Using Full Bandwidth and Constant Storage Ching-Tien Ho S. Lennart Johnsson Alan Edelman TR-19-91 April 1991 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in Proceedings of the 6th
	ftp://das-ftp.harvard.edu/techreports/tr-23-93.ps.gz, 19940920 CMSSL: A Scalable Scientific Software Library S. Lennart Johnsson TR-23-93 December 1993 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in Scalable Parallel Libraries, IEEE Computer Society. CMSSL: A Scalable Scientific
	ftp://das-ftp.harvard.edu/techreports/tr-09-93.ps.gz, 19940920 The Connection Machine Systems CM-5 S. Lennart Johnsson TR-09-93 April 1993 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures '93,
	ftp://das-ftp.harvard.edu/techreports/tr-07-94.ps.gz, 19940920 Parallel implementation of recursive spectral bisection on the Connection Machine CM-5 system Zden<=ek Johan Kapil K. Mathur S. Lennart Johnsson Thomas J.R. Hughes TR-07-94 April 1994 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge,
	ftp://das-ftp.harvard.edu/techreports/tr-18-92.ps.gz, 19940920 Language and Compiler Issues in Scalable High Performance Scientific Libraries S. Lennart Johnsson TR-18-92 September 1992 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts This work has in part been supported by the Air Force
	ftp://das-ftp.harvard.edu/techreports/tr-19-94.ps.gz, 19940920 Scientific Software Libraries for Scalable Architectures S. Lennart Johnsson Kapil K. Mathur TR-19-94 August 1994 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in Parallel Scientific Computing, Springer{Verlag.
	ftp://das-ftp.harvard.edu/techreports/tr-02-93.ps.gz, 19940920 All{to{All Communication on the Connection Machine CM-200 Kapil K. Mathur S. Lennart Johnsson TR-02-93 January 1993 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts This work has in part been supported by the Air Force Office of
	ftp://das-ftp.harvard.edu/techreports/tr-20-91.ps.gz, 19940920 On the Conversion between Binary Code and Binary{Reflected Gray Code on Boolean Cubes S. Lennart Johnsson Ching-Tien Ho TR-20-91 July 1991 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts This work has in part been supported by the
	ftp://das-ftp.harvard.edu/techreports/tr-20-92.ps.gz, 19940922 An Efficient Algorithm for Gray{to{Binary Permutation on Hypercubes Ching-Tien Ho S. Lennart Johnsson M.T. Raghunath TR-20-92 September 1992 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts An Efficient Algorithm for Gray{to{Binary
	ftp://das-ftp.harvard.edu/techreports/tr-02-91.ps.gz, 19940922 Communication and I/O Libraries Chair: S. Lennart Johnsson Scribe: Patrick Worley TR-02-91 February 1991 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Air Force Office of Scientific Research grant: 44-752-9000-2. National
	ftp://das-ftp.harvard.edu/techreports/tr-21-91.ps.gz, 19940922 All{to{all Broadcast and Applications on the Connection Machine Jean-Philippe Brunet S. Lennart Johnsson TR-21-91 August 1991 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts This work has been supported by the Air Force Office of
	ftp://das-ftp.harvard.edu/techreports/tr-18-93.ps.gz, 19940927 POLYSHIFT Communications Software for the Connection Machine System CM{200 William George Ralph G. Brickner S. Lennart Johnsson TR-18-93 October 1993 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in the Journal of
	ftp://das-ftp.harvard.edu/techreports/tr-22-93.ps.gz, 19940927 A Stencil Complier for the Connection Machine Models CM-2/200 Ralph G. Brickner William George S. Lennart Johnsson Alan Ruttenberg TR-22-93 November 1993 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in the Fourth
	ftp://das-ftp.harvard.edu/techreports/tr-25-94.ps.gz, 19940929 Using Collaborative Plans to Model the Intentional Structure of Discourse A thesis presented by Karen Elizabeth Lochbaum to The Division of Applied Sciences in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the subject of Computer Science Harvard University Cambridge,
	ftp://das-ftp.harvard.edu/techreports/tr-12-91.ps.gz, 19940930 Appears in Proceedings of ACL-91 AN ALGORITHM FOR PLAN RECOGNITION IN COLLABORATIVE DISCOURSE Karen E. Lochbaum Aiken Computation Lab Harvard University 33 Oxford Street Cambridge, MA 02138 kel@harvard.harvard.edu
	ftp://das-ftp.harvard.edu/techreports/tr-20-93.ps.gz, 19940930 A Collaborative Planning Approach to Discourse Understanding Karen E. Lochbaum kel@das.harvard.edu
	ftp://das-ftp.harvard.edu/techreports/tr-14-91.ps.gz, 19940930 Plan Recognition in Collaborative Discourse Karen E. Lochbaum
	ftp://das-ftp.harvard.edu/techreports/tr-27-94.ps.gz, 19941028 Local Basic Linear Algebra Subroutines (LBLAS) for the CM{5/5E David Kramer S. Lennart Johnsson Yu Hu TR-27-94 September 1994 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Submitted to the International Journal of Supercomputer
	ftp://das-ftp.harvard.edu/techreports/tr-24-94.ps.gz, 19941028 Implementing O(N ) N{body algorithms efficiently in data parallel languages (High Performance Fortran) Yu Hu S. Lennart Johnsson TR-24-94 September 1994 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Submitted to the Journal of
	ftp://das-ftp.harvard.edu/techreports/tr-29-94.ps.gz, 19941028 Automatic Derivation of Parallel and Systolic Programs Lilei Chen1 Center for Research in Computing Technology Division of Applied Sciences Harvard University October 18, 1994
	ftp://das-ftp.harvard.edu/techreports/tr-26-94.ps.gz, 19941028 A Data Parallel Implementation of Hierarchical N{body Methods Yu Hu S. Lennart Johnsson TR-26-94 September 1994 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Submitted to the International Journal of Supercomputer Applications.
	ftp://das-ftp.harvard.edu/techreports/tr-28-94.ps.gz, 19941102 Infrastructure for Research towards Ubiquitous Information Systems Barbara Grosz H. T. Kung Margo Seltzer Stuart Shieber Michael Smith TR-28-94 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Contents 1 Executive Summary 3 2 Research Narrative 4 2.1 Overview of
	ftp://das-ftp.harvard.edu/techreports/tr-32-94.ps.gz, 19941130 Rationality L.G. Valiant TR-32-94 November 1994 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Rationality (Extended Abstract) L.G. Valiant Harvard University 1 Introduction Human and certain other biological systems are endowed with remarkable information
	ftp://das-ftp.harvard.edu/techreports/tr-33-94.ps.gz, 19941201 Derivatives of the matrix exponential and their computation Igor Najfeld Timothy F. Havel Biological Chemistry and Molecular Pharmacology Harvard Medical School, Boston, MA, 02115-5718 TR-33-94 November 1994 A Technical Report of the Center for Research in Computing Technology Harvard University
	ftp://das-ftp.harvard.edu/techreports/tr-31-94.ps.gz, 19941209
	ftp://das-ftp.harvard.edu/techreports/tr-10-94r.ps.gz, 19941209 Easily Searched Encodings for Number Partitioning Wheeler Ruml ruml@das.harvard.edu Harvard University, Cambridge, Massachusetts J. Thomas Ngo ngo@interval.com Interval Research Corporation, Palo Alto, California Joe Marks marks@merl.com Mitsubishi Electric Research Laboratories, Inc., Cambridge,
	ftp://das-ftp.harvard.edu/techreports/tr-01-95.ps.gz, 19950112 Bayesian Grammar Induction for Language Modeling Stanley F. Chen TR-01-95 January 1995 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Bayesian Grammar Induction for Language Modeling Stanley F. Chen Aiken Computation Laboratory Division of Applied Sciences
	ftp://das-ftp.harvard.edu/techreports/tr-35-94.ps.gz, 19950117 1 File Layout and File System Performance Keith Smith Margo Seltzer Harvard University TR 35 94
	ftp://das-ftp.harvard.edu/techreports/tr-36-94.ps.gz, 19950125 Bulk Synchronous Parallel Computing { A Paradigm for Transportable Software Thomas Cheatham Amr Fahmy Dan C. Stefanescu Leslie G. Valiant TR-36-94 December 1994 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in the Proceedings of the 28th Annual Hawaii
	ftp://das-ftp.harvard.edu/techreports/tr-02-95.ps.gz, 19950203 Learning in Order to Reason Dan Roth TR-02-95 January 1995 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Learning in Order to Reason A thesis presented by Dan Roth to The Division of Applied Sciences in partial fulfillment of the requirements for the degree of
	ftp://das-ftp.harvard.edu/techreports/tr-34-94.ps.gz, 19950207 VINO: The 1994 Fall Harvest Yasuhiro Endo James Gwertzman Margo Seltzer Christopher Small Keith A. Smith and Diane Tang TR-34-94 December 1994 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts VINO: The 1994 Fall Harvest Yasuhiro Endo James Gwertzman Margo Seltzer
	ftp://das-ftp.harvard.edu/techreports/tr-05-95.ps.gz, 19950303 A Proposed New Memory Manager Robert L. Walton TR-05-95 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts A Proposed New Memory Manager Robert L. Walton Harvard University February 28, 1995
	ftp://das-ftp.harvard.edu/techreports/tr-04-95.ps.gz, 19950322 Efficient scheduling of loop nests for BSP programs Yan-Zhong Ding and Dan C. Stefanescu TR-04-95 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Efficient scheduling of loop nests for BSP programs Yan-Zhong Ding Harvard University Dan C. Stefanescu Harvard
	ftp://das-ftp.harvard.edu/techreports/tr-06-95.ps.gz, 19950413 1 A Comparative Analysis of Schemes for Correlated Branch Prediction Cliff Young, Nicolas Gloy, and Michael D. Smith Division of Applied Sciences Harvard University, Cambridge, MA 02138 {cyoung, ng, smith}@das.harvard.edu
	ftp://das-ftp.harvard.edu/techreports/tr-07-95.ps.gz, 19950424 Efficient Learning of Real Time One-Counter Automata Amr Fahmy and Robert Roos TR-07-95 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Efficient Learning of Real Time One Counter Automata Amr F. Fahmy Aiken Computation Lab. Harvard University amr@das.harvard.edu
	ftp://das-ftp.harvard.edu/techreports/tr-08-95.ps.gz, 19950428 ROMM Routing on Mesh and Torus Networks Ted Nesson S. Lennart Johnsson TR-08-95 May 1995 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and
	ftp://das-ftp.harvard.edu/techreports/tr-03-95.ps.gz, 19950505 Translating between Horn Representations and their Characteristic Models Roni Khardon TR-03-95 February 1995 (Revised May 5, 1995) Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Translating between Horn Representations and their Characteristic Models Roni Khardon
	ftp://das-ftp.harvard.edu/techreports/tr-11-95.ps.gz, 19950601 Interpreting Cohesive Forms in the Context of Discourse Inference Andrew Kehler TR-11-95 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Interpreting Cohesive Forms in the Context of Discourse Inference A thesis presented by Andrew Kehler to The Division of
	ftp://das-ftp.harvard.edu/techreports/tr-12-95.ps.gz, 19950601 Containment Algorithms for Nonconvex Polygons with Applications to Layout Karen McIntosh Daniels TR-12-95 May 1995 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Containment Algorithms for Nonconvex Polygons with Applications to Layout A thesis presented by Karen
	ftp://das-ftp.harvard.edu/techreports/tr-15-95.ps.gz, 19950613 Reasoning with Examples: Propositional Formulae and Database Dependencies Roni Khardon Heikki Mannila and Dan Roth TR-15-95 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Reasoning with Examples: Propositional Formulae and Database Dependencies Roni Khardon
	ftp://das-ftp.harvard.edu/techreports/tr-09-95.ps.gz, 19950713 The Impact of Operating System Structure on Personal Computer Performance J. Bradley Chen, Yasohiro Endo, Kee Chan, David Mazi res, Antonio Dias, Margo Seltzer, and Michael D. Smith TR-09-95 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts 1 The Impact of Operating
	ftp://das-ftp.harvard.edu/techreports/tr-14-95.ps.gz, 19950713 MOSS: A Mobile Operating System Substrate J. Bradley Chen, H. T. Kung, and Margo Seltzer TR-14-95 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts 1 MOSS: A Mobile Operating Systems Substrate A White Paper J. Bradley Chen, H.T. Kung, and Margo Seltzer Harvard
	ftp://das-ftp.harvard.edu/techreports/tr-13-95.ps.gz, 19950713 Probabilistic Cache Replacement J. Bradley Chen TR-13-95 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts 1 Probabilistic Cache Replacement J. Bradley Chen Division of Applied Sciences Harvard University AbstractModern microprocessors tend to use on-chip caches
	ftp://das-ftp.harvard.edu/techreports/tr-18-95.ps.gz, 19950718 Centering: A Framework for Modelling the Local Coherence of Discourse Barbara J. Grosz Aravind K. Joshi Scott Weinstein TR-18-95 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Appears in: Computational Liguistics 21(2), pp. 203{225, June 1995. Centering: A
	ftp://das-ftp.harvard.edu/techreports/tr-10-95-p70.ps.gz, 19950719 70 (a) (b) (c) Figure 30: Mr. Jello jumps (a), walks by tumbling (b), and walks by shuffling (c).
	ftp://das-ftp.harvard.edu/techreports/tr-10-95.ps.gz, 19950719 Managing Design Complexity: Using Stochastic Optimization in the Production of Computer Graphics Jon Christensen TR-10-95 Managing Design Complexity: Using Stochastic Optimization in the Production of Computer Graphics A thesis presented by Jon Christensen to The Division of Applied Sciences in partial
	ftp://das-ftp.harvard.edu/techreports/tr-10-95-p71.ps.gz, 19950719 71 (a) (b) (c) Figure 31: A leaping spider (a), a poodle performing a somersault (b), and a table pirouetting (c).
	ftp://das-ftp.harvard.edu/techreports/tr-17-95.ps.gz, 19950801 Autonomous Replication in Wide-Area Internetworks James Gwertzman TR-17-95 April 1995 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Autonomous Replication in Wide-Area Internetworks A Thesis presented by James Gwertzman to Computer Science in partial fulfillment
	ftp://das-ftp.harvard.edu/techreports/tr-19-95.ps.gz, 19950825 Benchmarking Filesystems Diane Tang TR-19-95 Benchmarking Filesystems A Thesis presented by Diane L. Tang to Computer Science in partial fulfillment of the honors requirements for the degree of Bachelor of Arts Harvard College Cambridge, Massachusetts April 10, 1995 Benchmarking Filesystems CHAPTER 1
	ftp://das-ftp.harvard.edu/techreports/tr-21-95.ps.gz, 19950919 Instructions for Annotating Discourse Christine H. Nakatani Barbara J. Grosz David D. Ahn Julia Hirschberg TR-21-95 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Instructions for Annotating Discourses Christine H. Nakatani, Barbara J. Grosz, David D. Ahn Aiken
	ftp://das-ftp.harvard.edu/techreports/tr-22-95.ps.gz, 19950919 Finding the Largest Rectangle in Several Classes of Polygons Karen Daniels Victor J. Milenkovic Dan Roth TR-22-95 September 1995 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Finding the Largest Rectangle in Several Classes of Polygons Karen Daniels y Victor
	ftp://das-ftp.harvard.edu/techreports/tr-20-95.ps.gz, 19951003 Collaborative Plans for Complex Group Action Barbara J. Grosz Sarit Kraus TR-20-95 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Note: This article will appear in Artificial Intelligence. Collaborative Plans for Complex Group Action Barbara J. Grosz Division of
	ftp://das-ftp.harvard.edu/techreports/tr-24-95.ps.gz, 19951010 Randomized, Oblivious, Minimal Routing Algorithms for Multicomputers Ted Nesson TR-24-95 October 1995 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Randomized, Oblivious, Minimal Routing Algorithms for Multicomputers A thesis
	ftp://das-ftp.harvard.edu/techreports/tr-23-95.ps.gz, 19951121 1 Performance Issues in Correlated Branch Prediction Schemes Nicolas Gloy, Michael D. Smith, Cliff Young Division of Applied Sciences Harvard University, Cambridge, MA 02138 {ng, smith, cyoung}@das.harvard.edu
	ftp://das-ftp.harvard.edu/techreports/tr-31-95.ps.gz, 19951213 Scheduler Activations on BSD: Sharing Thread Management Between Kernel and Application Christopher Small and Margo Seltzer Harvard University fchris,margog@eecs.harvard.edu
	ftp://das-ftp.harvard.edu/techreports/tr-29-95.ps.gz, 19951215 Network Related Performance Issues and Techniques for MPPs S. Lennart Johnsson TR-29-95 December 1995 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in Optoelectronic Interconnect and Packaging, SPIE International
	ftp://das-ftp.harvard.edu/techreports/tr-35-95.ps.gz, 19951219 Data Partitioning for Load{Balance and Communication Bandwidth Preservation S. Lennart Johnsson TR-35-95 August 1995 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in The Second International Conference on Massively
	ftp://das-ftp.harvard.edu/techreports/tr-10-92.ps.gz, 19951221 Direct Bulk-Synchronous Parallel Algorithms Alexandros V. Gerbessiotis and Leslie G. Valiant TR-10-92 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Direct Bulk-Synchronous Parallel Algorithms Alexandros V. Gerbessiotis and Leslie G. Valiant Aiken Computation
	ftp://das-ftp.harvard.edu/techreports/tr-30-94.ps.gz, 19951221 VINO: An Integrated Platform for Operating System and Database Research Christopher Small and Margo Seltzer Harvard University Cambridge, MA 02138 fchris,margog@das.harvard.edu Harvard Computer Science Laboratory Technical Report TR-30-94
	ftp://das-ftp.harvard.edu/techreports/tr-24-92.ps.gz, 19951221 A Combining Mechanism for Parallel Computers Leslie G. Valiant TR-24-92 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts A Combining Mechanism for Parallel Computers Leslie G. Valiant Aiken Computation Laboratory Harvard University Cambridge, MA 02138
	ftp://das-ftp.harvard.edu/techreports/tr-37-95.ps.gz, 19960220 R-Code a Very Capable Virtual Computer Robert Lee Walton TR-37-95 October 1995 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts R-CODE A Very Capable Virtual Computer A thesis presented by Robert Lee Walton to The Division of Applied Sciences in partial fulfillment
	ftp://das-ftp.harvard.edu/techreports/tr-30-95.ps.gz, 19960228 Efficient Learning from Faulty Data Scott Evan Decatur TR-30-95 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Efficient Learning from Faulty Data A thesis presented by Scott Evan Decatur to The Division of Applied Sciences in partial fulfillment of the
	ftp://das-ftp.harvard.edu/techreports/tr-16-95.ps.gz, 19960307 page 1 of 14 The Case for Extensible Operating Systems Margo Seltzer, Christopher Small, and Keith Smith Harvard University
	ftp://das-ftp.harvard.edu/techreports/tr-25-95.ps.gz, 19960516 Translational Polygon Containment and Minimal Enclosure using Geometric Algorithms and Mathematical Programming Victor J. Milenkovic Karen Daniels TR-25-95 November 1995 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Translational Polygon Containment and Minimal
	ftp://das-ftp.harvard.edu/techreports/tr-03-96.ps.gz, 19960530 Learning to be Competent Roni Khardon TR-03-96 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Learning to be Competent A thesis presented by Roni Khardon to The Division of Applied Sciences in partial fulfillment of the requirements for the degree of Doctor of
	ftp://das-ftp.harvard.edu/techreports/tr-02-96.ps.gz, 19960613 Building Probabilistic Models for Natural Language Stanley F. Chen TR-02-96 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Building Probabilistic Models for Natural Language A thesis presented by Stanley F. Chen to The Division of Applied Sciences in partial
	ftp://das-ftp.harvard.edu/techreports/tr-01-91.ps.gz, 19960619 QCD on the Connection Machine: Beyond *LISP Ralph G. Brickner Clive F. Baillie S. Lennart Johnsson TR-01-91 February 1991 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Presented at the IMACS First International Conference on
	ftp://das-ftp.harvard.edu/techreports/tr-26-95.ps.gz, 19960709 Kernel Instrumentation Tools and Techniques J. Bradley Chen and Alan Eustace TR-26-95 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Kernel Instrumentation Tools and Techniques J. Bradley Chen Alan Eustace Harvard University Digital Equipment Corporation Division
	ftp://das-ftp.harvard.edu/techreports/tr-27-95.ps.gz, 19960920 On the Transportation and Distribution of Data Structures in Parallel and Distributed Systems Amr F. Fahmy and Robert A. Wagner TR-27-95 March 1995 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts On the Transportation and Distribution of Data Structures in
	ftp://das-ftp.harvard.edu/techreports/tr-05-96.ps.gz, 19960920 A Data{Parallel Implementation of O(N ) HierarchicalN{body Methods Yu Hu S. Lennart Johnsson TR-05-96 May 1996 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in Proceedings of Supercomputing '96. A Data Parallel
	ftp://das-ftp.harvard.edu/techreports/tr-08-96.ps.gz, 19960920 Learning to Reason with a Restricted View Roni Khardon and Dan Roth TR-08-96 September 1996 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Learning to Reason with a Restricted View Roni Khardony Dan Rothz Aiken Computation Laboratory, Harvard University,
	ftp://das-ftp.harvard.edu/techreports/tr-32-95.ps.gz, 19961112 A Vector Space Framework for Parallel Stable Permutations Nadia Shalaby S. Lennart Johnsson TR-32-95 November 1995 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts A Vector Space Framework for Parallel Stable Permutations Nadia Shalaby y and S. Lennart Johnsson z
	ftp://das-ftp.harvard.edu/techreports/tr-36-95.ps.gz, 19961112 DPF: A Data Parallel Fortran Benchmark Suite Yu Hu S. Lennart Johnsson Dimitris Kehagias Nadia Shalaby TR-36-95 September 1995 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts DPF: A Data Parallel Fortran Benchmark Suitey Yu Huz, S. Lennart Johnssonzx, Dimitris
	ftp://das-ftp.harvard.edu/techreports/tr-11-96.ps.gz, 19961126 A Neuroidal Architecture for Cognitive Computation Leslie G. Valiant TR-11-96 November 1996 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts A Neuroidal Architecture for Cognitive Computation Leslie G. Valiant Division of Engineering and Applied Sciences Harvard
	ftp://das-ftp.harvard.edu/techreports/tr-09-96.ps.gz, 19961206 Communicable Memory and Lazy Barriers for Bulk Synchronous Parallelism in BSPk Amr Fahmy Abdelsalam Heddaya TR-09-96 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Also available as BU-CS-96-012, Boston University Computer Science Department Communicable Memory
	ftp://das-ftp.harvard.edu/techreports/tr-12-96.ps.gz, 19961206 Learning of Context-Free Languages: A Survey of the Literature Lillian Lee TR-12-96 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Learning of Context-Free Languages: A Survey of the Literature Lillian Lee Harvard University Center for Research in Computing
	ftp://das-ftp.harvard.edu/techreports/tr-10-96.ps.gz, 19970102 Ensemble Quantum Computing by Nuclear Magnetic Resonance Spectroscopy David G. Cory1 Nuclear Engineering, M.I.T., Cambridge, MA 02139 Amr F. Fahmy2 Timothy F. Havel2 B.C.M.P., Harvard Medical School, Boston, MA 02115 TR-10-96 (December 18, 1996; revised December 30, 1996) A Technical Report of the
	ftp://das-ftp.harvard.edu/techreports/tr-16-96.ps.gz, 19970114 On the Accuracy of Anderson's Fast N{body Algorithm Yu Charlie Hu S. Lennart Johnsson TR-16-96 December 1996 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in the Proceedings of the Eighth SIAM Conference on Parallel
	ftp://das-ftp.harvard.edu/techreports/tr-14-96.ps.gz, 19970114 A Data{Parallel Adaptive N{body Method Yu Charlie Hu S. Lennart Johnsson Shang-Hua Teng TR-14-96 December 1996 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in the Proceedings of the Eighth SIAM Conference on Parallel
	ftp://das-ftp.harvard.edu/techreports/tr-15-96.ps.gz, 19970114 A Data-Parallel Implementation of the Geometric Partitioning Algorithm Yu Charlie Hu Shang-Hua Teng S. Lennart Johnsson TR-15-96 December 1996 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in the Proceedings of the
	ftp://das-ftp.harvard.edu/techreports/tr-17-96.ps.gz, 19970114 Efficient Parallel FFTs for Different Computational Models Nadia Shalaby TR-17-96 December 1996 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Efficient Parallel FFTs for Different Computational Models Nadia Shalabyy December 25, 1996
	ftp://das-ftp.harvard.edu/techreports/tr-18-96.ps.gz, 19970114 Hierarchical Load Balancing for Parallel Fast Legendre Transforms Nadia Shalaby S. Lennart Johnsson TR-18-96 December 1996 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Hierarchical Load Balancing for Parallel Fast Legendre Transforms Nadia Shalabyy S. Lennart
	ftp://das-ftp.harvard.edu/techreports/tr-01-97.ps.gz, 19970121 DPF: A Data Parallel Fortran Benchmark Suite Yu Charlie Hu S. Lennart Johnsson Dimitris Kehagias Nadia Shalaby TR-01-97 January 1997 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in the Proceedings of the 11th
	ftp://das-ftp.harvard.edu/techreports/tr-06-96.ps.gz, 19970305 On the Accuracy of Poisson's Formula Based N{Body Algorithms Y. Charlie Hu S. Lennart Johnsson TR-06-96 January 1996 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Submitted to SIAM Journal on Scientific Computing. ON THE
	ftp://das-ftp.harvard.edu/techreports/tr-07-96.ps.gz, 19970410 1 MiSFIT: A Freely Available Tool for Building Safe Extensible Systems Christopher Small Harvard University Center for Research in Computing Technology Technical Report 07-96
	ftp://das-ftp.harvard.edu/techreports/tr-10-97.ps.gz, 19970521 L2Act: User Manual Roni Khardon TR-10-97 May 1997 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts L2Act: User Manual Roni Khardon Aiken Computation Laboratory, Harvard University, Cambridge, MA 02138 roni@deas.harvard.edu May 19, 1997 1 Introduction This note
	ftp://das-ftp.harvard.edu/techreports/tr-09-97.ps.gz, 19970521 Learning Action Strategies for Planning Domains Roni Khardon TR-09-97 May 1997 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Learning Action Strategies for Planning Domains Roni Khardon Aiken Computation Laboratory, Harvard University, Cambridge, MA 02138
	ftp://das-ftp.harvard.edu/techreports/tr-11-97.ps.gz, 19970522 Similarity-Based Approaches to Natural Language Processing Lillian Jane Lee TR-11-97 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Similarity-Based Approaches to Natural Language Processing A thesis presented by Lillian Jane Lee to The Division of Engineering
	ftp://das-ftp.harvard.edu/techreports/tr-13-96.ps.gz, 19970805 High Performance Fortran for Highly Irregular Problems Yu Charlie Hu S. Lennart Johnsson Shang-Hua Teng TR-13-96 December 1996 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in the Proceedings of the 6th ACM SIGPLAN
	ftp://das-ftp.harvard.edu/techreports/tr-28-95.ps.gz, 19970805 Learning to take Actions Roni Khardon TR-28-95 December 1995 (Revised July 1997) Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Learning to take Actions Roni Khardony Division of Applied Sciences Harvard University roni@deas.harvard.edu December 1995 (Revised
	ftp://das-ftp.harvard.edu/techreports/tr-13-97.ps.gz, 19970818 DATA PARALLEL PERFORMANCE OPTIMIZATIONS USING ARRAY ALIASING Y. Charlie Hu S. Lennart Johnsson TR-13-97 July 1997 Parallel Computing Research Group Center for Research in Computing Technology Harvard University Cambridge, Massachusetts To appear in Rob Schreiber, Mike Heath and Abhiram Ranade, editors,
	ftp://das-ftp.harvard.edu/techreports/tr-15-97.ps.gz, 19970925 The Computational Processing of Intonational Prominence: A Functional Prosody Perspective Christine Hisayo Nakatani TR-15-97 May 1997 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts THE COMPUTATIONAL PROCESSING OF INTONATIONAL PROMINENCE: A FUNCTIONAL PROSODY
	ftp://das-ftp.harvard.edu/techreports/tr-08-97.ps.gz, 19970925 Evaluation of Two Connectionist Approaches to Stack Representation Rebecca Hwa TR-08-97 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Evaluation of Two Connectionist Approaches to Stack Representation Rebecca Hwa
	ftp://das-ftp.harvard.edu/techreports/tr-19-97.ps.gz, 19980115 Projection Learning Leslie G. Valiant TR-19-97 Center for Research in Computing Technology Harvard University Cambridge, Massachusetts Projection Learning Leslie G. Valiant Division of Engineering and Applied Sciences Harvard University Cambridge, MA 02138
	ftp://das-ftp.harvard.edu/techreports/tr-18-97.ps.gz, 19980115 page 1 of 15 Issues in Extensible Operating Systems Margo I. Seltzer, Yasuhiro Endo, Christopher Small, Keith A. Smith