Michael T. Goodrich

Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Drawing Trees with Perfect Angular Resolution and Polynomial Area. Discrete & Computational Geometry 49(2): 157-182 (2013)

Arthur U. Asuncion, Michael T. Goodrich: Nonadaptive Mastermind Algorithms for String and Vector Databases, with Case Studies. IEEE Trans. Knowl. Data Eng. 25(1): 131-144 (2013)

Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Lombardi Drawings of Graphs. J. Graph Algorithms Appl. 16(1): 85-108 (2012)

Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler: Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. J. Graph Algorithms Appl. 16(2): 243-259 (2012)

Michael T. Goodrich, Duy Nguyen, Olga Ohrimenko, Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos, Cristina Videira Lopes: Efficient Verification of Web-Content Searching Through Authenticated Web Crawlers. PVLDB 5(10): 920-931 (2012)

David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott: Extended dynamic subgraph statistics using h-index parameterized data structures. Theor. Comput. Sci. 447: 44-52 (2012)

Michael T. Goodrich: Learning Character Strings via Mastermind Queries, With a Case Study Involving mtDNA. IEEE Transactions on Information Theory 58(11): 6726-6736 (2012)

Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia: Practical oblivious storage. CODASPY 2012: 13-24

Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia: Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage. Graph Drawing 2012: 43-54

Franz-Josef Brandenburg, David Eppstein, Andreas Gleißner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber: On the Density of Maximal 1-Planar Graphs. Graph Drawing 2012: 327-338

Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott: Force-Directed Graph Drawing Using Social Gravity and Scaling. Graph Drawing 2012: 414-425

Michael T. Goodrich, Joseph A. Simons: More Graph Drawing in the Cloud: Data-Oblivious st-Numbering, Visibility Representations, and Orthogonal Drawing of Biconnected Planar Graphs. Graph Drawing 2012: 569-570

Michael T. Goodrich, Michael Mitzenmacher: Anonymous Card Shuffling and Its Applications to Parallel Mixnets. ICALP (2) 2012: 549-560

Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler: Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability. MedAlg 2012: 203-218

Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia: Privacy-preserving group data access via stateless oblivious RAM simulation. SODA 2012: 157-167

Michael T. Goodrich, Duy Nguyen, Olga Ohrimenko, Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos, Cristina Videira Lopes: Verifying Search Results Over Web Collections. CoRR abs/1204.5446 (2012)

Michael T. Goodrich, Michael Mitzenmacher: Anonymous Card Shuffling and its Applications to Parallel Mixnets. CoRR abs/1205.1579 (2012)

Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott: Force-Directed Graph Drawing Using Social Gravity and Scaling. CoRR abs/1209.0748 (2012)

Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia: Data-Oblivious Graph Drawing Model and Algorithms. CoRR abs/1209.0756 (2012)

Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos: Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems. Algorithmica 60(3): 505-552 (2011)

Michael T. Goodrich: Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm. J. ACM 58(6): 27 (2011)

Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Planar Drawings of Higher-Genus Graphs. J. Graph Algorithms Appl. 15(1): 7-32 (2011)

David Eppstein, Michael T. Goodrich: Succinct Greedy Geometric Routing Using Hyperbolic Geometry. IEEE Trans. Computers 60(11): 1571-1580 (2011)

Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson, Ying Daisy Zhuo: Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks. Transactions on Computational Science 14: 211-238 (2011)

David Eppstein, Michael T. Goodrich: Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters. IEEE Trans. Knowl. Data Eng. 23(2): 297-306 (2011)

Michael T. Goodrich: Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons. ANALCO 2011: 93-106

David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott: Category-based routing in social networks: Membership dimension and the small-world phenomenon. CASoN 2011: 102-107

Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia: Oblivious RAM simulation with efficient worst-case access overhead. CCSW 2011: 95-100

Michael T. Goodrich, Florian Kerschbaum: Privacy-enhanced reputation-feedback methods to reduce feedback extortion in online auctions. CODASPY 2011: 273-282

Michael T. Goodrich, Pawel Pszona: External-Memory Network Analysis Algorithms for Naturally Sparse Graphs. ESA 2011: 664-676

Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler: Planar and Poly-arc Lombardi Drawings. Graph Drawing 2011: 308-319

Roman Chernobelskiy, Kathryn I. Cunningham, Michael T. Goodrich, Stephen G. Kobourov, Lowell Trott: Force-Directed Lombardi-Style Graph Drawing. Graph Drawing 2011: 320-331

Michael T. Goodrich, Michael Mitzenmacher: Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation. ICALP (2) 2011: 576-587

Michael T. Goodrich, Joseph A. Simons: Fully Retroactive Approximate Range and Nearest Neighbor Searching. ISAAC 2011: 292-301

Michael T. Goodrich, Nodari Sitchinava, Qin Zhang: Sorting, Searching, and Simulation in the MapReduce Framework. ISAAC 2011: 374-383

Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler: External-Memory Multimaps. ISAAC 2011: 384-394

David Eppstein, Michael T. Goodrich, Frank Uyeda, George Varghese: What's the difference?: efficient set reconciliation without prior context. SIGCOMM 2011: 218-229

Michael T. Goodrich, Michael Mitzenmacher: Brief announcement: large-scale multimaps. SPAA 2011: 259-260

Michael T. Goodrich: Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data. SPAA 2011: 379-388

David Eppstein, Michael T. Goodrich, Maarten Löffler: Tracking Moving Objects with Few Handovers. WADS 2011: 362-373

Michael T. Goodrich, Nodari Sitchinava, Qin Zhang: Sorting, Searching, and Simulation in the MapReduce Framework. CoRR abs/1101.1902 (2011)

