• 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

• Gabor, Csaba P.
  • Graph Decompositions with Applications to Circle and Permutation Graphs (thesis), TR-275-90, October 1990
  • Recognizing Circle Graphs in Polynomial Time, TR-059-86, July 1986
• Gabow, Harold N.
  • A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest, TR-108-87, July 1987
  • Algorithms for Two Bottleneck Optimization Problems, TR-104-87, May 1987
  • Almost-Optimum Parallel Speed-ups of Algorithms for Bipartite Matching and Related Problems, TR-223-89, January 1989
  • Faster Scaling Algorithms for General Graph Matching Problems, TR-222-89, April 1989
  • Faster Scaling Algorithms for Network Problems, TR-111-87, August 1987
  • Relaxed Heaps: An Alternative to Fibronacci Heaps, TR-109-87, July 1987
• Gallo, Girogio
  • A Fast Parametric Maximum Flow Algorithm, TR-105-87, July 1987
• Garcia-Molina, Hector
  • A Probabilistic Relational Data Model, TR-215-89, January 1989
  • Achieving High Availability in Distributed Databases, TR-043-86, June 1986
  • Altruistic Locking: A Strategy for Coping with Long Lived Transactions, TR-087-87, April 1987
  • An Implementation of Reliable Broadcast Using an Unreliable Multicast Facility , TR-170-88, August 1988
  • Checkpointing Memory-Resident Databases, TR-126-87, December 1987
  • Clustering Active Disk Data To Improve Disk Performance , TR-283-90, September 1990
  • 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
  • Data Caching in an Information Retrieval System, TR-065-86, Decmeber 1986
  • Database Processing with Triple Modular Redundancy, TR-002-85, July 1985
  • Distributed Computing Research at Princeton - 1985, TR-029-86, January 1986
  • Distributed Computing Research at Princeton - 1986, TR-073-87, January 1987
  • Distributed Processing of Filtering Queries in HyperFile, TR-295-90, November 1990
  • Evaluation of Remote Backup Algorithms for Transaction Processing Systems, TR-359-92, January 1992
  • Exploiting Symmetries for Low-Cost Comparison of File Copies, TR-117-87, November 1987
  • File System Design Using Large Memories, TR-246-90, June 1990
  • Increasing Availability under Mutual Exclusion Constraints with Dynamic Vote Reassignment, TR-056-86, November 1986
  • Indexing in a Hypertext Database, TR-206-89, February 1989
  • Maintaining Availability of Replicated Data in a Dynamic Failure Environment, TR-064-86, December 1986
  • Management of a Remote Backup Copy for Disaster Recovery, TR-198-88, December 1988
  • Message Ordering in a Multicast Environment, TR-161-88, June 1988
  • Mutual Exclusion in Partitioned Distributed Systems, TR-001-85, July 1985
  • Optimizing Shadow Recovery Algorithms, TR-012-85, September 1985
  • Ordered and Reliable Multicast Communication, TR-184-88, October 1988
  • Performance Through Memory, TR-075-87, January 1987
  • Policies for Dynamic Vote Reassignment, TR-010-85, September 1985
  • Processing of Read-Only Queries at a Remote Backup, TR-354-91, November 1991
  • Protocols for Dynamic Vote Reassignment, TR-037-86, May 1986
  • Quasi-Copies: Efficient Data Sharing for Information Retrieval Systems, TR-101-87, June 1987
  • Recovery in a Triple Modular Redundant Database System, TR-076-87, January 1987
  • Reliable Broadcast in Networks with Nonprogrammable Servers, TR-123-87, November 1987
  • Reliable Distributed Database Management, TR-047-86, August 1986
  • Reliable Scheduling in a TMR Database System, TR-028-86, April 1986
  • SAGAS, TR-070-87, January 1987
  • Scheduling I/O Requests with Deadlines: A Performance Evaluation, TR-287-90, October 1990
  • Scheduling Real-time Transactions, TR-129-87, December 1987
  • Scheduling Real-Time Transactions with Disk Resident Data, TR-207-89, February 1989
  • Scheduling Real-time Transactions: A Performance Evaluation, TR-146-88, February 1988
  • Some Thoughts on Data Sharing Among Autonomous Cooperating Database Systems, TR-100-87, June 1987
  • Some Thoughts on Probabilistic Databases, TR-090-87, April 1987
  • Supporting Probabilistic Data in a Relational System, TR-147-88, February 1988
  • 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
  • The Demarcation Protocol: A Technique for Maintaining Arithmetic Constraints in Distributed Database Systems, TR-320-91, April 1991
  • The Design of a Document Database, TR-177-88, September 1988
  • Two Epoch Algorithms for Disaster Recovery, TR-248-90, February 1990
  • Update Propagation in Bakunin Data Networks, TR-091-87, May 1987
