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]

  • TR-597-99 - New Heap Data Structures [26] (1999)
    Authors: Kaplan, Haim [27] / Tarjan, Robert E. [28]
  • TR-585-98 - Resistance of Digital Watermarks to Collusive Attacks [29] (1998)
    Authors: Kilian, Joe [30] / Leighton, Tom [31] / Matheson, Lesley R. [32] / Shamoon, Talal G. [33] / Tarjan, Robert E. [28] / Zane, Francis [34]
  • TR-584-98 - Strictly Functional, Real-Time Deques with Catenation [35] (1998)
    Authors: Kaplan, Haim [27] / Tarjan, Robert E. [28]
  • TR-530-96 - Expected Performance of Dijkstra's Shortest Path Algorithm [36] (1996)
    Authors: Goldberg, Andrew V. [37] / Tarjan, Robert E. [28]
  • TR-511-96 - Purely Functional Representations of Catenable Sorted Lists [38] (1996)
    Authors: Kaplan, Haim [27] / Tarjan, Robert E. [28]
  • TR-503-95 - Dynamic Trees as Search Trees via Euler Tours, Applied to the Network Simplex Algorithm [39] (1995)
    Authors: Tarjan, Robert E. [28]
  • TR-461-94 - Dominating Sets in Planar Graphs [40] (1994)
    Authors: Matheson, Lesley R. [32] / Tarjan, Robert E. [28]
  • TR-457-94 - A Linear-Work Parallel Algorithm for Finding Minimum Spanning Trees [41] (1994)
    Authors: Cole, Richard [42] / Klein, Philip N. [43] / Tarjan, Robert E. [28]
  • TR-448-94 - A Critical Analysis of Multigrid Methods on Massively Parallel Computers [44] (1994)
    Authors: Matheson, Lesley R. [32] / Tarjan, Robert E. [28]
  • TR-436-93 - A Randomized Linear-Time Algorithm for Finding Minimum Spanning Trees [45] (1993)
    Authors: Klein, Philip N. [43] / Tarjan, Robert E. [28]
  • TR-422-93 - Lazy Structure Sharing for Query Optimization [46] (1993)
    Authors: Buchsbaum, Adam L. [47] / Sundar, Rajamani [48] / Tarjan, Robert E. [28]
  • TR-420-93 - Confluently Persistent Deques via Data-Structural Bootstrapping [49] (1993)
    Authors: Buchsbaum, Adam L. [47] / Tarjan, Robert E. [28]
  • TR-381-92 - Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues [50] (1992)
    Authors: Buchsbaum, Adam L. [47] / Sundar, Rajamani [48] / Tarjan, Robert E. [28]
  • TR-356-91 - Computing Minimal Spanning Subgraphs in Linear Time [51] (1991)
    Authors: Han, Xiafeng [52] / Kelsen, Pierre [53] / Ramachandran, Vijaya [54] / Tarjan, Robert E. [28]
  • TR-338-91 - Improved Algorithms for Bipartite Network Flow [55] (1991)
    Authors: Ahuja, Ravindra K. [56] / Orlin, James B. [57] / Stein, Clifford [58] / Tarjan, Robert E. [28]
  • TR-327-91 - Polygon Triangulation in $O(N^log^log^N)$ Time with Simple Data Structures [59] (1991)
    Authors: Kirkpatrick, David G. [60] / Klawe, Maria M. [61] / Tarjan, Robert E. [28]
  • TR-318-91 - Randomized Parallel Algorithms for Trapezoidal Diagrams [62] (1991)
    Authors: Clarkson, Kenneth L. [63] / Cole, Richard [42] / Tarjan, Robert E. [28]
  • TR-311-91 - Efficient Maximum Flow Algorithms [64] (1991)
    Authors: Tarjan, Robert E. [28]
  • TR-310-91 - Dynamic Perfect Hashing: Upper and Lower Bounds [65] (1991)
    Authors: Dietzfelbinger, Martin [66] / Karlin, Anna R. [67] / Mehlhorn, Kurt [68] / Meyer auf der Heide, Friedhelm [69] / Rohnert, Hans [70] / Tarjan, Robert E. [28]
  • TR-309-91 - An <i>O</i>(<i>m</i> log <i>n</i>)-Time Algorithm for the Maximal Planar Subgraph Problem [71] (1991)
    Authors: Cai, Jiazhen [72] / Han, Xiafeng [52] / Tarjan, Robert E. [28]
  • TR-301-91 - A Linear-Time Algorithm for Finding an Ambitus [73] (1991)
    Authors: Mishra, B. [74] / Tarjan, Robert E. [28]
  • TR-299-90 - Fully Persistent Lists with Catenation [75] (1990)
    Authors: Driscoll, James R. [76] / Sleator, Daniel D. [77] / Tarjan, Robert E. [28]
  • TR-289-90 - Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time [78] (1990)
    Authors: Dixon, Brandon [79] / Rauch, Monika [80] / Tarjan, Robert E. [28]
  • TR-268-90 - More Efficient Bottom-Up Tree Pattern Matching [81] (1990)
    Authors: Cai, Jin-Yi [82] / Paige, R. [83] / Tarjan, Robert E. [28]
  • TR-267-90 - Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences [84] (1989)
    Authors: Sundar, Rajamani [48] / Tarjan, Robert E. [28]
  • TR-265-90 - Short Encodings of Evolving Structures [85] (1990)
    Authors: Sleator, Daniel D. [77] / Tarjan, Robert E. [28] / Thurston, William P. [86]
  • TR-243-90 - Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph [87] (1990)
    Authors: Eppstein, David [88] / Italiano, Guiseppe F. [89] / Tamassia, Roberto [90] / Tarjan, Robert E. [28] / Westbrook, Jeffrey [91] / Yung, Moti [92]
  • TR-228-89 - Maintaining Bridge-Connected and Biconnected Components Online [93] (1989)
    Authors: Westbrook, Jeffrey [91] / Tarjan, Robert E. [28]
  • TR-223-89 - Almost-Optimum Parallel Speed-ups of Algorithms for Bipartite Matching and Related Problems [94] (1989)
    Authors: Gabow, Harold N. [95] / Tarjan, Robert E. [28]
  • TR-222-89 - Faster Scaling Algorithms for General Graph Matching Problems [96] (1989)
    Authors: Gabow, Harold N. [95] / Tarjan, Robert E. [28]
  • TR-216-89 - Network Flow Algorithms [97] (1989)
    Authors: Goldberg, Andrew V. [37] / Tardos, Eva [98] / Tarjan, Robert E. [28]
  • TR-193-88 - Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem [99] (1988)
    Authors: Goldberg, Andrew V. [37] / Grigoriadis, Michael D. [100] / Tarjan, Robert E. [28]
  • TR-189-88 - Simplified Linear-Time Jordan Sorting and Polygon Clipping [101] (1988)
    Authors: Fung, Khun Yee [102] / Nicholl, Tina M. [103] / Tarjan, Robert E. [28] / Van Wyk, Christopher J. [104]
  • TR-187-88 - Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem [105] (1988)
    Authors: Tarjan, Robert E. [28]
  • TR-186-88 - A Parallel Algorithm for Finding A Blocking Flow in an Acyclic Network [106] (1988)
    Authors: Goldberg, Andrew V. [37] / Tarjan, Robert E. [28]
  • TR-171-88 - Transitive Reduction in Parallel Via Branchings [107] (1988)
    Authors: Gibbons, Phillip [108] / Karp, Richard M. [109] / Ramachandran, Vijaya [54] / Soroker, Danny [110] / Tarjan, Robert E. [28]
  • TR-164-88 - Finding Minimum-Cost Flows by Double Scaling [111] (1988)
    Authors: Ahuja, Ravindra K. [56] / Goldberg, Andrew V. [37] / Orlin, James B. [57] / Tarjan, Robert E. [28]
  • TR-163-88 - A Tight Amortized Bound for Path Reversal [112] (1988)
    Authors: Ginat, David [113] / Sleator, Daniel D. [77] / Tarjan, Robert E. [28]
  • TR-157-88 - A Fast Las Vegas Algorithm for Triangulating a Simple Polygon [114] (1988)
    Authors: Clarkson, Kenneth L. [63] / Tarjan, Robert E. [28] / Van Wyk, Christopher J. [104]
  • TR-154-88 - Faster Algorithms for the Shortest Path Problem [115] (1988)
    Authors: Ahuja, Ravindra K. [56] / Mehlhorn, Kurt [68] / Orlin, James B. [57] / Tarjan, Robert E. [28]
  • TR-132-88 - A Fast Las Vegas Algorithm for Triangulating a Simple Polygon [116] (1988)
    Authors: Clarkson, Kenneth L. [63] / Tarjan, Robert E. [28] / Van Wyk, Christopher J. [104]
  • TR-131-88 - Rotation Distance, Triangulations and Hyperbolic Geometry [117] (1988)
    Authors: Sleator, Daniel D. [77] / Tarjan, Robert E. [28] / Thurston, William P. [86]
  • TR-118-87 - Improved Time Bounds for the Maximum Flow Problem [118] (1987)
    Authors: Ahuja, Ravindra K. [56] / Orlin, James B. [57] / Tarjan, Robert E. [28]
  • TR-111-87 - Faster Scaling Algorithms for Network Problems [119] (1987)
    Authors: Gabow, Harold N. [95] / Tarjan, Robert E. [28]
  • TR-109-87 - Relaxed Heaps: An Alternative to Fibronacci Heaps [120] (1987)
    Authors: Driscoll, James R. [76] / Gabow, Harold N. [95] / Shrairman, Ruth [121] / Tarjan, Robert E. [28]
  • TR-108-87 - A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest [122] (1987)
    Authors: Gabow, Harold N. [95] / Tarjan, Robert E. [28]
  • TR-107-87 - Finding Minimum-Cost Circulations by Canceling Negative Cycles [123] (1987)
    Authors: Goldberg, Andrew V. [37] / Tarjan, Robert E. [28]
  • TR-106-87 - Finding Minimum-Cost Circulations by Successive Approximation [124] (1987)
    Authors: Goldberg, Andrew V. [37] / Tarjan, Robert E. [28]
  • TR-105-87 - A Fast Parametric Maximum Flow Algorithm [125] (1987)
    Authors: Gallo, Girogio [126] / Grigoriadis, Michael D. [100] / Tarjan, Robert E. [28]
  • TR-104-87 - Algorithms for Two Bottleneck Optimization Problems [127] (1987)
    Authors: Gabow, Harold N. [95] / Tarjan, Robert E. [28]
  • TR-103-87 - Amortized Analysis of Algorithms for Set Union with Backtracking [128] (1987)
    Authors: Westbrook, Jeffrey [91] / Tarjan, Robert E. [28]
  • TR-081-87 - Solving Minimum-Cost Flow Problems by Successive Approximation [129] (1987)
    Authors: Goldberg, Andrew V. [37] / Tarjan, Robert E. [28]
  • TR-069-86 - Designing Algorithms [130] (1986)
    Authors: Tarjan, Robert E. [28]
  • TR-052-86 - An O(n log log n)-Time Algorithm for Triangulating Simple Polygons [131] (1986)
    Authors: Tarjan, Robert E. [28] / Van Wyk, Christopher J. [104]
  • TR-050-86 - A New Approach to the Maximum Flow Problem [132] (1986)
    Authors: Goldberg, Andrew V. [37] / Tarjan, Robert E. [28]
  • TR-049-86 - One-Processor Scheduling of Tasks with Preferred Starting Times [133] (1986)
    Authors: Garey, Michael R. [134] / Tarjan, Robert E. [28] / Wilfong, Gordon T. [135]
  • TR-039-86 - Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons [136] (1986)
    Authors: Guibas, Leonidas [137] / Hershberger, John [138] / Leven, Daniel [139] / Sharir, Micha [140] / Tarjan, Robert E. [28]
  • TR-038-86 - Three Partition Refinement Algorithms [141] (1986)
    Authors: Paige, Robert [142] / Tarjan, Robert E. [28]
  • TR-013-85 - Two Streamlined Depth-First Search Algorithms [143] (1985)
    Authors: Tarjan, Robert E. [28]
  • TR-008-85 - The Pairing Heap: A New Form of Self-Adjusting Heap [144] (1985)
    Authors: Fredman, Michael L. [145] / Sedgewick, Robert [146] / Sleator, Daniel D. [77] / Tarjan, Robert E. [28]
  • TR-007-85 - Rectilinear Planar Layouts of Planar Graphs and Bipolar Orientations [147] (1985)
    Authors: Rosenstiehl, Pierre [148] / Tarjan, Robert E. [28]
  • TR-006-85 - Efficient Top-Down Updating of Red-Black Trees [149] (1985)
    Authors: Tarjan, Robert E. [28]
  • TR-005-85 - Planar Point Location Using Persistent Search Trees [150] (1985)
    Authors: Sarnak, Neil [151] / Tarjan, Robert E. [28]
  • TR-004-85 - A Locally Adaptive Data Compression Scheme [152] (1985)
    Authors: Bentley, Jon Louis [153] / Sleator, Daniel D. [77] / Tarjan, Robert E. [28] / Wei, Victor K. [154]
  • TR-003-85 - Rotation Distance [155] (1985)
    Authors: Sleator, Daniel D. [77] / Tarjan, Robert E. [28] / Thurston, William P. [86]

