Published on Computer Science Department at Princeton University (https://www.cs.princeton.edu)

Home > Research > Technical Reports > Technical Reports for Author

Display by author:
A [1] | B [2] | C [3] | D [4] | E [5] | F [6] | G [7] | H [8] | I [9] | J [10] | K [11] | L [12] | M [13] | N [14] | O [15] | P [16] | Q [17] | R [18] | S [19] | T [20] | U | V [21] | W [22] | X [23] | Y [24] | Z [25]

  • Gabor, Csaba P.
    • TR-275-90 - Graph Decompositions with Applications to Circle and Permutation Graphs (thesis) [26] (1990)
    • TR-059-86 - Recognizing Circle Graphs in Polynomial Time [27] (1986)
  • Gabow, Harold N.
    • TR-223-89 - Almost-Optimum Parallel Speed-ups of Algorithms for Bipartite Matching and Related Problems [28] (1989)
    • TR-222-89 - Faster Scaling Algorithms for General Graph Matching Problems [29] (1989)
    • TR-111-87 - Faster Scaling Algorithms for Network Problems [30] (1987)
    • TR-109-87 - Relaxed Heaps: An Alternative to Fibronacci Heaps [31] (1987)
    • TR-108-87 - A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest [32] (1987)
    • TR-104-87 - Algorithms for Two Bottleneck Optimization Problems [33] (1987)
  • Gallo, Girogio
    • TR-105-87 - A Fast Parametric Maximum Flow Algorithm [34] (1987)
  • Garcia-Molina, Hector
    • TR-359-92 - Evaluation of Remote Backup Algorithms for Transaction Processing Systems [35] (1992)
    • TR-354-91 - Processing of Read-Only Queries at a Remote Backup [36] (1991)
    • TR-320-91 - The Demarcation Protocol: A Technique for Maintaining Arithmetic Constraints in Distributed Database Systems [37] (1991)
    • TR-295-90 - Distributed Processing of Filtering Queries in HyperFile [38] (1990)
    • TR-287-90 - Scheduling I/O Requests with Deadlines: A Performance Evaluation [39] (1990)
    • TR-283-90 - Clustering Active Disk Data To Improve Disk Performance [40] (1990)
    • TR-248-90 - Two Epoch Algorithms for Disaster Recovery [41] (1990)
    • TR-247-90 - Coordinating Multi-Transaction Activities [42] (1990)
    • TR-246-90 - File System Design Using Large Memories [43] (1990)
    • TR-219-89 - Telematics Research at Princeton - 1988 [44] (1989)
    • TR-215-89 - A Probabilistic Relational Data Model [45] (1989)
    • TR-207-89 - Scheduling Real-Time Transactions with Disk Resident Data [46] (1989)
    • TR-206-89 - Indexing in a Hypertext Database [47] (1989)
    • TR-198-88 - Management of a Remote Backup Copy for Disaster Recovery [48] (1988)
    • TR-195-88 - System M: A Transaction Processing System for Memory Resident Data [49] (1988)
    • TR-184-88 - Ordered and Reliable Multicast Communication [50] (1988)
    • TR-177-88 - The Design of a Document Database [51] (1988)
    • TR-170-88 - An Implementation of Reliable Broadcast Using an Unreliable Multicast Facility [52] (1988)
    • TR-161-88 - Message Ordering in a Multicast Environment [53] (1988)
    • TR-151-88 - Telematics Research at Princeton - 1987 [54] (1988)
    • TR-147-88 - Supporting Probabilistic Data in a Relational System [55] (1988)
    • TR-146-88 - Scheduling Real-time Transactions: A Performance Evaluation [56] (1988)
    • TR-129-87 - Scheduling Real-time Transactions [57] (1987)
    • TR-126-87 - Checkpointing Memory-Resident Databases [58] (1987)
    • TR-123-87 - Reliable Broadcast in Networks with Nonprogrammable Servers [59] (1987)
    • TR-119-87 - Crash Recovery for Memory-Resident Databases [60] (1987)
    • TR-117-87 - Exploiting Symmetries for Low-Cost Comparison of File Copies [61] (1987)
    • TR-101-87 - Quasi-Copies: Efficient Data Sharing for Information Retrieval Systems [62] (1987)
    • TR-100-87 - Some Thoughts on Data Sharing Among Autonomous Cooperating Database Systems [63] (1987)
    • TR-099-87 - Concurrency Controls for Global Procedures in Federated Database Systems [64] (1987)
    • TR-091-87 - Update Propagation in Bakunin Data Networks [65] (1987)
    • TR-090-87 - Some Thoughts on Probabilistic Databases [66] (1987)
    • TR-087-87 - Altruistic Locking: A Strategy for Coping with Long Lived Transactions [67] (1987)
    • TR-076-87 - Recovery in a Triple Modular Redundant Database System [68] (1987)
    • TR-075-87 - Performance Through Memory [69] (1987)
    • TR-073-87 - Distributed Computing Research at Princeton - 1986 [70] (1987)
    • TR-070-87 - SAGAS [71] (1987)
    • TR-065-86 - Data Caching in an Information Retrieval System [72] (1986)
    • TR-064-86 - Maintaining Availability of Replicated Data in a Dynamic Failure Environment [73] (1986)
    • TR-056-86 - Increasing Availability under Mutual Exclusion Constraints with Dynamic Vote Reassignment [74] (1986)
    • TR-047-86 - Reliable Distributed Database Management [75] (1986)
    • TR-043-86 - Achieving High Availability in Distributed Databases [76] (1986)
    • TR-037-86 - Protocols for Dynamic Vote Reassignment [77] (1986)
    • TR-034-86 - Crash Recovery Mechanisms for Main Storage Database Systems [78] (1986)
    • TR-029-86 - Distributed Computing Research at Princeton - 1985 [79] (1986)
    • TR-028-86 - Reliable Scheduling in a TMR Database System [80] (1986)
    • TR-012-85 - Optimizing Shadow Recovery Algorithms [81] (1985)
    • TR-010-85 - Policies for Dynamic Vote Reassignment [82] (1985)
    • TR-002-85 - Database Processing with Triple Modular Redundancy [83] (1985)
    • TR-001-85 - Mutual Exclusion in Partitioned Distributed Systems [84] (1985)
  • Garey, Michael R.
    • TR-049-86 - One-Processor Scheduling of Tasks with Preferred Starting Times [85] (1986)
  • Garg, Ankit
    • TR-995-16 - INFORMATION THEORETIC RELAXATIONS IN COMPLEXITY THEORY [86] (2016)
  • Garg, Nitin
    • TR-757-06 - A Postal System Based Digital Network And A Distance Learning System (thesis) [87] (2006)
    • TR-723-05 - The Digital StudyHall [88] (2005)
    • TR-705-04 - Networking Going Postal [89] (2004)
    • TR-691-04 - Postmanet: Turning the Postal System into a Generic Digital Communication Mechanism [90] (2004)
    • TR-672-03 - Coherent and Network-Aware Tracking of Objects [91] (2003)
    • TR-664-02 - A Peer-to-Peer Mobile Storage System [92] (2002)
  • Gaw, Shirley
    • TR-852-09 - Ideals and Reality: Adopting Secure Technologies and Developing Secure Habits to Prevent Message Disclosure (thesis) [93] (2009)
  • Gawlick, D.
    • TR-247-90 - Coordinating Multi-Transaction Activities [42] (1990)
  • Ge, Rong
    • TR-968-14 - Provable Algorithms for Machine Learning Problems [94] (2013)
  • George, Lal
    • TR-630-00 - Optimal Spilling for CISC Machines with Few Registers [95] (2000)
    • TR-498-95 - Iterated Register Coalescing [96] (1995)
  • Georgiadis, Loukas
    • TR-737-05 - Linear-Time Algorithms for Dominators and Related Problems (thesis) [97] (2005)
  • Gerrish, Sean
    • TR-944-13 - Applications of Latent Variable Models in Modeling Influence and Decision Making [98] (2013)
  • Gershbein, Reid
    • TR-485-95 - An Adaptive Gauss Method for Computing Irradiance Coefficients of Galerkin Radiosity Systems [99] (1995)
    • TR-449-94 - Textures and Radiosity: Controlling Emission and Reflection with Texture Maps [100] (1994)
  • Ghasemi, Mojgan
    • TR-975-14 - RINC: Real-Time Inference-based Network Diagnosis in the Cloud [101] (2015)
  • Ghobadi, Monia
    • TR-973-14 - Niagara: Scalable Load Balancing on Commodity Switches [102] (2014)
  • Ghosh, Arpan
    • TR-955-13 - GrapeVine: Tracking the Pulse of Businesses using Twitter [103] (2013)
  • Ghosh, Soumyadeep
    • TR-997-16 - TRUSTGUARD: A CONTAINMENT ARCHITECTURE WITH VERIFIED OUTPUT [104] (2016)
  • Giannarakis, Nick
    • TR-014-19 - Compiler Correctness for Concurrency: from concurrent separation logic to shared-memory assembly language [105] (2020)
  • Gibbons, Phillip
    • TR-171-88 - Transitive Reduction in Parallel Via Branchings [106] (1988)
  • Ginat, David
    • TR-163-88 - A Tight Amortized Bound for Path Reversal [107] (1988)
  • Glew, Neal
    • TR-724-05 - Certifying Compilation for a Language with Stack Allocation [108] (2005)
  • Gleyzer, Artem
    • TR-761-06 - PADS/ML: A Functional Data Description Language [109] (2006)
  • Golan, Michael
    • TR-438-93 - A Very High Level Debugging Language (thesis) [110] (1994)
    • TR-399-92 - DUEL - A Very High-Level Debugging Language [111] (1992)
  • Goldberg, Andrew V.
    • TR-530-96 - Expected Performance of Dijkstra's Shortest Path Algorithm [112] (1996)
    • TR-216-89 - Network Flow Algorithms [113] (1989)
    • TR-193-88 - Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem [114] (1988)
    • TR-186-88 - A Parallel Algorithm for Finding A Blocking Flow in an Acyclic Network [115] (1988)
    • TR-164-88 - Finding Minimum-Cost Flows by Double Scaling [116] (1988)
    • TR-107-87 - Finding Minimum-Cost Circulations by Canceling Negative Cycles [117] (1987)
    • TR-106-87 - Finding Minimum-Cost Circulations by Successive Approximation [118] (1987)
    • TR-081-87 - Solving Minimum-Cost Flow Problems by Successive Approximation [119] (1987)
    • TR-050-86 - A New Approach to the Maximum Flow Problem [120] (1986)
  • Goldberg, Sharon
    • TR-823-08 - Rationality and Traffic Attraction: Incentives for Honest Path Announcements in BGP [121] (2008)
    • TR-813-08 - Rational ASes and Traffic Attraction: Incentives for honestly announcing paths in BGP [122] (2008)
    • TR-807-07 - Path-Quality Monitoring in the Presence of Adversaries [123] (2007)
    • TR-800-07 - A Cryptographic Study of Secure Fault Detection in the Internet [124] (2007)
    • TR-783-07 - A Cryptographic Study of Secure Internet Measurement [125] (2007)
    • TR-771-06 - Towards a Cryptanalysis of Spectral-Phase Encoded Optical CDMA with Phase-Scrambling [126] (2006)
  • Goldman, Phillip
    • TR-029-86 - Distributed Computing Research at Princeton - 1985 [79] (1986)
    • TR-018-86 - A Load Balancing Implementation for a Local Area Network of Workstations [127] (1986)
  • Golin, Mordecai
    • TR-266-90 - Probabilistic Analysis of Geometric Algorithms (thesis) [128] (1990)
    • TR-194-88 - Probabilistic Analysis of a Closest Pair Algorithm [129] (1988)
    • TR-130-88 - Analysis of a Simple Yet Efficient Convex Hull Algorithm [130] (1988)
    • TR-130-87 - Analysis of a Simple Yet Efficient Convex Hull Algorithm [131] (1987)
  • Golovinskiy, Aleksey
    • TR-871-10 - Analysis of Global Properties of Shapes (thesis) [132] (2010)
    • TR-782-07 - Symmetry-Aware Mesh Processing [133] (2007)
  • Goncalves, Marcelo Jose de Rezende
    • TR-492-95 - Cache Performance of Programs with Intensive Heap Allocation and Generational Garbage Collection (thesis) [134] (1995)
    • TR-482-94 - Cache Performance of Fast-Allocating Programs [135] (1994)
    • TR-412-93 - Hash-Consing Garbage Collection [136] (1993)
  • Gong, Li
    • TR-560-97 - Experience with Secure Multi-Processing in Java [137] (1997)
  • Gopalan, Prem
    • TR-976-15 - Scalable inference of discrete data: user behavior, networks and genetic variation [138] (2015)
    • TR-885-10 - Service-Centric Networking with SCAFFOLD [139] (2010)
  • Gopi, Sivakanth
    • TR-016-18 - Locality in Coding Theory [140] (2018)
  • Gore, Vivek
    • TR-426-93 - A Uniform Circuit Lower Bound for the Permanent [141] (1993)
  • Gortler, Steven J.
    • TR-473-94 - Wavelet Methods for Computer Graphics (Thesis) [142] (1994)
    • TR-456-94 - Variational Modeling with Wavelets [143] (1994)
    • TR-408-93 - Radiosity and Relaxation Methods: Progressive Refinement is Southwell Relaxation [144] (1993)
  • Gossels, Jennifer
    • TR-001-20 - Joint Optimization for Robust Network Design and Operation [145] (2020)
  • Gottlieb, Yitzchak
    • TR-711-04 - Operating System Support for Generalized Packet Forwarding (Thesis) [146] (2004)
    • TR-641-02 - Snow on Silk: A NodeOS in the Linux Kernel [147] (2002)
  • Govindavajhala, Sudhakar
    • TR-775-07 - A Formal Approach to Practical Network Security Management (thesis) [148] (2007)
    • TR-773-07 - Automatic Configuration Vulnerability Analysis [149] (2007)
    • TR-744-06 - Windows Access Control Demystified [150] (2006)
    • TR-718-04 - Policy-based Multihost Multistage Vulnerability Analysis [151] (2004)
    • TR-714-04 - Network Security Management with High-level Security Policies [152] (2004)
  • Greenberg, Michael
    • TR-987-16 - SNAP: Stateful Network-Wide Abstractions for Packet Processing [153] (2016)
  • Greenstreet, Mark R.
    • TR-394-92 - STARI: A Technique for High-Bandwidth Communication (Thesis) [154] (1993)
    • TR-242-90 - Simple Hardware for Fast Interprocessor Communication [155] (1990)
    • TR-190-88 - Throughput of Long Self-Timed Pipelines [156] (1988)
  • Grigni, Michelangelo
    • TR-350-91 - Ray Shooting in Polygons Using Geodesic Triangulations [157] (1991)
  • Grigoriadis, Michael D.
    • TR-193-88 - Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem [114] (1988)
    • TR-105-87 - A Fast Parametric Maximum Flow Algorithm [34] (1987)
  • Grigoriev, Dima
    • TR-538-96 - Randomized Omega (n^2) Lower Bound for Knapsack [158] (1996)
    • TR-527-96 - A Lower Bound for Randomized Algebraic Decision Trees [159] (1996)
  • Griswold, Ralph E.
    • TR-306-91 - String Processing Languages [160] (1991)
  • Grossman, Robert
    • TR-235-89 - Visibility with a Moving Point of View [161] (1989)
  • Gruetter, Samuel
    • TR-999-17 - Improving the Coq proof automation tactics of the Verified Software Toolchain, based on a case study on verifying a C implementation of the AES encryption algorithm [162] (2017)
  • Guibas, Leonidas
    • TR-350-91 - Ray Shooting in Polygons Using Geodesic Triangulations [157] (1991)
    • TR-334-91 - Computing a Face in an Arrangement of Line Segments and Related Problems [163] (1991)
    • TR-294-90 - Lines in Space: Combinatorics and Algorithms [164] (1990)
    • TR-288-90 - Counting and Cutting Cycles of Lines and Rods in Space [165] (1990)
    • TR-257-90 - Slimming Down by Adding: Selecting Heavily Covered Points [166] (1990)
    • TR-252-90 - Algorithms for Bichromatic Line Segment Problems and Polyhedral Terrains [167] (1990)
    • TR-167-88 - Visibility and Intersection Problems in Plane Geometry [168] (1988)
    • TR-152-88 - An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon [169] (1988)
    • TR-082-87 - The Complexity of Cutting Complexes [170] (1987)
    • TR-039-86 - Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons [171] (1986)
  • Gum, Ben
    • TR-627-00 - Cheaper by the Dozen: Batched Algorithms [172] (2000)
  • Gunopulos, Dimitrios
    • TR-563-95 - Concept Learning with Geometric Hypotheses [173] (1995)
    • TR-562-95 - Computing the Maximum Bichromatic Discrepancy with Applications to Computer Graphics and Machine Learning [174] (1995)
    • TR-481-94 - Concept Learning with Simple Geometric Hypotheses [175] (1994)
    • TR-480-94 - The Maximum Discrepancy of Simple Geometric Ranges [176] (1994)
    • TR-467-94 - Computing the Maximum Bichromatic Discrepancy, with Applications to Computer Graphics and Machine Learning [177] (1994)
    • TR-443-94 - Computing the Rectangle Discrepancy [178] (1994)
  • Guo, Bolei
    • TR-822-08 - Shape Analysis with Inductive Recursion Synthesis (thesis) [179] (2008)
  • Guruswami, Venkatesan
    • TR-848-09 - New Approximation Algorithms for Degree Lower-bounded Arborescences and Max-Min Allocation [180] (2009)

Source URL: https://www.cs.princeton.edu/research/techreps/author_letter/G

Links
[1] https://www.cs.princeton.edu/research/techreps/author_letter/A
[2] https://www.cs.princeton.edu/research/techreps/author_letter/B
[3] https://www.cs.princeton.edu/research/techreps/author_letter/C
[4] https://www.cs.princeton.edu/research/techreps/author_letter/D
[5] https://www.cs.princeton.edu/research/techreps/author_letter/E
[6] https://www.cs.princeton.edu/research/techreps/author_letter/F
[7] https://www.cs.princeton.edu/research/techreps/author_letter/G
[8] https://www.cs.princeton.edu/research/techreps/author_letter/H
[9] https://www.cs.princeton.edu/research/techreps/author_letter/I
[10] https://www.cs.princeton.edu/research/techreps/author_letter/J
[11] https://www.cs.princeton.edu/research/techreps/author_letter/K
[12] https://www.cs.princeton.edu/research/techreps/author_letter/L
[13] https://www.cs.princeton.edu/research/techreps/author_letter/M
[14] https://www.cs.princeton.edu/research/techreps/author_letter/N
[15] https://www.cs.princeton.edu/research/techreps/author_letter/O
[16] https://www.cs.princeton.edu/research/techreps/author_letter/P
[17] https://www.cs.princeton.edu/research/techreps/author_letter/Q
[18] https://www.cs.princeton.edu/research/techreps/author_letter/R
[19] https://www.cs.princeton.edu/research/techreps/author_letter/S
[20] https://www.cs.princeton.edu/research/techreps/author_letter/T
[21] https://www.cs.princeton.edu/research/techreps/author_letter/V
[22] https://www.cs.princeton.edu/research/techreps/author_letter/W
[23] https://www.cs.princeton.edu/research/techreps/author_letter/X
[24] https://www.cs.princeton.edu/research/techreps/author_letter/Y
[25] https://www.cs.princeton.edu/research/techreps/author_letter/Z
[26] https://www.cs.princeton.edu/research/techreps/TR-275-90
[27] https://www.cs.princeton.edu/research/techreps/TR-059-86
[28] https://www.cs.princeton.edu/research/techreps/TR-223-89
[29] https://www.cs.princeton.edu/research/techreps/TR-222-89
[30] https://www.cs.princeton.edu/research/techreps/TR-111-87
[31] https://www.cs.princeton.edu/research/techreps/TR-109-87
[32] https://www.cs.princeton.edu/research/techreps/TR-108-87
[33] https://www.cs.princeton.edu/research/techreps/TR-104-87
[34] https://www.cs.princeton.edu/research/techreps/TR-105-87
[35] https://www.cs.princeton.edu/research/techreps/TR-359-92
[36] https://www.cs.princeton.edu/research/techreps/TR-354-91
[37] https://www.cs.princeton.edu/research/techreps/TR-320-91
[38] https://www.cs.princeton.edu/research/techreps/TR-295-90
[39] https://www.cs.princeton.edu/research/techreps/TR-287-90
[40] https://www.cs.princeton.edu/research/techreps/TR-283-90
[41] https://www.cs.princeton.edu/research/techreps/TR-248-90
[42] https://www.cs.princeton.edu/research/techreps/TR-247-90
[43] https://www.cs.princeton.edu/research/techreps/TR-246-90
[44] https://www.cs.princeton.edu/research/techreps/TR-219-89
[45] https://www.cs.princeton.edu/research/techreps/TR-215-89
[46] https://www.cs.princeton.edu/research/techreps/TR-207-89
[47] https://www.cs.princeton.edu/research/techreps/TR-206-89
[48] https://www.cs.princeton.edu/research/techreps/TR-198-88
[49] https://www.cs.princeton.edu/research/techreps/TR-195-88
[50] https://www.cs.princeton.edu/research/techreps/TR-184-88
[51] https://www.cs.princeton.edu/research/techreps/TR-177-88
[52] https://www.cs.princeton.edu/research/techreps/TR-170-88
[53] https://www.cs.princeton.edu/research/techreps/TR-161-88
[54] https://www.cs.princeton.edu/research/techreps/TR-151-88
[55] https://www.cs.princeton.edu/research/techreps/TR-147-88
[56] https://www.cs.princeton.edu/research/techreps/TR-146-88
[57] https://www.cs.princeton.edu/research/techreps/TR-129-87
[58] https://www.cs.princeton.edu/research/techreps/TR-126-87
[59] https://www.cs.princeton.edu/research/techreps/TR-123-87
[60] https://www.cs.princeton.edu/research/techreps/TR-119-87
[61] https://www.cs.princeton.edu/research/techreps/TR-117-87
[62] https://www.cs.princeton.edu/research/techreps/TR-101-87
[63] https://www.cs.princeton.edu/research/techreps/TR-100-87
[64] https://www.cs.princeton.edu/research/techreps/TR-099-87
[65] https://www.cs.princeton.edu/research/techreps/TR-091-87
[66] https://www.cs.princeton.edu/research/techreps/TR-090-87
[67] https://www.cs.princeton.edu/research/techreps/TR-087-87
[68] https://www.cs.princeton.edu/research/techreps/TR-076-87
[69] https://www.cs.princeton.edu/research/techreps/TR-075-87
[70] https://www.cs.princeton.edu/research/techreps/TR-073-87
[71] https://www.cs.princeton.edu/research/techreps/TR-070-87
[72] https://www.cs.princeton.edu/research/techreps/TR-065-86
[73] https://www.cs.princeton.edu/research/techreps/TR-064-86
[74] https://www.cs.princeton.edu/research/techreps/TR-056-86
[75] https://www.cs.princeton.edu/research/techreps/TR-047-86
[76] https://www.cs.princeton.edu/research/techreps/TR-043-86
[77] https://www.cs.princeton.edu/research/techreps/TR-037-86
[78] https://www.cs.princeton.edu/research/techreps/TR-034-86
[79] https://www.cs.princeton.edu/research/techreps/TR-029-86
[80] https://www.cs.princeton.edu/research/techreps/TR-028-86
[81] https://www.cs.princeton.edu/research/techreps/TR-012-85
[82] https://www.cs.princeton.edu/research/techreps/TR-010-85
[83] https://www.cs.princeton.edu/research/techreps/TR-002-85
[84] https://www.cs.princeton.edu/research/techreps/TR-001-85
[85] https://www.cs.princeton.edu/research/techreps/TR-049-86
[86] https://www.cs.princeton.edu/research/techreps/TR-995-16
[87] https://www.cs.princeton.edu/research/techreps/TR-757-06
[88] https://www.cs.princeton.edu/research/techreps/TR-723-05
[89] https://www.cs.princeton.edu/research/techreps/TR-705-04
[90] https://www.cs.princeton.edu/research/techreps/TR-691-04
[91] https://www.cs.princeton.edu/research/techreps/TR-672-03
[92] https://www.cs.princeton.edu/research/techreps/TR-664-02
[93] https://www.cs.princeton.edu/research/techreps/TR-852-09
[94] https://www.cs.princeton.edu/research/techreps/TR-968-14
[95] https://www.cs.princeton.edu/research/techreps/TR-630-00
[96] https://www.cs.princeton.edu/research/techreps/TR-498-95
[97] https://www.cs.princeton.edu/research/techreps/TR-737-05
[98] https://www.cs.princeton.edu/research/techreps/TR-944-13
[99] https://www.cs.princeton.edu/research/techreps/TR-485-95
[100] https://www.cs.princeton.edu/research/techreps/TR-449-94
[101] https://www.cs.princeton.edu/research/techreps/TR-975-14
[102] https://www.cs.princeton.edu/research/techreps/TR-973-14
[103] https://www.cs.princeton.edu/research/techreps/TR-955-13
[104] https://www.cs.princeton.edu/research/techreps/TR-997-16
[105] https://www.cs.princeton.edu/research/techreps/TR-014-19
[106] https://www.cs.princeton.edu/research/techreps/TR-171-88
[107] https://www.cs.princeton.edu/research/techreps/TR-163-88
[108] https://www.cs.princeton.edu/research/techreps/TR-724-05
[109] https://www.cs.princeton.edu/research/techreps/TR-761-06
[110] https://www.cs.princeton.edu/research/techreps/TR-438-93
[111] https://www.cs.princeton.edu/research/techreps/TR-399-92
[112] https://www.cs.princeton.edu/research/techreps/TR-530-96
[113] https://www.cs.princeton.edu/research/techreps/TR-216-89
[114] https://www.cs.princeton.edu/research/techreps/TR-193-88
[115] https://www.cs.princeton.edu/research/techreps/TR-186-88
[116] https://www.cs.princeton.edu/research/techreps/TR-164-88
[117] https://www.cs.princeton.edu/research/techreps/TR-107-87
[118] https://www.cs.princeton.edu/research/techreps/TR-106-87
[119] https://www.cs.princeton.edu/research/techreps/TR-081-87
[120] https://www.cs.princeton.edu/research/techreps/TR-050-86
[121] https://www.cs.princeton.edu/research/techreps/TR-823-08
[122] https://www.cs.princeton.edu/research/techreps/TR-813-08
[123] https://www.cs.princeton.edu/research/techreps/TR-807-07
[124] https://www.cs.princeton.edu/research/techreps/TR-800-07
[125] https://www.cs.princeton.edu/research/techreps/TR-783-07
[126] https://www.cs.princeton.edu/research/techreps/TR-771-06
[127] https://www.cs.princeton.edu/research/techreps/TR-018-86
[128] https://www.cs.princeton.edu/research/techreps/TR-266-90
[129] https://www.cs.princeton.edu/research/techreps/TR-194-88
[130] https://www.cs.princeton.edu/research/techreps/TR-130-88
[131] https://www.cs.princeton.edu/research/techreps/TR-130-87
[132] https://www.cs.princeton.edu/research/techreps/TR-871-10
[133] https://www.cs.princeton.edu/research/techreps/TR-782-07
[134] https://www.cs.princeton.edu/research/techreps/TR-492-95
[135] https://www.cs.princeton.edu/research/techreps/TR-482-94
[136] https://www.cs.princeton.edu/research/techreps/TR-412-93
[137] https://www.cs.princeton.edu/research/techreps/TR-560-97
[138] https://www.cs.princeton.edu/research/techreps/TR-976-15
[139] https://www.cs.princeton.edu/research/techreps/TR-885-10
[140] https://www.cs.princeton.edu/research/techreps/TR-016-18
[141] https://www.cs.princeton.edu/research/techreps/TR-426-93
[142] https://www.cs.princeton.edu/research/techreps/TR-473-94
[143] https://www.cs.princeton.edu/research/techreps/TR-456-94
[144] https://www.cs.princeton.edu/research/techreps/TR-408-93
[145] https://www.cs.princeton.edu/research/techreps/TR-001-20
[146] https://www.cs.princeton.edu/research/techreps/TR-711-04
[147] https://www.cs.princeton.edu/research/techreps/TR-641-02
[148] https://www.cs.princeton.edu/research/techreps/TR-775-07
[149] https://www.cs.princeton.edu/research/techreps/TR-773-07
[150] https://www.cs.princeton.edu/research/techreps/TR-744-06
[151] https://www.cs.princeton.edu/research/techreps/TR-718-04
[152] https://www.cs.princeton.edu/research/techreps/TR-714-04
[153] https://www.cs.princeton.edu/research/techreps/TR-987-16
[154] https://www.cs.princeton.edu/research/techreps/TR-394-92
[155] https://www.cs.princeton.edu/research/techreps/TR-242-90
[156] https://www.cs.princeton.edu/research/techreps/TR-190-88
[157] https://www.cs.princeton.edu/research/techreps/TR-350-91
[158] https://www.cs.princeton.edu/research/techreps/TR-538-96
[159] https://www.cs.princeton.edu/research/techreps/TR-527-96
[160] https://www.cs.princeton.edu/research/techreps/TR-306-91
[161] https://www.cs.princeton.edu/research/techreps/TR-235-89
[162] https://www.cs.princeton.edu/research/techreps/TR-999-17
[163] https://www.cs.princeton.edu/research/techreps/TR-334-91
[164] https://www.cs.princeton.edu/research/techreps/TR-294-90
[165] https://www.cs.princeton.edu/research/techreps/TR-288-90
[166] https://www.cs.princeton.edu/research/techreps/TR-257-90
[167] https://www.cs.princeton.edu/research/techreps/TR-252-90
[168] https://www.cs.princeton.edu/research/techreps/TR-167-88
[169] https://www.cs.princeton.edu/research/techreps/TR-152-88
[170] https://www.cs.princeton.edu/research/techreps/TR-082-87
[171] https://www.cs.princeton.edu/research/techreps/TR-039-86
[172] https://www.cs.princeton.edu/research/techreps/TR-627-00
[173] https://www.cs.princeton.edu/research/techreps/TR-563-95
[174] https://www.cs.princeton.edu/research/techreps/TR-562-95
[175] https://www.cs.princeton.edu/research/techreps/TR-481-94
[176] https://www.cs.princeton.edu/research/techreps/TR-480-94
[177] https://www.cs.princeton.edu/research/techreps/TR-467-94
[178] https://www.cs.princeton.edu/research/techreps/TR-443-94
[179] https://www.cs.princeton.edu/research/techreps/TR-822-08
[180] https://www.cs.princeton.edu/research/techreps/TR-848-09