• 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

• Sacks, Elisha
  • A Catalog of Higher Pairs and Their Configuration Spaces, TR-424-93, June 1993
  • A Smart Interface for Numerical Software, TR-341-91, August 1991
  • A Smart Interface for Numerical Software, TR-342-91, August 1991
  • Automatic Analysis of One-Parameter Planar Ordinary Differential Equations, TR-244-90, January 1990
  • Comprehensive Kinematic Analysis of Higher Pairs with Two Degrees of Freedom, TR-421-93, April 1993
  • Computational Kinematics, TR-300-90, December 1990
  • Markov Analysis of Qualitative Dynamics, TR-305-91, February 1991
  • Mechanism Simulation with Configuration Spaces and Simple Dynamics, TR-367-92, March 1992
  • Nonlinear Heart Model Predicts the Range of Heart Rates for Electrical Alternans in Pericardial Effusion, TR-365-92, February 1992
  • Prolegomena to any Future Qualitative Physics, TR-314-91, April 1991
• Sagiv, Yehoshua
  • Minimizing Expansions of Recursions, TR-150-88, April 1988
• Sahni, Urvashi
  • The Digital StudyHall, TR-723-05, March, 2005
• Salem, Kenneth
  • Altruistic Locking: A Strategy for Coping with Long Lived Transactions, TR-087-87, April 1987
  • Checkpointing Memory-Resident Databases, TR-126-87, December 1987
  • Concurrency Controls for Global Procedures in Federated Database Systems, TR-099-87, June 1987
  • Coordinating Multi-Transaction Activities, TR-247-90, February 1990
  • Crash Recovery for Memory-Resident Databases, TR-119-87, November 1987
  • Crash Recovery Mechanisms for Main Storage Database Systems, TR-034-86, May 1986
  • Distributed Computing Research at Princeton - 1986, TR-073-87, January 1987
  • Failure Recovery in Memory-Resident Transaction Processing Systems (thesis), TR-188-88, December 1988
  • Probabilistic Diagnosis of Hot Spots, TR-328-91, June 1991
  • SAGAS, TR-070-87, January 1987
  • System M: A Transaction Processing System for Memory Resident Data, TR-195-88, December 1988
  • Telematics Research at Princeton - 1987, TR-151-88, May 1988
  • Telematics Research at Princeton - 1988, TR-219-89, April 1989
• Saltz, Joel
  • Efficient Support for Irregular Applications on Distributed--Memory Machines, TR-488-95, April 1995
• Salzman, David
  • A Rapid Hierarchical Radiosity Algorithm for Unoccluded Environments, TR-281-90, August 1990
• Samanta, Rudrajit
  • Home-based SVM Protocols for SMP Clusters: Design, Implementation and Performance, TR-548-97, May 1997
• Sandberg, Jonathan
  • Design of the PRAM Network, TR-254-90, April 1990
  • Virtual Memory Mapped Network Interface for the SHRIMP Multicomputer, TR-437-93, November 1993
• Sandberg, Jonathan S.
  • A Free-Market Exchange for Information , TR-298-90, December 1990
  • How to Store a Triangular Matrix, TR-240-89, December 1989
  • PRAM: A Scalable Shared Memory, TR-180-88, September 1988
• Sander, Pedro V.
  • The Real-Time Reprojection Cache , TR-749-06, April 2006
• Sarnak, Neil
  • Planar Point Location Using Persistent Search Trees, TR-005-85, July 1985
• Schaefer, Richard
  • Shiva: An Operating System Transforming a Hypercube into a Shared-Memory Machine, TR-217-89, April 1989
• Schaffer, Russel
  • The Analysis of Heapsort, TR-330-91, January 1991
  • The Best Case of Heapsort, TR-293-90, NOvember 1990
• Schaffer, Russel W.
  • Analysis of Heapsort (Thesis), TR-370-92, June 1992