Source URL: https://www.cs.princeton.edu/research/techreps/author/384

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-597-99
[27] https://www.cs.princeton.edu/research/techreps/author/311
[28] https://www.cs.princeton.edu/research/techreps/author/384
[29] https://www.cs.princeton.edu/research/techreps/TR-585-98
[30] https://www.cs.princeton.edu/research/techreps/author/98
[31] https://www.cs.princeton.edu/research/techreps/author/436
[32] https://www.cs.princeton.edu/research/techreps/author/322
[33] https://www.cs.princeton.edu/research/techreps/author/196
[34] https://www.cs.princeton.edu/research/techreps/author/253
[35] https://www.cs.princeton.edu/research/techreps/TR-584-98
[36] https://www.cs.princeton.edu/research/techreps/TR-530-96
[37] https://www.cs.princeton.edu/research/techreps/author/412
[38] https://www.cs.princeton.edu/research/techreps/TR-511-96
[39] https://www.cs.princeton.edu/research/techreps/TR-503-95
[40] https://www.cs.princeton.edu/research/techreps/TR-461-94
[41] https://www.cs.princeton.edu/research/techreps/TR-457-94
[42] https://www.cs.princeton.edu/research/techreps/author/397
[43] https://www.cs.princeton.edu/research/techreps/author/431
[44] https://www.cs.princeton.edu/research/techreps/TR-448-94
[45] https://www.cs.princeton.edu/research/techreps/TR-436-93
[46] https://www.cs.princeton.edu/research/techreps/TR-422-93
[47] https://www.cs.princeton.edu/research/techreps/author/275
[48] https://www.cs.princeton.edu/research/techreps/author/468
[49] https://www.cs.princeton.edu/research/techreps/TR-420-93
[50] https://www.cs.princeton.edu/research/techreps/TR-381-92
[51] https://www.cs.princeton.edu/research/techreps/TR-356-91
[52] https://www.cs.princeton.edu/research/techreps/author/420
[53] https://www.cs.princeton.edu/research/techreps/author/96
[54] https://www.cs.princeton.edu/research/techreps/author/167
[55] https://www.cs.princeton.edu/research/techreps/TR-338-91
[56] https://www.cs.princeton.edu/research/techreps/author/4
[57] https://www.cs.princeton.edu/research/techreps/author/152
[58] https://www.cs.princeton.edu/research/techreps/author/210
[59] https://www.cs.princeton.edu/research/techreps/TR-327-91
[60] https://www.cs.princeton.edu/research/techreps/author/101
[61] https://www.cs.princeton.edu/research/techreps/author/102
[62] https://www.cs.princeton.edu/research/techreps/TR-318-91
[63] https://www.cs.princeton.edu/research/techreps/author/24
[64] https://www.cs.princeton.edu/research/techreps/TR-311-91
[65] https://www.cs.princeton.edu/research/techreps/TR-310-91
[66] https://www.cs.princeton.edu/research/techreps/author/33
[67] https://www.cs.princeton.edu/research/techreps/author/428
[68] https://www.cs.princeton.edu/research/techreps/author/136
[69] https://www.cs.princeton.edu/research/techreps/author/443
[70] https://www.cs.princeton.edu/research/techreps/author/177
[71] https://www.cs.princeton.edu/research/techreps/TR-309-91
[72] https://www.cs.princeton.edu/research/techreps/author/17
[73] https://www.cs.princeton.edu/research/techreps/TR-301-91
[74] https://www.cs.princeton.edu/research/techreps/author/139
[75] https://www.cs.princeton.edu/research/techreps/TR-299-90
[76] https://www.cs.princeton.edu/research/techreps/author/665
[77] https://www.cs.princeton.edu/research/techreps/author/465
[78] https://www.cs.princeton.edu/research/techreps/TR-289-90
[79] https://www.cs.princeton.edu/research/techreps/author/34
[80] https://www.cs.princeton.edu/research/techreps/author/172
[81] https://www.cs.princeton.edu/research/techreps/TR-268-90
[82] https://www.cs.princeton.edu/research/techreps/author/276
[83] https://www.cs.princeton.edu/research/techreps/author/705
[84] https://www.cs.princeton.edu/research/techreps/TR-267-90
[85] https://www.cs.princeton.edu/research/techreps/TR-265-90
[86] https://www.cs.princeton.edu/research/techreps/author/474
[87] https://www.cs.princeton.edu/research/techreps/TR-243-90
[88] https://www.cs.princeton.edu/research/techreps/author/40
[89] https://www.cs.princeton.edu/research/techreps/author/684
[90] https://www.cs.princeton.edu/research/techreps/author/728
[91] https://www.cs.princeton.edu/research/techreps/author/589
[92] https://www.cs.princeton.edu/research/techreps/author/738
[93] https://www.cs.princeton.edu/research/techreps/TR-228-89
[94] https://www.cs.princeton.edu/research/techreps/TR-223-89
[95] https://www.cs.princeton.edu/research/techreps/author/670
[96] https://www.cs.princeton.edu/research/techreps/TR-222-89
[97] https://www.cs.princeton.edu/research/techreps/TR-216-89
[98] https://www.cs.princeton.edu/research/techreps/author/729
[99] https://www.cs.princeton.edu/research/techreps/TR-193-88
[100] https://www.cs.princeton.edu/research/techreps/author/677
[101] https://www.cs.princeton.edu/research/techreps/TR-189-88
[102] https://www.cs.princeton.edu/research/techreps/author/669
[103] https://www.cs.princeton.edu/research/techreps/author/702
[104] https://www.cs.princeton.edu/research/techreps/author/476
[105] https://www.cs.princeton.edu/research/techreps/TR-187-88
[106] https://www.cs.princeton.edu/research/techreps/TR-186-88
[107] https://www.cs.princeton.edu/research/techreps/TR-171-88
[108] https://www.cs.princeton.edu/research/techreps/author/674
[109] https://www.cs.princeton.edu/research/techreps/author/94
[110] https://www.cs.princeton.edu/research/techreps/author/722
[111] https://www.cs.princeton.edu/research/techreps/TR-164-88
[112] https://www.cs.princeton.edu/research/techreps/TR-163-88
[113] https://www.cs.princeton.edu/research/techreps/author/675
[114] https://www.cs.princeton.edu/research/techreps/TR-157-88
[115] https://www.cs.princeton.edu/research/techreps/TR-154-88
[116] https://www.cs.princeton.edu/research/techreps/TR-132-88
[117] https://www.cs.princeton.edu/research/techreps/TR-131-88
[118] https://www.cs.princeton.edu/research/techreps/TR-118-87
[119] https://www.cs.princeton.edu/research/techreps/TR-111-87
[120] https://www.cs.princeton.edu/research/techreps/TR-109-87
[121] https://www.cs.princeton.edu/research/techreps/author/721
[122] https://www.cs.princeton.edu/research/techreps/TR-108-87
[123] https://www.cs.princeton.edu/research/techreps/TR-107-87
[124] https://www.cs.princeton.edu/research/techreps/TR-106-87
[125] https://www.cs.princeton.edu/research/techreps/TR-105-87
[126] https://www.cs.princeton.edu/research/techreps/author/671
[127] https://www.cs.princeton.edu/research/techreps/TR-104-87
[128] https://www.cs.princeton.edu/research/techreps/TR-103-87
[129] https://www.cs.princeton.edu/research/techreps/TR-081-87
[130] https://www.cs.princeton.edu/research/techreps/TR-069-86
[131] https://www.cs.princeton.edu/research/techreps/TR-052-86
[132] https://www.cs.princeton.edu/research/techreps/TR-050-86
[133] https://www.cs.princeton.edu/research/techreps/TR-049-86
[134] https://www.cs.princeton.edu/research/techreps/author/53
[135] https://www.cs.princeton.edu/research/techreps/author/241
[136] https://www.cs.princeton.edu/research/techreps/TR-039-86
[137] https://www.cs.princeton.edu/research/techreps/author/417
[138] https://www.cs.princeton.edu/research/techreps/author/424
[139] https://www.cs.princeton.edu/research/techreps/author/111
[140] https://www.cs.princeton.edu/research/techreps/author/461
[141] https://www.cs.princeton.edu/research/techreps/TR-038-86
[142] https://www.cs.princeton.edu/research/techreps/author/156
[143] https://www.cs.princeton.edu/research/techreps/TR-013-85
[144] https://www.cs.princeton.edu/research/techreps/TR-008-85
[145] https://www.cs.princeton.edu/research/techreps/author/47
[146] https://www.cs.princeton.edu/research/techreps/author/341
[147] https://www.cs.princeton.edu/research/techreps/TR-007-85
[148] https://www.cs.princeton.edu/research/techreps/author/179
[149] https://www.cs.princeton.edu/research/techreps/TR-006-85
[150] https://www.cs.princeton.edu/research/techreps/TR-005-85
[151] https://www.cs.princeton.edu/research/techreps/author/187
[152] https://www.cs.princeton.edu/research/techreps/TR-004-85
[153] https://www.cs.princeton.edu/research/techreps/author/9
[154] https://www.cs.princeton.edu/research/techreps/author/236
[155] https://www.cs.princeton.edu/research/techreps/TR-003-85