• 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

• Tal, Ayellet
  • Building and Using Polyhedral Hierarchies, TR-411-93, February 1993
  • Integration of Commit Protocols in Heterogeneous Databases, TR-375-92, June 1992
  • Strategies for Polyhedral Surface Decomposition: An Experimental Study, TR-564-95, December 1995
  • The New Jersey Line-Segment-Saw Massacre (Companion to Video), TR-379-92, July 1992
  • Visualization of Geometric Algorithms, TR-559-95, February 1995
• Tamassia, Roberto
  • Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph, TR-243-90, January 1990
• Tan, Gang
  • A Compositional Logic for Control Flow and its Application in Foundational Proof-Carrying Code, TR-731-05, August 2005
  • Dynamic Typing with Dependent Types, TR-695-04, April 2004
  • Safe Heterogeneous Applications: Curing the Java Native Interface, TR-715-04, October 2004
• Tardos, Eva
  • Network Flow Algorithms, TR-216-89, March 1989
• Tarjan, Robert E.
  • A Critical Analysis of Multigrid Methods on Massively Parallel Computers, TR-448-94, February 1994
  • A Fast Las Vegas Algorithm for Triangulating a Simple Polygon, TR-132-88, January 1988
  • A Fast Las Vegas Algorithm for Triangulating a Simple Polygon, TR-157-88, May 1988
  • A Fast Parametric Maximum Flow Algorithm, TR-105-87, July 1987
  • A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest, TR-108-87, July 1987
  • A Linear-Time Algorithm for Finding an Ambitus, TR-301-91, January 1991
  • A Linear-Work Parallel Algorithm for Finding Minimum Spanning Trees, TR-457-94, May 1994
  • A Locally Adaptive Data Compression Scheme, TR-004-85, July 1985
  • A New Approach to the Maximum Flow Problem, TR-050-86, July 1986
  • A Parallel Algorithm for Finding A Blocking Flow in an Acyclic Network, TR-186-88, October 1988
  • A Randomized Linear-Time Algorithm for Finding Minimum Spanning Trees, TR-436-93, October 1993
  • A Tight Amortized Bound for Path Reversal, TR-163-88, June 1988
  • Algorithms for Two Bottleneck Optimization Problems, TR-104-87, May 1987
  • Almost-Optimum Parallel Speed-ups of Algorithms for Bipartite Matching and Related Problems, TR-223-89, January 1989
  • Amortized Analysis of Algorithms for Set Union with Backtracking, TR-103-87, May 1987
  • An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem, TR-309-91, March 1991
  • An O(n log log n)-Time Algorithm for Triangulating Simple Polygons, TR-052-86, July 1986
  • Computing Minimal Spanning Subgraphs in Linear Time, TR-356-91, December 1991
  • Confluently Persistent Deques via Data-Structural Bootstrapping, TR-420-93, March 1993
  • Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues, TR-381-92, July 1992
  • Designing Algorithms, TR-069-86, December 1986
  • Dominating Sets in Planar Graphs, TR-461-94, June 1994
  • Dynamic Perfect Hashing: Upper and Lower Bounds, TR-310-91, March 1991
  • Dynamic Trees as Search Trees via Euler Tours, Applied to the Network Simplex Algorithm, TR-503-95, September 1995
  • Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem, TR-193-88, October 1988
  • Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem, TR-187-88, August 1988
  • Efficient Maximum Flow Algorithms, TR-311-91, March 1991
  • Efficient Top-Down Updating of Red-Black Trees, TR-006-85, June 1985
  • Expected Performance of Dijkstra's Shortest Path Algorithm, TR-530-96, October 1996
  • Faster Algorithms for the Shortest Path Problem, TR-154-88, March 1988
  • Faster Scaling Algorithms for General Graph Matching Problems, TR-222-89, April 1989
  • Faster Scaling Algorithms for Network Problems, TR-111-87, August 1987
  • Finding Minimum-Cost Circulations by Canceling Negative Cycles, TR-107-87, July 1987
  • Finding Minimum-Cost Circulations by Successive Approximation, TR-106-87, July 1987
  • Finding Minimum-Cost Flows by Double Scaling , TR-164-88, June 1988
  • Fully Persistent Lists with Catenation, TR-299-90, December 1990
  • Improved Algorithms for Bipartite Network Flow, TR-338-91, May 1991
  • Improved Time Bounds for the Maximum Flow Problem, TR-118-87, September 1987
  • Lazy Structure Sharing for Query Optimization, TR-422-93, April 1993
  • Linear Time Algorithms for Visibility and shortest Path Problems Inside Simple Polygons, TR-039-86, May 1986
  • Maintaining Bridge-Connected and Biconnected Components Online, TR-228-89, August 1989
  • Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph, TR-243-90, January 1990
  • More Efficient Bottom-Up Tree Pattern Matching, TR-268-90, May 1990
  • Network Flow Algorithms, TR-216-89, March 1989
  • New Heap Data Structures, TR-597-99, March 1999
  • One-Processor Scheduling of Tasks with Preferred Starting Times, TR-049-86, August 1986
  • Planar Point Location Using Persistent Search Trees, TR-005-85, July 1985
  • Polygon Triangulation in $O(N^log^log^N)$ Time with Simple Data Structures, TR-327-91, June 1991
  • Purely Functional Representations of Catenable Sorted Lists, TR-511-96, February 1996
  • Randomized Parallel Algorithms for Trapezoidal Diagrams, TR-318-91, April 1991
  • Rectilinear Planar Layouts of Planar Graphs and Bipolar Orientations, TR-007-85, July 1985
  • Relaxed Heaps: An Alternative to Fibronacci Heaps, TR-109-87, July 1987
  • Resistance of Digital Watermarks to Collusive Attacks, TR-585-98, July 1998
  • Rotation Distance, TR-003-85, July 1985
  • Rotation Distance, Triangulations and Hyperbolic Geometry, TR-131-88, January 1988
  • Short Encodings of Evolving Structures, TR-265-90, April 1990
  • Simplified Linear-Time Jordan Sorting and Polygon Clipping, TR-189-88, July 1988
  • Solving Minimum-Cost Flow Problems by Successive Approximation, TR-081-87, February 1987
  • Strictly Functional, Real-Time Deques with Catenation, TR-584-98, June 1998
  • The Pairing Heap: A New Form of Self-Adjusting Heap, TR-008-85, July 1985
  • Three Partition Refinement Algorithms, TR-038-86, January 1986
  • Transitive Reduction in Parallel Via Branchings, TR-171-88, July 1988
  • Two Streamlined Depth-First Search Algorithms, TR-013-85, July 1985
  • Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences, TR-267-90, November 1989
  • Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time, TR-289-90, July 1990
