• Academics
  • Course Schedule
  • Course Catalog
  • Graduate Program
  • Undergraduate Programs
  • Interdisciplinary Programs
• Research
  • Research Areas
  • Research Projects
  • Public Lectures and Colloquia
  • Technical Reports
• People
  • Faculty
  • Researchers
  • Technical Staff
  • Administrative Staff
  • Graduate Students
  • Undergraduate Students
  • Alumni/ae
• Connect
  • Collaborations
  • Industrial Affiliates
  • Libraries
• Jobs
• About
  • Contact Us
  • News and Events
  • Department Information
  • Visit Us

Technical Reports

• Caesar, Matthew
  • Building Scalable Self-configuring Networks with SEIZE, TR-801-07, October 2007
• Cai, Jiazhen
  • An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem, TR-309-91, March 1991
• Cai, Jin-Yi
  • Computations Over Infinite Groups, TR-325-91, June 1991
  • More Efficient Bottom-Up Tree Pattern Matching, TR-268-90, May 1990
  • On Bounded Round Multi-Prover Interactive Proof Systems, TR-237-89, December 1989
  • Playing Games of Incomplete Information, TR-238-89, December 1989
  • The Polynomial Hierarchy is Provable by Two Provers in One Round, TR-260-90, December 1989
  • Uncheatable Benchmarks Using Numerical Instability, TR-433-93, September 1993
• Calamia, Paul Thomas
  • Advances in Edge-Diffraction Modeling for Virtual-Acoustic Simulations (thesis), TR-853-09, April 2009
• Calandrino, Joseph
  • Control of Sensitive Data in Systems with Novel Functionality, TR-924-12, May 2012
• Calderbank, Robert
  • Sparse Approximation and Compressed Sensing Using the Reed-Muller Sieve, TR-888-10, December 2010
• Campos, Alvaro E.
  • Distributed EZ, TR-349-91, September 1991
  • Distributed, Garbage-Collected, Persistent, Virtual Address Spaces (thesis), TR-419-93, June 1993
• Cao, Fengyun
  • Approximate Index Routing: A Case for Content-based Peer-to-Peer Routing, TR-684-03, November 2003
  • MEDYM: An Architecture for Content-based Publish-Subscribe Service Networks, TR-692-04, March 2004
  • Scheduling Web Crawl for Better Performance and Quality, TR-682-03, October 2003
  • Towards Scalable Content-based Publish-Subscribe Networks, TR-725-05, April, 2005
• Cao, Pei
  • A Study of Integrated Prefetching and Caching Strategies, TR-479-94, December 1994
  • Application-Controlled File Caching and Prefetching (Thesis), TR-522-96, May 1996
  • Application-Controlled File Caching Policies, TR-445-94, February 1994
  • Implementation and Performance of Application-Controlled File Caching, TR-462-94, June 1994
  • Implementation and Performance of Integrated Application-Controlled Caching, Prefetching and Disk Scheduling, TR-493-95, July 1995
  • Integrated Parellel Prefetching and Caching, TR-502-95, December 1995
• Capra, John Anthony
  • Algorithms for the Identification of Functional Sites in Proteins (thesis), TR-855-09, May 2009
• Carlisle, Martin C.
  • Determining Single Connectivity in Directed Graphs, TR-390-92, September 1992
  • Software Caching and Computation Migration in Olden, TR-483-95, January 1995
  • Supporting Dynamic Data Structures on Distributed Memory Machines, TR-447-94, February 1994
• Carroll, Melissa K.
  • FMRI "Mind Readers": Sparsity, Spatial Structure, and Reliability (thesis), TR-894-11, January 2011
• Catu, Oana
  • Scaffold: Quantum Programming Language, TR-934-12, July 2012
• Cesareo, Jacopo
  • Optimizing Implicit Proxy Placement to Evade Traffic Filters, TR-927-12, June 2012
• Chakrabati, Amlan
  • Scaffold: Quantum Programming Language, TR-934-12, July 2012
• Chakradhar, Srimat
  • Safe Heterogeneous Applications: Curing the Java Native Interface, TR-715-04, October 2004
