• 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

• Abad, Soraya
  • Data Caching in an Information Retrieval System, TR-065-86, Decmeber 1986
  • Quasi-Copies: Efficient Data Sharing for Information Retrieval Systems, TR-101-87, June 1987
• Abbott, Robert K.
  • Distributed Computing Research at Princeton - 1985, TR-029-86, January 1986
  • Distributed Computing Research at Princeton - 1986, TR-073-87, January 1987
  • Reliable Distributed Database Management, TR-047-86, August 1986
  • 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
  • Telematics Research at Princeton - 1987, TR-151-88, May 1988
  • Telematics Research at Princeton - 1988, TR-219-89, April 1989
• Abbott, Robert Kilburn
  • Scheduling Real-Time Transactions: A Performance Evaluation (Thesis), TR-331-91, October 1991
• Abhari, Ali Javadi
  • Scaffold: Quantum Programming Language, TR-934-12, July 2012
• Ablayev, Farid
  • On the Power of Randomized Branching Programs, TR-531-96, October 1996
• Agarwal, Amit
  • Logarithmic Regret Algorithms for Online Convex Optimization, TR-747-06, February 2006
  • New Algorithms for Repeated Play and Universal Portfolio Management, TR-740-05, October 2005
• Aggarwal, Sudhir
  • Distributed Reachability Analysis for Protocol Verification Environments, TR-110-87, August 1987
• Ahmed, Amal J.
  • Semantics of Types for Mutable State (Thesis), TR-713-04, July 2004
• Ahuja, Pritpal S.
  • Branch Prediction, Instruction-Window Size, and Cache Size: Performance Tradeoffs and Sampling Techniques, TR-578-98, April 1998
  • Improving Prediction for Procedure Returns with Return-Address-Stack Repair Mechanisms, TR-577-98, March 1998
• Ahuja, Ravindra K.
  • Faster Algorithms for the Shortest Path Problem, TR-154-88, March 1988
  • Finding Minimum-Cost Flows by Double Scaling , TR-164-88, June 1988
  • Improved Algorithms for Bipartite Network Flow, TR-338-91, May 1991
  • Improved Time Bounds for the Maximum Flow Problem, TR-118-87, September 1987
• Ailon, Nir
  • Proofs of Conjectures in "Aggregating Inconsistent Information: Ranking and Clustering", TR-719-05, January 2005
  • Studies in Algorithms (Thesis), TR-763-06, August 2006
• Allender, Eric
  • A Uniform Circuit Lower Bound for the Permanent, TR-426-93, June 1993
  • Depth Reduction for Noncommutative Arithmetic Circuits (Extended Abstract), TR-417-93, March 1993
  • Relationships among PL, #L, and the Determinant, TR-425-93, June 1993
• Alonso, Rafael
  • A Dynamic File Caching Strategy that Preserves File Consistency , TR-241-90, January 1990
  • A Load Balancing Implementation for a Local Area Network of Workstations, TR-018-86, January 1986
  • A Process Migration Implementation for a Unix System, TR-092-87, May 1987
  • A Prototype for Research on Heterogeneous Database Systems, TR-102-87, June 1987
  • Altruistic Locking: A Strategy for Coping with Long Lived Transactions, TR-087-87, April 1987
  • An Advisor for Flexible Working Sets, TR-245-90, February 1990
  • An Experimental Comparison of Initial Placement vs. Process Migration for Load Balancing Strategies, TR-199-88, December 1988
  • An Experimental Evaluation of Load Balancing Strategies, TR-112-87, September 1987
  • Augmenting Availability in Distributed File Systems, TR-234-89, October 1989
  • Concurrency Controls for Global Procedures in Federated Database Systems, TR-099-87, June 1987
  • Data Caching in an Information Retrieval System, TR-065-86, Decmeber 1986
  • Data Sharing in a Large Heterogeneous Environment, TR-272-90, July 1990
  • Distributed Computing Research at Princeton - 1985, TR-029-86, January 1986
  • Distributed Computing Research at Princeton - 1986, TR-073-87, January 1987
  • Distributed Reachability Analysis for Protocol Verification Environments, TR-110-87, August 1987
  • Distributing Workload Among Independently Owned Processors, TR-200-88, December 1988
  • Dynamic Hierarchical Caching in Large-Scale Distributed File Systems, TR-353-91, October 1991
  • FACE: Enhancing Distributed File Systems for Autonomous Computing Environments, TR-214-89, March 1989
  • Integration of Commit Protocols in Heterogeneous Databases, TR-375-92, June 1992
  • Long-Term Caching Strategies for Very Large Distributed File Systems, TR-321-91, April 1991
  • Negotiating Data Access in Federated Database Systems, TR-160-88, June 1988
  • Quasi-Copies: Efficient Data Sharing for Information Retrieval Systems, TR-101-87, June 1987
  • Querying a Network of Autonomous Databases, TR-202-89, January 1989
  • Sharing Jobs Among Independently Owned Processors, TR-120-87, November 1987
  • Some Thoughts on Data Sharing Among Autonomous Cooperating Database Systems, TR-100-87, June 1987
  • 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
  • The Design of Load Balancing Strategies for Distributed Systems, TR-035-86, May 1986