• Tay, Y. C.
  • A Monotonicity Theorem for Tandem Queues, TR-362-92, February 1992
  • A Theory for Deadlocks, TR-344-91, August 1991
• Terrace, Jeffrey
  • Content Conditioning and Distribution for Dynamic Virtual Worlds, TR-941-12, November 2012
• Thomas, Robert G.
  • Hierarchical Non-Emitting Markov Models, TR-544-97, May 1997
  • Nonmonotonic Multicontext Models, TR-486-95, February 1995
  • Nonuniform Markov Models, TR-536-96, November 1996
• Thompson, Jonathan
  • Computer Science 111, TR-346-91, September 1991
• Thurston, William P.
  • Robust Contour Tracing, TR-054-86, September 1986
  • Rotation Distance, TR-003-85, July 1985
  • Rotation Distance, Triangulations and Hyperbolic Geometry, TR-131-88, January 1988
  • Short Encodings of Evolving Structures, TR-265-90, April 1990
• Ting, Hing Fung
  • Computational Complexity for Selection Problems with Parity-Like Tests (Thesis), TR-392-92, January 1993
  • Some Complexity Questions Related to the Query l leq k leq m Pi (Xik - X jk) : 0?, TR-259-90, April 1990
• Toler-Franklin, Corey
  • Matching, Archiving and Visualizing Cultural Heritage Artifacts Using Multi-Channel Images (thesis), TR-895-11, May 2011
  • Multi-Feature Matching of Fresco Fragments, TR-874-10, May 2010
  • Stylized Depiction of Images with Normals , TR-777-07, April 2007
• Tolmach, Andrew P.
  • A Portable Multiprocessor Interface for Standard ML of New Jersey, TR-376-92, June 1992
  • Debuggable Concurrency Extensions for Standard ML, TR-352-91, October 1991
  • Debugging Standard ML, TR-378-92, October 1992
  • Debugging Standard ML Without Reverse Engineering, TR-253-90, March 1990
• Tomasic, Anthony S.
  • Distributed Queries and Incremental Updates in Information Retrieval Systems (Thesis), TR-458-94, June 1994
• Toonen, Brian R.
  • Relaxed Consistency and Coherence Granularity in DSM Systems: A Performance Evaluation, TR-535-96, December 1996
• Torocsik, Jeno
  • Layout of Rooted Trees, TR-369-92, February 1992
• Tourlakis, Iannis
  • New lower bounds for Approximation Algorithms in the Lovasz-Schrijver hierarchy , TR-751-06, May 2006
• Tracey, John
  • Do Commodity SMT Processors Need More OS Research?, TR-792-07, August 2007
  • On the Effectiveness of Simultaneous Multithreading on Network Server Workloads, TR-793-07, August 2007
• Tromer, Eran
  • Path-Quality Monitoring in the Presence of Adversaries, TR-807-07, December 2007
• Troyanskaya, Olga G.
  • Bayesian Aggregation for Hierarchical Classfication, TR-785-07, May 2008
• Tsioutsiouliklis, Kostas
  • Maximum Flow Techniques for Network Clustering (Thesis), TR-652-02, June 2002
• Tunnell, Chris
  • Puzzle Outsourcing for IP-Level DoS Resistance, TR-700-04, May 2004
• Tzanetakis, George
  • Manipulation, Analysis and Retrieval Systems for Audio Signals (Thesis), TR-651-02, June 2002