Michael T. Goodrich, Michael Mitzenmacher: Invertible Bloom Lookup Tables. CoRR abs/1101.2245 (2011)

Michael T. Goodrich, Florian Kerschbaum: Privacy-Enhanced Reputation-Feedback Methods to Reduce Feedback Extortion in Online Auctions. CoRR abs/1102.4602 (2011)

Michael T. Goodrich: Data-Oblivious External-Memory Algorithms for the Compaction, Selection, and Sorting of Outsourced Data. CoRR abs/1103.5102 (2011)

Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler: External-Memory Multimaps. CoRR abs/1104.5533 (2011)

David Eppstein, Michael T. Goodrich, Maarten Löffler: Tracking Moving Objects with Few Handovers. CoRR abs/1105.0392 (2011)

Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia: Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation. CoRR abs/1105.4125 (2011)

Michael T. Goodrich, Pawel Pszona: External-Memory Network Analysis Algorithms for Naturally Sparse Graphs. CoRR abs/1106.6336 (2011)

David Eppstein, Michael T. Goodrich, Pierre Baldi: Privacy-Enhanced Methods for Comparing Compressed DNA Sequences. CoRR abs/1107.3593 (2011)

Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler: Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps. CoRR abs/1107.4378 (2011)

Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia: Oblivious RAM Simulation with Efficient Worst-Case Access Overhead. CoRR abs/1107.5093 (2011)

David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott: Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short). CoRR abs/1108.4675 (2011)

Michael T. Goodrich, Joseph A. Simons: Fully Retroactive Approximate Range and Nearest Neighbor Searching. CoRR abs/1109.0312 (2011)

Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler: Planar and Poly-Arc Lombardi Drawings. CoRR abs/1109.0345 (2011)

Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia: Oblivious Storage with Low I/O Overhead. CoRR abs/1110.1851 (2011)

David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott: Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full). CoRR abs/1110.4499 (2011)

David Eppstein, Michael T. Goodrich, Darren Strash: Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings. SIAM J. Comput. 39(8): 3814-3829 (2010)

Guan Wang, Tongbo Luo, Michael T. Goodrich, Wenliang Du, Zutao Zhu: Bureaucratic protocols for secure two-party sorting, selection, and permuting. ASIACCS 2010: 226-237

David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott: Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures. COCOA (1) 2010: 128-141

Matthew T. Dickerson, David Eppstein, Michael T. Goodrich: Cloning Voronoi Diagrams via Retroactive Data Structures. ESA (1) 2010: 362-373

Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler: Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. Graph Drawing 2010: 129-140

Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Drawing Trees with Perfect Angular Resolution and Polynomial Area. Graph Drawing 2010: 183-194

Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Lombardi Drawings of Graphs. Graph Drawing 2010: 195-207

David Eppstein, Michael T. Goodrich, Roberto Tamassia: Privacy-preserving data-oblivious geometric algorithms for geographic data. GIS 2010: 13-22

Lars Arge, Michael T. Goodrich, Nodari Sitchinava: Parallel external memory graph algorithms. IPDPS 2010: 1-11

Michael T. Goodrich, Darren Strash: Priority Range Trees. ISAAC (1) 2010: 97-108

Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson: Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks. ISVD 2010: 132-141

Michael T. Goodrich: Randomized Shellsort: A Simple Oblivious Sorting Algorithm. SODA 2010: 1262-1277

Arthur U. Asuncion, Michael T. Goodrich: Turning privacy leaks into floods: surreptitious discovery of social network friendships and other sensitive binary attribute vectors. WPES 2010: 21-30

Michael T. Goodrich: Simulating Parallel Algorithms in the MapReduce Framework with Applications to Parallel Computational Geometry. CoRR abs/1004.4708 (2010)

Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson: Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks. CoRR abs/1005.1053 (2010)

Matthew T. Dickerson, David Eppstein, Michael T. Goodrich: Cloning Voronoi Diagrams via Retroactive Data Structures. CoRR abs/1006.1921 (2010)

Michael T. Goodrich, Michael Mitzenmacher: MapReduce Parallel Cuckoo Hashing and Oblivious RAM Simulations. CoRR abs/1007.1259 (2010)

Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler: Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. CoRR abs/1009.0088 (2010)

Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Lombardi Drawings of Graphs. CoRR abs/1009.0579 (2010)

Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Drawing Trees with Perfect Angular Resolution and Polynomial Area. CoRR abs/1009.0581 (2010)

David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott: Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics. CoRR abs/1009.0783 (2010)

David Eppstein, Michael T. Goodrich, Roberto Tamassia: Privacy-Preserving Data-Oblivious Geometric Algorithms for Geographic Data. CoRR abs/1009.1904 (2010)

Michael T. Goodrich, Darren Strash: Priority Range Trees. CoRR abs/1009.3527 (2010)

Michael T. Goodrich: Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons. CoRR abs/1011.2480 (2010)

Arthur U. Asuncion, Michael T. Goodrich: Nonadaptive Mastermind Algorithms for String and Vector Databases, with Case Studies. CoRR abs/1012.2509 (2010)

Michael T. Goodrich, Michael Sirivianos, John Solis, Claudio Soriente, Gene Tsudik, Ersin Uzun: Using audio in secure device pairing. IJSN 4(1/2): 57-68 (2009)

Michael T. Goodrich: On the algorithmic complexity of the Mastermind game with black-peg results. Inf. Process. Lett. 109(13): 675-678 (2009)

David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf: Approximate topological matching of quad meshes. The Visual Computer 25(8): 771-783 (2009)

Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Planar Drawings of Higher-Genus Graphs. Graph Drawing 2009: 45-56