• Alpert, Richard D.
  • Design and Implementation of NX Message Passing Using SHRIMP Virtual Memory Mapped Communication, TR-507-96, January 1996
  • Early Experience with Message-Passing on the SHRIMP Multicomputer, TR-510-96, January 1996
  • Virtual Memory Mapped Network Interface for the SHRIMP Multicomputer, TR-437-93, November 1993
• Althofer, Ingo
  • Generating Sparse Spanners for Weighted Graphs, TR-261-90, April 1990
• Anderson, Thomas E.
  • MimdRAID: Low Latency Secondary Storage, TR-612-99, September 1999
  • The Digital StudyHall, TR-723-05, March, 2005
• Anshus, Otto J.
  • A Multi-Cursor X Window Manager Supporting Control Room Collaboration, TR-707-04, July 2004
  • Thread Scheduling for Cache Locality, TR-569-96, December 1996
• Aperjis, Christina
  • The Role of Prices in Peer-Assisted Content Distribution, TR-814-08, February 2008
• Appel, Andrew W.
  • A Critique of Standard ML, TR-364-92, February 1992
  • A Runtime System, TR-220-89, May 1989
  • A Standard ML Compiler, TR-097-87, June 1987
  • A Trustworthy Proof Checker, TR-648-02, April 2002
  • A Type-Based Compiler for Standard ML, TR-487-95, March 1995
  • Allocation Without Locking, TR-182-88, September 1988
  • An Advisor for Flexible Working Sets, TR-245-90, February 1990
  • An Empirical and Analytic Study of Stack vs. Heap Cost for Languages with Closures, TR-450-94, March 1994
  • An Indexed Model of Recursive Types for Foundational Proof-Carrying Code, TR-629-00, November 2000
  • Automatic Configuration Vulnerability Analysis, TR-773-07, February 2007
  • Axiomatic Bootstrapping: A Guide for Compiler Hackers, TR-451-94, March 1994
  • Cache Performance of Fast-Allocating Programs, TR-482-94, December 1994
  • Callee-save Registers in Continuation-Passing Style, TR-326-91, August 1991
  • Concise Specifications of Locally Optimal Code Generators, TR-080-87, February 1987
  • Concurrent Separation Logic for Pipelined Parallelization, TR-876-10, June 2010
  • Continuation-Passing, Closure-Passing Style, TR-183-88, September 1988
  • Copying Garbage Collection in the Presence of Ambiguous References, TR-162-88, June 1988
  • Debuggable Concurrency Extensions for Standard ML, TR-352-91, October 1991
  • Debugging Standard ML Without Reverse Engineering, TR-253-90, March 1990
  • Dictionary Passing for Polytypic Polymorphism, TR-635-01, March 2001
  • Emulating Write-Allocate on a No-Write-Allocate Cache, TR-459-94, June 1994
  • Garbage Collection Can Be Faster Than Stack Allocation, TR-045-86, June 1986
  • Hash-Consing Garbage Collection, TR-412-93, February 1993
  • Hierarchical Modularity: Compilation Management for Standard ML, TR-555-97, July 1997
  • How to Edit a Journal by E-mail, TR-494-95, July 1995
  • Intensional Equality ;=) for Continuations, TR-557-95, September 1995
  • Iterated Register Coalescing, TR-498-95, August 1995
  • JVM TCB: Measurements of the Trusted Computing Base of Java Virtual Machines, TR-647-02, April 2002
  • Lambda-Splitting: A Higher-Order Approach to Cross-Module Optimizations, TR-537-96, November 1996
  • Lightweight Lemmas in Lambda Prolog (Extended Version), TR-607-99, October 1999
  • Loop Headers in Lambda-Calculus or CPS, TR-460-94, June 1994
  • Machine Instruction Syntax and Semantics in Higher Order Logic, TR-619-00, April 2000
  • Making Lambda Calculus Smaller, Faster, TR-477-94, November 1994
  • Mechanisms for Secure Modular Programming in Java, TR-603-99, July 1999
  • Models for Security Policies in Proof-Carrying Code, TR-636-01, March 2001
  • Network Security Management with High-level Security Policies, TR-714-04, September 2004
  • Optimal Spilling for CISC Machines with Few Registers, TR-630-00, November 2000
  • Optimizing Closure Environment Representation, TR-168-88, July 1988
  • Oracle Semantics for Concurrent Separation Logic (Extended Version), TR-825-08, June 2008
  • Policy-based Multihost Multistage Vulnerability Analysis, TR-718-04, December 2004
  • Profiling in the Presence of Optimization and Garbage Collection, TR-197-88, November 1988
  • Re-opening Closures, TR-079-87, February 1987
  • Real-time Concurrent Collection on Stock Multiprocessors, TR-133-88, February 1988
  • Runtime Tags Aren't Necessary, TR-142-88, March 1988
  • Safe Garbage Collection = Regions + Intensional Type Analysis, TR-609-99, October 1999
  • Safe Heterogeneous Applications: Curing the Java Native Interface, TR-715-04, October 2004
  • Secure Linking: a Framework for Trusted Software Components, TR-662-02, September 2002
  • Secure Linking: a Framework for Trusted Software Components (Extended Version), TR-663-02, September 2002
  • Security and Document Compatability for Electronic Refereeing, TR-558-96, October 1996
  • Separate Compilation for Standard ML, TR-452-94, March 1994
  • Shrinking Lambda Expressions in Linear Time, TR-556-97, February 1997
  • Simple Generational Garbage Collection and Fast Allocation, TR-143-88, March 1988
  • Simulating Digital Circuits with One Bit Per Wire, TR-093-87, May 1987
  • Smartest Recompilation, TR-395-92, October 1992
  • Space-Efficient Closure Representations, TR-454-94, March 1994
  • Standard ML of New Jersey, TR-329-91, June 1991
  • Technological Access Control Interferes with Noninfringing Scholarship, TR-617-00, February 2000
  • The Zephyr Abstract Syntax Description Language, TR-554-97, October 1997
  • Type-Preserving Garbage Collectors (Extended Version), TR-624-00, December 2000
  • Unrolling Lists, TR-453-94, March 1994
  • Unrolling Recursions Saves Space, TR-363-92, March 1992
  • Vectorized Garbage Collection, TR-169-88, July 1988
  • Virtual Memory Primitives for User Programs, TR-276-90, July 1990
  • Windows Access Control Demystified , TR-744-06, January 2006