• Garey, Michael R.
  • One-Processor Scheduling of Tasks with Preferred Starting Times, TR-049-86, August 1986
• Garg, Nitin
  • A Postal System Based Digital Network And A Distance Learning System (thesis), TR-757-06, June 2006
  • 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
• Gaw, Shirley
  • Ideals and Reality: Adopting Secure Technologies and Developing Secure Habits to Prevent Message Disclosure (thesis), TR-852-09, April 2009
• Gawlick, D.
  • Coordinating Multi-Transaction Activities, TR-247-90, February 1990
• George, Lal
  • Iterated Register Coalescing, TR-498-95, August 1995
  • Optimal Spilling for CISC Machines with Few Registers, TR-630-00, November 2000
• Georgiadis, Loukas
  • Linear-Time Algorithms for Dominators and Related Problems (thesis), TR-737-05, October 2005
• Gerrish, Sean
  • Applications of Latent Variable Models in Modeling Influence and Decision Making, TR-944-13, January 2013
• Gershbein, Reid
  • An Adaptive Gauss Method for Computing Irradiance Coefficients of Galerkin Radiosity Systems, TR-485-95, February 1995
  • Textures and Radiosity: Controlling Emission and Reflection with Texture Maps, TR-449-94, March 1994
• Gibbons, Phillip
  • Transitive Reduction in Parallel Via Branchings, TR-171-88, July 1988
• Ginat, David
  • A Tight Amortized Bound for Path Reversal, TR-163-88, June 1988
• Glew, Neal
  • Certifying Compilation for a Language with Stack Allocation, TR-724-05, March, 2005
• Gleyzer, Artem
  • PADS/ML: A Functional Data Description Language , TR-761-06, July 2006
• Golan, Michael
  • A Very High Level Debugging Language (thesis), TR-438-93, January 1994
  • DUEL - A Very High-Level Debugging Language, TR-399-92, November 1992
• Goldberg, Andrew V.
  • A New Approach to the Maximum Flow Problem, TR-050-86, July 1986
  • A Parallel Algorithm for Finding A Blocking Flow in an Acyclic Network, TR-186-88, October 1988
  • Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem, TR-193-88, October 1988
  • Expected Performance of Dijkstra's Shortest Path Algorithm, TR-530-96, October 1996
  • Finding Minimum-Cost Circulations by Canceling Negative Cycles, TR-107-87, July 1987
  • Finding Minimum-Cost Circulations by Successive Approximation, TR-106-87, July 1987
  • Finding Minimum-Cost Flows by Double Scaling , TR-164-88, June 1988
  • Network Flow Algorithms, TR-216-89, March 1989
  • Solving Minimum-Cost Flow Problems by Successive Approximation, TR-081-87, February 1987
• Goldberg, Sharon
  • A Cryptographic Study of Secure Fault Detection in the Internet, TR-800-07, October 2007
  • A Cryptographic Study of Secure Internet Measurement, TR-783-07, May 2007
  • Path-Quality Monitoring in the Presence of Adversaries, TR-807-07, December 2007
  • Rational ASes and Traffic Attraction: Incentives for honestly announcing paths in BGP, TR-813-08, February 2008
  • Rationality and Traffic Attraction: Incentives for Honest Path Announcements in BGP, TR-823-08, August 2008
  • Towards a Cryptanalysis of Spectral-Phase Encoded Optical CDMA with Phase-Scrambling, TR-771-06, November 2006
• Goldman, Phillip
  • A Load Balancing Implementation for a Local Area Network of Workstations, TR-018-86, January 1986
  • Distributed Computing Research at Princeton - 1985, TR-029-86, January 1986
• Golin, Mordecai
  • 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
  • Probabilistic Analysis of a Closest Pair Algorithm, TR-194-88, December 1988
  • Probabilistic Analysis of Geometric Algorithms (thesis), TR-266-90, June 1990
• Golovinskiy, Aleksey
  • Analysis of Global Properties of Shapes (thesis), TR-871-10, March 2010
  • Symmetry-Aware Mesh Processing, TR-782-07, April 2007
