Browse

ftp://ftp.cs.princeton.edu (208)

	ftp://ftp.cs.princeton.edu/reports/1992/363.ps.Z, 19920517 Unrolling Recursions Saves Space Andrew W. Appel Princeton University CS-TR-363-92 March 10, 1992
	ftp://ftp.cs.princeton.edu/reports/1991/303.ps.Z, 19920517 A Retargetable Compiler for ANSI C Christopher W. Fraser AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 7974 and David R. Hanson Department of Computer Science, Princeton University, Princeton, NJ 8544 Research Report CS-TR-303-91 February 1991
	ftp://ftp.cs.princeton.edu/reports/1991/349.ps.Z, 19920517 Distributed EZ Alvaro E. Campos and David R. Hanson Department of Computer Science, Princeton University, Princeton, NJ 8544 Research Report CS-TR-349-91 September 1991
	ftp://ftp.cs.princeton.edu/reports/1991/306.ps.Z, 19920529 String Processing Languages Ralph E. Griswold Department of Computer Science, The University of Arizona, Tucson, AZ 85721 and David R. Hanson Department of Computer Science, Princeton University, Princeton, NJ 08544 Research Report CS-TR-306-91 February 1991
	ftp://ftp.cs.princeton.edu/reports/1992/362.ps.Z, 19920911 A Monotonicity Theorem for Tandem Queues Y.C. Tay * Department of Computer Science Princeton University yct@cs.princeton.edu
	ftp://ftp.cs.princeton.edu/reports/1992/376.ps.Z, 19920914 J. Gregory Morrisetty Andrew Tolmachz Carnegie Mellon University Princeton University jgmorris@cs.cmu.edu apt@cs.princeton.edu June 1992
	ftp://ftp.cs.princeton.edu/reports/1992/378.ps.Z, 19920914 DEBUGGING STANDARD ML Andrew Peter Tolmach A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE October 1992 c Copyright by Andrew Peter Tolmach 1992 All Rights Reserved ii
	ftp://ftp.cs.princeton.edu/reports/1992/365.ps.Z, 19920916 H0297{2 MIP REVISED Elisha Sacks, Ph.D. Department of Computer Science Princeton University Princeton, NJ 8544, USA Lawrence E. Widman, M.D., Ph.D.y Cardiovascular Section, Department of Medicine University of Oklahoma Health Sciences Center Oklahoma City, OK 73190, USA September 16, 1992 supported by
	ftp://ftp.cs.princeton.edu/reports/1992/379.ps.Z, 19920916 Ayellet Tal, Bernard Chazelle, David Dobkin Department of Computer Science Princeton University Princeton, NJ 8544 September 16, 1992 This videotape shows a line segment intersection algorithm in action and illustrates its most important features. The algorithm, due to Chazelle and Edelsbrunner , has
	ftp://ftp.cs.princeton.edu/reports/1992/375.ps.Z, 19920916 Ayellet Tal Princeton University Rafael Alonso Matsushita Information Technology Laboratory September 16, 1992
	ftp://ftp.cs.princeton.edu/reports/1992/373.ps.Z, 19920916 Karin Petersen Kai Li Department of Computer Science Princeton University
	ftp://ftp.cs.princeton.edu/reports/1992/381.ps.Z, 19920916 Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues1 Adam L. Buchsbaum2 Rajamani Sundar3 Robert E. Tarjan4 Research Report CS-TR-381-92 September 1992
	ftp://ftp.cs.princeton.edu/reports/1992/360.ps.Z, 19920916 An Empirical Comparison of Loop Scheduling Algorithms on a Shared Memory Multiprocessor Matthias A. Blumrich Carrie J. Brownhilly Kai Li Alexandru Nicolauy
	ftp://ftp.cs.princeton.edu/reports/1991/351.ps.Z, 19920916 Literate-Programming Tools Need Not Be Complex Norman Ramsey Department of Computer Science, Princeton University 35 Olden Street, Princeton, New Jersey 8544 Research Report CS-TR-351-91 October 1991 Revised August 1992
	ftp://ftp.cs.princeton.edu/reports/1992/391.ps.Z, 19920921 Monte Carlo and Markov Chain Techniques for Network Reliability and Sampling1 Adam L. Buchsbaum2 Milena Mihail3 Research Report CS-TR-391-92 September 1992
	ftp://ftp.cs.princeton.edu/reports/1992/390.ps.Z, 19920921 Determining Single Connectivity in Directed Graphs Adam L. Buchsbaum1 Martin C. Carlisle2 Research Report CS-TR-390-92 September 1992
	ftp://ftp.cs.princeton.edu/reports/1992/386.ps.Z, 19920930 Engineering Efficient Code Generators using Tree Matching and Dynamic Programming Christopher W. Fraser1 David R. Hanson Todd A. Proebsting2 Research Report CS-TR-386-92 August 1992
	ftp://ftp.cs.princeton.edu/reports/1992/372.ps.Z, 19921001 Software Support for Speculative Loads Anne Rogers Kai Li Department of Computer Science Princeton University Princeton, New Jersey
	ftp://ftp.cs.princeton.edu/reports/1991/329.ps.Z, 19921001 Standard ML of New Jersey Andrew W. Appel Princeton University David B. MacQueen AT&T Bell Laboratories CS-TR-329-91, Dept. of Computer Science, Princeton University, June 1991 This paper appeared in Third Int'l Symp. on Prog. Lang. Implementation and Logic Programming, Springer-Verlag LNCS 528, pp.
	ftp://ftp.cs.princeton.edu/reports/1990/276.ps.Z, 19921001 Virtual Memory Primitives for User Programs Andrew W. Appel and Kai Li CS-TR-276-90 Department of Computer Science Princeton University
	ftp://ftp.cs.princeton.edu/reports/1991/326.ps.Z, 19921001 Callee-save Registers in Continuation-passing Style Andrew W. Appel and Zhong Shaoy CS-TR-326-91 Department of Computer Science Princeton University August 1991 A revised version of this paper appears in Lisp and Symbolic Computation 5, 189-219, 1992.
	ftp://ftp.cs.princeton.edu/reports/1992/393.ps.Z, 19921004 On linear-time deterministic algorithms for optimization problems in xed dimension Bernard Chazelle Department of Computer Science Princeton University Princeton, NJ 8544, USA Ji<=r Matou<=seky Department of Applied Mathematics Charles University Malostransk e n am. 25, 118 00 Praha 1, Czechoslovakia,
	ftp://ftp.cs.princeton.edu/reports/1992/385.ps.Z, 19921005 On the Fault Tolerance of Some Popular Bounded-Degree Networks Tom Leighton1 Mathematics Department, and Laboratory for Computer Science Massachusetts Institute of Technology Cambridge, MA 02139 ftl@math.mit.edu Bruce Maggs NEC Research Institute 4 Independence Way Princeton, NJ 08540
	ftp://ftp.cs.princeton.edu/reports/1992/394.ps.Z, 19921015 STARI: A TECHNIQUE FOR HIGH{BANDWIDTH COMMUNICATION Mark Russell Greenstreet A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE January 1993 This dissertation presents a
	ftp://ftp.cs.princeton.edu/reports/1992/395.ps.Z, 19921016 Smartest Recompilation Zhong Shao Andrew W. Appel zsh@princeton.edu appel@princeton.edu CS-TR-395-92 Princeton University October 1992
	ftp://ftp.cs.princeton.edu/reports/1992/374.ps.Z, 19921019 Supporting SPMD Execution for Dynamic Data Structures Anne Rogers Princeton University amr@cs.princeton.edu John H. Reppy AT&T Bell Laboratories jhr@research.att.com Laurie J. Hendreny McGill University hendren@cs.mcgill.ca
	ftp://ftp.cs.princeton.edu/reports/1992/397.ps.Z, 19921101 CACHING IN LARGE-SCALE DISTRIBUTED FILE SYSTEMS Matthew Addison Blaze A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE January 1993 c Copyright by Matthew Addison Blaze
	ftp://ftp.cs.princeton.edu/reports/1992/399.ps.Z, 19921119 DUEL \| A Very High-Level Debugging Language1 Michael Golan2 David R. Hanson Research Report CS-TR-399-92 November 1992
	ftp://ftp.cs.princeton.edu/reports/1992/401.ps.Z, 19921216 Karin Petersen Kai Li Department of Computer Science Princeton University
	ftp://ftp.cs.princeton.edu/reports/1992/400.ps.Z, 19921216 Karin Petersen Kai Li Department of Computer Science Princeton University
	ftp://ftp.cs.princeton.edu/reports/1992/403.ps.Z, 19921221 A RETARGETABLE DEBUGGER Norman Ramsey A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE January 1993 c Copyright by Norman Ramsey 1993 All Rights Reserved Debuggers are
	ftp://ftp.cs.princeton.edu/reports/1993/404.ps.Z, 19930106 Peter Schr oder Pat Hanrahan Research Report CS-TR-404-93 January 1993
	ftp://ftp.cs.princeton.edu/reports/1993/405.ps.Z, 19930106 Abstracts of all technical reports published by the Department of Computer Science between 1985 and 1991 are listed below. Some of these reports are available for anonymous ftp or can be purchased from the Department. Details are given at the end of this report. TR-001-85 Mutual Exclusion in Partitioned
	ftp://ftp.cs.princeton.edu/reports/1993/406.ps.Z, 19930111 EFFICIENT CHECKPOINTING ON MIMD ARCHITECTURES James Steven Plank A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCEINCE June 1993 c Copyright by James Steven Plank, 1993. All
	ftp://ftp.cs.princeton.edu/reports/1993/407.ps.Z, 19930201 Quasi-Orthogonality via Finite-Differencing: An Elementary Approach to Geometric Discrepancy Bernard Chazelle Department of Computer Science Princeton University Princeton, NJ 8544, USA chazelle@princeton.edu
	ftp://ftp.cs.princeton.edu/reports/1993/408.ps.Z, 19930203 Radiosity and Relaxation Methods Progressive Re nement is Southwell Relaxation Steven Gortler and Michael F. Cohen Department of Computer Science Princeton University Philipp Slusallek Wilhelm-Schickard-Institut fur Informatik Universitat Tubingen February 3, 1993
	ftp://ftp.cs.princeton.edu/reports/1993/410.ps.Z, 19930205 A Hierarchical Illumination Algorithm for Surfaces with Glossy Reflection Larry Aupperle Pat Hanrahan Meshing for glossy and diffuse reflection. Princeton University Department of Computer Science Princeton, New Jersey 08544 January 1993
	ftp://ftp.cs.princeton.edu/reports/1993/409.ps.Z, 19930205 Pat Hanrahan Department of Computer Science Princeton University Princeton, NJ 8544, USA Wolfgang Krueger Department of Scientific Visualization German National Research Center for Computer Science Sankt Augustin, Germany The reflection of light from most materials consists of two major terms: the
	ftp://ftp.cs.princeton.edu/reports/1993/411.ps.Z, 19930218 Building and Using Polyhedral Hierarchies David Dobkin Ayellet Tal Department of Computer Science Princeton University Princeton, NJ 8544 This animation shows the techniques used to build a hierarchy of polyhedra as a preprocessing step for intersection detection algorithms. It is an animation of ideas
	ftp://ftp.cs.princeton.edu/reports/1993/412.ps.Z, 19930219 Hash-consing Garbage Collection Andrew W. Appel appel@princeton.edu Marcelo J. R. Gon calvesy mjrg@cs.princeton.edu CS-TR-412-93 Princeton University February 1993
	ftp://ftp.cs.princeton.edu/reports/1993/414.ps.Z, 19930304 Communication and Fault Tolerance in Parallel Computers Ramesh Kumar Sitaraman Research Report CS-TR-xxx-93 February 1993 COMMUNICATION AND FAULT TOLERANCE IN PARALLEL COMPUTERS Ramesh Kumar Sitaraman A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR
	ftp://ftp.cs.princeton.edu/reports/1993/413.ps.Z, 19930304 On linear-time deterministic algorithms for optimization problems in xed dimension Bernard Chazelle Department of Computer Science Princeton University Princeton, NJ 8544, USA Ji<=r Matou<=seky Department of Applied Mathematics Charles University Malostransk e n am. 25, 118 00 Praha 1, Czechoslovakia,
	ftp://ftp.cs.princeton.edu/reports/1993/416.ps.Z, 19930314 A Clustering-Based Optimization Algorithm in Zero-Skew Routings Masato Edahiro 1 Research Report CS-TR-416-93 March 1993
	ftp://ftp.cs.princeton.edu/reports/1993/420.ps.Z, 19930319 Con uently Persistent Deques via Data-Structural Bootstrapping1 Adam L. Buchsbaum2 Robert E. Tarjan3 Research Report CS-TR-420-93 March 1993
	ftp://ftp.cs.princeton.edu/reports/1993/419.ps.Z, 19930319 DISTRIBUTED, GARBAGE-COLLECTED, PERSISTENT, VIRTUAL ADDRESS SPACES Alvaro E. Campos A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE June 1993 c Copyright by Alvaro E.
	ftp://ftp.cs.princeton.edu/reports/1992/368-A.ps.Z, 19930408 DECOMPOSITION PROBLEMS IN COMPUTATIONAL GEOMETRY Leonidas Palios A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE June 1992 c Copyright by Leonidas Palios 1992 All Rights
	ftp://ftp.cs.princeton.edu/reports/1993/415.ps.Z, 19930416 Delay Minimization for Zero-Skew Routing Masato Edahiro 1 Research Report CS-TR-415-93 March 1993
	ftp://ftp.cs.princeton.edu/reports/1992/368-B.ps.Z, 19930422 include.h lap @ atomic 92/04/12 15:22:59 1 /* include.h / #include #include #include "defs.h" #include "structs.h" #include "macros.h" defs.h lap @ atomic 92/04/12 15:26:23 1 / defs.h / #define DIAGNOSTICS #define DEBUG #define XALLDEBUG / define DEBUG, in case ALLDEBUG is defined
	ftp://ftp.cs.princeton.edu/reports/1992/368.ps.Z, 19930423 DECOMPOSITION PROBLEMS IN COMPUTATIONAL GEOMETRY Leonidas Palios A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE June 1992 c Copyright by Leonidas Palios 1992 All Rights
	ftp://ftp.cs.princeton.edu/reports/1993/421.ps.Z, 19930426 Elisha Sacks Computer Science Department Princeton University Princeton, NJ 8544 Leo Joskowicz IBM T.J. Watson Research Center P.O. Box 704 Yorktown Heights, NY 10598 April 26, 1993
	ftp://ftp.cs.princeton.edu/reports/1993/422.ps.Z, 19930505 Lazy Structure Sharing for Query Optimization Adam L. Buchsbaum1 Rajamani Sundar2 Robert E. Tarjan3 Research Report CS-TR-422-93 May 1993
	ftp://ftp.cs.princeton.edu/reports/1992/388.ps.Z, 19930520 Complexity of the Simplified Segmental Phonology Eric Sven Ristad1 Research Report CS-TR-388-92 August 1992
	ftp://ftp.cs.princeton.edu/reports/1993/424.ps.Z, 19930525 Leo Joskowicz IBM T.J. Watson Research Center P.O. Box 704 Yorktown Heights, NY 10598 Elisha Sacks Computer Science Department Princeton University Princeton, NJ 08544 May 25, 1993
	ftp://ftp.cs.princeton.edu/reports/1992/382.ps.Z, 19930604 Depth Complexity in Object-Parallel Graphics Architectures Michael Cox Pat Hanrahan Department of Computer Science Princeton University 35 Olden Street Princeton, NJ 8540 September 17, 1992
	ftp://ftp.cs.princeton.edu/reports/1993/426.ps.Z, 19930621 A uniform circuit lower bound for the permanent Eric Allender Department of Computer Science Princeton University 35 Olden Street, Princeton, NJ 08544 Vivek Gorey Department of Computer Science Rutgers University New Brunswick, NJ 08903 June 21, 1993
	ftp://ftp.cs.princeton.edu/reports/1993/427.ps.Z, 19930622 Evenly Distributed Depth is the Worst for Distributed Snooping Michael Cox Pat Hanrahan Princeton University
	ftp://ftp.cs.princeton.edu/reports/1993/428.ps.Z, 19930625 MINIMUM SPANNING TREE VERIFICATION, FAST PRIORITY QUEUES, AND MASSIVELY PARALLEL FACTORING Brandon Dixon A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE October 1993 c
	ftp://ftp.cs.princeton.edu/reports/1993/431-1.ps.Z, 19930806 OPERATING SYSTEM SUPPORT FOR MODERN MEMORY HIERARCHIES Karin Petersen A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE October 1993 c Copyright by Karin Petersen 1993 All
	ftp://ftp.cs.princeton.edu/reports/1993/431-2.ps.Z, 19930806 Chapter 3 introduced the idea of VM-based algorithms for cache coherence on multipro- cessors. This chapter presents a discussion and evaluation of the effects of several design alternatives and architectural parameters on the performance of the VM-based cache co- herence algorithms. 4.1 Design
	ftp://ftp.cs.princeton.edu/reports/1993/434.ps.Z, 19930927 HIERARCHICAL ALGORITHMS FOR ILLUMINATION Larry Aupperle A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE November 1993 c Copyright by Larry Aupperle 1993 All Rights
	ftp://ftp.cs.princeton.edu/reports/1993/436.ps.Z, 19931021 A Randomized Linear-Time Algorithm for Finding Minimum Spanning Trees Philip N. Klein Robert E. Tarjany October 12, 1993
	ftp://ftp.cs.princeton.edu/reports/1993/438.ps.Z, 19931112 A VERY HIGH LEVEL DEBUGGING LANGUAGE Michael Golan A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE January 1994 c Copyright by Michael Golan 1994 All Rights Reserved To
	ftp://ftp.cs.princeton.edu/reports/1993/439.ps.Z, 19931122 Liviu Iftode Kai Li Princeton University Department of Computer Science Princeton, NJ 8544
	ftp://ftp.cs.princeton.edu/reports/1993/437.ps.Z, 19931123 Virtual Memory Mapped Network Interface for the SHRIMP Multicomputer Matthias A. Blumrich, Kai Li, Richard Alpert, Cezary Dubnicki, and Edward W. Felten Department of Computer Science, Princeton University, Princeton NJ 8544 Jonathan Sandberg Panasonic Technologies, Inc., 2 Research Way, Princeton, NJ
	ftp://ftp.cs.princeton.edu/reports/1993/440.ps.Z, 19931203 A Critical Analysis of Multigrid Methods on Massively Parallel Computers Lesley R. Matheson Robert E. Tarjan y July 21, 1993
	ftp://ftp.cs.princeton.edu/reports/1994/442.ps.Z, 19940126 John Danskin Pat Hanrahan January 19, 1994
	ftp://ftp.cs.princeton.edu/reports/1994/441.ps.Z, 19940126 Compression Performance of the Xremote Protocol John Danskin Pat Hanrahan Department of Computer Science, Princeton University
	ftp://ftp.cs.princeton.edu/reports/1991/317.ps.Z, 19940127 Lecture Notes on Evasiveness of Graph Properties Lectures by L aszl o Lov asz Computer Science Department, Princeton University, Princeton, NJ 08544, USA, and Computer Science Department, E~otv~os Lor and University, Budapest, Hungary H-1088. Notes by Neal Young Computer Science Department, Princeton
	ftp://ftp.cs.princeton.edu/reports/1991/348.ps.Z, 19940127 COMPETITIVE PAGING AND DUAL-GUIDED ON-LINE WEIGHTED CACHING AND MATCHING ALGORITHMS Neal Young A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE, PRINCETON UNIVERSITY
	ftp://ftp.cs.princeton.edu/reports/1994/448.ps.Z, 19940222 12 A Critical Analysis of Multigrid Methods on Massively Parallel Computers Lesley R. Matheson1 and Robert E. Tarjan2
	ftp://ftp.cs.princeton.edu/reports/1994/446.ps.Z, 19940224 A COMPARISON STUDY OF HEURISTICS FOR MAPPING PARALLEL ALGORITHMS TO MESSAGE-PASSING MULTIPROCESSORS Marios D. Dikaiakos Anne Rogers Ken Steiglitz Department of Computer Science Princeton University email: mdd@princeton.edu
	ftp://ftp.cs.princeton.edu/reports/1990/286.ps.Z, 19940301 AVERAGE-CASE ANALYSIS OF GRAPH-SEARCHING ALGORITHMS SARANTOS KAPIDAKIS A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE October 1990 c Copyright by Sarantos Kapidakis 1990
	ftp://ftp.cs.princeton.edu/reports/1994/449.ps.Z, 19940303 Textures and Radiosity: Controlling Emission and Reflection with Texture Maps Reid Gershbein Peter Schr oder Pat Hanrahan Research Report CS-TR-449-94 March 1993
	ftp://ftp.cs.princeton.edu/reports/1994/450.ps.Z, 19940308 An Empirical and Analytic Study of Stack vs. Heap Cost for Languages with Closures Andrew W. Appel appel@princeton.edu Zhong Shao zsh@cs.princeton.edu CS-TR-450-94 Princeton University March 8, 1994
	ftp://ftp.cs.princeton.edu/reports/1994/451.ps.Z, 19940314 Axiomatic Bootstrapping: A guide for compiler hackers Andrew W. Appel CS-TR-451-94 Princeton University appel@princeton.edu March 10, 1994
	ftp://ftp.cs.princeton.edu/reports/1994/452.ps.Z, 19940315 Separate Compilation for Standard ML Andrew W. Appel y Princeton University appel@princeton.edu David B. MacQueen AT&T Bell Laboratories macqueen@research.att.com Princeton University CS-TR-452-94 March 15, 1994
	ftp://ftp.cs.princeton.edu/reports/1991/352.ps.Z, 19940317 Debuggable Concurrency Extensions for Standard ML Andrew P. Tolmachy and Andrew W. Appely Princeton University CS-TR-352-91 October 1991
	ftp://ftp.cs.princeton.edu/reports/1994/453.ps.Z, 19940317 Unrolling Lists Zhong Shao y John H. Reppy z Andrew W. Appel y Princeton University AT&T Bell Laboratories Princeton University Princeton University CS-TR-453-94 March 1994
	ftp://ftp.cs.princeton.edu/reports/1994/454.ps.Z, 19940317 Space-Efficient Closure Representations Zhong Shao and Andrew W. Appel y Princeton University CS-TR-454-94 March 1994
	ftp://ftp.cs.princeton.edu/reports/1992/364.ps.Z, 19940321 A Critique of Standard ML Andrew W. Appel Princeton University revised version of CS-TR-364-92 November 12, 1992
	ftp://ftp.cs.princeton.edu/reports/1994/455.ps.Z, 19940405 An Analysis of a Combined Hardware-software Mechanism for Speculative Loads Stefanos Damianakis, Kai Li, and Anne Rogers Department of Computer Science Princeton University Princeton, New Jersey TR-455-94 April 5, 1994
	ftp://ftp.cs.princeton.edu/reports/1994/456.ps.Z, 19940419 Steven J. Gortler and Michael F. Cohen Department of Computer Science Princeton University
	ftp://ftp.cs.princeton.edu/reports/1994/457.ps.Z, 19940517 to appear in Proceedings of SPAA '94 Richard Cole New York University Philip N. Klein y Brown University Robert E. Tarjan z Princeton University and NEC Research Institute
	ftp://ftp.cs.princeton.edu/reports/1994/445.ps.Z, 19940526 Application-Controlled File Caching Policies Pei Cao, Edward W. Felten, and Kai Li Department of Computer Science Princeton University Princeton, NJ 8544 USA
	ftp://ftp.cs.princeton.edu/reports/1994/458.ps.Z, 19940531 DISTRIBUTED QUERIES AND INCREMENTAL UPDATES IN INFORMATION RETRIEVAL SYSTEMS Anthony Slavko Tomasic A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE June 1994 c Copyright
	ftp://ftp.cs.princeton.edu/reports/1994/460.ps.Z, 19940615 Loop Headers in -calculus or CPS Andrew W. Appel Princeton University appel@princeton.edu CS-TR-460-94 Princeton University June 15, 1994
	ftp://ftp.cs.princeton.edu/reports/1994/459.ps.Z, 19940620 Emulating Write-Allocate on a No-Write-Allocate Cache Andrew W. Appel Princeton University appel@princeton.edu CS-TR-459-94 Princeton University June 20, 1994
	ftp://ftp.cs.princeton.edu/reports/1994/461.ps.Z, 19940622 Dominating Sets in Planar Graphs1 Lesley R. Matheson2 Robert E. Tarjan2;3 May, 1994
	ftp://ftp.cs.princeton.edu/reports/1993/423.ps.Z, 19940707 DATA-STRUCTURAL BOOTSTRAPPING AND CATENABLE DEQUES Adam Louis Buchsbaum A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE June 1993 c Copyright by Adam Louis Buchsbaum 1994
	ftp://ftp.cs.princeton.edu/reports/1994/463.ps.Z, 19940722 Appears in: ASPLOS VI," Oct. 1994. Reprinted by permission of ACM. Where is Time Spent in Message-Passing and Shared-Memory Programs Satish Chandra James R. Larus Computer Sciences Department University of Wisconsin{Madison 1210 West Dayton Street Madison, WI 53706 USA fchandra,larusg@cs.wisc.edu Anne
	ftp://ftp.cs.princeton.edu/reports/1994/464.ps.Z, 19940817 Appears in: Supercomputing '94," Nov. 1994. Reprinted by permission of IEEE. Application-Specific Protocols for User-Level Shared Memory Babak Falsa , Alvin R. Lebeck, Steven K. Reinhardt, Ioannis Schoinas, Mark D. Hill, James R. Larus, Anne Rogers y , David A. Wood Computer Sciences Department
	ftp://ftp.cs.princeton.edu/reports/1994/467.ps.Z, 19941003 David P. Dobkin 1 Department of Computer Science, Princeton University, 35 Olden St., Princeton, NJ 8540, USA e-mail: dpd@cs.princeton.edu Dimitrios Gunopulos 1 Department of Computer Science, Princeton University, 35 Olden St., Princeton, NJ 08540, USA e-mail: dg@cs.princeton.edu Wolfgang Maass
	ftp://ftp.cs.princeton.edu/reports/1994/468.ps.Z, 19941013 Collusion-Secure Fingerprinting for Digital Data Dan Boneh y James Shaw dabo@cs.princeton.edu jhs@cs.princeton.edu Department of Computer Science Princeton University Princeton, NJ 8544
	ftp://ftp.cs.princeton.edu/reports/1994/471.ps.Z, 19941019 New Jersey Machine-Code Toolkit Reference Manual Version 0.1 Norman Ramsey Mary Fernandez October 18, 1994 2 Contents 1 Introduction 5 1.1 Multiple-language support : : : : : : : : : : : : : : : : : : : : : : 5 1.2 Caveat user : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 6 1.3 Known bugs
	ftp://ftp.cs.princeton.edu/reports/1994/469.ps.Z, 19941019 The New Jersey Machine-Code Toolkit Norman Ramsey Bell Communications Research 445 South Street Morristown, NJ 07960 norman@bellcore.com Mary F. Fernandez Department of Computer Science Princeton University Princeton, NJ 08544 mff@cs.princeton.edu
	ftp://ftp.cs.princeton.edu/reports/1994/470.ps.Z, 19941019 New Jersey Machine-Code Toolkit Architecture Specifications Norman Ramsey Mary Fernandez October 18, 1994 Preface The New Jersey Machine-Code Toolkit helps programmers write applications that process machine code\|assemblers, disassemblers, code generators, tracers, profilers, and debuggers. The toolkit
	ftp://ftp.cs.princeton.edu/reports/1994/465.ps.Z, 19941026 COMPRESSING THE X GRAPHICS PROTOCOL John Moffatt Danskin A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE November 1994 c Copyright by John Moffatt Danskin 1994 All Rights
	ftp://ftp.cs.princeton.edu/reports/1994/472.ps.Z, 19941030 Probability Value Library 1 Peter N. Yianilos, NEC Research Institute Eric Sven Ristad, Princeton University Research Report CS-TR-472-94 October 1994
	ftp://ftp.cs.princeton.edu/reports/1994/473.ps.Z, 19941102 WAVELET METHODS FOR COMPUTER GRAPHICS Steven J. Gortler A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE January 1995 c Copyright by Steven J. Gortler 1995 All Rights
	ftp://ftp.cs.princeton.edu/reports/1994/474.ps.Z, 19941107 Simple and Effective Link-Time Optimization of Modula-3 Programs Mary F. Fernandez November 7, 1994 1 Introduction Object-oriented languages have features that help develop modular programs and libraries of reusable software. Opaque types and methods, two such features in Modula-3, incur a runtime cost,
	ftp://ftp.cs.princeton.edu/reports/1994/475.ps.Z, 19941108 COMPILING STANDARD ML FOR EFFICIENT EXECUTION ON MODERN MACHINES Zhong Shao A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE November 1994 c Copyright by Zhong Shao 1995
	ftp://ftp.cs.princeton.edu/reports/1994/462.ps.Z, 19941114 Implementation and Performance of Application-Controlled File Caching Pei Cao, Edward W. Felten, and Kai Li Department of Computer Science Princeton University Princeton, NJ 8544 USA fpc,felten,lig@cs.princeton.edu
	ftp://ftp.cs.princeton.edu/reports/1994/477.ps.Z, 19941115 Making Lambda Calculus Smaller, Faster Andrew W. Appel Princeton University appel@princeton.edu Trevor Jim Massachusetts Inst. of Technology trevor@lcs.mit.edu Princeton CS-TR-477-94 November 1994
	ftp://ftp.cs.princeton.edu/reports/1994/478.ps.Z, 19941205 1 1 Programmable Parallel Arithmetic in Cellular Automata using a Particle Model Richard K. Squier, Ken Steiglitz December 3, 1994
	ftp://ftp.cs.princeton.edu/reports/1994/447.ps.Z, 19941213 To appear in ACM Transactions on Programming Languages and Systems ANNE ROGERS and MARTIN C. CARLISLE Princeton University JOHN H. REPPY AT&T Bell Laboratories and LAURIE J. HENDREN McGill University Compiling for distributed memory machines has been a very active research area in recent years. Much of
	ftp://ftp.cs.princeton.edu/reports/1994/480.ps.Z, 19941220 David P. Dobkin 1 2 Dimitrios Gunopulos 1 3 In this paper we give algorithms that compute the maximum bichromatic discrepancy for simple geometric ranges and consequently solve the minimizing disagreement problem of machine learning for geometric hypotheses. The main result, presented in section 3 is an
	ftp://ftp.cs.princeton.edu/reports/1994/481.ps.Z, 19941220 David P. Dobkin 1 2 Dimitrios Gunopulos 1 3 We present a general approach to solving the minimizing disagreement problem for geometric hypotheses with finite VC-dimension. These results also imply efficient agnosticPAC learning of these hypotheses classes. In particular we give an O(n min( +1=2;2k 1)
	ftp://ftp.cs.princeton.edu/reports/1994/482.ps.Z, 19941221 Cache Performance of Fast-Allocating Programs Marcelo J. R. Gon calves and Andrew W. Appel Princeton University Department of Computer Science fmjrg,appelg@cs.princeton.edu Princeton CS-TR-482-94 December 21, 1994
	ftp://ftp.cs.princeton.edu/reports/1994/479.ps.Z, 19950109 A Study of Integrated Prefetching and Caching Strategies Pei Cao Edward W. Felten Anna Karlin y Kai Li
	ftp://ftp.cs.princeton.edu/reports/1995/483.ps.Z, 19950119 Software Caching and Computation Migration in Olden Martin C. Carlisle and Anne Rogers Department of Computer Science Princeton University fmcc,amrg@cs.princeton.edu TR-483-95
	ftp://ftp.cs.princeton.edu/reports/1995/484.ps.Z, 19950207 1 1 General Parallel Computation without CPUs: VLSI Realization of a Particle Machine Richard K. Squier, Ken Steiglitz, Mariusz H. Jakubowski February 6, 1995
	ftp://ftp.cs.princeton.edu/reports/1995/485a.ps.Z, 19950213 An Adaptive Gauss Method For Computing Irradiance Coefficients of Galerkin Radiosity Systems Reid Gershbein Department Of Computer Science Princeton University
	ftp://ftp.cs.princeton.edu/reports/1994/476.ps.Z, 19950215 Probabilistic Checking of Proofs and Hardness of Approximation Problems Sanjeev Arora CS-TR-476-94 (Revised version of a dissertation submitted at CS Division, UC Berkeley, in August 1994) Princeton tech-reports are available in postscript form via anonymous ftp from ftp.cs.princeton.edu (InterNet
	ftp://ftp.cs.princeton.edu/reports/1990/270.ps.Z, 19950216 A Code Generation Interface for ANSI C Christopher W. Fraser AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 7974 and David R. Hanson Department of Computer Science, Princeton University, Princeton, NJ 8544 Research Report CS-TR-270-90 July 1990 Last Revised September 1991
	ftp://ftp.cs.princeton.edu/reports/1995/487.ps.Z, 19950329 A Type-Based Compiler for Standard ML Zhong Shao Andrew W. Appely Yale University Princeton University PRINCETON-CS-TR-487-95 March 28, 1995
	ftp://ftp.cs.princeton.edu/reports/1995/488.ps.Z, 19950404 Efficient Support for Irregular Applications on Distributed-Memory Machines Appears in ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPoPP), July 1995. Princeton CS TR-488-95, Maryland CS-TR-3453 & UMIACS-TR-95-46, & Wisconsin CS TR 1271. Shubhendu S. Mukherjeey, Shamik D.
	ftp://ftp.cs.princeton.edu/reports/1993/430.ps.Z, 19950426 SCHEDULING AND BEHAVIORAL TRANSFORMATIONS FOR PARALLEL SYSTEMS Liang-Fang Chao A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE October 1993 c Copyright by Liang-Fang Chao
	ftp://ftp.cs.princeton.edu/reports/1995/489.ps.Z, 19950505 Breaking DES Using a Molecular Computer Dan Boneh Christopher Dunworth Richard J. Lipton dabo@cs.princeton.edu ctd@cs.princeton.edu rjl@cs.princeton.edu Department of Computer Science Princeton University Princeton, NJ 8544
	ftp://ftp.cs.princeton.edu/reports/1995/490.ps.Z, 19950508 The implementation of mlcc and mld: A Machine-Independent Compiler and A Retargetable, Optimizing Linker Mary Fernandez May 8, 1995 Contents 1 Introduction 4 2 mlcc: A C to mill compiler 5 2.1 Program initialization and termination : : : : : : : : : : : : : : : : : : : : : : : : : : 5 2.2 Generating
	ftp://ftp.cs.princeton.edu/reports/1995/491.ps.Z, 19950509 Making DNA Computers Error Resistant Dan Boneh Richard J. Lipton Department of Computer Science Princeton University DNA (deoxyribonucleic acid) based computing is days old. Yet there have already been a number of exciting results. It all started with Adleman's beautiful insight that showed that
	ftp://ftp.cs.princeton.edu/reports/1995/492.ps.Z, 19950623 CACHE PERFORMANCE OF PROGRAMS WITH INTENSIVE HEAP ALLOCATION AND GENERATIONAL GARBAGE COLLECTION Marcelo Jos e de Rezende Gon calves A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF
	ftp://ftp.cs.princeton.edu/reports/1995/493.ps.Z, 19950705 Implementation and Performance of Integrated Application-Controlled Caching, Prefetching and Disk Scheduling Pei Cao Edward W. Felten Anna R. Karlin y Kai Li
	ftp://ftp.cs.princeton.edu/reports/1995/494.ps.Z, 19950710 How to Edit a Journal by E-mail Andrew W. Appel Department of Computer Science Princeton University appel@princeton.edu CS-TR-494-95 July 10, 1995
	ftp://ftp.cs.princeton.edu/reports/1995/496.ps.Z, 19950816 SCHEDULING IN DISTRIBUTED SOFT REAL-TIME SYSTEMS WITH AUTONOMOUS COMPONENTS By Benjamin Chi-Ming Kao a dissertation presented to the faculty of princeton university in candidacy for the degree of doctor of philosophy recommended for acceptance by the department of computer science November 1995 c
	ftp://ftp.cs.princeton.edu/reports/1995/498.ps.Z, 19950816 Iterated Register Coalescing Lal George AT&T Bell Labs, rm. 2A426 600 Mountain Avenue Murray Hill, NJ 07974 george@research.att.com Andrew W. Appel Dept. of Computer Science Princeton University Princeton, NJ 08544-2087 appel@princeton.edu princeton cs-tr-498-95 August 15, 1995
	ftp://ftp.cs.princeton.edu/reports/1995/486.ps.Z, 19950816 Nonmonotonic Extension Models 1 Eric Sven Ristad Robert G. Thomas Research Report CS-TR-486-95 February 1995
	ftp://ftp.cs.princeton.edu/reports/1995/497.ps.Z, 19950816 E ect of Speed on Handwriting Shape: A Descriptive Generalization1 Eric Sven Ristad Research Report CS-TR-497-95 August 1995
	ftp://ftp.cs.princeton.edu/reports/1992/402.ps.Z, 19950825 FULLY DYNAMIC GRAPH ALGORITHMS AND THEIR DATA STRUCTURES Monika Rauch A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE January 1993 c Copyright by Monika Rauch 1993 All
	ftp://ftp.cs.princeton.edu/reports/1995/495.ps.Z, 19950830 A Natural Law of Succession 1 Eric Sven Ristad Research Report CS-TR-495-95 May 1995; Revised July 1995
	ftp://ftp.cs.princeton.edu/reports/1989/220.ps.Z, 19950912 A Runtime System Andrew W. Appel Princeton University CS-TR-220-89 May 1989 A revised version of this paper appeared in Journal of Lisp and Symbolic Computation 3, 343-380, 1990.
	ftp://ftp.cs.princeton.edu/reports/1992/383.ps.Z, 19950915 Computational Geometry and Computer Graphics David P. Dobkin+ Department of Computer Science Princeton University Princeton, NJ 08544
	ftp://ftp.cs.princeton.edu/reports/1993/417.ps.Z, 19950915 Depth Reduction for Noncommutative Arithmetic Circuits (Extended Abstract) Eric Allender Department of Computer Science Princeton University 35 Olden Street Princeton, NJ, 08544-2087 allender@cs.princeton.edu Jia Jiaoy Department of Computer Science Rutgers University Hill Center, Busch Campus New
	ftp://ftp.cs.princeton.edu/reports/1990/253.ps.Z, 19950915 Debugging Standard ML Without Reverse Engineering Andrew P. Tolmach* Andrew W. Appel* Department of Computer Science Princeton University CS-TR-253-90 March 1990 (Paper presented at 1990 ACM Conference on LISP and Functional Programming, Nice, June 1990.)
	ftp://ftp.cs.princeton.edu/reports/1995/499.ps.Z, 19951005 On The Computational Power of DNA Dan Boneh Christopher Dunworth Richard J. Lipton dabo@cs.princeton.edu ctd@cs.princeton.edu rjl@cs.princeton.edu Department of Computer Science Princeton University Princeton, NJ 08544 Ji<=r Sgally sgallj@earn.cvut.cz Hebrew University Jerusalem, Israel
	ftp://ftp.cs.princeton.edu/reports/1995/500.ps.Z, 19951110 A Machine-Independent Debugger David R. Hanson and Mukund Raghavachari Research Report CS-TR-500-95 November 9, 1995
	ftp://ftp.cs.princeton.edu/reports/1995/501.ps.Z, 19951113 Security Flaws in the HotJava Web Browser Drew Dean ddean@cs.princeton.edu Dan S. Wallach dwallach@cs.princeton.edu Department of Computer Science, Princeton University November 3, 1995
	ftp://ftp.cs.princeton.edu/reports/1995/502.ps.Z, 19951206 Integrated Parallel Prefetching and Caching
	ftp://ftp.cs.princeton.edu/reports/1995/503.ps.Z, 19951206 Dynamic Trees as Search Trees via Euler Tours, Applied to the Network Simplex Algorithm Robert E. Tarjan Research Report CS-TR-503-95 September, 1995
	ftp://ftp.cs.princeton.edu/reports/1995/504.ps.Z, 19960126 54 CHAPTER 10 HARDNESS OF APPROXIMATIONS Sha92. A. Shamir. IP = PSPACE. J. of the ACM, 39(4):869{877, October 1992. Sim90. H. U. Simon. On approximate solutions for combinatorial optimization problems. SIAM J. Algebraic Discrete Methods, 3:294{310, 1990. Sud92. Madhu Sudan. Efficient checking of
	ftp://ftp.cs.princeton.edu/reports/1996/505.ps.Z, 19960126 A STUDY OF THE EFFECTS OF ORDERING, PARTITIONING AND FACTORIZATION ALGORITHMS ON DISTRIBUTED SPARSE CHOLESKY FACTORIZATION MUKUND RAGHAVACHARI AND ANNE ROGERS DEPARTMENT OF COMPUTER SCIENCE, PRINCETON UNIVERSITY PRINCETON, NJ 8544 MRM@CS.PRINCETON.EDU AMR@CS.PRINCETON.EDU PHONE: (609)-258-5388
	ftp://ftp.cs.princeton.edu/reports/1996/507.ps.Z, 19960129 Design and Implementation of NX Message Passing Using Shrimp Virtual Memory Mapped Communication Richard Alpert, Cezary Dubnicki, Edward W. Felten, and Kai Li Technical Report TR-507-96 Department of Computer Science Princeton University Princeton, New Jersey 08544-2009
	ftp://ftp.cs.princeton.edu/reports/1996/508.ps.Z, 19960129 Contention and Queueing in an Experimental Multicomputer: Analytical and Simulation-based Results Wenjia Fang , Edward W. Felten , and Margaret Martonosiy Department of Computer Science, Princeton University y Department of Electrical Engineering, Princeton University Computer Science Technical Report
	ftp://ftp.cs.princeton.edu/reports/1996/506.ps.Z, 19960129 In Proc. of the International Workshop on Parallel Symbolic Languages and Systems, Oct. 1995 (Springer) Understanding Language Support for Irregular Parallelism Mukund Raghavachari and Anne Rogers Princeton University, Princeton NJ 8544 CS-TR-506-96
	ftp://ftp.cs.princeton.edu/reports/1996/510.ps.Z, 19960129 Early Experience with Message-Passing on the SHRIMP Multicomputer Edward W. Felten, Richard D. Alpert, Angelos Bilas, Matthias A. Blumrich, Douglas W. Clark, Stefanos Damianakis, Cezary Dubnicki, Liviu Iftode, and Kai Li Department of Computer Science Princeton University Technical Report TR-510-96 A
	ftp://ftp.cs.princeton.edu/reports/1996/511.ps.Z, 19960207 TR-511-96 Purely Functional Representations of Catenable Sorted Lists. Haim Kaplan1 Robert E. Tarjan2
	ftp://ftp.cs.princeton.edu/reports/1996/514.ps.Z, 19960228 Irregular Applications under Software Shared Memory Liviu Iftode, Jaswinder Pal Singh and Kai Li Department of Computer Science Princeton University Princeton, NJ 08544 liv,jps,li@cs.princeton.edu
	ftp://ftp.cs.princeton.edu/reports/1996/515.ps.Z, 19960305 Hardness of Computing the Most Signi cant Bits of Secret Keys in Diffie-Hellman and Related Schemes Dan Boneh dabo@cs.princeton.edu Department of Computer Science Princeton University Princeton, NJ 8544 Ramarathnam Venkatesan venkie@bellcore.com Bellcore Room-1C341B, 445 South Street, Morristown NJ 7960
	ftp://ftp.cs.princeton.edu/reports/1996/512.ps.Z, 19960312 Fast RPC on the SHRIMP Virtual Memory Mapped Network Interface Princeton University Technical Report TR-512-96 A shorter version of this report is submitted for publication. Angelos Bilas and Edward W. Felten Department of Computer Science, Princeton University, Princeton NJ 8544 USA
	ftp://ftp.cs.princeton.edu/reports/1996/518.ps.Z, 19960313 In Proceedings of the 2nd International Symposium on High-Performance Comp uter Architecture, February 1996. Improving Release-Consistent Shared Virtual Memory using Automatic Update Liviu Iftode, Cezary Dubnicki, Edward W. Felten and Kai Li Department of Computer Science Princeton University Princeton,
	ftp://ftp.cs.princeton.edu/reports/1996/520.ps.Z, 19960314 A Revocable Backup System (extended abstract) Dan Boneh Richard J. Liptony dabo@cs.princeton.edu rjl@cs.princeton.edu Department of Computer Science Princeton University Princeton, NJ 8544
	ftp://ftp.cs.princeton.edu/reports/1996/519.ps.Z, 19960316 To appear in Proceedings of the 23rd Annual International Symposium on Computer Architecture, May 1996. Understanding Application Performance on Shared Virtual Memory Systems Liviu Iftode, Jaswinder Pal Singh and Kai Li Department of Computer Science Princeton University Princeton, NJ 08544 USA
	ftp://ftp.cs.princeton.edu/reports/1996/509.ps.Z, 19960327 To appear in Proceedings of the 8th Anual ACM Symposium on Parallel Algorithms a nd Architectures, June 1996 Scope Consistency : A Bridge between Release Consistency and Entry Consistency Liviu Iftode, Jaswinder Pal Singh and Kai Li Department of Computer Science, Princeton University, Princeton, NJ
	ftp://ftp.cs.princeton.edu/reports/1996/521.ps.Z, 19960416 Application Challenges to Computational Geometry CG Impact Task Force Report
	ftp://ftp.cs.princeton.edu/reports/1996/522.ps.Z, 19960529 APPLICATION-CONTROLLED FILE CACHING AND PREFETCHING Pei Cao A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE January 1996 c Copyright by Pei Cao 1996 All Rights Reserved ii
	ftp://ftp.cs.princeton.edu/reports/1996/523.ps.Z, 19960703 STUDIES IN COMPUTATIONAL NUMBER THEORY WITH APPLICATIONS TO CRYPTOGRAPHY Dan Boneh A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE November 1996 c Copyright by Dan Boneh
	ftp://ftp.cs.princeton.edu/reports/1996/529.ps.Z, 19961002 In Proceedings of the 2nd Symposium on Operating Systems Design and Implementation, October 1996 Performance Evaluation of Two Home-Based Lazy Release Consistency Protocols for Shared Virtual Memory Systems Yuanyuan Zhou, Liviu Iftode and Kai Li Department of Computer Science Princeton University
	ftp://ftp.cs.princeton.edu/reports/1996/525.ps.Z, 19961002 Reducing Waiting Costs in User-Level Communication Princeton University Technical Report TR-525-96 Stefanos N. Damianakis, Yuqun Chen, Edward W. Felten Department of Computer Science Princeton University Princeton, NJ 08544 USA fsnd,yuqun,felteng@cs.princeton.edu
	ftp://ftp.cs.princeton.edu/reports/1996/528.ps.Z, 19961002 STRUCTURED TESTING: ANALYSIS AND EXTENSIONS Arthur Henry Watson A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE TR-528-96 November 1996 c Copyright by Arthur Henry Watson
	ftp://ftp.cs.princeton.edu/reports/1996/530.ps.Z, 19961007 Expected Performance of Dijkstra's Shortest Path Algorithm Andrew V. Goldberg NEC Research Institute 4 Independence Way Princeton, NJ 08540 avg@research.nj.nec.com Robert E. Tarjan Computer Science Department Princeton University Princeton, NJ 08858 and NEC Research Institute ret@cs.princeton.edu June
	ftp://ftp.cs.princeton.edu/reports/1996/524.ps.Z, 19961007 Simplifying Distributed File Systems Using a Shared Logical Disk Robert A. Shillner and Edward W. Felten Dept. of Computer Science Princeton University fras,felteng@cs.princeton.edu
	ftp://ftp.cs.princeton.edu/reports/1996/526.ps.Z, 19961015 Polynomial Bounds for VC Dimension of Sigmoidal and General Pfaffian Neural Networks Marek Karpinski Dept. of Computer Science University of Bonn 53117 Bonn Angus Macintyre y Mathematical Institute University of Oxford Oxford OX1 3LB
	ftp://ftp.cs.princeton.edu/reports/1996/513.ps.Z, 19961015 Stream Sockets on SHRIMP Princeton University Technical Report TR-513-96 Stefanos N. Damianakis, Cezary Dubnicki, Edward W. Felten Department of Computer Science Princeton University Princeton, NJ 8544 USA fsnd,dubnicki,felteng@cs.princeton.edu
	ftp://ftp.cs.princeton.edu/reports/1996/527.ps.Z, 19961015 A Lower Bound for Randomized Algebraic Decision Trees Dima Grigoriev Marek Karpinski y Friedhelm Meyer auf der Heide z Roman Smolensky x
	ftp://ftp.cs.princeton.edu/reports/1996/517.ps.Z, 19961015 Shared Virtual Memory Across SMP Nodes Using Automatic Update: Protocols and Performance Princeton university Technical Report TR-517-96. Submitted for publication. Please do not distribute. Angelos Bilas, Liviu Iftode, David Martin, and Jaswinder Pal Singh Department of Computer Science, Princeton
	ftp://ftp.cs.princeton.edu/reports/1996/531.ps.Z, 19961015 On the Power of Randomized Branching Programs Farid Ablayev Marek Karpinski y
	ftp://ftp.cs.princeton.edu/reports/1996/534.ps.Z, 19961018 Mobile Network Objects Robert A. Shillner and Edward W. Felten Dept. of Computer Science Princeton University fras,felteng@cs.princeton.edu
	ftp://ftp.cs.princeton.edu/reports/1996/532.ps.Z, 19961029 Learning String Edit Distance 1 Eric Sven Ristad Peter N. Yianilos Research Report CS-TR-532-96 October 1996
	ftp://ftp.cs.princeton.edu/reports/1996/536.ps.Z, 19961113 Nonuniform Markov Models 1 Eric Sven Ristad Robert G. Thomas Research Report CS-TR-536-96 November 1996
	ftp://ftp.cs.princeton.edu/reports/1996/537.ps.Z, 19961122 Lambda-Splitting: A Higher-Order Appro Princeton University CS-TR-537-96 ach to Cross-Module Optimizations Matthias Blume Andrew W. Appel Princeton University, November 22, 1996
	ftp://ftp.cs.princeton.edu/reports/1996/538.ps.Z, 19961204 Randomized (n2) Lower Bound for Knapsack Dima Grigoriev Marek Karpinskiy
	ftp://ftp.cs.princeton.edu/reports/1996/539.ps.Z, 19961216 Correctness of Constructing Optimal Alphabetic Trees Revisited Marek Karpinski Lawrence L. Larmore y Wojciech Rytter z
	ftp://ftp.cs.princeton.edu/reports/1996/541.ps.Z, 19961216 On the Strange a Posteriori degeneracy of Normal Mixtures, and Related Reparameterization Theorems Eric S. Ristad Peter N. Yianilos Research Report CS-TR-541-96 December, 1996
	ftp://ftp.cs.princeton.edu/reports/1996/535.ps.Z, 19961216 Relaxed Consistency and Coherence Granularity in DSM Systems: A Performance Evaluation Yuanyuan Zhou, Liviu Iftode, Kai Li and Jaswinder Pal Singh Computer Science Department Princeton University Princeton, NJ 08544 fyzhou,liv,li,jpsg@cs.princeton.edu Brian R. Toonen, Ioannis Schoinas, Mark D. Hill, and
	ftp://ftp.cs.princeton.edu/reports/1996/533.ps.Z, 19961216 Finite Growth Models Eric Sven Ristad Peter N. Yianilos Research Report CS-TR-533-96 December, 1996
	ftp://ftp.cs.princeton.edu/reports/1996/516.ps.Z, 19970108 Real-Time Parallel MPEG-2 Decoding in Software Angelos Bilas 1 , Jason Fritts 2 , Jaswinder Pal Singh 1 fbilas@cs, jefritts@ee, jps@csg.princeton.edu 1 Department of Computer Science, 2 Department of Electrical Engineering Princeton University, Princeton NJ 8544 Phone: (609) 258 - 5329 Fax: (609) 258 -
	ftp://ftp.cs.princeton.edu/reports/1997/545.ps.Z, 19970327 An Introduction to Client-Server Programming with Sockets Rob Shillner March 14, 1997 1 Introduction 1.1 Distributed applications A distributed application is a collection of running programs which cooperate to accomplish some task. Distributed applications are designed to work over a network, such that
	ftp://ftp.cs.princeton.edu/reports/1992/398.ps.Z, 19970501 Maintaining Bipartite Matchings in the Presence of Failures y Edwin Hsing-Mean Sha Dept. of Computer Sci. & Engin. University of Notre Dame Notre Dame, IN 46556 Kenneth Steiglitz Dept. of Computer Science Princeton University Princeton, NJ 08544
	ftp://ftp.cs.princeton.edu/reports/1996/540.ps.Z, 19970501 Copyright Princeton University, 1996, 1997. Introduction This paper describes an Internet security attack that could endanger the privacy of World Wide Web users and the integrity of their data. The attack can be carried out on today s systems, endangering users of the most common Web browsers,
	ftp://ftp.cs.princeton.edu/reports/1997/546.ps.Z, 19970501 Technical Report 546-97, Department of Computer Science, Princeton University, April 1997. Extensible Security Architectures for Java Dan S. Wallach Dirk Balfanz Drew Dean Edward W. Felten dwallach@cs.princeton.edu balfanz@cs.princeton.edu ddean@cs.princeton.edu felten@cs.princeton.edu Department of
	ftp://ftp.cs.princeton.edu/reports/1997/543.ps.Z, 19970516 CLIP: A Checkpointing Tool for Message-Passing Parallel Programs Yuqun Chen, James S. Plank, Kai Li
	ftp://ftp.cs.princeton.edu/reports/1997/547.ps.Z, 19970528 TOPICS IN COMPUTATIONAL HIDDEN STATE MODELING Peter N. Yianilos A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE June 1997 c Copyright by Peter N. Yianilos 1997 All Rights
	ftp://ftp.cs.princeton.edu/reports/1997/548.ps.Z, 19970529 Home-based SVM Protocols for SMP Clusters: Design, Implementation and Performance Rudrajit Samanta, Liviu Iftode and Jaswinder Pal Singh Department of Computer Science Princeton University Princeton, NJ 08544
	ftp://ftp.cs.princeton.edu/reports/1997/549.ps.Z, 19970619 EFFICIENT ANIMATION TECHNIQUES BALANCING BOTH USER CONTROL AND PHYSICAL REALISM Zicheng Liu A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE November 1996 c Copyright by
	ftp://ftp.cs.princeton.edu/reports/1997/550.ps.Z, 19970707 Comparison of Shared Virtual Memory across Uniprocessor and SMP Nodes Princeton University Technical Report TR-550-97 Angelos Bilas, Liviu Iftode, and Jaswinder Pal Singh Department of Computer Science 35 Olden Street Princeton University Princeton, NJ 08544 fbilas, liv, jpsg@cs.princeton.edu
	ftp://ftp.cs.princeton.edu/reports/1997/551.ps.Z, 19970903 HIERARCHICAL MODULARITY AND INTERMODULE OPTIMIZATION MATTHIAS BLUME A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE NOVEMBER 1997 c Copyright by Matthias Blume, 1997. All
	ftp://ftp.cs.princeton.edu/reports/1997/552.ps.Z, 19971013 Shared Virtual Memory: Progress and Challenges Submitted for Publication Liviu Iftode Computer Science Department Rutgers University Piscataway, NJ 08855 iftode@cs.rutgers.edu Jaswinder Pal Singh Computer Science Department Princeton University Princeton, NJ 08544 jps@cs.princeton.edu 1 Introduction
	ftp://ftp.cs.princeton.edu/reports/1997/553.ps.Z, 19971201 LANGUAGE AND COMPILER MECHANISMS FOR PARALLEL PROGRAMMING WITH CUSTOMIZABLE PROTOCOLS MUKUND RAGHAVACHARI A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE JANUARY 1998 c
	ftp://ftp.cs.princeton.edu/reports/1997/554.ps.Z, 19971202 The Zephyr Abstract Syntax Description Language Daniel C. Wang Andrew W. Appel Jeff L. Korn Christopher S. Serra Department of Computer Science, Princeton University, Princeton, NJ, 08544 fdanwang,appel,jlkg@cs.princeton.edu, csserra@cs.wisc.edu
	ftp://ftp.cs.princeton.edu/reports/1997/555.ps.Z, 19971202 Hierarchical Modularity: Compilation Management for Standard ML Matthias Blume Andrew W. Appel Princeton University July 17, 1997
	ftp://ftp.cs.princeton.edu/reports/1997/556.ps.Z, 19971203 Shrinking Lambda Expressions in Linear Time Andrew W. Appel Princeton University Trevor Jim University of Pennsylvania February 1997
	ftp://ftp.cs.princeton.edu/reports/1995/557.ps.Z, 19971203 Intensional Equality ;=) for Continuations Andrew W. Appel Princeton University appel@princeton.edu September 8, 1995
	ftp://ftp.cs.princeton.edu/reports/1996/558.ps.Z, 19971204 Security and document compatibility for electronic refereeing Andrew W. Appel Department of Computer Science Princeton University appel@princeton.edu October 9, 1996 I have recently described a management system, with accompanying software, for use by journal editors in organizing the refereeing of
	ftp://ftp.cs.princeton.edu/reports/1997/560.ps.Z, 19971208 Experience with Secure Multi-Processing in Java Dirk Balfanz Princeton University balfanz@cs.princeton.edu Li Gong JavaSoft, Sun Microsystems, Inc. li.gong@sun.com September 29, 1997
	ftp://ftp.cs.princeton.edu/reports/1995/559.ps.Z, 19971208 1 Visualization of Geometric Algorithms Ayellet Tal, David Dobkin
	ftp://ftp.cs.princeton.edu/reports/1995/563.ps.Z, 19971209 Concept Learning with geometric hypotheses David P. Dobkin and Dimitrios Gunopulos y
	ftp://ftp.cs.princeton.edu/reports/1996/561.ps.Z, 19971209 Computing the Discrepancy with Applications to Supersampling Patterns David P. Dobkin David Eppsteiny Don P. Mitchell
	ftp://ftp.cs.princeton.edu/reports/1995/562.ps.Z, 19971209 David P. Dobkin 1 Department of Computer Science, Princeton University, 35 Olden St., Princeton, NJ 8540, USA e-mail: dpd@cs.princeton.edu Dimitrios Gunopulos 1 Department of Computer Science, Princeton University, 35 Olden St., Princeton, NJ 08540, USA e-mail: dg@cs.princeton.edu Wolfgang Maass
	ftp://ftp.cs.princeton.edu/reports/1995/564.ps.Z, 19971210 Strategies for Polyhedral Surface Decomposition: An Experimental Study Bernard Chazelle y David P. Dobkin z Nadia Shouraboura x Ayellet Tal 1 Introduction Convex shapes are easiest to represent, manipulate, and render: Even though they form the building blocks of bottom-up solid modelers, it is more
	ftp://ftp.cs.princeton.edu/reports/1995/565.ps.Z, 19971210 The Quickhull Algorithm for Convex Hulls C. Bradford Barber David P. Dobkiny Hannu Huhdanpaaz January 9, 1995 Submitted to the ACM Transactions on Mathematical Software
	ftp://ftp.cs.princeton.edu/reports/1997/566.ps.Z, 19971215 Java Security: Web Browsers and Beyond Drew Dean Edward W. Felten Dan S. Wallach Dirk Balfanz ddean@cs.princeton.edu felten@cs.princeton.edu dwallach@cs.princeton.edu balfanz@cs.princeton.edu Department of Computer Science Princeton University Princeton, NJ 08544 February 24, 1997
	ftp://ftp.cs.princeton.edu/reports/1996/568.ps.Z, 19971215 NETWORK INTERFACE FOR PROTECTED, USER-LEVEL COMMUNICATION Matthias Augustin Blumrich A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE June 1996 c Copyright by Matthias
	ftp://ftp.cs.princeton.edu/reports/1997/567.ps.Z, 19971215 A Java Filter Dirk Balfanz Princeton University balfanz@cs.princeton.edu Edward W. Felten Princeton University felten@cs.princeton.edu
	ftp://ftp.cs.princeton.edu/reports/1996/569.ps.Z, 19971217 Thread Scheduling for Cache Locality James Philbin and Jan Edler NEC Research Institute, 4 Independence Way, Princeton, NJ 8540 Otto J. Anshus Department of Computer Science, Institute of Mathematical and Physical Sciences, University of Tromso, N-9037 Tromso, Norway Craig C. Douglas IBM T.J. Watson
	ftp://ftp.cs.princeton.edu/reports/1997/570.ps.Z, 19971217 Design and Implementation of Virtual Memory-Mapped Communication on Myrinet Cezary Dubnicki, Angelos Bilas, Kai Li Princeton University Princeton, New Jersey 08540 fdubnicki,bilas,lig@cs.princeton.edu James Philbin NEC Research Institute, Inc. Princeton, New Jersey 08540 philbin@research.nj.nec.com
	ftp://ftp.cs.princeton.edu/reports/1995/572.ps.Z, 19971218 In Proceedings of the 2nd International Symposium on High-Performance Computer Architecture, February, 1996. Protected, User-level DMA for the SHRIMP Network Interface Matthias A. Blumrich, Cezary Dubnicki, Edward W. Felten, and Kai Li Department of Computer Science, Princeton University, Princeton, NJ
	ftp://ftp.cs.princeton.edu/reports/1996/571.ps.Z, 19971218 To appear in 10th International Parallel Processing Symposium, April, 1996. Software Support for Virtual Memory-Mapped Communication Cezary Dubnicki, Liviu Iftode, Edward W. Felten, Kai Li Department of Computer Science Princeton University
	ftp://ftp.cs.princeton.edu/reports/1997/544.ps.Z, 19980113 Hierarchical Non-Emitting Markov Models1 Eric Sven Ristad Robert G. Thomas Research Report CS-TR-544-97 May 1997; Revised January 1998
	ftp://ftp.cs.princeton.edu/reports/1998/573.ps.Z, 19980209 VMMC-2: Efficient Support for Reliable, Connection-Oriented Communication Princeton University Technical Report TR-573-98 Cezary Dubnicki, Angelos Bilas, Yuqun Chen, Stefanos N. Damianakis, and Kai Li Department of Computer Science Princeton University, Princeton, NJ-08544 fdubnicki, bilas, yuqun, snd,