• Schapira, Michael
  • Neighbor-Specific BGP: More Flexible Routing Policies Without Sacrificing Global Stability, TR-844-08, November 2008
  • Rehoming Edge Links for Better Traffic Engineering, TR-917-11, November 2011
• Schapire, Robert E.
  • Bayesian Aggregation for Hierarchical Classfication, TR-785-07, May 2008
• Schmidt, Erich
  • Query-Independent Ranking for Large-Scale Persistent Search Systems, TR-837-08, October 2008
• Schmidt, Erich R.
  • SiteRank: Link-Based Relevance Computation for Persistent Search, TR-745-06, February 2006
• Schneider, Michael A.
  • A Proof-Carrying Authorization System, TR-638-01, April 2001
• Schoinas, Ioannis
  • Application-Specific Protocols for User-Level Shared Memory, TR-464-94, August 1994
  • Relaxed Consistency and Coherence Granularity in DSM Systems: A Performance Evaluation, TR-535-96, December 1996
• Schran, Andrew
  • Namecast: A Reliable, Flexible, Scalable DNS Hosting System, TR-850-09, April 2009
• Schroeder, Peter
  • A Closed Form Expression for the Form Factor between Two Polygons, TR-404-93, January 1993
  • Textures and Radiosity: Controlling Emission and Reflection with Texture Maps, TR-449-94, March 1994
  • Wavelet Algorithms for Illumination Computations (Thesis), TR-466-94, November 1994
• Schwartz, Stuart
  • Distributed Computing Research at Princeton - 1985, TR-029-86, January 1986
• Sedgewick, Robert
  • Analysis of a Simple Yet Efficient Convex Hull Algorithm, TR-130-88, January 1988
  • Analysis of a Simple Yet Efficient Convex Hull Algorithm, TR-130-87, November 1987
  • Practical Variations of Shellsort, TR-027-86, February 1986
  • The Analysis of Heapsort, TR-330-91, January 1991
  • The Best Case of Heapsort, TR-293-90, NOvember 1990
  • The Pairing Heap: A New Form of Self-Adjusting Heap, TR-008-85, July 1985
  • Tight Lower Bounds for Shellsort, TR-137-88, February 1988
• Seidel, Raimund
  • Counting and Cutting Cycles of Lines and Rods in Space, TR-288-90, October 1990
  • Slimming Down by Adding: Selecting Heavily Covered Points, TR-257-90, April 1990
• Serpanos, D. N.
  • Practical LFU Implementation for Web Caching, TR-622-00, June 2000
• Serpanos, Dimitrios N.
  • Scalable Shared Memory Interconnections (thesis), TR-277-90, October 1990
• Serra, Christopher S.
  • The Zephyr Abstract Syntax Description Language, TR-554-97, October 1997
• Seshadhri, C.
  • Adaptive Algorithms for Online Decision Problems , TR-798-07, September 2007
  • Testing Expansion in Bounded Degree Graphs , TR-789-07, July 2007
• Sgall, Jiri
  • On The Computational Power of DNA, TR-499-95, October 1995
• Sha, Edwin Hsing-Mean
  • Error Detection in Arrays Via Dependency Graphs, TR-339-91, August 1991
  • Fault Tolerance For Array Architectures (Thesis), TR-380-92, October 1992
  • Maintaining Bipartite Matchings in the Presence of Failures, TR-398-92, October 1992
  • Reconfigurability and Reliability of Systolic/Wavefront Arrays, TR-280-90, August 1990
  • Reliable Reconfigurable Structures for Array Architectures, TR-315-91, April 1991
  • 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
• Shalaby, Nadia
  • Intelligent Devices as Symmetric Partners for End--to--end Data Flows, TR-642-02, July 2002
  • Snow on Silk: A NodeOS in the Linux Kernel, TR-641-02, June 2002
• Shamoon, Talal G.
  • Resistance of Digital Watermarks to Collusive Attacks, TR-585-98, July 1998
• Shao, Yilei
  • A Peer-to-Peer Mobile Storage System, TR-664-02, October 2002
  • Exploring Social Networks in Computer Systems, TR-779-07, May 2007