• Chandra, Satish
  • Where is Time Spent in Message-Passing and Shared-Memory Programs?, TR-463-94, July 1994
• Chao, Liang-Fang
  • Finding All Minimal Shapes in a Routing Channel, TR-384-92, August 1992
  • Scheduling and Behavioral Transformations for Parallel Systems (Thesis), TR-430-93, October 1993
  • Scheduling Data-Flow Graphs via Retiming and Unfolding, TR-396-92, October 1992
  • Static Scheduling for Synthesis of DSP Algorithms on Various Models, TR-432-93, August 1993
• Charikar, Moses
  • A Time-Space Efficient Locality Sensitive Hashing Method for Similarity Search in High Dimensions, TR-759-06, June 2006
  • Analysis of Filtering for Similarity Search Using Sketches, TR-760-06, July 2006
  • New Approximation Algorithms for Degree Lower-bounded Arborescences and Max-Min Allocation, TR-848-09, May 2009
  • Proofs of Conjectures in "Aggregating Inconsistent Information: Ranking and Clustering", TR-719-05, January 2005
• Chazelle, Bernard
  • A Deterministic View of Random Sampling and its Use in Geometry , TR-181-88, September 1988
  • Algorithms for Bichromatic Line Segment Problems and Polyhedral Terrains, TR-252-90, March 1990
  • An Algorithm for Segment-Dragging and its Implementation, TR-077-87, January 1987
  • An Optimal Algorithm for Intersecting Line Segments in the Plane, TR-148-88, April 1988
  • An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra, TR-205-89, February 1989
  • An Optimal Convex Hull Algorithm for Points Sets in Any Fixed Dimension, TR-336-91, June 1991
  • Application Challenges to Computational Geometry: CG Impact Task Force Report, TR-521-96, April 1996
  • Computing a Face in an Arrangement of Line Segments and Related Problems, TR-334-91, June 1991
  • Computing on a Free Tree Via Complexity-Preserving Mappings, TR-096-87, June 1987
  • Counting and Cutting Cycles of Lines and Rods in Space, TR-288-90, October 1990
  • Cutting Hyperplanes for Divide-and-Conquer, TR-335-91, June 1991
  • Derandomizing an Output-Sensitive Convex Hull Algorithm in Three Dimensions, TR-358-91, December 1991
  • Efficient Polygon Triangulation, TR-249-90, February 1990
  • Intersection of Convex Objects in Two and Three Dimensions, TR-025-86, January 1986
  • Linear Space Data Structures for Two Types of Range Search, TR-062-86, November 1986
  • Lines in Space: Combinatorics and Algorithms, TR-294-90, January 1990
  • Lower Bounds on the Complexity of Multidimensional Searching, TR-055-86, October 1986
  • Lower Bounds on the Complexity of Polytope Range Searching , TR-166-88, June 1988
  • On Linear-time Deterministic Algorithms for Optimization Problems in Fixed Dimension, TR-393-92, October 1992
  • On Linear-time Deterministic Algorithms for Optimization Problems in Fixed Dimension, TR-413-93, March 1993
  • Point Location Among Hyperplanes and Unidirectional Ray-Shooting, TR-333-91, June 1991
  • Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems, TR-290-90, October 1990
  • Quasi-Orthogonality via Finite-Differencing: An Elementary Approach to Geometric Discrepancy, TR-407-93, February 1993
  • Randomizing an Output-Sensitive Convex Hull Algorithm in Three Dimensions, TR-361-92, February 1992
  • Ray Shooting in Polygons Using Geodesic Triangulations, TR-350-91, September 1991
  • Slimming Down by Adding: Selecting Heavily Covered Points, TR-257-90, April 1990
  • Some Techniques for Geometric Searching with Implicit Set Representations, TR-095-97, June 1987
  • Some Techniques for Geometric Searching with Implicit Set Representations, TR-095-87, June 1987
  • Strategies for Polyhedral Surface Decomposition: An Experimental Study, TR-564-95, December 1995
  • The Complexity of Cutting Complexes, TR-082-87, March 1987
  • The New Jersey Line-Segment-Saw Massacre (Companion to Video), TR-379-92, July 1992
  • Tight Bounds on the Stabbing Number of Spanning Trees in Euclidean Space, TR-155-88, May 1988
  • Triangulating A Nonconvex Polytope, TR-227-89, August 1989
  • Triangulating a Simple Polygon in Linear Time, TR-264-90, May 1990
  • Visibility and Intersection Problems in Plane Geometry, TR-167-88, June 1988