• Appelbaum, Benny
  • Fast Cryptographic Primitives Based on the Hardness of Decoding Random Linear Code , TR-845-08, December 2008
• Ar, Sigal H.
  • Trustworthy Computations (Thesis), TR-435-93, November 1993
  • Uncheatable Benchmarks Using Numerical Instability, TR-433-93, September 1993
• Arden, Bruce W.
  • A New Approach to Fast Control of Permutation Networks, TR-032-86, April 1986
  • An Improved Upper Bound for Sorting on Non-partitionable Superposed Parallel Buses, TR-071-87, January 1987
  • Bitonic Sorting on Superposed Parallel Buses, TR-063-86, November 1986
  • Bus Partitionability and Parallel Permutations, TR-041-86, May 1986
  • K-Way Bitonic Sort, TR-040-86, May 1986
  • More Parallelism into the Monte Carlo Solution of Partial Differential Equations, TR-061-86, November 1986
  • Optimal Permutations on Superposed Parallel Buses, TR-060-86, November 1986
  • Optimal Selection on Non-partitionable Superposed Parallel Buses, TR-072-87, January 1987
  • Permutations on Superposed Parallel Buses, TR-024-86, January 1986
  • Superposed Parallel Buses: A Systolic Area-Time Optimal VLSI Interconnection, TR-019-86, February 1986
  • The Optimal Uniform Schedules of Arbitrary Static Permutations on Superposed Parallel Buses, TR-033-86, April 1986
• Arora, Dushyant
  • Live Migration of an Entire Network (and its Hosts), TR-926-12, June 2012
• Arora, Sanjeev
  • Hardness of Approximations, TR-504-95, December 1995
  • Probabilistic Checking of Proofs and Hardness of Approximation Problems, TR-476-94, November 1994
• Arye, Matvey
  • FlexMove: A Protocol for Flexible Addressing on Mobile Devices (MSE thesis), TR-900-11, May 2011
  • Service-Centric Networking with SCAFFOLD, TR-885-10, September 2010
• August, David I.
  • Fault-tolerant Typed Assembly Language, TR-776-07, April 2007
• Aupperle, Larry
  • A Hierarchical Illumination Algorithm for Surfaces with Glossy Reflection, TR-410-93, January 1993
  • Hierarchical Algorithms for Illumination (Thesis), TR-434-93, November 1993
• Avramopoulos, Ioannis
  • Comparing the Security Performance of Network-Layer and Application-Layer Anycast, TR-849-09, April 2009
  • Counteracting Discrimination against Network Traffic , TR-794-07, August 2007
  • How Small Groups Can Secure Interdomain Routing, TR-808-07, December 2007
  • How to Take Back Your Address Space, TR-809-07, December 2007
  • Morpheus: Enabling Flexible Interdomain Routing Policies , TR-802-07, October 2007
  • Morpheus: Making Routing Programmable, TR-784-07, June 2007
  • Nicephorus: Striking a Balance between the Recovery Capability and the Overhead of Byzantine Detection, TR-710-04, October 2004
  • Opt and Vent: An Efficient Protocol for Byzantine Detection in Wireless Ad Hoc Network Routing, TR-709-04, October 2004
  • Secure Availability Monitoring Using Stealth Probes, TR-769-06, October 2006
  • Stealth Probing: Securing IP Routing through Data-Plane Security, TR-730-05, June 2005