• Shao, Zhong
  • A Type-Based Compiler for Standard ML, TR-487-95, March 1995
  • An Empirical and Analytic Study of Stack vs. Heap Cost for Languages with Closures, TR-450-94, March 1994
  • Callee-save Registers in Continuation-Passing Style, TR-326-91, August 1991
  • Compiling Standard ML for Efficient Execution on Modern Machines (Thesis), TR-475-94, November 1994
  • Smartest Recompilation, TR-395-92, October 1992
  • Space-Efficient Closure Representations, TR-454-94, March 1994
  • Unrolling Lists, TR-453-94, March 1994
• Sharir, Micha
  • Algorithms for Bichromatic Line Segment Problems and Polyhedral Terrains, TR-252-90, March 1990
  • Computing a Face in an Arrangement of Line Segments and Related Problems, TR-334-91, June 1991
  • Counting and Cutting Cycles of Lines and Rods in Space, TR-288-90, October 1990
  • Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons, TR-039-86, May 1986
  • Lines in Space: Combinatorics and Algorithms, TR-294-90, January 1990
  • Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems, TR-290-90, October 1990
  • 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
• Sharma, Shamik D.
  • Efficient Support for Irregular Applications on Distributed--Memory Machines, TR-488-95, April 1995
• Shaw, James
  • Collusion-Secure Fingerprinting for Digital Data, TR-468-94, October 1994
• Shilane, Philip N
  • Shape Distinction for 3D Object Retrieval, TR-817-08, March 2008
• Shillner, Robert A.
  • An Introduction to Client-Server Programming with Sockets, TR-545-97, March 1997
  • Mobile Network Objects, TR-534-96, October 1996
  • Simplifying Distributed File Systems Using a Shared Logical Disk, TR-524-96, October 1996
• Shouraboura, Nadia
  • Strategies for Polyhedral Surface Decomposition: An Experimental Study, TR-564-95, December 1995
• Shrairman, Ruth
  • Relaxed Heaps: An Alternative to Fibronacci Heaps, TR-109-87, July 1987
• Shue, David
  • Service-Centric Networking with SCAFFOLD, TR-885-10, September 2010
• Silva, Claudio T.
  • iWalk: Interactive Out-Of-Core Rendering of Large Models, TR-653-02, July 2002
• Silver, Deborah
  • Applied Computational Geometry: Towards Robust Solutions of Basic Problems, TR-192-88, December 1988
  • Recipes for Geometry & Numerical Analysis - Part I: An Empirical Study, TR-144-88, March 1988
• Silver, Deborah E.
  • Geometry, Graphics, and Numerical Analysis (thesis), TR-178-88, October 1988
• Simpson, Patricia
  • Distributed Computing Research at Princeton - 1985, TR-029-86, January 1986
  • Distributed Computing Research at Princeton - 1986, TR-073-87, January 1987
  • Query Processing in a Heterogeneous Retrieval Network, TR-158-88, May 1988
  • Querying a Network of Autonomous Databases, TR-202-89, January 1989
  • Telematics Research at Princeton - 1987, TR-151-88, May 1988
  • Telematics Research at Princeton - 1988, TR-219-89, April 1989
  • The Application of Workstation Caching to Information Systems, TR-085-87, March 1987