• Goncalves, Marcelo Jose de Rezende
  • Cache Performance of Fast-Allocating Programs, TR-482-94, December 1994
  • Cache Performance of Programs with Intensive Heap Allocation and Generational Garbage Collection (thesis), TR-492-95, May 1995
  • Hash-Consing Garbage Collection, TR-412-93, February 1993
• Gong, Li
  • Experience with Secure Multi-Processing in Java, TR-560-97, September 1997
• Gopalan, Prem
  • Service-Centric Networking with SCAFFOLD, TR-885-10, September 2010
• Gore, Vivek
  • A Uniform Circuit Lower Bound for the Permanent, TR-426-93, June 1993
• Gortler, Steven J.
  • Radiosity and Relaxation Methods: Progressive Refinement is Southwell Relaxation, TR-408-93, February 1993
  • Variational Modeling with Wavelets, TR-456-94, April 1994
  • Wavelet Methods for Computer Graphics (Thesis), TR-473-94, December 1994
• Gottlieb, Yitzchak
  • Operating System Support for Generalized Packet Forwarding (Thesis), TR-711-04, August 2004
  • Snow on Silk: A NodeOS in the Linux Kernel, TR-641-02, June 2002
• Govindavajhala, Sudhakar
  • A Formal Approach to Practical Network Security Management (thesis), TR-775-07, February 2007
  • Automatic Configuration Vulnerability Analysis, TR-773-07, February 2007
  • Network Security Management with High-level Security Policies, TR-714-04, September 2004
  • Policy-based Multihost Multistage Vulnerability Analysis, TR-718-04, December 2004
  • Windows Access Control Demystified , TR-744-06, January 2006
• Greenstreet, Mark R.
  • Simple Hardware for Fast Interprocessor Communication, TR-242-90, January 1990
  • STARI: A Technique for High-Bandwidth Communication (Thesis), TR-394-92, January 1993
  • Throughput of Long Self-Timed Pipelines, TR-190-88, November 1988
• Grigni, Michelangelo
  • Ray Shooting in Polygons Using Geodesic Triangulations, TR-350-91, September 1991
• Grigoriadis, Michael D.
  • A Fast Parametric Maximum Flow Algorithm, TR-105-87, July 1987
  • Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem, TR-193-88, October 1988
• Grigoriev, Dima
  • A Lower Bound for Randomized Algebraic Decision Trees, TR-527-96, October 1996
  • Randomized Omega (n^2) Lower Bound for Knapsack, TR-538-96, December 1996
• Griswold, Ralph E.
  • String Processing Languages, TR-306-91, February 1991
• Grossman, Robert
  • Visibility with a Moving Point of View, TR-235-89, November 1989
• Guibas, Leonidas
  • 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
  • Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons, TR-039-86, May 1986
  • Ray Shooting in Polygons Using Geodesic Triangulations, TR-350-91, September 1991
• Guibas, Leonidas J.
  • Algorithms for Bichromatic Line Segment Problems and Polyhedral Terrains, TR-252-90, March 1990
  • Counting and Cutting Cycles of Lines and Rods in Space, TR-288-90, October 1990
  • Lines in Space: Combinatorics and Algorithms, TR-294-90, January 1990
  • Slimming Down by Adding: Selecting Heavily Covered Points, TR-257-90, April 1990
  • The Complexity of Cutting Complexes, TR-082-87, March 1987
  • Visibility and Intersection Problems in Plane Geometry, TR-167-88, June 1988
• Gum, Ben
  • Cheaper by the Dozen: Batched Algorithms, TR-627-00, November 2000
• Gunopulos, Dimitrios
  • Computing the Maximum Bichromatic Discrepancy with Applications to Computer Graphics and Machine Learning, TR-562-95, December 1995
  • Computing the Maximum Bichromatic Discrepancy, with Applications to Computer Graphics and Machine Learning, TR-467-94, October 1994
  • Computing the Rectangle Discrepancy, TR-443-94, January 24, 1994
  • Concept Learning with Geometric Hypotheses, TR-563-95, December 1995
  • Concept Learning with Simple Geometric Hypotheses, TR-481-94, December 1994
  • The Maximum Discrepancy of Simple Geometric Ranges, TR-480-94, December 1994
• Guo, Bolei
  • Shape Analysis with Inductive Recursion Synthesis (thesis), TR-822-08, May 2008
• Guruswami, Venkatesan
  • New Approximation Algorithms for Degree Lower-bounded Arborescences and Max-Min Allocation, TR-848-09, May 2009