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