• Singh, Jaswinder Pal
  • Approximate Index Routing: A Case for Content-based Peer-to-Peer Routing, TR-684-03, November 2003
  • Comparison of Shared Virtual Memory across Uniprocessor and SMP Nodes, TR-550-97, July 1997
  • Estimating Application Hierarchical Bandwidth Requirements using BSP Family Models, TR-875-10, May 2010
  • Home-based SVM Protocols for SMP Clusters: Design, Implementation and Performance, TR-548-97, May 1997
  • Irregular Applications under Software Shared Memory, TR-514-96, February 1996
  • Limits to the Performance of Software Shared Memory: A Layered Approach, TR-576-98, November 1997
  • MEDYM: An Architecture for Content-based Publish-Subscribe Service Networks, TR-692-04, March 2004
  • Network Interface Support for Shared Virtual Memory on Clusters, TR-579-98, March 1998
  • Query Affinity in Internet Applications, TR-621-00, December 2000
  • Real-Time Parallel MPEG-2 Decoding in Software, TR-516-96, March 1996
  • Relaxed Consistency and Coherence Granularity in DSM Systems: A Performance Evaluation, TR-535-96, December 1996
  • Scheduling Web Crawl for Better Performance and Quality, TR-682-03, October 2003
  • Scope Consistency: a Bridge between Release Consistency and Entry Consistency, TR-509-96, January 1996
  • Shared Virtual Memory Across SMP Nodes Using Automatic Update: Protocols and Performance, TR-517-96, March 1996
  • Shared Virtual Memory with Automatic Update Support, TR-575-98, February 1998
  • Shared Virtual Memory: Progress and Challenges, TR-552-97, October 1997
  • SiteRank: Link-Based Relevance Computation for Persistent Search, TR-745-06, February 2006
  • The Digital StudyHall, TR-723-05, March, 2005
  • The PARSEC Benchmark Suite: Characterization and Architectural Implications, TR-811-08, January 2008
  • Toward quantitative simulation of germinal center dynamics. I. Biologicaland modeling insights from experimental validation, TR-623-00, June 2000
  • Towards Scalable Content-based Publish-Subscribe Networks, TR-725-05, April, 2005
  • Understanding Application Performance on Shared Virtual Memory Systems, TR-519-96, March 1996
• Singh, Mona
  • Combinatorial Optimization Approaches to Motif Finding, TR-728-05, June 2005
  • Improving Mathematical Programming Approaches for Motif Finding, TR-729-05, June 2005
• Sitaraman, Ramesh Kumar
  • Communication and Fault Tolerance in Parallel Computers (Thesis), TR-414-93, June 1993
  • On the Fault Tolerance of Some Popular Bounded-Degree Networks, TR-385-92, September 1992
• Skadron, Kevin
  • 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
  • Branch Prediction, Instruction-Window Size, and Cache Size: Performance Tradeoffs and Sampling Techniques, TR-578-98, April 1998
  • Characterizing and Removing Branch Mispredictions (Thesis), TR-604-99, June 1999
  • 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
• Sleator, Daniel
  • Rotation Distance, Triangulations and Hyperbolic Geometry, TR-131-88, January 1988
• Sleator, Daniel D.
  • A Tight Amortized Bound for Path Reversal, TR-163-88, June 1988
  • Fully Persistent Lists with Catenation, TR-299-90, December 1990
  • Rotation Distance, TR-003-85, July 1985
  • Short Encodings of Evolving Structures, TR-265-90, April 1990
  • The Pairing Heap: A New Form of Self-Adjusting Heap, TR-008-85, July 1985
• Sleator, Daniel E.
  • A Locally Adaptive Data Compression Scheme, TR-004-85, July 1985
• Sloan, Peter-Pike J.
  • Video Cubism, TR-637-01, October 2001
• Slusallek, Philipp
  • Radiosity and Relaxation Methods: Progressive Refinement is Southwell Relaxation, TR-408-93, February 1993
• Smolensky, Roman
  • A Lower Bound for Randomized Algebraic Decision Trees, TR-527-96, October 1996
• Snoeyink, Jack
  • An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon, TR-152-88, May 1988
  • Computing a Face in an Arrangement of Line Segments and Related Problems, TR-334-91, June 1991
  • Counting and Cutting Cycles of Lines and Rods in Space, TR-288-90, October 1990
  • Ray Shooting in Polygons Using Geodesic Triangulations, TR-350-91, September 1991
• Sobti, Sumeet
  • A Peer-to-Peer Mobile Storage System, TR-664-02, October 2002
  • Coherent and Network-Aware Tracking of Objects, TR-672-03, December 2003
  • Networking Going Postal, TR-705-04, May 2004
  • Postmanet: Turning the Postal System into a Generic Digital Communication Mechanism, TR-691-04, March 1, 2004
  • The Digital StudyHall, TR-723-05, March, 2005