David Eppstein, Michael T. Goodrich, Lowell Trott: Going off-road: transversal complexity in road networks. GIS 2009: 23-32

Michael T. Goodrich, Darren Strash: Succinct Greedy Geometric Routing in the Euclidean Plane. ISAAC 2009: 781-791

Michael T. Goodrich, Jonathan Z. Sun, Roberto Tamassia, Nikos Triandopoulos: Reliable Resource Searching in P2P Networks. SecureComm 2009: 437-447

David Eppstein, Michael T. Goodrich, Darren Strash: Linear-time algorithms for geometric graphs with sublinearly many crossings. SODA 2009: 150-159

Michael T. Goodrich: The Mastermind Attack on Genomic Data. IEEE Symposium on Security and Privacy 2009: 204-218

Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker: On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. WADS 2009: 242-253

Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker: On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. CoRR abs/0904.3756 (2009)

Michael T. Goodrich: The Mastermind Attack on Genomic Data. CoRR abs/0904.4458 (2009)

Mikhail J. Atallah, Marina Blanton, Michael T. Goodrich, Stanislas Polu: Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric. CoRR abs/0904.4670 (2009)

Michael T. Goodrich: On the Algorithmic Complexity of the Mastermind Game with Black-Peg Results. CoRR abs/0904.4911 (2009)

Michael T. Goodrich, Roberto Tamassia, Jasminka Hasic: An Efficient Dynamic and Distributed RSA Accumulator. CoRR abs/0905.1307 (2009)

Michael T. Goodrich, Daniel S. Hirschberg: Improved Adaptive Group Testing Algorithms with Applications to Multiple Access Channels and Dead Sensor Diagnosis. CoRR abs/0905.1906 (2009)

Michael T. Goodrich, Michael J. Nelson, Jonathan Z. Sun: The Rainbow Skip Graph: A Fault-Tolerant Constant-Degree P2P Relay Structure. CoRR abs/0905.2214 (2009)

Michael T. Goodrich: Pipelined Algorithms to Detect Cheating in Long-Term Grid Computations. CoRR abs/0906.1225 (2009)

Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Planar Drawings of Higher-Genus Graphs. CoRR abs/0908.1608 (2009)

Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos: Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems. CoRR abs/0908.4116 (2009)

Michael T. Goodrich: Randomized Shellsort: A Simple Oblivious Sorting Algorithm. CoRR abs/0909.1037 (2009)

David Eppstein, Michael T. Goodrich, Lowell Trott: Going Off-road: Transversal Complexity in Road Networks. CoRR abs/0909.2891 (2009)

David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf: Motorcycle Graphs: Canonical Quad Mesh Partitioning. Comput. Graph. Forum 27(5): 1477-1486 (2008)

David Eppstein, Michael T. Goodrich, Jonathan Z. Sun: Skip Quadtrees: Dynamic Data Structures for Multidimensional Point Sets. Int. J. Comput. Geometry Appl. 18(1/2): 131-160 (2008)

Michael T. Goodrich, Daniel S. Hirschberg: Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis. J. Comb. Optim. 15(1): 95-121 (2008)

Michael T. Goodrich, Roberto Tamassia, Danfeng (Daphne) Yao: Notarized federated ID management and authentication. Journal of Computer Security 16(4): 399-418 (2008)

Michael T. Goodrich: Pipelined algorithms to detect cheating in long-term grid computations. Theor. Comput. Sci. 408(2-3): 199-207 (2008)

Michael T. Goodrich: Probabilistic packet marking for large-scale IP traceback. IEEE/ACM Trans. Netw. 16(1): 15-24 (2008)

Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos: Super-Efficient Verification of Dynamic Outsourced Databases. CT-RSA 2008: 407-424

Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman: Straight Skeletons of Three-Dimensional Polyhedra. ESA 2008: 148-160

David Eppstein, Michael T. Goodrich: Succinct Greedy Graph Drawing in the Hyperbolic Plane. Graph Drawing 2008: 14-25

David Eppstein, Michael T. Goodrich: Studying (non-planar) road networks through an algorithmic lens. GIS 2008: 16

Matthew T. Dickerson, Michael T. Goodrich: Two-site Voronoi diagrams in geographic networks. GIS 2008: 59

Michael T. Goodrich, Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos: Athos: Efficient Authentication of Outsourced File Systems. ISC 2008: 80-96

David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf: Approximate topological matching of quadrilateral meshes. Shape Modeling International 2008: 83-92

Lars Arge, Michael T. Goodrich, Michael J. Nelson, Nodari Sitchinava: Fundamental parallel algorithms for private-cache chip multiprocessors. SPAA 2008: 197-206

Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman: Straight Skeletons of Three-Dimensional Polyhedra. CoRR abs/0805.0022 (2008)

David Eppstein, Michael T. Goodrich: Succinct Greedy Graph Drawing in the Hyperbolic Plane. CoRR abs/0806.0341 (2008)

David Eppstein, Michael T. Goodrich: Studying (Non-Planar) Road Networks Through an Algorithmic Lens. CoRR abs/0808.3694 (2008)

David Eppstein, Michael T. Goodrich, Darren Strash: Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings. CoRR abs/0812.0893 (2008)

Michael T. Goodrich, Darren Strash: Succinct Greedy Geometric Routing in R^2. CoRR abs/0812.3893 (2008)

David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Layered Drawings. Algorithmica 47(4): 439-452 (2007)

David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg: Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. SIAM J. Comput. 36(5): 1360-1375 (2007)

Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich: Deterministic sampling and range counting in geometric data streams. ACM Transactions on Algorithms 3(2) (2007)