• Chen, Han
  • Scalable and Ultra-High Resolution MPEG Video Delivery on Tiled Displays (Thesis), TR-675-03, September 2003
• Chen, Jie
  • Comparison of Clustering Algorithms and Its Application to Document Clustering (thesis), TR-758-06, June 2006
• Chen, Juan
  • A Low-Level Typed Assembly Language with a Machine-Checkable Soundness Proof (Thesis), TR-704-04, February 2004
  • Dictionary Passing for Polytypic Polymorphism, TR-635-01, March 2001
• Chen, Mao
  • Query Affinity in Internet Applications, TR-621-00, December 2000
  • Using User-Provided Information to Improve Internet Services (Thesis), TR-708-04, July 2004
• Chen, Peter M.
  • Fast Cluster Failover Using Virtual Memory-Mapped Communication, TR-591-99, January 1999
• Chen, Yuqun
  • Avoiding Seams On High-Resolution Multi-Projector Displays using An Un-calibrated Camera, TR-618-00, June 2000
  • Building a Scalable High-Resolution Display Wall (Thesis), TR-631-00, December 2000
  • CLIP: A Checkpointing Tool for Message-Passing Parallel Programs, TR-543-97, May 1997
  • Firmware Support for Reliable Communication and Dynamic System Configuration in System Area Networks, TR-581-98, June 1998
  • MimdRAID: Low Latency Secondary Storage, TR-612-99, September 1999
  • Reducing Waiting Costs in User-Level Communication, TR-525-96, September 1996
  • UTLB: A Mechanism for Address Translation On Network Interfaces, TR-580-98, June 1998
  • VMMC-2: Efficient Support for Reliable, Connection-Oriented Communication, TR-573-98, February 1998
• Chiang, Chen-Fu
  • Scaffold: Quantum Programming Language, TR-934-12, July 2012
• Chiang, Mung
  • Cooperative Content Distribution and Traffic Engineering in an ISP Network, TR-846-08, December 2008
  • Design Principles of Manageable Networks, TR-770-06, October 2006
  • Performance Bounds for Peer-Assisted Live Streaming, TR-833-08, August 2008
  • Rethinking Internet Traffic Management: From Multiple Decompositions to a Practical Protocol, TR-774-07, February 2007
  • Rethinking Virtual Network Embedding: Substrate Support for Path Splitting and Migration, TR-788-07, July 2007
• Chlamtac, Eden
  • Non-Local Analysis of SDP-Based Approximation Algorithms (thesis), TR-843-08, November 2008
• Chong, Fred
  • Scaffold: Quantum Programming Language, TR-934-12, July 2012
• Clark, David D.
  • Explicit Allocation of Best Effort Packet Delivery Service, TR-600-99, March 1999
• Clark, Douglas W.
  • Alloyed Global and Local Branch History: A Robust Solution to Wrong-History Misprediction, TR-606-99, October 1999
  • Alloying Global and Local Branch History: Taxonomy, Performance, and Analysis, TR-594-99, January 1999
  • Avoiding Seams On High-Resolution Multi-Projector Displays using An Un-calibrated Camera, TR-618-00, June 2000
  • Branch Prediction, Instruction-Window Size, and Cache Size: Performance Tradeoffs and Sampling Techniques, TR-578-98, April 1998
  • Early Experience with Message-Passing on the SHRIMP Multicomputer, TR-510-96, January 1996
  • Improving Prediction for Procedure Returns with Return-Address-Stack Repair Mechanisms, TR-577-98, March 1998
  • Selecting a Single, Representative Sample for Accurate Simulation of SPECint Benchmarks, TR-595-99, August 1999
  • Speculative Updates of Local and Global Branch History: A Quantitative Analysis, TR-589-98, December 1998
  • SurfBoard - A Hardware Performance Monitor for SHRIMP, TR-596-99, March 1999
  • Thread Scheduling for Out-of-Core Applications with Memory Server on Multicomputers, TR-590-99, January 1999