• Song, Jimin
  • Network-based Analysis of Protein Function, TR-918-11, December 2011
• Soroker, Danny
  • Transitive Reduction in Parallel Via Branchings, TR-171-88, July 1988
• Sotessl, M.
  • Distributed Computing Research at Princeton - 1985, TR-029-86, January 1986
• Souvaine, Diane L.
  • Computational Geometry in a Curved World (thesis), TR-094-87, October 1986
  • Decomposition and Intersection of Simple Splinegons, TR-051-86, August 1986
  • Detecting the Intersection of Convex Objects in the Plane, TR-231-89, October 1989
• Soviani, Adrian
  • Estimating Application Hierarchical Bandwidth Requirements using BSP Family Models, TR-875-10, May 2010
• Spalding, Frances
  • Certifying Compilation for a Language with Stack Allocation, TR-724-05, March, 2005
• Spalink, Tammo
  • Communication synchronization, TR-722-05, February 2005
  • Deterministic Sharing of Distributed Resources, TR-768-06, October 2006
  • Evaluating Network Processors in IP Forwarding, TR-626-00, November 2000
  • Evolving beyond asynchrony, TR-721-05, February 2005
• Spatscheck, Oliver
  • Defending Against Denial of Service Attacks in Scout, TR-588-98, August 1998
• Spauster, Annemarie
  • Distributed Computing Research at Princeton - 1985, TR-029-86, January 1986
  • Distributed Computing Research at Princeton - 1986, TR-073-87, January 1987
  • Increasing Availability under Mutual Exclusion Constraints with Dynamic Vote Reassignment, TR-056-86, November 1986
  • Message Ordering in a Multicast Environment, TR-161-88, June 1988
  • Ordered and Reliable Multicast Communication, TR-184-88, October 1988
  • Ordered and Reliable Multicast Communication (Thesis), TR-312-91, June 1991
  • Policies for Dynamic Vote Reassignment, TR-010-85, September 1985
  • Protocols for Dynamic Vote Reassignment, TR-037-86, May 1986
  • Telematics Research at Princeton - 1987, TR-151-88, May 1988
  • Telematics Research at Princeton - 1988, TR-219-89, April 1989
• Squier, Richard
  • Performance of VLSI Engines for Lattice Computations, TR-083-87, March 1987
  • Testing Parallel Simulators for Two-Dimensional Lattice-Gas Automata, TR-269-90, June 1990
• Squier, Richard K.
  • Efficient, Scalable Architectures for Lattice-Gas Computations (Thesis), TR-304-91, June 1991
  • General Parallel Computation without CPUs: VLSI Realization of a Particle Machine, TR-484-95, February 1995
  • Programmable Parallel Arithmetic in Cellular Automata Using a Particle Model, TR-478-94, December 1994
• Staelin, Carl
  • Clustering Active Disk Data To Improve Disk Performance , TR-283-90, September 1990
  • File Access Patterns, TR-179-88, September 1988
  • File System Design Using Large Memories, TR-246-90, June 1990
• Staelin, Carl Hudson
  • High Performance File System Design(Thesis), TR-347-91, October 1991