David Eppstein, Michael T. Goodrich, Nodari Sitchinava: Guard placement for efficient point-in-polygon proofs. Symposium on Computational Geometry 2007: 27-36

Michael T. Goodrich, Jonathan Z. Sun: Checking Value-Sensitive Data Structures in Sublinear Space. ISAAC 2007: 353-364

Mikhail J. Atallah, Marina Blanton, Michael T. Goodrich, Stanislas Polu: Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric. WADS 2007: 114-126

David Eppstein, Michael T. Goodrich: Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters. WADS 2007: 637-648

Michael T. Goodrich, Charalampos Papamanthou, Roberto Tamassia: On the Cost of Persistence and Authentication in Skip Lists. WEA 2007: 94-107

David Eppstein, Michael T. Goodrich: Space-Efficient Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters. CoRR abs/0704.3313 (2007)

Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Chen Li, Michal Shmueli-Scheuer: Achieving Communication Efficiency through Push-Pull Partitioning of Semantic Spaces to Disseminate Dynamic Information. IEEE Trans. Knowl. Data Eng. 18(10): 1352-1367 (2006)

Michael T. Goodrich, Roberto Tamassia, Danfeng Yao: Notarized Federated Identity Management for Web Services. DBSec 2006: 133-147

Michael B. Dillencourt, David Eppstein, Michael T. Goodrich: Choosing Colors for Geometric Graphs Via Color Space Embeddings. Graph Drawing 2006: 294-305

Michael T. Goodrich, Michael Sirivianos, John Solis, Gene Tsudik, Ersin Uzun: Loud and Clear: Human-Verifiable Authentication Based on Audio. ICDCS 2006: 10

Michael T. Goodrich, Michael J. Nelson, Jonathan Z. Sun: The rainbow skip graph: a fault-tolerant constant-degree distributed data structure. SODA 2006: 384-393

Michael T. Goodrich, Daniel S. Hirschberg: Efficient parallel algorithms for dead sensor diagnosis and multiple access channels. SPAA 2006: 118-127

David Eppstein, Michael T. Goodrich, Nodari Sitchinava: Guard Placement For Wireless Localization. CoRR abs/cs/0603057 (2006)

Michael B. Dillencourt, David Eppstein, Michael T. Goodrich: Choosing Colors for Geometric Graphs via Color Space Embeddings. CoRR abs/cs/0609033 (2006)

Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich: Biased Skip Lists. Algorithmica 42(1): 31-48 (2005)

Gill Barequet, Prosenjit Bose, Matthew T. Dickerson, Michael T. Goodrich: Optimizing a constrained convex polygonal annulus. J. Discrete Algorithms 3(1): 1-26 (2005)

Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. J. Graph Algorithms Appl. 9(1): 31-52 (2005)

Wenliang Du, Michael T. Goodrich: Searching for High-Value Rare Events with Uncheatable Grid Computing. ACNS 2005: 122-137

Michael T. Goodrich, Mikhail J. Atallah, Roberto Tamassia: Indexing Information for Data Forensics. ACNS 2005: 206-221

Michael T. Goodrich, Roberto Tamassia, Danfeng Yao: Accredited DomainKeys: A Service Architecture for Improved Email Validation. CEAS 2005

David Eppstein, Michael T. Goodrich, Jonathan Z. Sun: The skip quadtree: a simple dynamic data structure for multidimensional data. Symposium on Computational Geometry 2005: 296-305

Mikhail J. Atallah, Keith B. Frikken, Michael T. Goodrich, Roberto Tamassia: Secure Biometric Authentication for Weak Computational Devices. Financial Cryptography 2005: 357-371

David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Delta-Confluent Drawings. Graph Drawing 2005: 165-176

Michael T. Goodrich, George S. Lueker, Jonathan Z. Sun: C-Planarity of Extrovert Clustered Graphs. Graph Drawing 2005: 211-222

Lars Arge, David Eppstein, Michael T. Goodrich: Skip-webs: efficient distributed data structures for multi-dimensional data sets. PODC 2005: 69-76

Michael T. Goodrich: Leap-Frog Packet Linking and Diverse Key Distributions for Improved Integrity in Network Broadcasts. IEEE Symposium on Security and Privacy 2005: 196-207

Amitabh Chaudhary, Michael T. Goodrich: Balanced Aspect Ratio Trees Revisited. WADS 2005: 73-85

David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg: Improved Combinatorial Group Testing for Real-World Problem Sizes. WADS 2005: 86-98

David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg: Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. CoRR abs/cs/0505048 (2005)

David Eppstein, Michael T. Goodrich, Jonathan Z. Sun: The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data. CoRR abs/cs/0507049 (2005)

Lars Arge, David Eppstein, Michael T. Goodrich: Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets. CoRR abs/cs/0507050 (2005)

David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Layered Drawings. CoRR abs/cs/0507051 (2005)

David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Delta-confluent Drawings. CoRR abs/cs/0510024 (2005)

Michael T. Goodrich, Michael Sirivianos, John Solis, Gene Tsudik, Ersin Uzun: Loud and Clear: Human-Verifiable Authentication Based on Audio. IACR Cryptology ePrint Archive 2005: 428 (2005)

Michael T. Goodrich, Roberto Tamassia, David M. Mount: Data structures and algorithms in C++. Wiley 2004, isbn 978-0-471-42924-1, pp. I-XV, 1-683

Adam L. Buchsbaum, Michael T. Goodrich: Three-Dimensional Layers of Maxima. Algorithmica 39(4): 275-286 (2004)

Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov: A multi-dimensional approach to force-directed layouts of large graphs. Comput. Geom. 29(1): 3-18 (2004)

