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]

  • Caesar, Matthew
    • TR-801-07 - Building Scalable Self-configuring Networks with SEIZE [26] (2007)
  • Cai, Jiazhen
    • TR-309-91 - An <i>O</i>(<i>m</i> log <i>n</i>)-Time Algorithm for the Maximal Planar Subgraph Problem [27] (1991)
  • Cai, Jin-Yi
    • TR-433-93 - Uncheatable Benchmarks Using Numerical Instability [28] (1993)
    • TR-325-91 - Computations Over Infinite Groups [29] (1991)
    • TR-268-90 - More Efficient Bottom-Up Tree Pattern Matching [30] (1990)
    • TR-260-90 - The Polynomial Hierarchy is Provable by Two Provers in One Round [31] (1989)
    • TR-238-89 - Playing Games of Incomplete Information [32] (1989)
    • TR-237-89 - On Bounded Round Multi-Prover Interactive Proof Systems [33] (1989)
  • Cai, Qizhe
    • TR-006-18 - Network-Wide Heavy-Hitter Detection for Real-Time Telemetry [34] (2018)
  • Calamia, Paul T.
    • TR-853-09 - Advances in Edge-Diffraction Modeling for Virtual-Acoustic Simulations (thesis) [35] (2009)
  • Calandrino, Joseph
    • TR-924-12 - Control of Sensitive Data in Systems with Novel Functionality [36] (2012)
  • Calderbank, Robert
    • TR-888-10 - Sparse Approximation and Compressed Sensing Using the Reed-Muller Sieve [37] (2010)
  • Campos, Alvaro E.
    • TR-419-93 - Distributed, Garbage-Collected, Persistent, Virtual Address Spaces (thesis) [38] (1993)
    • TR-349-91 - Distributed EZ [39] (1991)
  • Cao, Fengyun
    • TR-725-05 - Towards Scalable Content-based Publish-Subscribe Networks [40] (2005)
    • TR-692-04 - MEDYM: An Architecture for Content-based Publish-Subscribe Service Networks [41] (2004)
    • TR-684-03 - Approximate Index Routing: A Case for Content-based Peer-to-Peer Routing [42] (2003)
    • TR-682-03 - Scheduling Web Crawl for Better Performance and Quality [43] (2003)
  • Cao, Pei
    • TR-522-96 - Application-Controlled File Caching and Prefetching (Thesis) [44] (1996)
    • TR-502-95 - Integrated Parellel Prefetching and Caching [45] (1995)
    • TR-493-95 - Implementation and Performance of Integrated Application-Controlled Caching, Prefetching and Disk Scheduling [46] (1995)
    • TR-479-94 - A Study of Integrated Prefetching and Caching Strategies [47] (1994)
    • TR-462-94 - Implementation and Performance of Application-Controlled File Caching [48] (1994)
    • TR-445-94 - Application-Controlled File Caching Policies [49] (1994)
  • Cao, Qinxiang
    • TR-014-19 - Compiler Correctness for Concurrency: from concurrent separation logic to shared-memory assembly language [50] (2020)
  • Capotă, Mihai
    • TR-985-16 - Incremental Full Correlation Matrix Analysis for Real-Time fMRI Studies [51] (2016)
  • Capra, Tony
    • TR-855-09 - Algorithms for the Identification of Functional Sites in Proteins (thesis) [52] (2009)
  • Carlisle, Martin C.
    • TR-483-95 - Software Caching and Computation Migration in Olden [53] (1995)
    • TR-447-94 - Supporting Dynamic Data Structures on Distributed Memory Machines [54] (1994)
    • TR-390-92 - Determining Single Connectivity in Directed Graphs [55] (1992)
  • Carlsten, Miles
    • TR-983-16 - The Impact of Transaction Fees on Bitcoin Mining Strategies [56] (2016)
  • Carroll, Melissa
    • TR-894-11 - FMRI "Mind Readers": Sparsity, Spatial Structure, and Reliability (thesis) [57] (2011)
  • Catu, Oana
    • TR-934-12 - Scaffold: Quantum Programming Language [58] (2012)
  • Cesareo, Jacopo
    • TR-927-12 - Optimizing Implicit Proxy Placement to Evade Traffic Filters [59] (2012)
  • Chakrabati, Amlan
    • TR-934-12 - Scaffold: Quantum Programming Language [58] (2012)
  • Chakradhar, Srimat
    • TR-715-04 - Safe Heterogeneous Applications: Curing the Java Native Interface [60] (2004)
  • Chandra, Satish
    • TR-463-94 - Where is Time Spent in Message-Passing and Shared-Memory Programs? [61] (1994)
  • Chaney, Allison
    • TR-989-16 - Computational Methods for Exploring Human Behavior [62] (2016)
  • Chang, Huiwen
    • TR-013-18 - PERSONAL PHOTO ENHANCEMENT [63] (2018)
  • Chao, Liang-Fang
    • TR-432-93 - Static Scheduling for Synthesis of DSP Algorithms on Various Models [64] (1993)
    • TR-430-93 - Scheduling and Behavioral Transformations for Parallel Systems (Thesis) [65] (1993)
    • TR-396-92 - Scheduling Data-Flow Graphs via Retiming and Unfolding [66] (1992)
    • TR-384-92 - Finding All Minimal Shapes in a Routing Channel [67] (1992)
  • Charikar, Moses
    • TR-995-15 - Multi-Commodity Flow with In-Network Processing [68] (2015)
    • TR-848-09 - New Approximation Algorithms for Degree Lower-bounded Arborescences and Max-Min Allocation [69] (2009)
    • TR-760-06 - Analysis of Filtering for Similarity Search Using Sketches [70] (2006)
    • TR-759-06 - A Time-Space Efficient Locality Sensitive Hashing Method for Similarity Search in High Dimensions [71] (2006)
    • TR-719-05 - Proofs of Conjectures in "Aggregating Inconsistent Information: Ranking and Clustering" [72] (2005)
  • Chazelle, Bernard
    • TR-564-95 - Strategies for Polyhedral Surface Decomposition: An Experimental Study [73] (1995)
    • TR-521-96 - Application Challenges to Computational Geometry: CG Impact Task Force Report [74] (1996)
    • TR-413-93 - On Linear-time Deterministic Algorithms for Optimization Problems in Fixed Dimension [75] (1993)
    • TR-407-93 - Quasi-Orthogonality via Finite-Differencing: An Elementary Approach to Geometric Discrepancy [76] (1993)
    • TR-393-92 - On Linear-time Deterministic Algorithms for Optimization Problems in Fixed Dimension [77] (1992)
    • TR-379-92 - The New Jersey Line-Segment-Saw Massacre (Companion to Video) [78] (1992)
    • TR-361-92 - Randomizing an Output-Sensitive Convex Hull Algorithm in Three Dimensions [79] (1992)
    • TR-358-91 - Derandomizing an Output-Sensitive Convex Hull Algorithm in Three Dimensions [80] (1991)
    • TR-350-91 - Ray Shooting in Polygons Using Geodesic Triangulations [81] (1991)
    • TR-336-91 - An Optimal Convex Hull Algorithm for Points Sets in Any Fixed Dimension [82] (1991)
    • TR-335-91 - Cutting Hyperplanes for Divide-and-Conquer [83] (1991)
    • TR-334-91 - Computing a Face in an Arrangement of Line Segments and Related Problems [84] (1991)
    • TR-333-91 - Point Location Among Hyperplanes and Unidirectional Ray-Shooting [85] (1991)
    • TR-294-90 - Lines in Space: Combinatorics and Algorithms [86] (1990)
    • TR-290-90 - Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems [87] (1990)
    • TR-288-90 - Counting and Cutting Cycles of Lines and Rods in Space [88] (1990)
    • TR-264-90 - Triangulating a Simple Polygon in Linear Time [89] (1990)
    • TR-257-90 - Slimming Down by Adding: Selecting Heavily Covered Points [90] (1990)
    • TR-252-90 - Algorithms for Bichromatic Line Segment Problems and Polyhedral Terrains [91] (1990)
    • TR-249-90 - Efficient Polygon Triangulation [92] (1990)
    • TR-227-89 - Triangulating A Nonconvex Polytope [93] (1989)
    • TR-205-89 - An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra [94] (1989)
    • TR-181-88 - A Deterministic View of Random Sampling and its Use in Geometry [95] (1988)
    • TR-167-88 - Visibility and Intersection Problems in Plane Geometry [96] (1988)
    • TR-166-88 - Lower Bounds on the Complexity of Polytope Range Searching [97] (1988)
    • TR-155-88 - Tight Bounds on the Stabbing Number of Spanning Trees in Euclidean Space [98] (1988)
    • TR-148-88 - An Optimal Algorithm for Intersecting Line Segments in the Plane [99] (1988)
    • TR-096-87 - Computing on a Free Tree Via Complexity-Preserving Mappings [100] (1987)
    • TR-095-97 - Some Techniques for Geometric Searching with Implicit Set Representations [101] (1987)
    • TR-095-87 - Some Techniques for Geometric Searching with Implicit Set Representations [102] (1987)
    • TR-082-87 - The Complexity of Cutting Complexes [103] (1987)
    • TR-077-87 - An Algorithm for Segment-Dragging and its Implementation [104] (1987)
    • TR-062-86 - Linear Space Data Structures for Two Types of Range Search [105] (1986)
    • TR-055-86 - Lower Bounds on the Complexity of Multidimensional Searching [106] (1986)
    • TR-025-86 - Intersection of Convex Objects in Two and Three Dimensions [107] (1986)
  • Chen, Han
    • TR-675-03 - Scalable and Ultra-High Resolution MPEG Video Delivery on Tiled Displays (Thesis) [108] (2003)
  • Chen, Jie
    • TR-758-06 - Comparison of Clustering Algorithms and Its Application to Document Clustering (thesis) [109] (2006)
  • Chen, Juan
    • TR-704-04 - A Low-Level Typed Assembly Language with a Machine-Checkable Soundness Proof (Thesis) [110] (2004)
    • TR-635-01 - Dictionary Passing for Polytypic Polymorphism [111] (2001)
  • Chen, Mao
    • TR-708-04 - Using User-Provided Information to Improve Internet Services (Thesis) [112] (2004)
    • TR-621-00 - Query Affinity in Internet Applications [113] (2000)
  • Chen, Peter M.
    • TR-591-99 - Fast Cluster Failover Using Virtual Memory-Mapped Communication [114] (1999)
  • Chen, Xiaobai
    • TR-979-15 - SHAPE ANALYSIS WITH CROWDSOURCED DATA [115] (2014)
  • Chen, Yuqun
    • TR-631-00 - Building a Scalable High-Resolution Display Wall (Thesis) [116] (2000)
    • TR-618-00 - Avoiding Seams On High-Resolution Multi-Projector Displays using An Un-calibrated Camera [117] (2000)
    • TR-612-99 - MimdRAID: Low Latency Secondary Storage [118] (1999)
    • TR-581-98 - Firmware Support for Reliable Communication and Dynamic System Configuration in System Area Networks [119] (1998)
    • TR-580-98 - UTLB: A Mechanism for Address Translation On Network Interfaces [120] (1998)
    • TR-573-98 - VMMC-2: Efficient Support for Reliable, Connection-Oriented Communication [121] (1998)
    • TR-543-97 - CLIP: A Checkpointing Tool for Message-Passing Parallel Programs [122] (1997)
    • TR-525-96 - Reducing Waiting Costs in User-Level Communication [123] (1996)
  • Chiang, Chen-Fu
    • TR-934-12 - Scaffold: Quantum Programming Language [58] (2012)
  • Chiang, Mung
    • TR-998-15 - To Coordinate Or Not To Coordinate? Wide-Area Traffic Management for Data Centers [124] (2012)
    • TR-846-08 - Cooperative Content Distribution and Traffic Engineering in an ISP Network [125] (2008)
    • TR-833-08 - Performance Bounds for Peer-Assisted Live Streaming [126] (2008)
    • TR-788-07 - Rethinking Virtual Network Embedding: Substrate Support for Path Splitting and Migration [127] (2007)
    • TR-774-07 - Rethinking Internet Traffic Management: From Multiple Decompositions to a Practical Protocol [128] (2007)
    • TR-770-06 - Design Principles of Manageable Networks [129] (2006)
  • Chlamtac, Eden
    • TR-843-08 - Non-Local Analysis of SDP-Based Approximation Algorithms (thesis) [130] (2008)
  • Chong, Fred
    • TR-934-12 - Scaffold: Quantum Programming Language [58] (2012)
  • Clark, David D.
    • TR-600-99 - Explicit Allocation of Best Effort Packet Delivery Service [131] (1999)
  • Clark, Douglas W.
    • TR-618-00 - Avoiding Seams On High-Resolution Multi-Projector Displays using An Un-calibrated Camera [117] (2000)
    • TR-606-99 - Alloyed Global and Local Branch History: A Robust Solution to Wrong-History Misprediction [132] (1999)
    • TR-596-99 - SurfBoard - A Hardware Performance Monitor for SHRIMP [133] (1999)
    • TR-595-99 - Selecting a Single, Representative Sample for Accurate Simulation of SPECint Benchmarks [134] (1999)
    • TR-594-99 - Alloying Global and Local Branch History: Taxonomy, Performance, and Analysis [135] (1999)
    • TR-590-99 - Thread Scheduling for Out-of-Core Applications with Memory Server on Multicomputers [136] (1999)
    • TR-589-98 - Speculative Updates of Local and Global Branch History: A Quantitative Analysis [137] (1998)
    • TR-578-98 - Branch Prediction, Instruction-Window Size, and Cache Size: Performance Tradeoffs and Sampling Techniques [138] (1998)
    • TR-577-98 - Improving Prediction for Procedure Returns with Return-Address-Stack Repair Mechanisms [139] (1998)
    • TR-510-96 - Early Experience with Message-Passing on the SHRIMP Multicomputer [140] (1996)
  • Clarkson, Kenneth L.
    • TR-318-91 - Randomized Parallel Algorithms for Trapezoidal Diagrams [141] (1991)
    • TR-157-88 - A Fast Las Vegas Algorithm for Triangulating a Simple Polygon [142] (1988)
    • TR-132-88 - A Fast Las Vegas Algorithm for Triangulating a Simple Polygon [143] (1988)
  • Clarkson, Will
    • TR-921-12 - Breaking Assumptions: Distinguishing Between Seemingly Identical Items Using Cheap Sensors [144] (2012)
  • Clifton, Christopher W.
    • TR-323-91 - Hyperfile, A Database Manager for Documents (Thesis) [145] (1991)
    • TR-295-90 - Distributed Processing of Filtering Queries in HyperFile [146] (1990)
    • TR-219-89 - Telematics Research at Princeton - 1988 [147] (1989)
    • TR-206-89 - Indexing in a Hypertext Database [148] (1989)
    • TR-177-88 - The Design of a Document Database [149] (1988)
  • Cohen, Jonathan
    • TR-985-16 - Incremental Full Correlation Matrix Analysis for Real-Time fMRI Studies [51] (2016)
  • Cohen, Michael F.
    • TR-637-01 - Video Cubism [150] (2001)
    • TR-456-94 - Variational Modeling with Wavelets [151] (1994)
    • TR-408-93 - Radiosity and Relaxation Methods: Progressive Refinement is Southwell Relaxation [152] (1993)
  • Cohen, Michael S.
    • TR-791-07 - Finding Speed Bumps: Web Server Performance Analysis and Anomaly Detection via Wide-Spectrum Microbenchmarking [153] (2007)
  • Cohn, Steve
    • TR-272-90 - Data Sharing in a Large Heterogeneous Environment [154] (1990)
  • Colburn, R. Alex
    • TR-637-01 - Video Cubism [150] (2001)
  • Cole, Forrester
    • TR-856-09 - Line Drawings of 3D Shapes (thesis) [155] (2009)
  • Cole, Richard
    • TR-457-94 - A Linear-Work Parallel Algorithm for Finding Minimum Spanning Trees [156] (1994)
    • TR-318-91 - Randomized Parallel Algorithms for Trapezoidal Diagrams [141] (1991)
  • Comandur, Seshadhri
    • TR-838-08 - Sublinear Distributed Reconstruction (thesis) [157] (2008)
  • Condon, Anne
    • TR-238-89 - Playing Games of Incomplete Information [32] (1989)
    • TR-237-89 - On Bounded Round Multi-Prover Interactive Proof Systems [33] (1989)
  • Cordon, Ricardo
    • TR-029-86 - Distributed Computing Research at Princeton - 1985 [158] (1986)
    • TR-009-85 - Using Semantic Knowledge for Transaction Processing (Thesis) [159] (1985)
  • Correa, Wagner T.
    • TR-653-02 - iWalk: Interactive Out-Of-Core Rendering of Large Models [160] (2002)
  • Courcoubetis, Costas
    • TR-110-87 - Distributed Reachability Analysis for Protocol Verification Environments [161] (1987)
  • Cova, Luis L.
    • TR-282-90 - Resource Management in Federated Computing Environments (thesis) [162] (1990)
    • TR-234-89 - Augmenting Availability in Distributed File Systems [163] (1989)
    • TR-219-89 - Telematics Research at Princeton - 1988 [147] (1989)
    • TR-214-89 - FACE: Enhancing Distributed File Systems for Autonomous Computing Environments [164] (1989)
    • TR-200-88 - Distributing Workload Among Independently Owned Processors [165] (1988)
    • TR-165-88 - Load Balancing in Two Types of Computational Environments [166] (1988)
    • TR-151-88 - Telematics Research at Princeton - 1987 [167] (1988)
    • TR-120-87 - Sharing Jobs Among Independently Owned Processors [168] (1987)
    • TR-073-87 - Distributed Computing Research at Princeton - 1986 [169] (1987)
  • Cox, Michael
    • TR-427-93 - Evenly Distributed Depth is the Worst for Distributed Snooping [170] (1993)
    • TR-382-92 - Depth Complexity in Object-Parallel Graphics Architectures [171] (1992)
  • Craver, Scott A.
    • TR-657-02 - Reading Between the Lines: Lessons from the SDMI Challenge [172] (2002)
  • Cuellar, Santiago
    • TR-014-19 - Compiler Correctness for Concurrency: from concurrent separation logic to shared-memory assembly language [50] (2020)
    • TR-002-20 - Concurrent Permission Machine for modular proofs of optimizing compilers with shared memory concurrency [173] (2020)

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

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-801-07
[27] https://www.cs.princeton.edu/research/techreps/TR-309-91
[28] https://www.cs.princeton.edu/research/techreps/TR-433-93
[29] https://www.cs.princeton.edu/research/techreps/TR-325-91
[30] https://www.cs.princeton.edu/research/techreps/TR-268-90
[31] https://www.cs.princeton.edu/research/techreps/TR-260-90
[32] https://www.cs.princeton.edu/research/techreps/TR-238-89
[33] https://www.cs.princeton.edu/research/techreps/TR-237-89
[34] https://www.cs.princeton.edu/research/techreps/TR-006-18
[35] https://www.cs.princeton.edu/research/techreps/TR-853-09
[36] https://www.cs.princeton.edu/research/techreps/TR-924-12
[37] https://www.cs.princeton.edu/research/techreps/TR-888-10
[38] https://www.cs.princeton.edu/research/techreps/TR-419-93
[39] https://www.cs.princeton.edu/research/techreps/TR-349-91
[40] https://www.cs.princeton.edu/research/techreps/TR-725-05
[41] https://www.cs.princeton.edu/research/techreps/TR-692-04
[42] https://www.cs.princeton.edu/research/techreps/TR-684-03
[43] https://www.cs.princeton.edu/research/techreps/TR-682-03
[44] https://www.cs.princeton.edu/research/techreps/TR-522-96
[45] https://www.cs.princeton.edu/research/techreps/TR-502-95
[46] https://www.cs.princeton.edu/research/techreps/TR-493-95
[47] https://www.cs.princeton.edu/research/techreps/TR-479-94
[48] https://www.cs.princeton.edu/research/techreps/TR-462-94
[49] https://www.cs.princeton.edu/research/techreps/TR-445-94
[50] https://www.cs.princeton.edu/research/techreps/TR-014-19
[51] https://www.cs.princeton.edu/research/techreps/TR-985-16
[52] https://www.cs.princeton.edu/research/techreps/TR-855-09
[53] https://www.cs.princeton.edu/research/techreps/TR-483-95
[54] https://www.cs.princeton.edu/research/techreps/TR-447-94
[55] https://www.cs.princeton.edu/research/techreps/TR-390-92
[56] https://www.cs.princeton.edu/research/techreps/TR-983-16
[57] https://www.cs.princeton.edu/research/techreps/TR-894-11
[58] https://www.cs.princeton.edu/research/techreps/TR-934-12
[59] https://www.cs.princeton.edu/research/techreps/TR-927-12
[60] https://www.cs.princeton.edu/research/techreps/TR-715-04
[61] https://www.cs.princeton.edu/research/techreps/TR-463-94
[62] https://www.cs.princeton.edu/research/techreps/TR-989-16
[63] https://www.cs.princeton.edu/research/techreps/TR-013-18
[64] https://www.cs.princeton.edu/research/techreps/TR-432-93
[65] https://www.cs.princeton.edu/research/techreps/TR-430-93
[66] https://www.cs.princeton.edu/research/techreps/TR-396-92
[67] https://www.cs.princeton.edu/research/techreps/TR-384-92
[68] https://www.cs.princeton.edu/research/techreps/TR-995-15
[69] https://www.cs.princeton.edu/research/techreps/TR-848-09
[70] https://www.cs.princeton.edu/research/techreps/TR-760-06
[71] https://www.cs.princeton.edu/research/techreps/TR-759-06
[72] https://www.cs.princeton.edu/research/techreps/TR-719-05
[73] https://www.cs.princeton.edu/research/techreps/TR-564-95
[74] https://www.cs.princeton.edu/research/techreps/TR-521-96
[75] https://www.cs.princeton.edu/research/techreps/TR-413-93
[76] https://www.cs.princeton.edu/research/techreps/TR-407-93
[77] https://www.cs.princeton.edu/research/techreps/TR-393-92
[78] https://www.cs.princeton.edu/research/techreps/TR-379-92
[79] https://www.cs.princeton.edu/research/techreps/TR-361-92
[80] https://www.cs.princeton.edu/research/techreps/TR-358-91
[81] https://www.cs.princeton.edu/research/techreps/TR-350-91
[82] https://www.cs.princeton.edu/research/techreps/TR-336-91
[83] https://www.cs.princeton.edu/research/techreps/TR-335-91
[84] https://www.cs.princeton.edu/research/techreps/TR-334-91
[85] https://www.cs.princeton.edu/research/techreps/TR-333-91
[86] https://www.cs.princeton.edu/research/techreps/TR-294-90
[87] https://www.cs.princeton.edu/research/techreps/TR-290-90
[88] https://www.cs.princeton.edu/research/techreps/TR-288-90
[89] https://www.cs.princeton.edu/research/techreps/TR-264-90
[90] https://www.cs.princeton.edu/research/techreps/TR-257-90
[91] https://www.cs.princeton.edu/research/techreps/TR-252-90
[92] https://www.cs.princeton.edu/research/techreps/TR-249-90
[93] https://www.cs.princeton.edu/research/techreps/TR-227-89
[94] https://www.cs.princeton.edu/research/techreps/TR-205-89
[95] https://www.cs.princeton.edu/research/techreps/TR-181-88
[96] https://www.cs.princeton.edu/research/techreps/TR-167-88
[97] https://www.cs.princeton.edu/research/techreps/TR-166-88
[98] https://www.cs.princeton.edu/research/techreps/TR-155-88
[99] https://www.cs.princeton.edu/research/techreps/TR-148-88
[100] https://www.cs.princeton.edu/research/techreps/TR-096-87
[101] https://www.cs.princeton.edu/research/techreps/TR-095-97
[102] https://www.cs.princeton.edu/research/techreps/TR-095-87
[103] https://www.cs.princeton.edu/research/techreps/TR-082-87
[104] https://www.cs.princeton.edu/research/techreps/TR-077-87
[105] https://www.cs.princeton.edu/research/techreps/TR-062-86
[106] https://www.cs.princeton.edu/research/techreps/TR-055-86
[107] https://www.cs.princeton.edu/research/techreps/TR-025-86
[108] https://www.cs.princeton.edu/research/techreps/TR-675-03
[109] https://www.cs.princeton.edu/research/techreps/TR-758-06
[110] https://www.cs.princeton.edu/research/techreps/TR-704-04
[111] https://www.cs.princeton.edu/research/techreps/TR-635-01
[112] https://www.cs.princeton.edu/research/techreps/TR-708-04
[113] https://www.cs.princeton.edu/research/techreps/TR-621-00
[114] https://www.cs.princeton.edu/research/techreps/TR-591-99
[115] https://www.cs.princeton.edu/research/techreps/TR-979-15
[116] https://www.cs.princeton.edu/research/techreps/TR-631-00
[117] https://www.cs.princeton.edu/research/techreps/TR-618-00
[118] https://www.cs.princeton.edu/research/techreps/TR-612-99
[119] https://www.cs.princeton.edu/research/techreps/TR-581-98
[120] https://www.cs.princeton.edu/research/techreps/TR-580-98
[121] https://www.cs.princeton.edu/research/techreps/TR-573-98
[122] https://www.cs.princeton.edu/research/techreps/TR-543-97
[123] https://www.cs.princeton.edu/research/techreps/TR-525-96
[124] https://www.cs.princeton.edu/research/techreps/TR-998-15
[125] https://www.cs.princeton.edu/research/techreps/TR-846-08
[126] https://www.cs.princeton.edu/research/techreps/TR-833-08
[127] https://www.cs.princeton.edu/research/techreps/TR-788-07
[128] https://www.cs.princeton.edu/research/techreps/TR-774-07
[129] https://www.cs.princeton.edu/research/techreps/TR-770-06
[130] https://www.cs.princeton.edu/research/techreps/TR-843-08
[131] https://www.cs.princeton.edu/research/techreps/TR-600-99
[132] https://www.cs.princeton.edu/research/techreps/TR-606-99
[133] https://www.cs.princeton.edu/research/techreps/TR-596-99
[134] https://www.cs.princeton.edu/research/techreps/TR-595-99
[135] https://www.cs.princeton.edu/research/techreps/TR-594-99
[136] https://www.cs.princeton.edu/research/techreps/TR-590-99
[137] https://www.cs.princeton.edu/research/techreps/TR-589-98
[138] https://www.cs.princeton.edu/research/techreps/TR-578-98
[139] https://www.cs.princeton.edu/research/techreps/TR-577-98
[140] https://www.cs.princeton.edu/research/techreps/TR-510-96
[141] https://www.cs.princeton.edu/research/techreps/TR-318-91
[142] https://www.cs.princeton.edu/research/techreps/TR-157-88
[143] https://www.cs.princeton.edu/research/techreps/TR-132-88
[144] https://www.cs.princeton.edu/research/techreps/TR-921-12
[145] https://www.cs.princeton.edu/research/techreps/TR-323-91
[146] https://www.cs.princeton.edu/research/techreps/TR-295-90
[147] https://www.cs.princeton.edu/research/techreps/TR-219-89
[148] https://www.cs.princeton.edu/research/techreps/TR-206-89
[149] https://www.cs.princeton.edu/research/techreps/TR-177-88
[150] https://www.cs.princeton.edu/research/techreps/TR-637-01
[151] https://www.cs.princeton.edu/research/techreps/TR-456-94
[152] https://www.cs.princeton.edu/research/techreps/TR-408-93
[153] https://www.cs.princeton.edu/research/techreps/TR-791-07
[154] https://www.cs.princeton.edu/research/techreps/TR-272-90
[155] https://www.cs.princeton.edu/research/techreps/TR-856-09
[156] https://www.cs.princeton.edu/research/techreps/TR-457-94
[157] https://www.cs.princeton.edu/research/techreps/TR-838-08
[158] https://www.cs.princeton.edu/research/techreps/TR-029-86
[159] https://www.cs.princeton.edu/research/techreps/TR-009-85
[160] https://www.cs.princeton.edu/research/techreps/TR-653-02
[161] https://www.cs.princeton.edu/research/techreps/TR-110-87
[162] https://www.cs.princeton.edu/research/techreps/TR-282-90
[163] https://www.cs.princeton.edu/research/techreps/TR-234-89
[164] https://www.cs.princeton.edu/research/techreps/TR-214-89
[165] https://www.cs.princeton.edu/research/techreps/TR-200-88
[166] https://www.cs.princeton.edu/research/techreps/TR-165-88
[167] https://www.cs.princeton.edu/research/techreps/TR-151-88
[168] https://www.cs.princeton.edu/research/techreps/TR-120-87
[169] https://www.cs.princeton.edu/research/techreps/TR-073-87
[170] https://www.cs.princeton.edu/research/techreps/TR-427-93
[171] https://www.cs.princeton.edu/research/techreps/TR-382-92
[172] https://www.cs.princeton.edu/research/techreps/TR-657-02
[173] https://www.cs.princeton.edu/research/techreps/TR-002-20