• Steiglitz, Kenneth
  • A Comparison Study of Heuristics for Mapping Parallel Algorithms to Message-Passing Multiprocessors, TR-446-94, February 1994
  • A Probabilistic Model for Clock Skew, TR-124-87, November 1987
  • A Semiring On Convex Polygons and Zero-Sum Cycle Problems, TR-053-86, September 1986
  • Comparison of Tree and Straight-Line Clocking for Long Systolic Arrays, TR-271-90, June 1990
  • Computer Science 111 Lab Manual, TR-346-91, September 1991
  • Ein Kleiner Filter Compiler, TR-279-90, August 1990
  • Embedding Computation in One-Dimensional Automata by Phase Coding Solitons, TR-015-85, November 1985
  • Error Detection in Arrays Via Dependency Graphs, TR-339-91, August 1991
  • General Parallel Computation without CPUs: VLSI Realization of a Particle Machine, TR-484-95, February 1995
  • Maintaining Bipartite Matchings in the Presence of Failures, TR-398-92, October 1992
  • METEOR: A Constraint-based FIR Filter Design Program, TR-278-90, August 1990
  • Optimization of One-Bit Full Adders Embedded in Regular Structures, TR-031-86, March 1986
  • Performance of VLSI Engines for Lattice Computations, TR-083-87, March 1987
  • Planarity Testing of Doubly Periodic Infinite Graphs, TR-066-86, December 1986
  • Programmable Parallel Arithmetic in Cellular Automata Using a Particle Model, TR-478-94, December 1994
  • Reconfigurability and Reliability of Systolic/Wavefront Arrays, TR-280-90, August 1990
  • Reliable Reconfigurable Structures for Array Architectures, TR-315-91, April 1991
  • Soliton Phase Shifts in a Dissipative Lattice, TR-044-86, June 1986
  • Testing Parallel Simulators for Two-Dimensional Lattice-Gas Automata, TR-269-90, June 1990
  • Throughput of Long Self-Timed Pipelines, TR-190-88, November 1988
• Stein, Clifford
  • Improved Algorithms for Bipartite Network Flow, TR-338-91, May 1991
• Steurer, David
  • On the Complexity of Unique Games and Graph Expansion, TR-887-10, October 2010
• Stolfi, Jorge
  • Lines in Space: Combinatorics and Algorithms, TR-294-90, January 1990
• Stubblefield, Adam
  • Reading Between the Lines: Lessons from the SDMI Challenge, TR-657-02, July 2002
• Stumm, Michael
  • Shared Virtual Memory Accomodating Heterogeneity, TR-210-89, February 1989
• Stump, Aaron
  • A Trustworthy Proof Checker, TR-648-02, April 2002
• Suchara, Martin
  • BGP Safety with Spurious Updates, TR-881-10, September 2010
  • Comparing the Security Performance of Network-Layer and Application-Layer Anycast, TR-849-09, April 2009
  • How Small Groups Can Secure Interdomain Routing, TR-808-07, December 2007
  • Reliable Internet Routing (thesis), TR-902-11, June 2011
  • Scaffold: Quantum Programming Language, TR-934-12, July 2012
• Suleimenov, Arman
  • Twitter News: Harnessing Twitter to Build an Article Recommendation System, TR-932-12, June 2012
• Sundar, Rajamani
  • Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues, TR-381-92, July 1992
  • Lazy Structure Sharing for Query Optimization, TR-422-93, April 1993
  • Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences, TR-267-90, November 1989
• Supowit, Kenneth J.
  • Delaunay Graphs are Almost as Good as Complete Graphs, TR-113-87, June 1987
  • Finding the Optimal Variable Ordering for Binary Decision Diagrams, TR-058-86, November 1986
  • Recognizing Circle Graphs in Polynomial Time, TR-059-86, July 1986
• Suri, Subhash
  • Maintenance of Geometric Extrema, TR-196-88, December 1988
• Svec, Lukas
  • Scaffold: Quantum Programming Language, TR-934-12, July 2012
• Swadi, Kedar N.
  • Typed Machine Language (Thesis), TR-676-03, September 2003
• Swartzlander, Ben
  • Reading Between the Lines: Lessons from the SDMI Challenge, TR-657-02, July 2002
• Syed, Umar
  • Reinforcement Learning Without Rewards, TR-883-10, August 2010
• Syrivelis, Dimitris
  • Counteracting Discrimination against Network Traffic , TR-794-07, August 2007
  • Secure Availability Monitoring Using Stealth Probes, TR-769-06, October 2006
• Szefer, Jakub
  • Cloud Resident Data Center, TR-914-11, September 2011