Gill Barequet, Michael T. Goodrich, Aya Levi-Steiner, Dvir Steiner: Contour interpolation by straight skeletons. Graphical Models 66(4): 245-260 (2004)

Gill Barequet, Michael T. Goodrich, Chris Riley: Drawing Planar Graphs with Large Vertices and Thick Edges. J. Graph Algorithms Appl. 8: 3-20 (2004)

Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich: Deterministic sampling and range counting in geometric data streams. Symposium on Computational Geometry 2004: 144-151

Michael T. Goodrich, Jonathan Z. Sun, Roberto Tamassia: Efficient Tree-Based Revocation in Groups of Low-State Devices. CRYPTO 2004: 511-527

David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Layered Drawings. Graph Drawing 2004: 184-194

Michael T. Goodrich, Roberto Tamassia: Data structures and algorithms in Java (3. ed.). Wiley 2003, isbn 978-0-471-64452-1, pp. I-XVII, 1-681

Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Planarity-preserving clustering and embedding for large planar graphs. Comput. Geom. 24(2): 95-114 (2003)

Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos, Robert F. Cohen: Authenticated Data Structures for Graph and Geometric Searching. CT-RSA 2003: 295-313

Michael T. Goodrich, Michael Shin, Christian D. Straub, Roberto Tamassia: Distributed Data Authenication (System Demonstration). DISCEX (2) 2003: 58-59

Michael T. Goodrich, Roberto Tamassia: Efficient and Scalable Infrastructure Support for Dynamic Coalitions. DISCEX (2) 2003: 246-251

Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. Graph Drawing 2003: 1-12

Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel: Selected Open Problems in Graph Drawing. Graph Drawing 2003: 515-539

Michael T. Goodrich, Michael Shin, Roberto Tamassia, William H. Winsborough: Authenticated Dictionaries for Fresh Attribute Credentials. iTrust 2003: 332-347

Gill Barequet, Michael T. Goodrich, Aya Levi-Steiner, Dvir Steiner: Straight-skeleton based contour interpolation. SODA 2003: 119-127

Gill Barequet, Michael T. Goodrich, Chris Riley: Drawing Graphs with Large Vertices and Thick Edges. WADS 2003: 281-293

Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Shouhuai Xu: Constructing Disjoint Paths for Secure Communication. DISC 2003: 181-195

Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich: Deterministic Sampling and Range Counting in Geometric Data Streams. CoRR cs.CG/0307027 (2003)

Michael T. Goodrich, Roberto Tamassia: Algorithm design - foundations, analysis and internet examples. Wiley 2002, isbn 978-0-471-38365-9, pp. I-XII, 1-708

Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink: Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. Algorithmica 33(2): 150-167 (2002)

Michael T. Goodrich: Guest Editor's Foreword. Algorithmica 33(3): 271 (2002)

Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia: Optimizing area and aspect ration in straight-line orthogonal tree drawings. Comput. Geom. 23(2): 153-162 (2002)

Michael T. Goodrich: Efficient packet marking for large-scale IP traceback. ACM Conference on Computer and Communications Security 2002: 117-126

Adam L. Buchsbaum, Michael T. Goodrich: Three-Dimensional Layers of Maxima. ESA 2002: 257-269

Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich: Biased Skip Lists. ISAAC 2002: 1-13

Michael T. Goodrich, Roberto Tamassia, Jasminka Hasic: An Efficient Dynamic and Distributed Cryptographic Accumulator. ISC 2002: 372-388

Stephen G. Kobourov, Michael T. Goodrich (Eds.): Graph Drawing, 10th International Symposium, GD 2002, Irvine, CA, USA, August 26-28, 2002, Revised Papers. Lecture Notes in Computer Science 2528, Springer 2002, isbn 3-540-00158-1

Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. CoRR cs.CG/0212046 (2002)

Gill Barequet, Matthew Dickerson, Michael T. Goodrich: Voronoi Diagrams for Convex Polygon-Offset Distance Functions. Discrete & Computational Geometry 25(2): 271-291 (2001)

C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Drawing Planar Graphs with Circular Arcs. Discrete & Computational Geometry 25(3): 405-418 (2001)

Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos: A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time. Discrete & Computational Geometry 26(2): 245-265 (2001)

Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees. J. Algorithms 38(1): 303-333 (2001)

Matthew Dickerson, Michael T. Goodrich: Matching points to a convex polygonal boundary. CCCG 2001: 89-92

Mihai Pop, Christian A. Duncan, Gill Barequet, Michael T. Goodrich, Wenjing Huang, Subodh Kumar: Efficient perspective-accurate silhouette computation and applications. Symposium on Computational Geometry 2001: 60-68

Aris Anagnostopoulos, Michael T. Goodrich, Roberto Tamassia: Persistent Authenticated Dictionaries and Their Applications. ISC 2001: 379-393

Giuseppe Ateniese, Breno de Medeiros, Michael T. Goodrich: TRICERT: A Distributed Certified E-Mail Scheme. NDSS 2001

Michael T. Goodrich, Roberto Tamassia: Teaching internet algorithmics. SIGCSE 2001: 129-133

Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, Vijay Kumar: Seller-Focused Algorithms for Online Auctioning. WADS 2001: 135-147

Michael T. Goodrich: Editorial. Comput. Geom. 16(1): 1-2 (2000)

Michael T. Goodrich, Christopher G. Wagner: A Framework for Drawing Planar Graphs with Curves and Polylines. J. Algorithms 37(2): 399-421 (2000)

Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs. J. Graph Algorithms Appl. 4(3): 19-46 (2000)

Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos: Linear-time triangulation of a simple polygon made easier via randomization. Symposium on Computational Geometry 2000: 201-212

