- Efficient PiecewiseLinear Function Approximation Using the Uniform Metric \Lambda
- On the Complexity of Optimization Problems for 3Dimensional Convex Polyhedra and Decision Trees \Lambda
- Deterministic Sampling and Range Counting in Geometric Data Amitabha Bagchi
- Using Randomization in the Teaching of Data Structures and Algorithms Michael T. Goodrich \Lambda Roberto Tamassia y
- Algorithmica (1996) 16:181-214 Algorithmica
- The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data
- Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 8, no. 1, pp. 320 (2004)
- DOI: 10.1007/s00453-004-1082-5 Algorithmica (2004) 39: 275286
- Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
- Efficient Perspective-Accurate Silhouette Computation and Applications
- Simplified Analyses of Randomized Algorithms for Searching, Sorting, and Selection
- Secure Access Control for Location-Based Applications in WLAN Systems
- TRICERT: A Distributed Certified E-Mail Scheme Giuseppe Ateniese Breno de Medeiros Michael T. Goodrich
- Implementation of an Authenticated Dictionary with Skip Lists and Commutative Hashing
- Efficient Tree-Based Revocation in Groups of Low-State Devices
- Loud and Clear: Human-Verifiable Authentication Based on Audio Michael T. Goodrich, Michael Sirivianos, John Solis, Gene Tsudik, and Ersin Uzun
- The Mastermind Attack on Genomic Data Michael T. Goodrich
- Algorithmica (1996) 16: 569617 Algorithmica
- 10 Goodrich et al. the 19th Ann. ACM Symp. on Theory of Computing,
- Fixed-Dimensional Parallel Linear Programming via Relative c-Approximations Michael T. Goodrich*
- Classical Computational Geometry in GeomNet* Gill Barequett Stina S. Bridgemanl Christian A. Duncanf Michael T. Goodrichf
- Communication-Efficient Parallel Sorting (Preliminary Version)
- Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version)
- Journal of Graph Algorithms and Applications http://www.cs.brown.edu/publications/jgaa/
- Computational Geometry 24 (2003) 95114 www.elsevier.com/locate/comgeo
- Planarity-Preserving Clustering and Embedding for Large Planar Graphs
- Drawing Graphs with Large Vertices and Thick Gill Barequet1
- A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs
- Confluent Layered Drawings David Eppstein, Michael T. Goodrich, and Jeremy Yu Meng
- Delta-Confluent Drawings David Eppstein, Michael T. Goodrich, and Jeremy Yu Meng
- Succinct Greedy Graph Drawing in the Hyperbolic Plane David Eppstein1 and Michael T. Goodrich2
- Methods for Achieving Fast Query Times in Point Location Data Structures Michael T. Goodrich
- DOI: 10.1007/s00453-004-1138-6 Algorithmica (2005) 42: 3148
- Biased Skip Lists Amitabha Bagchi1
- Improved Combinatorial Group Testing for Real-World Problem Sizes
- Snap Rounding Line Segments E ciently in Two and Three Dimensions
- Animating the Polygon-Offset Distance Function* Gill Barequett Amy Briggs$ MatthewDickerson* CristianDima$ MichaelT. Goodricht
- DOI: 10.1007/s00453-001-0096-5 Algorithmica (2002) 33: 150167
- Three-Dimensional Layers of Maxima Adam L. Buchsbaum1
- Contour interpolation by straight skeletonsq Gill Barequet,a,*,1
- Deterministic Sampling and Range Counting in Geometric Data Streams
- Straight Skeletons of Three-Dimensional Polyhedra Gill Barequet1, David Eppstein2, Michael T. Goodrich2, and Amir Vaxman1
- Searching for High-Value Rare Events with Uncheatable Grid Computing
- Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via
- JDSL: The Data Structures Library
- On the Algorithmic Complexity of the Mastermind Game with Black-Peg Results
- Selected Open Problems in Graph Drawing Franz Brandenburg , David Eppstein , Michael T. Goodrich ,
- Fast Randomized Parallel Methods for Planar Convex Hull Construction \Lambda
- Efficient Parallel Algorithms for Dead Sensor Diagnosis and Multiple Access Channels
- Geometric Pattern Matching under Euclidean Motion L. Paul Chew 1 , Michael T. Goodrich 2 , Daniel P. Huttenlocher 3 ,
- A Framework for Drawing Planar Graphs with Curves and Polylines
- Fundamental Parallel Algorithms for Private-Cache Chip Multiprocessors
- Computational Geometry 29 (2004) 318 www.elsevier.com/locate/comgeo
- Choosing Colors for Geometric Graphs via Color Space Embeddings
- Competitive Tree-Structured Dictionaries MICHAEL T. GOODRICH
- Parallel Algorithms for HigherDimensional Convex Hulls (Preliminary Version)
- Secure Biometric Authentication for Weak Computational Devices
- Journal of Discrete Algorithms 3 (2005) 126 www.elsevier.com/locate/jda
- C-Planarity of Extrovert Clustered Graphs Michael T. Goodrich, George S. Lueker, and Jonathan Z. Sun
- A Polygonal Approach to HiddenLine and HiddenSurface Elimination \Lambda
- Computational Geometry 23 (2002) 153162 www.elsevier.com/locate/comgeo
- IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. X, NO. X, JANUARY 2007 1 Probabilistic Packet Marking for
- Randomized Fully-Scalable BSP Techniques for Multi-Searching and Convex Hull Construction
- Accredited DomainKeys: A Service Architecture for Improved Email Validation
- Balanced Aspect Ratio Trees Revisited Amitabh Chaudhary and Michael T. Goodrich
- Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes
- OutputSensitive Methods for Rectilinear Hidden Surface Removal \Lambda
- BoundedIndependence Derandomization of Geometric Partitioning with Applications to
- Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets
- IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 21, NO. 4, APRIL 1999 371 Short Papers___________________________
- GeomNet's layered client-server architecture lets
- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
- The Rainbow Skip Graph: A Fault-Tolerant Constant-Degree
- E cient Approximation and Optimization Algorithms for Computational Metrology
- Approximate Geometric Query Specialized data structures are essential for answering geometric problems. In general
- Balanced Aspect Ratio Trees
- Indexing Information for Data Forensics Michael T. Goodrich1
- Efficient Packet Marking for Large-Scale IP Traceback Michael T. Goodrich
- External-Memory Computational Geometry (Preliminary Version)
- 42 PARALLEL ALGORITHMS IN GEOMETRY Michael T. Goodrich
- Computing the Arrangement of Curve Segments: Divide-and-Conquer Algorithms via Sampling
- ExternalMemory Graph Algorithms YiJen Chiang \Lambday Michael T. Goodrich zx Edward F. Grove --k Roberto Tamassia \Lambday
- IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1 Achieving Communication Efficiency through
- Parallel External Memory Graph Algorithms University of Aarhus
- SAIL: A System for Generating, Archiving, and Retrieving Specialized AssignmentsUsing ETEX*
- Abstracting Positional Information in Data Structures: Locators and Positions in JDSL
- Almost Optimal Set Covers in Finite VCDimension Herv' e Br onnimann \Lambda
- PILOT: An Interactive Tool for Learning and Grading* Stina Bridgeman
- Teaching Internet Algorithmics Michael T. Goodrich
- DOI: 10.1007/s004540010081 Discrete Comput Geom OF1OF21 (2000) Discrete & Computational
- Leap-Frog Packet Linking and Diverse Key Distributions for Improved Integrity in Network Broadcasts
- Computing Faces in Segment and Simplex Arrangements (Preliminary Version)
- Confluent Layered Drawings David Eppstein, Michael T. Goodrich, and Jeremy Yu Meng
- Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
- Linear-Time Triangulation of a Simple Polygon Made Easier Via Randomization
- Journal of Graph Algorithms and Applications http://www.cs.brown.edu/publications/jgaa/
- Algorithrnica(1996) 15:126-153 Algorithmica9 1996Springer-Verlag New York Inc,
- Generalized Sweep Methods for Parallel Computakional Geometry (Preliminary Version)