• Clarkson, Kenneth L.
  • A Fast Las Vegas Algorithm for Triangulating a Simple Polygon, TR-132-88, January 1988
  • A Fast Las Vegas Algorithm for Triangulating a Simple Polygon, TR-157-88, May 1988
  • Randomized Parallel Algorithms for Trapezoidal Diagrams, TR-318-91, April 1991
• Clarkson, William
  • Breaking Assumptions: Distinguishing Between Seemingly Identical Items Using Cheap Sensors, TR-921-12, April 2012
• Clifton, Christopher W.
  • Distributed Processing of Filtering Queries in HyperFile, TR-295-90, November 1990
  • Hyperfile, A Database Manager for Documents (Thesis), TR-323-91, June 1991
  • Indexing in a Hypertext Database, TR-206-89, February 1989
  • Telematics Research at Princeton - 1988, TR-219-89, April 1989
  • The Design of a Document Database, TR-177-88, September 1988
• Cohen, Michael F.
  • Radiosity and Relaxation Methods: Progressive Refinement is Southwell Relaxation, TR-408-93, February 1993
  • Variational Modeling with Wavelets, TR-456-94, April 1994
  • Video Cubism, TR-637-01, October 2001
• Cohen, Michael S.
  • Finding Speed Bumps: Web Server Performance Analysis and Anomaly Detection via Wide-Spectrum Microbenchmarking, TR-791-07, August 2007
• Cohn, Steve
  • Data Sharing in a Large Heterogeneous Environment, TR-272-90, July 1990
• Colburn, R. Alex
  • Video Cubism, TR-637-01, October 2001
• Cole, Forrester H.
  • Line Drawings of 3D Shapes (thesis), TR-856-09, May 2009
• Cole, Richard
  • A Linear-Work Parallel Algorithm for Finding Minimum Spanning Trees, TR-457-94, May 1994
  • Randomized Parallel Algorithms for Trapezoidal Diagrams, TR-318-91, April 1991
• Comandur, Seshadhri
  • Sublinear Distributed Reconstruction (thesis), TR-838-08, October 2008
• Condon, Anne
  • On Bounded Round Multi-Prover Interactive Proof Systems, TR-237-89, December 1989
  • Playing Games of Incomplete Information, TR-238-89, December 1989
• Cordon, Ricardo
  • Distributed Computing Research at Princeton - 1985, TR-029-86, January 1986
• Cordon, Ricardo A.
  • Using Semantic Knowledge for Transaction Processing (Thesis), TR-009-85, October 1985
• Correa, Wagner T.
  • iWalk: Interactive Out-Of-Core Rendering of Large Models, TR-653-02, July 2002
• Courcoubetis, Costas
  • Distributed Reachability Analysis for Protocol Verification Environments, TR-110-87, August 1987
• Cova, Luis L.
  • Augmenting Availability in Distributed File Systems, TR-234-89, October 1989
  • Distributed Computing Research at Princeton - 1986, TR-073-87, January 1987
  • Distributing Workload Among Independently Owned Processors, TR-200-88, December 1988
  • FACE: Enhancing Distributed File Systems for Autonomous Computing Environments, TR-214-89, March 1989
  • Load Balancing in Two Types of Computational Environments, TR-165-88, January 1988
  • Resource Management in Federated Computing Environments (thesis), TR-282-90, October 1990
  • Sharing Jobs Among Independently Owned Processors, TR-120-87, November 1987
  • Telematics Research at Princeton - 1987, TR-151-88, May 1988
  • Telematics Research at Princeton - 1988, TR-219-89, April 1989
• Cox, Michael
  • Depth Complexity in Object-Parallel Graphics Architectures, TR-382-92, September 1992
  • Evenly Distributed Depth is the Worst for Distributed Snooping, TR-427-93, June 1993
• Craver, Scott A.
  • Reading Between the Lines: Lessons from the SDMI Challenge, TR-657-02, July 2002