Adam L. Buchsbaum, Michael T. Goodrich, Jeffery Westbrook: Range Searching Over Tree Cross Products. ESA 2000: 120-131

Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich: K-D Trees Are Better when Cut on the Longest Side. ESA 2000: 179-190

Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov: A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs. Graph Drawing 2000: 211-221

Stina S. Bridgeman, Michael T. Goodrich, Stephen G. Kobourov, Roberto Tamassia: PILOT: an interactive tool for learning and grading. SIGCSE 2000: 139-143

Stina S. Bridgeman, Michael T. Goodrich, Stephen G. Kobourov, Roberto Tamassia: SAIL: a system for generating, archiving, and retrieving specialized assignments using LATEX. SIGCSE 2000: 300-304

Michael T. Goodrich: Competitive tree-structured dictionaries. SODA 2000: 494-495

Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos: Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling. SODA 2000: 705-706

Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Stina S. Bridgeman, Roberto Tamassia: GeomNet: Geometric Computing Over the Internet. IEEE Internet Computing 3(2): 21-29 (1999)

Michael T. Goodrich, Joseph S. B. Mitchell, Mark W. Orletsky: Approximate Geometric Pattern Matching Under Rigid Motions. IEEE Trans. Pattern Anal. Mach. Intell. 21(4): 371-379 (1999)

Michael T. Goodrich: Communication-Efficient Parallel Sorting. SIAM J. Comput. 29(2): 416-432 (1999)

Michael T. Goodrich, Mark Handy, Benoît Hudson, Roberto Tamassia: Accessing the Internal Organization of Data Structures in the JDSL Library. ALENEX 1999: 124-139

Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Subodh Kumar, Mihai Pop: Efficient Perspective-Accurate Silhouette Computation. Symposium on Computational Geometry 1999: 417-418

C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Drawing Planar Graphs with Circular Arcs. Graph Drawing 1999: 117-126

Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Planarity-Preserving Clustering and Embedding for Large Planar Graphs. Graph Drawing 1999: 186-196

Michael T. Goodrich, Roberto Tamassia: Using randomization in the teaching of data structures and algorithms. SIGCSE 1999: 53-57

Ryan Shaun Baker, Michael Boilen, Michael T. Goodrich, Roberto Tamassia, B. Aaron Stibel: Testers and visualizers for teaching data structures. SIGCSE 1999: 261-265

Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees. SODA 1999: 300-309

Michael T. Goodrich, John G. Kloss II: Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences. WADS 1999: 205-216

Michael T. Goodrich, Catherine C. McGeoch (Eds.): Algorithm Engineering and Experimentation, International Workshop ALENEX '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers. Lecture Notes in Computer Science 1619, Springer 1999, isbn 3-540-66227-8

Michael T. Goodrich, Roberto Tamassia: Data structures and algorithms in Java. World wide series in computer science, Wiley 1998, isbn 978-0-471-19308-1, pp. I-XVIII, 1-738

Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich: Offset-polygon annulus placement problems. Comput. Geom. 11(3-4): 125-141 (1998)

Michael T. Goodrich: An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction. Int. J. Comput. Geometry Appl. 8(1): 1-24 (1998)

Michael T. Goodrich, Roberto Tamassia: Dynamic Trees and Dynamic Point Location. SIAM J. Comput. 28(2): 612-636 (1998)

Gill Barequet, Michael T. Goodrich: Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. Symposium on Computational Geometry 1998: 317-326

Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs. Graph Drawing 1998: 111-124

Michael T. Goodrich, Christopher G. Wagner: A Framework for Drawing Planar Graphs with Curves and Polylines. Graph Drawing 1998: 153-166

Michael T. Goodrich, Roberto Tamassia: Teaching the analysis of algorithms with visual proofs. SIGCSE 1998: 207-211

Natasha Gelfand, Michael T. Goodrich, Roberto Tamassia: Teaching data structure design patterns. SIGCSE 1998: 331-335

L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets: Geometric Pattern Matching Under Euclidean Motion. Comput. Geom. 7: 113-124 (1997)

Mujtaba R. Ghouse, Michael T. Goodrich: Fast Randomized Parallel Methods for Planar Convex Hull Construction. Comput. Geom. 7: 219-235 (1997)

Gautam Das, Michael T. Goodrich: On the Complexity of Optimization Problems for 3-dimensional Convex Polyhedra and Decision Trees. Comput. Geom. 8: 123-137 (1997)

Michael T. Goodrich, Edgar A. Ramos: Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming. Discrete & Computational Geometry 18(4): 397-420 (1997)

Michael T. Goodrich, Roberto Tamassia: Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations. J. Algorithms 23(1): 51-73 (1997)

Michael T. Goodrich, Leonidas J. Guibas, John Hershberger, Paul J. Tanenbaum: Snap Rounding Line Segments Efficiently in Two and Three Dimensions. Symposium on Computational Geometry 1997: 284-293

Gill Barequet, Stina S. Bridgeman, Christian A. Duncan, Michael T. Goodrich, Roberto Tamassia: Classical Computational Geometry in GeomNet. Symposium on Computational Geometry 1997: 412-414

Gill Barequet, Amy J. Briggs, Matthew Dickerson, Cristian Dima, Michael T. Goodrich: Animating the Polygon-Offset Distance Function. Symposium on Computational Geometry 1997: 479-480

Christian A. Duncan, Michael T. Goodrich, Edgar A. Ramos: Efficient Approximation and Optimization Algorithms for Computational Metrology. SODA 1997: 121-130

Michael T. Goodrich, Mark W. Orletsky, Kumar Ramaiyer: Methods for Achieving Fast Query Times in Point Location Data Structures. SODA 1997: 757-766

Michael T. Goodrich: Randomized Fully-Scalable BSP Techniques for Multi-Searching and Convex Hull Construction (Preliminary Version). SODA 1997: 767-776

Gill Barequet, Matthew Dickerson, Michael T. Goodrich: Voronoi Diagrams for Polygon-Offset Distance Functions. WADS 1997: 200-209

Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich: Offset-Polygon Annulus Placement Problems. WADS 1997: 378-391

Michael T. Goodrich, Mujtaba R. Ghouse, J. Bright: Sweep Methods for Parallel Computational Geometry. Algorithmica 15(2): 126-153 (1996)

Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott Vitter: Blocking for External Graph Searching. Algorithmica 16(2): 181-214 (1996)

Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing: A Nearly Optimal Deterministic Parallel Voroni Diagram Algorithm. Algorithmica 16(6): 569-617 (1996)

Thomas H. Cormen, Michael T. Goodrich: A Bridging Model for Parallel Computation, Communication, and I/O. ACM Comput. Surv. 28(4es): 208 (1996)

Ashim Garg, Michael T. Goodrich, Roberto Tamassia: Planar upward tree drawings with optimal area. Int. J. Comput. Geometry Appl. 6(3): 333-356 (1996)

Michael T. Goodrich, S. Rao Kosaraju: Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation. J. ACM 43(2): 331-361 (1996)

Marek Chrobak, Michael T. Goodrich, Roberto Tamassia: Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version). Symposium on Computational Geometry 1996: 319-328

Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia: Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. Graph Drawing 1996: 63-75

Michael T. Goodrich: Fixed-Dimensional Parallel Linesr Programming via epsilon-Relative-Approximations. SODA 1996: 132-141

Michael T. Goodrich: Communication-Efficient Parallel Sorting (Preliminary Version). STOC 1996: 247-256

Michael T. Goodrich: Efficient Piecewise-Linear Function Approximation Using the Uniform Metric. Discrete & Computational Geometry 14(4): 445-462 (1995)

Hervé Brönnimann, Michael T. Goodrich: Almost Optimal Set Covers in Finite VC-Dimension. Discrete & Computational Geometry 14(4): 463-479 (1995)

Michael T. Goodrich: Planar Separators and Parallel Polygon Triangulation. J. Comput. Syst. Sci. 51(3): 374-389 (1995)

Yi-Jen Chiang, Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, Jeffrey Scott Vitter: External-Memory Graph Algorithms. SODA 1995: 139-149

Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos: Computing faces in segment and simplex arrangements (Preliminary Version). STOC 1995: 672-682

Gautam Das, Michael T. Goodrich: On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version). WADS 1995: 74-85

Paul B. Callahan, Michael T. Goodrich, Kumar Ramaiyer: Topology B-Trees and Their Applications. WADS 1995: 381-392

Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju: Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. J. ACM 41(6): 1049-1088 (1994)

Michael T. Goodrich, Joseph S. B. Mitchell, Mark W. Orletsky: Practical Methods for Approximate Geometric Pattern Matching Under Rigid Motions (Preliminary Version). Symposium on Computational Geometry 1994: 103-112

Mikhail J. Atallah, Michael T. Goodrich, Kumar Ramaiyer: Biased Finger Trees and Three-Dimensional Layers of Maxima (Preliminary Version). Symposium on Computational Geometry 1994: 150-159

Hervé Brönnimann, Michael T. Goodrich: Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version). Symposium on Computational Geometry 1994: 293-302

Michael T. Goodrich: Efficient Piecewise-Linear Function Approximation Using the Uniform Metric (Preliminary Version). Symposium on Computational Geometry 1994: 322-331

Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos: Parallel Algorithms for Higher-Dimensional Convex Hulls. FOCS 1994: 683-694

Paul J. Tanenbaum, Michael T. Goodrich, Edward R. Scheinerman: Characterization and Recognition of Point-Halfspace and Related Orders. Graph Drawing 1994: 234-245

Michael T. Goodrich, Yossi Matias, Uzi Vishkin: Optimal Parallel Approximation for Prefix Sums and Integer Sorting. SODA 1994: 241-250

Frank Thomson Leighton, Michael T. Goodrich (Eds.): Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada. ACM 1994, isbn 0-89791-663-8

Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap: Constructing the Voronoi Diagram of a Set of Line Segments in Parallel. Algorithmica 9(2): 128-141 (1993)

Michael T. Goodrich, Steven B. Shauck, Sumanta Guha: An Addendum to Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons. Algorithmica 9(5): 515-516 (1993)

Michael T. Goodrich: Constructing Arrangement Optimally in Parallel. Discrete & Computational Geometry 9: 371-385 (1993)

Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars: Output-Sensitive Methods for Rectilinear Hidden Surface Removal. Inf. Comput. 107(1): 1-24 (1993)

Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich: P-complete geometric problems. Int. J. Comput. Geometry Appl. 3(4): 443-462 (1993)

L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets: Geometric Pattern Matching Under Euclidean Motion. CCCG 1993: 151-156

Michael T. Goodrich: Geometric Partitioning Made Easier, Even in Parallel. Symposium on Computational Geometry 1993: 73-82

Michael T. Goodrich, Roberto Tamassia: Dynamic Ray Shooting and Shortest Paths Via Balanced Geodesic Triangulations. Symposium on Computational Geometry 1993: 318-327

Ashim Garg, Michael T. Goodrich, Roberto Tamassia: Area-Efficient Upward Tree Drawings. Symposium on Computational Geometry 1993: 359-368

Michael T. Goodrich, Jyh-Jong Tsay, Darren Erik Vengroff, Jeffrey Scott Vitter: External-Memory Computational Geometry (Preliminary Version). FOCS 1993: 714-723

Michael T. Goodrich, Yossi Matias, Uzi Vishkin: Approximate Parallel Prefix Computation and its Applications. IPPS 1993: 318-325

Mujtaba R. Ghouse, Michael T. Goodrich: Experimental Evidence for the Power of Random Samplings in Practical Parallel Algorithms. IPPS 1993: 549-556

Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott Vitter: Blocking for External Graph Searching. PODS 1993: 222-232

Esther M. Arkin, Michael T. Goodrich, Joseph S. B. Mitchell, David M. Mount, Christine D. Piatko, Steven Skiena: Point Probe Decision Trees for Geometric Concept Classes. WADS 1993: 95-106

Richard Cole, Michael T. Goodrich: Optimal Parallel Algorithms for Point-Set and Polygon Problems. Algorithmica 7(1): 3-23 (1992)

Michael T. Goodrich, Steven B. Shauck, Sumanta Guha: Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons. Algorithmica 8(5&6): 461-486 (1992)

Michael T. Goodrich: Constructing the Convex Hull of a Partially Sorted Set of Points. Comput. Geom. 2: 267-278 (1992)

Michael T. Goodrich: A polygonal approach to hidden-line and hidden-surface elimination. CVGIP: Graphical Model and Image Processing 54(1): 1-12 (1992)

Michael T. Goodrich: Planar Separators and Parallel Polygon Triangulation (Preliminary Version). STOC 1992: 507-516

Michael T. Goodrich: Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors. SIAM J. Comput. 20(4): 737-755 (1991)

John K. Johnstone, Michael T. Goodrich: A localized method for intersecting plane algebraic curve segments. The Visual Computer 7(2): 60-71 (1991)

Michael T. Goodrich: Using Approximation Algorithms to Design Parallel Algorithms that May Ignore Processor Allocation (Preliminary Version). FOCS 1991: 711-722

Michael T. Goodrich: Constructing Arrangements Optimally in Parallel (Preliminary Version). SPAA 1991: 169-179

Mujtaba R. Ghouse, Michael T. Goodrich: In-Place Techniques for Parallel Convex Hull Algorithms (Preliminary Version). SPAA 1991: 192-203

Michael T. Goodrich, Roberto Tamassia: Dynamic Trees and Dynamic Point Location (Preliminary Version). STOC 1991: 523-533

Michael T. Goodrich, Jack Snoeyink: Stabbing Parallel Segments with a Convex Polygon. Computer Vision, Graphics, and Image Processing 49(2): 152-170 (1990)

Michael T. Goodrich, Mikhail J. Atallah: On Performing Robust Order Statistics in Tree-Structured Dictionary Machines. J. Parallel Distrib. Comput. 9(1): 69-76 (1990)

Michael T. Goodrich, Steven B. Shauck, Sumanta Guha: Parallel Methods for Visibility and Shortest Path Problems in Simple Polygons (Preliminary Version). Symposium on Computational Geometry 1990: 73-82

Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing: Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version). ICALP 1990: 432-445

Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars: An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version). ICALP 1990: 689-702

Michael T. Goodrich: Applying Parallel Processing Techniques to Classification Problems in Constructive Solid Geometry. SODA 1990: 118-128

Michael T. Goodrich, Mujtaba R. Ghouse, J. Bright: Generalized Sweep Methods for Parallel Computational Geometry. SPAA 1990: 280-289

Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich: P-Complete Geometric Problems. SPAA 1990: 317-326

Michael T. Goodrich: Triangulating a Polygon in Parallel. J. Algorithms 10(3): 327-351 (1989)

Mikhail J. Atallah, Richard Cole, Michael T. Goodrich: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms. SIAM J. Comput. 18(3): 499-532 (1989)

Michael T. Goodrich, S. Rao Kosaraju: Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation (Preliminary Version). FOCS 1989: 190-195

Michael T. Goodrich: Intersecting Line Segments in Parallel With an Output-Sensitive Number of Processors. SPAA 1989: 127-137

Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap: Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version). WADS 1989: 12-23

Michael T. Goodrich, Jack Snoeyink: Stabbing Parallel Segments with a Convex Polygon (Extended Abstract). WADS 1989: 231-242

Mikhail J. Atallah, Michael T. Goodrich: Parallel Algorithms for Some Functions of two Convex Polygons. Algorithmica 3: 535-548 (1988)

Hossam A. ElGindy, Michael T. Goodrich: Parallel algorithms for shortest path problems in polygons. The Visual Computer 3(6): 371-378 (1988)

Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju: Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. AWOC 1988: 1-10

Richard Cole, Michael T. Goodrich: Optimal Parallel Algorithms for Polygon and Point-Set Problems. Symposium on Computational Geometry 1988: 201-210

Michael T. Goodrich: Finding the Convex Hull of a Sorted Point Set in Parallel. Inf. Process. Lett. 26(4): 173-179 (1987)

Mikhail J. Atallah, Richard Cole, Michael T. Goodrich: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms. FOCS 1987: 151-160

Mikhail J. Atallah, Michael T. Goodrich: Efficient Parallel Solutions to Some Geometric Problems. J. Parallel Distrib. Comput. 3(4): 492-507 (1986)

Mikhail J. Atallah, Michael T. Goodrich: Efficient Plane Sweeping in Parallel. Symposium on Computational Geometry 1986: 216-225

Mikhail J. Atallah, Michael T. Goodrich: Efficient Parallel Solutions to Geometric Problems. ICPP 1985: 411-417