default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael T. Goodrich
Person information
- affiliation: University of California, Irvine, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j101]Michael B. Dillencourt, Michael T. Goodrich
, Michael Mitzenmacher:
Leveraging parameterized Chernoff bounds for simplified algorithm analyses. Inf. Process. Lett. 187: 106516 (2025)- 2024
- [j100]Michael A. Bender, Martín Farach-Colton, Michael T. Goodrich, Hanna Komlós:
History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures. Proc. ACM Manag. Data 2(2): 108 (2024) - [c233]David Eppstein, Michael T. Goodrich, Abraham M. Illickan:
Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature. GD 2024: 39:1-39:17 - [c232]Alvin Chiu, Ahmed Eldawy, Michael T. Goodrich:
Polygonally Anchored Graph Drawing (Poster Abstract). GD 2024: 52:1-52:3 - [i116]Ofek Gila, Evrim Ozel, Michael T. Goodrich:
Highway Preferential Attachment Models for Geographic Routing. CoRR abs/2403.08105 (2024) - [i115]Michael T. Goodrich, Ryuto Kitagawa:
Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm. CoRR abs/2409.19784 (2024) - 2023
- [j99]Pratibha Choudhary, Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias, Venkatesh Raman:
Improved kernels for tracking paths. Inf. Process. Lett. 181: 106360 (2023) - [j98]Michael B. Dillencourt, Michael T. Goodrich:
Simplified Chernoff bounds with powers-of-two probabilities. Inf. Process. Lett. 182: 106397 (2023) - [j97]Shanshan Han, Vishal Chakraborty, Michael T. Goodrich, Sharad Mehrotra, Shantanu Sharma:
Veil: A Storage and Communication Efficient Volume-Hiding Algorithm. Proc. ACM Manag. Data 1(4): 265:1-265:27 (2023) - [j96]Marina Blanton, Michael T. Goodrich, Chen Yuan:
Secure and Accurate Summation of Many Floating-Point Numbers. Proc. Priv. Enhancing Technol. 2023(3): 432-445 (2023) - [c231]Ofek Gila, Evrim Ozel, Michael T. Goodrich:
Highway Preferential Attachment Models for Geographic Routing. COCOA (2) 2023: 56-80 - [c230]Alvin Chiu, David Eppstein, Michael T. Goodrich:
Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs. GD (2) 2023: 141-149 - [c229]Michael T. Goodrich, Riko Jacob:
Optimal Parallel Sorting with Comparison Errors. SPAA 2023: 355-365 - [c228]Ofek Gila, Michael T. Goodrich, Robert E. Tarjan:
Zip-Zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent. WADS 2023: 474-492 - [c227]Michael T. Goodrich, Evrim Ozel:
External-Memory Sorting with Comparison Errors. WADS 2023: 493-506 - [c226]Ramtin Afshar, Michael B. Dillencourt, Michael T. Goodrich, Evrim Ozel:
Noisy Sorting Without Searching: Data Oblivious Sorting with Comparison Errors. SEA 2023: 8:1-8:18 - [i114]Ofek Gila, Michael T. Goodrich, Robert E. Tarjan:
Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent. CoRR abs/2307.07660 (2023) - [i113]Shion Fukuzawa, Michael T. Goodrich, Sandy Irani:
Quantum Tutte Embeddings. CoRR abs/2307.08851 (2023) - [i112]Alvin Chiu, David Eppstein, Michael T. Goodrich:
Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs. CoRR abs/2307.10527 (2023) - [i111]Shanshan Han, Vishal Chakraborty, Michael T. Goodrich, Sharad Mehrotra, Shantanu Sharma:
Hiding Access-pattern is Not Enough! Veil: A Storage and Communication Efficient Volume-Hiding Algorithm. CoRR abs/2310.12491 (2023) - [i110]Alvin Chiu, Mithun Ghosh, Abu Reyan Ahmed, Kwang-Sung Jun, Stephen G. Kobourov, Michael T. Goodrich:
Graph Sparsifications using Neural Network Assisted Monte Carlo Tree Search. CoRR abs/2311.10316 (2023) - [i109]Marina Blanton, Michael T. Goodrich, Chen Yuan:
Secure and Accurate Summation of Many Floating-Point Numbers. CoRR abs/2312.10247 (2023) - 2022
- [c225]Gill Barequet, Shion Fukuzawa, Michael T. Goodrich, David M. Mount, Martha C. Osegueda, Evrim Ozel:
Optimally Confining Lattice Polymers. CCCG 2022: 24-15 - [c224]Michael T. Goodrich, Evrim Ozel:
Modeling the small-world phenomenon with road networks. SIGSPATIAL/GIS 2022: 46:1-46:10 - [c223]Ramtin Afshar, Michael T. Goodrich:
Exact Learning of Multitrees and Almost-Trees Using Path Queries. LATIN 2022: 293-311 - [c222]Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda:
Mapping Networks via Parallel kth-Hop Traceroute Queries. STACS 2022: 4:1-4:21 - [c221]Ramtin Afshar, Michael T. Goodrich, Evrim Ozel:
Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees. SEA 2022: 9:1-9:18 - [i108]Ramtin Afshar, Michael T. Goodrich:
Exact Learning of Multitrees and Almost-Trees Using Path Queries. CoRR abs/2208.04216 (2022) - [i107]Gill Barequet, Shion Fukuzawa, Michael T. Goodrich, David M. Mount, Martha C. Osegueda, Evrim Ozel:
Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching. CoRR abs/2208.05597 (2022) - [i106]Michael T. Goodrich, Evrim Ozel:
Modeling the Small-World Phenomenon with Road Networks. CoRR abs/2209.09888 (2022) - 2021
- [j95]Gill Barequet, Minati De, Michael T. Goodrich:
Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons. Algorithmica 83(7): 2245-2272 (2021) - [j94]Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta:
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. Algorithmica 83(8): 2471-2502 (2021) - [j93]William E. Devanny, Michael T. Goodrich, Sandy Irani:
A competitive analysis for the Start-Gap algorithm for online memory wear leveling. Inf. Process. Lett. 166: 106042 (2021) - [c220]Michael T. Goodrich, Riko Jacob, Nodari Sitchinava:
Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model. SODA 2021: 2141-2153 - [c219]Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda:
Parallel Network Mapping Algorithms. SPAA 2021: 410-413 - [c218]Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias:
How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths. WADS 2021: 442-456 - [i105]Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias:
How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths. CoRR abs/2104.12337 (2021) - 2020
- [j92]Gill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano:
Stable-matching Voronoi diagrams: Combinatorial complexity and algorithms. J. Comput. Geom. 11(1): 26-59 (2020) - [c217]Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda:
Reconstructing Biological and Digital Phylogenetic Trees in Parallel. ESA 2020: 3:1-3:24 - [c216]Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda:
Reconstructing Binary Trees in Parallel. SPAA 2020: 491-492 - [c215]Ramtin Afshar, Amihood Amir, Michael T. Goodrich, Pedro Matias:
Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction. SPIRE 2020: 155-174 - [i104]Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda:
Reconstructing Biological and Digital Phylogenetic Trees in Parallel. CoRR abs/2006.15259 (2020) - [i103]Ramtin Afshar, Amihood Amir, Michael T. Goodrich, Pedro Matias:
Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors, and Jumbled-Index Queries in String Reconstruction. CoRR abs/2007.08787 (2020)
2010 – 2019
- 2019
- [c214]Juan José Besa Vial, Michael T. Goodrich, Timothy Johnson, Martha C. Osegueda:
Minimum-Width Drawings of Phylogenetic Trees. COCOA 2019: 39-55 - [c213]Juan José Besa Vial, Giordano Da Lozzo, Michael T. Goodrich:
Computing k-Modal Embeddings of Planar Digraphs. ESA 2019: 19:1-19:16 - [c212]Nil Mamano, Alon Efrat, David Eppstein, Daniel Frishberg, Michael T. Goodrich, Stephen G. Kobourov, Pedro Matias, Valentin Polishchuk:
New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs. ISAAC 2019: 51:1-51:21 - [c211]David Eppstein, Michael T. Goodrich, James A. Liu, Pedro Matias:
Tracking Paths in Planar Graphs. ISAAC 2019: 54:1-54:17 - [c210]Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta:
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. IPEC 2019: 9:1-9:17 - [i102]Alon Efrat, David Eppstein, Daniel Frishberg, Michael T. Goodrich, Stephen G. Kobourov, Nil Mamano, Pedro Matias, Valentin Polishchuk:
Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains. CoRR abs/1902.06875 (2019) - [i101]Juan José Besa Vial, Giordano Da Lozzo, Michael T. Goodrich:
Computing k-Modal Embeddings of Planar Digraphs. CoRR abs/1907.01630 (2019) - [i100]David Eppstein, Michael T. Goodrich, James A. Liu, Pedro Matias:
Tracking Paths in Planar Graphs. CoRR abs/1908.05445 (2019) - [i99]Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta:
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. CoRR abs/1910.02057 (2019) - [i98]Marco Liang, Michael T. Goodrich, Shuang Zhao:
On the Optical Accuracy of the Salvator Mundi. CoRR abs/1912.03416 (2019) - 2018
- [j91]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg:
Planar and poly-arc Lombardi drawings. J. Comput. Geom. 9(1): 328-355 (2018) - [c209]Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson:
Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. ALENEX 2018: 87-96 - [c208]Michael T. Goodrich, Timothy Johnson:
Low Ply Drawings of Trees and 2-Trees. CCCG 2018: 2-10 - [c207]David Eppstein, Michael T. Goodrich, Jordan Jorgensen, Manuel R. Torres:
Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching. CCCG 2018: 98-113 - [c206]Michael T. Goodrich:
Isogrammic-Fusion ORAM: Improved Statistically Secure Privacy-Preserving Cloud Data Access for Thin Clients. AsiaCCS 2018: 699-706 - [c205]Gill Barequet, Minati De, Michael T. Goodrich:
Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons. COCOON 2018: 130-142 - [c204]Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson:
Optimally Sorting Evolving Data. ICALP 2018: 81:1-81:13 - [c203]Gill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano:
Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms. ICALP 2018: 89:1-89:14 - [c202]David Eppstein, Michael T. Goodrich, Nil Mamano:
Reactive Proximity Data Structures for Graphs. LATIN 2018: 777-789 - [c201]Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta:
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. WG 2018: 111-124 - [i97]David Eppstein, Michael T. Goodrich, Nil Mamano:
Reactive Proximity Data Structures for Graphs. CoRR abs/1803.04555 (2018) - [i96]Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta:
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. CoRR abs/1803.05465 (2018) - [i95]Gill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano:
Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms. CoRR abs/1804.09411 (2018) - [i94]Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson:
Optimally Sorting Evolving Data. CoRR abs/1805.03350 (2018) - [i93]Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson:
Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. CoRR abs/1805.05443 (2018) - [i92]David Eppstein, Michael T. Goodrich, Jordan Jorgensen, Manuel R. Torres:
Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching. CoRR abs/1808.00561 (2018) - [i91]Michael T. Goodrich, Timothy Johnson:
Low Ply Drawings of Trees and 2-Trees. CoRR abs/1808.03139 (2018) - 2017
- [c200]Giuseppe Ateniese, Michael T. Goodrich, Vassilios Lekakis, Charalampos Papamanthou, Evripidis Paraskevas, Roberto Tamassia:
Accountable Storage. ACNS 2017: 623-644 - [c199]William E. Devanny, Jeremy T. Fineman, Michael T. Goodrich, Tsvi Kopelowitz:
The Online House Numbering Problem: Min-Max Online List Labeling. ESA 2017: 33:1-33:15 - [c198]Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia:
Auditable Data Structures. EuroS&P 2017: 285-300 - [c197]David Eppstein, Michael T. Goodrich, Doruk Korkmaz, Nil Mamano:
Defining Equitable Geographic Districts in Road Networks via Stable Matching. SIGSPATIAL/GIS 2017: 52:1-52:4 - [c196]Michael T. Goodrich:
Answering Spatial Multiple-Set Intersection Queries Using 2-3 Cuckoo Hash-Filters. SIGSPATIAL/GIS 2017: 65:1-65:4 - [c195]David Eppstein, Michael T. Goodrich, Nil Mamano:
Algorithms for Stable Matching and Clustering in a Grid. IWCIA 2017: 117-131 - [c194]David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Manuel R. Torres:
2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection. PODS 2017: 247-260 - [c193]David Eppstein, Michael T. Goodrich:
Brief Announcement: Using Multi-Level Parallelism and 2-3 Cuckoo Filters for Set Intersection Queries and Sparse Boolean Matrix Multiplication. SPAA 2017: 137-139 - [c192]Michael T. Goodrich:
BIOS ORAM: Improved Privacy-Preserving Data Access for Parameterized Outsourced Storage. WPES@CCS 2017: 41-50 - [i90]Fattaneh Bayatbabolghani, Marina Blanton, Mehrdad Aliasgari, Michael T. Goodrich:
Secure Fingerprint Alignment and Matching Protocols. CoRR abs/1702.03379 (2017) - [i89]David Eppstein, Michael T. Goodrich, Nil Mamano:
Algorithms for Stable Matching and Clustering in a Grid. CoRR abs/1704.02303 (2017) - [i88]David Eppstein, Michael T. Goodrich, Doruk Korkmaz, Nil Mamano:
Defining Equitable Geographic Districts in Road Networks via Stable Matching. CoRR abs/1706.09593 (2017) - [i87]Michael T. Goodrich:
Answering Spatial Multiple-Set Intersection Queries Using 2-3 Cuckoo Hash-Filters. CoRR abs/1708.09059 (2017) - [i86]Michael T. Goodrich:
BIOS ORAM: Improved Privacy-Preserving Data Access for Parameterized Outsourced Storage. CoRR abs/1709.06534 (2017) - 2016
- [c191]Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich:
Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection. ATMOS 2016: 5:1-5:14 - [c190]Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia:
More Practical and Secure History-Independent Hash Tables. ESORICS (2) 2016: 20-38 - [c189]Michael T. Goodrich, Siddharth Gupta, Manuel R. Torres:
A topological algorithm for determining how road networks evolve over time. SIGSPATIAL/GIS 2016: 31:1-31:10 - [c188]David Eppstein, Michael T. Goodrich, Jenny Lam, Nil Mamano, Michael Mitzenmacher, Manuel R. Torres:
Models and Algorithms for Graph Watermarking. ISC 2016: 283-301 - [c187]Esha Ghosh, Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia:
Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees. SCN 2016: 216-236 - [c186]Michael T. Goodrich, Ahmed Eldawy:
Parallel Algorithms for Summing Floating-Point Numbers. SPAA 2016: 13-22 - [c185]William E. Devanny, Michael T. Goodrich, Kristopher Jetviroj:
Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis. SPAA 2016: 265-274 - [c184]Md. Jawaherul Alam, Michael T. Goodrich, Timothy Johnson:
J-Viz: Finding algorithmic complexity attacks via graph visualization of Java bytecode. VizSEC 2016: 1-8 - [e4]Michael T. Goodrich, Michael Mitzenmacher:
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016. SIAM 2016, ISBN 978-1-61197-431-7 [contents] - [i85]William E. Devanny, Michael T. Goodrich, Kristopher Jetviroj:
Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis. CoRR abs/1605.03643 (2016) - [i84]Michael T. Goodrich, Ahmed Eldawy:
Parallel Algorithms for Summing Floating-Point Numbers. CoRR abs/1605.05436 (2016) - [i83]David Eppstein, Michael T. Goodrich, Jenny Lam, Nil Mamano, Michael Mitzenmacher, Manuel R. Torres:
Models and Algorithms for Graph Watermarking. CoRR abs/1605.09425 (2016) - [i82]Md. Jawaherul Alam, Michael B. Dillencourt, Michael T. Goodrich:
Capturing Lombardi Flow in Orthogonal Drawings by Minimizing the Number of Segments. CoRR abs/1608.03943 (2016) - [i81]Md. Jawaherul Alam, Michael T. Goodrich, Timothy Johnson:
J-Viz: Sibling-First Recursive Graph Drawing for Visualizing Java Bytecode. CoRR abs/1608.08970 (2016) - [i80]Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich:
Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection. CoRR abs/1609.04512 (2016) - [i79]Michael T. Goodrich, Siddharth Gupta, Manuel R. Torres:
A Topological Algorithm for Determining How Road Networks Evolve Over Time. CoRR abs/1609.07239 (2016) - [i78]Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia:
More Practical and Secure History-Independent Hash Tables. IACR Cryptol. ePrint Arch. 2016: 134 (2016) - [i77]Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia:
Auditable Data Structures. IACR Cryptol. ePrint Arch. 2016: 755 (2016) - 2015
- [j90]Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich:
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. J. Graph Algorithms Appl. 19(2): 619-656 (2015) - [c183]Michael T. Goodrich, Timothy Johnson, Manuel R. Torres:
Knuthian Drawings of Series-Parallel Flowcharts. GD 2015: 556-557 - [i76]Michael T. Goodrich, Timothy Johnson, Manuel R. Torres:
Knuthian Drawings of Series-Parallel Flowcharts. CoRR abs/1508.03931 (2015) - [i75]Esha Ghosh, Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia:
Fully-Dynamic Verifiable Zero-Knowledge Order Queries for Network Data. IACR Cryptol. ePrint Arch. 2015: 283 (2015) - 2014
- [j89]Michael T. Goodrich:
Spin-the-Bottle Sort and Annealing Sort: Oblivious Sorting via Round-Robin Random Comparisons. Algorithmica 68(4): 835-858 (2014) - [c182]Michael J. Bannister, William E. Devanny, Michael T. Goodrich, Joseph A. Simons, Lowell Trott:
Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets. CCCG 2014 - [c181]Michael T. Goodrich, Joseph A. Simons:
Data-Oblivious Graph Algorithms in Outsourced External Memory. COCOA 2014: 241-257 - [c180]Md. Jawaherul Alam, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Sergey Pupyrev:
Balanced Circle Packings for Planar Graphs. GD 2014: 125-136 - [c179]Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich:
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. GD 2014: 149-161 - [c178]Michael T. Goodrich, Pawel Pszona:
Two-phase bicriterion search for finding fast and efficient electric vehicle routes. SIGSPATIAL/GIS 2014: 193-202 - [c177]Olga Ohrimenko, Michael T. Goodrich, Roberto Tamassia, Eli Upfal:
The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. ICALP (2) 2014: 556-567 - [c176]Michael T. Goodrich:
Zig-zag sort: a simple deterministic data-oblivious sorting algorithm running in O(n log n) time. STOC 2014: 684-693 - [c175]David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Pawel Pszona:
Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket. SEA 2014: 162-173 - [i74]Olga Ohrimenko, Michael T. Goodrich, Roberto Tamassia, Eli Upfal:
The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. CoRR abs/1402.5524 (2014) - [i73]Michael T. Goodrich:
Zig-zag Sort: A Simple Deterministic Data-Oblivious Sorting Algorithm Running in O(n log n) Time. CoRR abs/1403.2777 (2014) - [i72]David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Pawel Pszona:
Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket. CoRR abs/1404.0286 (2014) - [i71]Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich:
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. CoRR abs/1408.1422 (2014) - [i70]Md. Jawaherul Alam, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Sergey Pupyrev:
Balanced Circle Packings for Planar Graphs. CoRR abs/1408.4902 (2014) - [i69]Michael T. Goodrich, Joseph A. Simons:
Data-Oblivious Graph Algorithms in Outsourced External Memory. CoRR abs/1409.0597 (2014) - [i68]Michael T. Goodrich, Pawel Pszona:
Two-Phase Bicriterion Search for Finding Fast and Efficient Electric Vehicle Routes. CoRR abs/1409.3192 (2014) - [i67]Michael J. Bannister, William E. Devanny, Michael T. Goodrich, Joseph A. Simons, Lowell Trott:
Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets. CoRR abs/1409.5452 (2014) - [i66]Giuseppe Ateniese, Michael T. Goodrich, Vassilios Lekakis, Charalampos Papamanthou, Evripidis Paraskevas, Roberto Tamassia:
Accountable Storage. IACR Cryptol. ePrint Arch. 2014: 886 (2014) - 2013
- [j88]Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler:
External-Memory Multimaps. Algorithmica 67(1): 23-48 (2013) - [j87]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg:
Drawing Trees with Perfect Angular Resolution and Polynomial Area. Discret. Comput. Geom. 49(2): 157-182 (2013) - [j86]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. Theor. Comput. Sci. 514: 96-104 (2013) - [j85]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) - [c174]Lars Arge, Michael T. Goodrich, Freek van Walderveen:
Computing betweenness centrality in external memory. IEEE BigData 2013: 368-375 - [c173]David Eppstein, Michael T. Goodrich, Joseph A. Simons:
Set-Difference Range Queries. CCCG 2013 - [c172]Michael T. Goodrich, Pawel Pszona:
Cole's Parametric Search Technique Made Practical. CCCG 2013 - [c171]Michael T. Goodrich, Pawel Pszona:
Achieving Good Angular Resolution in 3D Arc Diagrams. GD 2013: 161-172 - [c170]Michael T. Goodrich, Pawel Pszona:
Streamed Graph Drawing and the File Maintenance Problem. GD 2013: 256-267 - [c169]David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg:
Combinatorial Pair Testing: Distinguishing Workers from Slackers. WADS 2013: 316-327 - [r5]Christian A. Duncan, Michael T. Goodrich:
Planar Orthogonal and Polyline Drawing Algorithms. Handbook of Graph Drawing and Visualization 2013: 223-246 - [i65]David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg:
Combinatorial Pair Testing: Distinguishing Workers from Slackers. CoRR abs/1305.0110 (2013) - [i64]Michael T. Goodrich, Pawel Pszona:
Cole's Parametric Search Technique Made Practical. CoRR abs/1306.3000 (2013) - [i63]David Eppstein, Michael T. Goodrich, Joseph A. Simons:
Set-Difference Range Queries. CoRR abs/1306.3482 (2013) - [i62]Michael T. Goodrich, Pawel Pszona:
Streamed Graph Drawing and the File Maintenance Problem. CoRR abs/1308.6711 (2013) - [i61]Michael T. Goodrich, Pawel Pszona:
Achieving Good Angular Resolution in 3D Arc Diagrams. CoRR abs/1308.6730 (2013) - 2012
- [j84]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) - [j83]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) - [j82]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. Proc. VLDB Endow. 5(10): 920-931 (2012) - [j81]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) - [j80]Michael T. Goodrich:
Learning Character Strings via Mastermind Queries, With a Case Study Involving mtDNA. IEEE Trans. Inf. Theory 58(11): 6726-6736 (2012) - [c168]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia:
Practical oblivious storage. CODASPY 2012: 13-24 - [c167]Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia:
Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage. GD 2012: 43-54 - [c166]Franz-Josef Brandenburg, David Eppstein, Andreas Gleißner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber:
On the Density of Maximal 1-Planar Graphs. GD 2012: 327-338 - [c165]Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott:
Force-Directed Graph Drawing Using Social Gravity and Scaling. GD 2012: 414-425 - [c164]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. GD 2012: 569-570 - [c163]Michael T. Goodrich, Michael Mitzenmacher:
Anonymous Card Shuffling and Its Applications to Parallel Mixnets. ICALP (2) 2012: 549-560 - [c162]Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler:
Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability. MedAlg 2012: 203-218 - [c161]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia:
Privacy-preserving group data access via stateless oblivious RAM simulation. SODA 2012: 157-167 - [i60]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) - [i59]Michael T. Goodrich, Michael Mitzenmacher:
Anonymous Card Shuffling and its Applications to Parallel Mixnets. CoRR abs/1205.1579 (2012) - [i58]Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott:
Force-Directed Graph Drawing Using Social Gravity and Scaling. CoRR abs/1209.0748 (2012) - [i57]Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia:
Data-Oblivious Graph Drawing Model and Algorithms. CoRR abs/1209.0756 (2012) - 2011
- [j79]Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos:
Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems. Algorithmica 60(3): 505-552 (2011) - [j78]Michael T. Goodrich:
Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm. J. ACM 58(6): 27:1-27:26 (2011) - [j77]Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
Planar Drawings of Higher-Genus Graphs. J. Graph Algorithms Appl. 15(1): 7-32 (2011) - [j76]David Eppstein, Michael T. Goodrich:
Succinct Greedy Geometric Routing Using Hyperbolic Geometry. IEEE Trans. Computers 60(11): 1571-1580 (2011) - [j75]Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson, Ying Daisy Zhuo:
Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks. Trans. Comput. Sci. 14: 211-238 (2011) - [j74]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) - [c160]Michael T. Goodrich, Michael Mitzenmacher:
Invertible bloom lookup tables. Allerton 2011: 792-799 - [c159]Michael T. Goodrich:
Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons. ANALCO 2011: 93-106 - [c158]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 - [c157]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia:
Oblivious RAM simulation with efficient worst-case access overhead. CCSW 2011: 95-100 - [c156]Michael T. Goodrich, Florian Kerschbaum:
Privacy-enhanced reputation-feedback methods to reduce feedback extortion in online auctions. CODASPY 2011: 273-282 - [c155]Michael T. Goodrich, Pawel Pszona:
External-Memory Network Analysis Algorithms for Naturally Sparse Graphs. ESA 2011: 664-676 - [c154]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler:
Planar and Poly-arc Lombardi Drawings. GD 2011: 308-319 - [c153]Roman Chernobelskiy, Kathryn I. Cunningham, Michael T. Goodrich, Stephen G. Kobourov, Lowell Trott:
Force-Directed Lombardi-Style Graph Drawing. GD 2011: 320-331 - [c152]Michael T. Goodrich, Michael Mitzenmacher:
Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation. ICALP (2) 2011: 576-587 - [c151]Michael T. Goodrich, Joseph A. Simons:
Fully Retroactive Approximate Range and Nearest Neighbor Searching. ISAAC 2011: 292-301 - [c150]Michael T. Goodrich, Nodari Sitchinava, Qin Zhang:
Sorting, Searching, and Simulation in the MapReduce Framework. ISAAC 2011: 374-383 - [c149]Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler:
External-Memory Multimaps. ISAAC 2011: 384-394 - [c148]David Eppstein, Michael T. Goodrich, Frank C. Uyeda, George Varghese:
What's the difference?: efficient set reconciliation without prior context. SIGCOMM 2011: 218-229 - [c147]Michael T. Goodrich, Michael Mitzenmacher:
Brief announcement: large-scale multimaps. SPAA 2011: 259-260 - [c146]Michael T. Goodrich:
Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data. SPAA 2011: 379-388 - [c145]David Eppstein, Michael T. Goodrich, Maarten Löffler:
Tracking Moving Objects with Few Handovers. WADS 2011: 362-373 - [i56]Michael T. Goodrich, Nodari Sitchinava, Qin Zhang:
Sorting, Searching, and Simulation in the MapReduce Framework. CoRR abs/1101.1902 (2011) - [i55]Michael T. Goodrich, Michael Mitzenmacher:
Invertible Bloom Lookup Tables. CoRR abs/1101.2245 (2011) - [i54]Michael T. Goodrich, Florian Kerschbaum:
Privacy-Enhanced Reputation-Feedback Methods to Reduce Feedback Extortion in Online Auctions. CoRR abs/1102.4602 (2011) - [i53]Michael T. Goodrich:
Data-Oblivious External-Memory Algorithms for the Compaction, Selection, and Sorting of Outsourced Data. CoRR abs/1103.5102 (2011) - [i52]Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler:
External-Memory Multimaps. CoRR abs/1104.5533 (2011) - [i51]David Eppstein, Michael T. Goodrich, Maarten Löffler:
Tracking Moving Objects with Few Handovers. CoRR abs/1105.0392 (2011) - [i50]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia:
Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation. CoRR abs/1105.4125 (2011) - [i49]Michael T. Goodrich, Pawel Pszona:
External-Memory Network Analysis Algorithms for Naturally Sparse Graphs. CoRR abs/1106.6336 (2011) - [i48]David Eppstein, Michael T. Goodrich, Pierre Baldi:
Privacy-Enhanced Methods for Comparing Compressed DNA Sequences. CoRR abs/1107.3593 (2011) - [i47]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) - [i46]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia:
Oblivious RAM Simulation with Efficient Worst-Case Access Overhead. CoRR abs/1107.5093 (2011) - [i45]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) - [i44]Michael T. Goodrich, Joseph A. Simons:
Fully Retroactive Approximate Range and Nearest Neighbor Searching. CoRR abs/1109.0312 (2011) - [i43]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) - [i42]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia:
Oblivious Storage with Low I/O Overhead. CoRR abs/1110.1851 (2011) - [i41]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) - 2010
- [j73]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) - [c144]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 - [c143]David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott:
Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures. COCOA (1) 2010: 128-141 - [c142]Matthew T. Dickerson, David Eppstein, Michael T. Goodrich:
Cloning Voronoi Diagrams via Retroactive Data Structures. ESA (1) 2010: 362-373 - [c141]Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler:
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. GD 2010: 129-140 - [c140]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg:
Drawing Trees with Perfect Angular Resolution and Polynomial Area. GD 2010: 183-194 - [c139]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg:
Lombardi Drawings of Graphs. GD 2010: 195-207 - [c138]David Eppstein, Michael T. Goodrich, Roberto Tamassia:
Privacy-preserving data-oblivious geometric algorithms for geographic data. GIS 2010: 13-22 - [c137]Lars Arge, Michael T. Goodrich, Nodari Sitchinava:
Parallel external memory graph algorithms. IPDPS 2010: 1-11 - [c136]Michael T. Goodrich, Darren Strash:
Priority Range Trees. ISAAC (1) 2010: 97-108 - [c135]Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson:
Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks. ISVD 2010: 132-141 - [c134]Michael T. Goodrich:
Randomized Shellsort: A Simple Oblivious Sorting Algorithm. SODA 2010: 1262-1277 - [c133]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 - [i40]Michael T. Goodrich:
Simulating Parallel Algorithms in the MapReduce Framework with Applications to Parallel Computational Geometry. CoRR abs/1004.4708 (2010) - [i39]Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson:
Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks. CoRR abs/1005.1053 (2010) - [i38]Matthew T. Dickerson, David Eppstein, Michael T. Goodrich:
Cloning Voronoi Diagrams via Retroactive Data Structures. CoRR abs/1006.1921 (2010) - [i37]Michael T. Goodrich, Michael Mitzenmacher:
MapReduce Parallel Cuckoo Hashing and Oblivious RAM Simulations. CoRR abs/1007.1259 (2010) - [i36]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) - [i35]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg:
Lombardi Drawings of Graphs. CoRR abs/1009.0579 (2010) - [i34]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) - [i33]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) - [i32]David Eppstein, Michael T. Goodrich, Roberto Tamassia:
Privacy-Preserving Data-Oblivious Geometric Algorithms for Geographic Data. CoRR abs/1009.1904 (2010) - [i31]Michael T. Goodrich, Darren Strash:
Priority Range Trees. CoRR abs/1009.3527 (2010) - [i30]Michael T. Goodrich:
Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons. CoRR abs/1011.2480 (2010) - [i29]Arthur U. Asuncion, Michael T. Goodrich:
Nonadaptive Mastermind Algorithms for String and Vector Databases, with Case Studies. CoRR abs/1012.2509 (2010)
2000 – 2009
- 2009
- [j72]Michael T. Goodrich, Michael Sirivianos, John Solis, Claudio Soriente, Gene Tsudik, Ersin Uzun:
Using audio in secure device pairing. Int. J. Secur. Networks 4(1/2): 57-68 (2009) - [j71]Michael T. Goodrich:
On the algorithmic complexity of the Mastermind game with black-peg results. Inf. Process. Lett. 109(13): 675-678 (2009) - [j70]David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf:
Approximate topological matching of quad meshes. Vis. Comput. 25(8): 771-783 (2009) - [c132]Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
Planar Drawings of Higher-Genus Graphs. GD 2009: 45-56 - [c131]David Eppstein, Michael T. Goodrich, Lowell Trott:
Going off-road: transversal complexity in road networks. GIS 2009: 23-32 - [c130]Michael T. Goodrich, Darren Strash:
Succinct Greedy Geometric Routing in the Euclidean Plane. ISAAC 2009: 781-791 - [c129]Michael T. Goodrich, Jonathan Z. Sun, Roberto Tamassia, Nikos Triandopoulos:
Reliable Resource Searching in P2P Networks. SecureComm 2009: 437-447 - [c128]David Eppstein, Michael T. Goodrich, Darren Strash:
Linear-time algorithms for geometric graphs with sublinearly many crossings. SODA 2009: 150-159 - [c127]Michael T. Goodrich:
The Mastermind Attack on Genomic Data. SP 2009: 204-218 - [c126]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 - [i28]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) - [i27]Michael T. Goodrich:
The Mastermind Attack on Genomic Data. CoRR abs/0904.4458 (2009) - [i26]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) - [i25]Michael T. Goodrich:
On the Algorithmic Complexity of the Mastermind Game with Black-Peg Results. CoRR abs/0904.4911 (2009) - [i24]Michael T. Goodrich, Roberto Tamassia, Jasminka Hasic:
An Efficient Dynamic and Distributed RSA Accumulator. CoRR abs/0905.1307 (2009) - [i23]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) - [i22]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) - [i21]Michael T. Goodrich:
Pipelined Algorithms to Detect Cheating in Long-Term Grid Computations. CoRR abs/0906.1225 (2009) - [i20]Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
Planar Drawings of Higher-Genus Graphs. CoRR abs/0908.1608 (2009) - [i19]Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos:
Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems. CoRR abs/0908.4116 (2009) - [i18]Michael T. Goodrich:
Randomized Shellsort: A Simple Oblivious Sorting Algorithm. CoRR abs/0909.1037 (2009) - [i17]David Eppstein, Michael T. Goodrich, Lowell Trott:
Going Off-road: Transversal Complexity in Road Networks. CoRR abs/0909.2891 (2009) - 2008
- [j69]David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf:
Motorcycle Graphs: Canonical Quad Mesh Partitioning. Comput. Graph. Forum 27(5): 1477-1486 (2008) - [j68]David Eppstein, Michael T. Goodrich, Jonathan Z. Sun:
Skip Quadtrees: Dynamic Data Structures for Multidimensional Point Sets. Int. J. Comput. Geom. Appl. 18(1/2): 131-160 (2008) - [j67]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) - [j66]Michael T. Goodrich, Roberto Tamassia, Danfeng (Daphne) Yao:
Notarized federated ID management and authentication. J. Comput. Secur. 16(4): 399-418 (2008) - [j65]Michael T. Goodrich:
Pipelined algorithms to detect cheating in long-term grid computations. Theor. Comput. Sci. 408(2-3): 199-207 (2008) - [j64]Michael T. Goodrich:
Probabilistic packet marking for large-scale IP traceback. IEEE/ACM Trans. Netw. 16(1): 15-24 (2008) - [c125]Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos:
Super-Efficient Verification of Dynamic Outsourced Databases. CT-RSA 2008: 407-424 - [c124]Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman:
Straight Skeletons of Three-Dimensional Polyhedra. ESA 2008: 148-160 - [c123]David Eppstein, Michael T. Goodrich:
Succinct Greedy Graph Drawing in the Hyperbolic Plane. GD 2008: 14-25 - [c122]David Eppstein, Michael T. Goodrich:
Studying (non-planar) road networks through an algorithmic lens. GIS 2008: 16 - [c121]Matthew T. Dickerson, Michael T. Goodrich:
Two-site Voronoi diagrams in geographic networks. GIS 2008: 59 - [c120]Michael T. Goodrich, Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos:
Athos: Efficient Authentication of Outsourced File Systems. ISC 2008: 80-96 - [c119]David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf:
Approximate topological matching of quadrilateral meshes. Shape Modeling International 2008: 83-92 - [c118]Lars Arge, Michael T. Goodrich, Michael J. Nelson, Nodari Sitchinava:
Fundamental parallel algorithms for private-cache chip multiprocessors. SPAA 2008: 197-206 - [i16]Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman:
Straight Skeletons of Three-Dimensional Polyhedra. CoRR abs/0805.0022 (2008) - [i15]David Eppstein, Michael T. Goodrich:
Succinct Greedy Graph Drawing in the Hyperbolic Plane. CoRR abs/0806.0341 (2008) - [i14]David Eppstein, Michael T. Goodrich:
Studying (Non-Planar) Road Networks Through an Algorithmic Lens. CoRR abs/0808.3694 (2008) - [i13]David Eppstein, Michael T. Goodrich, Darren Strash:
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings. CoRR abs/0812.0893 (2008) - [i12]Michael T. Goodrich, Darren Strash:
Succinct Greedy Geometric Routing in R^2. CoRR abs/0812.3893 (2008) - 2007
- [j63]David Eppstein, Michael T. Goodrich, Jeremy Yu Meng:
Confluent Layered Drawings. Algorithmica 47(4): 439-452 (2007) - [j62]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) - [j61]Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich:
Deterministic sampling and range counting in geometric data streams. ACM Trans. Algorithms 3(2): 16 (2007) - [c117]David Eppstein, Michael T. Goodrich, Nodari Sitchinava:
Guard placement for efficient point-in-polygon proofs. SCG 2007: 27-36 - [c116]Michael T. Goodrich, Jonathan Z. Sun:
Checking Value-Sensitive Data Structures in Sublinear Space. ISAAC 2007: 353-364 - [c115]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 - [c114]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 - [c113]Michael T. Goodrich, Charalampos Papamanthou, Roberto Tamassia:
On the Cost of Persistence and Authentication in Skip Lists. WEA 2007: 94-107 - [r4]Michael T. Goodrich, Michael J. Nelson:
Distributed Peer-to-Peer Data Structures. Handbook of Parallel Computing 2007 - [i11]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) - 2006
- [j60]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) - [c112]Michael T. Goodrich, Roberto Tamassia, Danfeng Yao:
Notarized Federated Identity Management for Web Services. DBSec 2006: 133-147 - [c111]Michael B. Dillencourt, David Eppstein, Michael T. Goodrich:
Choosing Colors for Geometric Graphs Via Color Space Embeddings. GD 2006: 294-305 - [c110]Michael T. Goodrich, Michael Sirivianos, John Solis, Gene Tsudik, Ersin Uzun:
Loud and Clear: Human-Verifiable Authentication Based on Audio. ICDCS 2006: 10 - [c109]YounSun Cho, Lichun Bao, Michael T. Goodrich:
LAAC: A Location-Aware Access Control Protocol. MobiQuitous 2006: 1-7 - [c108]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 - [c107]Michael T. Goodrich, Daniel S. Hirschberg:
Efficient parallel algorithms for dead sensor diagnosis and multiple access channels. SPAA 2006: 118-127 - [i10]David Eppstein, Michael T. Goodrich, Nodari Sitchinava:
Guard Placement For Wireless Localization. CoRR abs/cs/0603057 (2006) - [i9]Michael B. Dillencourt, David Eppstein, Michael T. Goodrich:
Choosing Colors for Geometric Graphs via Color Space Embeddings. CoRR abs/cs/0609033 (2006) - 2005
- [j59]Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich:
Biased Skip Lists. Algorithmica 42(1): 31-48 (2005) - [j58]Gill Barequet, Prosenjit Bose, Matthew T. Dickerson, Michael T. Goodrich:
Optimizing a constrained convex polygonal annulus. J. Discrete Algorithms 3(1): 1-26 (2005) - [j57]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) - [c106]Wenliang Du, Michael T. Goodrich:
Searching for High-Value Rare Events with Uncheatable Grid Computing. ACNS 2005: 122-137 - [c105]Michael T. Goodrich, Mikhail J. Atallah, Roberto Tamassia:
Indexing Information for Data Forensics. ACNS 2005: 206-221 - [c104]Michael T. Goodrich, Roberto Tamassia, Danfeng Yao:
Accredited DomainKeys: A Service Architecture for Improved Email Validation. CEAS 2005 - [c103]David Eppstein, Michael T. Goodrich, Jonathan Z. Sun:
The skip quadtree: a simple dynamic data structure for multidimensional data. SCG 2005: 296-305 - [c102]Mikhail J. Atallah, Keith B. Frikken, Michael T. Goodrich, Roberto Tamassia:
Secure Biometric Authentication for Weak Computational Devices. Financial Cryptography 2005: 357-371 - [c101]David Eppstein, Michael T. Goodrich, Jeremy Yu Meng:
Delta-Confluent Drawings. GD 2005: 165-176 - [c100]Michael T. Goodrich, George S. Lueker, Jonathan Z. Sun:
C-Planarity of Extrovert Clustered Graphs. GD 2005: 211-222 - [c99]Lars Arge, David Eppstein, Michael T. Goodrich:
Skip-webs: efficient distributed data structures for multi-dimensional data sets. PODC 2005: 69-76 - [c98]Michael T. Goodrich:
Leap-Frog Packet Linking and Diverse Key Distributions for Improved Integrity in Network Broadcasts. S&P 2005: 196-207 - [c97]Amitabh Chaudhary, Michael T. Goodrich:
Balanced Aspect Ratio Trees Revisited. WADS 2005: 73-85 - [c96]David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg:
Improved Combinatorial Group Testing for Real-World Problem Sizes. WADS 2005: 86-98 - [i8]David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg:
Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. CoRR abs/cs/0505048 (2005) - [i7]David Eppstein, Michael T. Goodrich, Jonathan Z. Sun:
The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data. CoRR abs/cs/0507049 (2005) - [i6]Lars Arge, David Eppstein, Michael T. Goodrich:
Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets. CoRR abs/cs/0507050 (2005) - [i5]David Eppstein, Michael T. Goodrich, Jeremy Yu Meng:
Confluent Layered Drawings. CoRR abs/cs/0507051 (2005) - [i4]David Eppstein, Michael T. Goodrich, Jeremy Yu Meng:
Delta-confluent Drawings. CoRR abs/cs/0510024 (2005) - [i3]Michael T. Goodrich, Michael Sirivianos, John Solis, Gene Tsudik, Ersin Uzun:
Loud and Clear: Human-Verifiable Authentication Based on Audio. IACR Cryptol. ePrint Arch. 2005: 428 (2005) - 2004
- [b5]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 - [j56]Adam L. Buchsbaum, Michael T. Goodrich:
Three-Dimensional Layers of Maxima. Algorithmica 39(4): 275-286 (2004) - [j55]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) - [j54]Gill Barequet, Michael T. Goodrich, Aya Levi-Steiner, Dvir Steiner:
Contour interpolation by straight skeletons. Graph. Model. 66(4): 245-260 (2004) - [j53]Gill Barequet, Michael T. Goodrich, Chris Riley:
Drawing Planar Graphs with Large Vertices and Thick Edges. J. Graph Algorithms Appl. 8: 3-20 (2004) - [c95]Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich:
Deterministic sampling and range counting in geometric data streams. SCG 2004: 144-151 - [c94]Michael T. Goodrich, Jonathan Z. Sun, Roberto Tamassia:
Efficient Tree-Based Revocation in Groups of Low-State Devices. CRYPTO 2004: 511-527 - [c93]David Eppstein, Michael T. Goodrich, Jeremy Yu Meng:
Confluent Layered Drawings. GD 2004: 184-194 - [r3]Michael T. Goodrich:
Parallel algorithms in geometry. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 953-967 - [r2]Christian A. Duncan, Michael T. Goodrich:
Approximate Geometric Query Structures. Handbook of Data Structures and Applications 2004 - [r1]Michael T. Goodrich, Roberto Tamassia, Luca Vismara:
Data Structures in JDSL. Handbook of Data Structures and Applications 2004 - 2003
- [b4]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 - [j52]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) - [c92]Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos, Robert F. Cohen:
Authenticated Data Structures for Graph and Geometric Searching. CT-RSA 2003: 295-313 - [c91]Michael T. Goodrich, Michael Shin, Christian D. Straub, Roberto Tamassia:
Distributed Data Authenication (System Demonstration). DISCEX (2) 2003: 58-59 - [c90]Michael T. Goodrich, Roberto Tamassia:
Efficient and Scalable Infrastructure Support for Dynamic Coalitions. DISCEX (2) 2003: 246-251 - [c89]Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng:
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. GD 2003: 1-12 - [c88]Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel:
Selected Open Problems in Graph Drawing. GD 2003: 515-539 - [c87]Michael T. Goodrich, Michael Shin, Roberto Tamassia, William H. Winsborough:
Authenticated Dictionaries for Fresh Attribute Credentials. iTrust 2003: 332-347 - [c86]Gill Barequet, Michael T. Goodrich, Aya Levi-Steiner, Dvir Steiner:
Straight-skeleton based contour interpolation. SODA 2003: 119-127 - [c85]Gill Barequet, Michael T. Goodrich, Chris Riley:
Drawing Graphs with Large Vertices and Thick Edges. WADS 2003: 281-293 - [c84]Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Shouhuai Xu:
Constructing Disjoint Paths for Secure Communication. DISC 2003: 181-195 - [i2]Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich:
Deterministic Sampling and Range Counting in Geometric Data Streams. CoRR cs.CG/0307027 (2003) - 2002
- [b3]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 - [j51]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) - [j50]Michael T. Goodrich:
Guest Editor's Foreword. Algorithmica 33(3): 271 (2002) - [j49]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) - [c83]Michael T. Goodrich:
Efficient packet marking for large-scale IP traceback. CCS 2002: 117-126 - [c82]Adam L. Buchsbaum, Michael T. Goodrich:
Three-Dimensional Layers of Maxima. ESA 2002: 257-269 - [c81]Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich:
Biased Skip Lists. ISAAC 2002: 1-13 - [c80]Michael T. Goodrich, Roberto Tamassia, Jasminka Hasic:
An Efficient Dynamic and Distributed Cryptographic Accumulator. ISC 2002: 372-388 - [e3]Stephen G. Kobourov, Michael T. Goodrich:
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 [contents] - [i1]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) - 2001
- [j48]Gill Barequet, Matthew Dickerson, Michael T. Goodrich:
Voronoi Diagrams for Convex Polygon-Offset Distance Functions. Discret. Comput. Geom. 25(2): 271-291 (2001) - [j47]C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
Drawing Planar Graphs with Circular Arcs. Discret. Comput. Geom. 25(3): 405-418 (2001) - [j46]Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos:
A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time. Discret. Comput. Geom. 26(2): 245-265 (2001) - [j45]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) - [c79]Matthew Dickerson, Michael T. Goodrich:
Matching points to a convex polygonal boundary. CCCG 2001: 89-92 - [c78]Mihai Pop, Christian A. Duncan, Gill Barequet, Michael T. Goodrich, Wenjing Huang, Subodh Kumar:
Efficient perspective-accurate silhouette computation and applications. SCG 2001: 60-68 - [c77]Aris Anagnostopoulos, Michael T. Goodrich, Roberto Tamassia:
Persistent Authenticated Dictionaries and Their Applications. ISC 2001: 379-393 - [c76]Giuseppe Ateniese, Breno de Medeiros, Michael T. Goodrich:
TRICERT: A Distributed Certified E-Mail Scheme. NDSS 2001 - [c75]Michael T. Goodrich, Roberto Tamassia:
Teaching internet algorithmics. SIGCSE 2001: 129-133 - [c74]Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, Vijay Kumar:
Seller-Focused Algorithms for Online Auctioning. WADS 2001: 135-147 - 2000
- [j44]Michael T. Goodrich:
Editorial. Comput. Geom. 16(1): 1-2 (2000) - [j43]Michael T. Goodrich, Christopher G. Wagner:
A Framework for Drawing Planar Graphs with Curves and Polylines. J. Algorithms 37(2): 399-421 (2000) - [j42]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) - [c73]Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos:
Linear-time triangulation of a simple polygon made easier via randomization. SCG 2000: 201-212 - [c72]Adam L. Buchsbaum, Michael T. Goodrich, Jeffery R. Westbrook:
Range Searching Over Tree Cross Products. ESA 2000: 120-131 - [c71]Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich:
K-D Trees Are Better when Cut on the Longest Side. ESA 2000: 179-190 - [c70]Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov:
A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs. GD 2000: 211-221 - [c69]Stina S. Bridgeman, Michael T. Goodrich, Stephen G. Kobourov, Roberto Tamassia:
PILOT: an interactive tool for learning and grading. SIGCSE 2000: 139-143 - [c68]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 - [c67]Michael T. Goodrich:
Competitive tree-structured dictionaries. SODA 2000: 494-495 - [c66]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 - [p1]Michael T. Goodrich, Kumar Ramaiyer:
Geometric Data Structures. Handbook of Computational Geometry 2000: 463-489
1990 – 1999
- 1999
- [j41]Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Stina S. Bridgeman, Roberto Tamassia:
GeomNet: Geometric Computing Over the Internet. IEEE Internet Comput. 3(2): 21-29 (1999) - [j40]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) - [j39]Michael T. Goodrich:
Communication-Efficient Parallel Sorting. SIAM J. Comput. 29(2): 416-432 (1999) - [c65]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 - [c64]Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Subodh Kumar, Mihai Pop:
Efficient Perspective-Accurate Silhouette Computation. SCG 1999: 417-418 - [c63]C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
Drawing Planar Graphs with Circular Arcs. GD 1999: 117-126 - [c62]Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
Planarity-Preserving Clustering and Embedding for Large Planar Graphs. GD 1999: 186-196 - [c61]Michael T. Goodrich, Roberto Tamassia:
Using randomization in the teaching of data structures and algorithms. SIGCSE 1999: 53-57 - [c60]Ryan Shaun Baker, Michael Boilen, Michael T. Goodrich, Roberto Tamassia, B. Aaron Stibel:
Testers and visualizers for teaching data structures. SIGCSE 1999: 261-265 - [c59]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 - [c58]Michael T. Goodrich, John G. Kloss II:
Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences. WADS 1999: 205-216 - [e2]Michael T. Goodrich, Catherine C. McGeoch:
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 [contents] - 1998
- [b2]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 - [j38]Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich:
Offset-polygon annulus placement problems. Comput. Geom. 11(3-4): 125-141 (1998) - [j37]Michael T. Goodrich:
An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction. Int. J. Comput. Geom. Appl. 8(1): 1-24 (1998) - [j36]Michael T. Goodrich, Roberto Tamassia:
Dynamic Trees and Dynamic Point Location. SIAM J. Comput. 28(2): 612-636 (1998) - [c57]Gill Barequet, Michael T. Goodrich, Danny Z. Chen, Ovidiu Daescu, Jack Snoeyink:
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. SCG 1998: 317-326 - [c56]Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs. GD 1998: 111-124 - [c55]Michael T. Goodrich, Christopher G. Wagner:
A Framework for Drawing Planar Graphs with Curves and Polylines. GD 1998: 153-166 - [c54]Michael T. Goodrich, Roberto Tamassia:
Teaching the analysis of algorithms with visual proofs. SIGCSE 1998: 207-211 - [c53]Natasha Gelfand, Michael T. Goodrich, Roberto Tamassia:
Teaching data structure design patterns. SIGCSE 1998: 331-335 - 1997
- [j35]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) - [j34]Mujtaba R. Ghouse, Michael T. Goodrich:
Fast Randomized Parallel Methods for Planar Convex Hull Construction. Comput. Geom. 7: 219-235 (1997) - [j33]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) - [j32]Michael T. Goodrich, Edgar A. Ramos:
Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming. Discret. Comput. Geom. 18(4): 397-420 (1997) - [j31]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) - [c52]Michael T. Goodrich, Leonidas J. Guibas, John Hershberger, Paul J. Tanenbaum:
Snap Rounding Line Segments Efficiently in Two and Three Dimensions. SCG 1997: 284-293 - [c51]Gill Barequet, Stina S. Bridgeman, Christian A. Duncan, Michael T. Goodrich, Roberto Tamassia:
Classical Computational Geometry in GeomNet. SCG 1997: 412-414 - [c50]Gill Barequet, Amy J. Briggs, Matthew Dickerson, Cristian Dima, Michael T. Goodrich:
Animating the Polygon-Offset Distance Function. SCG 1997: 479-480 - [c49]Christian A. Duncan, Michael T. Goodrich, Edgar A. Ramos:
Efficient Approximation and Optimization Algorithms for Computational Metrology. SODA 1997: 121-130 - [c48]Michael T. Goodrich, Mark W. Orletsky, Kumar Ramaiyer:
Methods for Achieving Fast Query Times in Point Location Data Structures. SODA 1997: 757-766 - [c47]Michael T. Goodrich:
Randomized Fully-Scalable BSP Techniques for Multi-Searching and Convex Hull Construction (Preliminary Version). SODA 1997: 767-776 - [c46]Gill Barequet, Matthew Dickerson, Michael T. Goodrich:
Voronoi Diagrams for Polygon-Offset Distance Functions. WADS 1997: 200-209 - [c45]Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich:
Offset-Polygon Annulus Placement Problems. WADS 1997: 378-391 - 1996
- [j30]Michael T. Goodrich, Mujtaba R. Ghouse, J. Bright:
Sweep Methods for Parallel Computational Geometry. Algorithmica 15(2): 126-153 (1996) - [j29]Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott Vitter:
Blocking for External Graph Searching. Algorithmica 16(2): 181-214 (1996) - [j28]Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing:
A Nearly Optimal Deterministic Parallel Voroni Diagram Algorithm. Algorithmica 16(6): 569-617 (1996) - [j27]Thomas H. Cormen, Michael T. Goodrich:
A Bridging Model for Parallel Computation, Communication, and I/O. ACM Comput. Surv. 28(4es): 208 (1996) - [j26]Ashim Garg, Michael T. Goodrich, Roberto Tamassia:
Planar upward tree drawings with optimal area. Int. J. Comput. Geom. Appl. 6(3): 333-356 (1996) - [j25]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) - [c44]Marek Chrobak, Michael T. Goodrich, Roberto Tamassia:
Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version). SCG 1996: 319-328 - [c43]Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia:
Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. GD 1996: 63-75 - [c42]Michael T. Goodrich:
Fixed-Dimensional Parallel Linesr Programming via epsilon-Relative-Approximations. SODA 1996: 132-141 - [c41]Michael T. Goodrich:
Communication-Efficient Parallel Sorting (Preliminary Version). STOC 1996: 247-256 - 1995
- [j24]Michael T. Goodrich:
Efficient Piecewise-Linear Function Approximation Using the Uniform Metric. Discret. Comput. Geom. 14(4): 445-462 (1995) - [j23]Hervé Brönnimann, Michael T. Goodrich:
Almost Optimal Set Covers in Finite VC-Dimension. Discret. Comput. Geom. 14(4): 463-479 (1995) - [j22]Michael T. Goodrich:
Planar Separators and Parallel Polygon Triangulation. J. Comput. Syst. Sci. 51(3): 374-389 (1995) - [c40]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 - [c39]Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos:
Computing faces in segment and simplex arrangements (Preliminary Version). STOC 1995: 672-682 - [c38]Gautam Das, Michael T. Goodrich:
On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version). WADS 1995: 74-85 - [c37]Paul B. Callahan, Michael T. Goodrich, Kumar Ramaiyer:
Topology B-Trees and Their Applications. WADS 1995: 381-392 - 1994
- [j21]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) - [c36]Michael T. Goodrich, Joseph S. B. Mitchell, Mark W. Orletsky:
Practical Methods for Approximate Geometric Pattern Matching Under Rigid Motions (Preliminary Version). SCG 1994: 103-112 - [c35]Mikhail J. Atallah, Michael T. Goodrich, Kumar Ramaiyer:
Biased Finger Trees and Three-Dimensional Layers of Maxima (Preliminary Version). SCG 1994: 150-159 - [c34]Hervé Brönnimann, Michael T. Goodrich:
Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version). SCG 1994: 293-302 - [c33]Michael T. Goodrich:
Efficient Piecewise-Linear Function Approximation Using the Uniform Metric (Preliminary Version). SCG 1994: 322-331 - [c32]Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos:
Parallel Algorithms for Higher-Dimensional Convex Hulls. FOCS 1994: 683-694 - [c31]Paul J. Tanenbaum, Michael T. Goodrich, Edward R. Scheinerman:
Characterization and Recognition of Point-Halfspace and Related Orders. GD 1994: 234-245 - [c30]Michael T. Goodrich, Yossi Matias, Uzi Vishkin:
Optimal Parallel Approximation for Prefix Sums and Integer Sorting. SODA 1994: 241-250 - [e1]Frank Thomson Leighton, Michael T. Goodrich:
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 [contents] - 1993
- [j20]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) - [j19]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) - [j18]Michael T. Goodrich:
Constructing Arrangement Optimally in Parallel. Discret. Comput. Geom. 9: 371-385 (1993) - [j17]Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars:
Output-Sensitive Methods for Rectilinear Hidden Surface Removal. Inf. Comput. 107(1): 1-24 (1993) - [j16]Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich:
P-complete geometric problems. Int. J. Comput. Geom. Appl. 3(4): 443-462 (1993) - [j15]Michael T. Goodrich:
Parallel algorithms column 1: models of computation. SIGACT News 24(4): 16-21 (1993) - [c29]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 - [c28]Michael T. Goodrich:
Geometric Partitioning Made Easier, Even in Parallel. SCG 1993: 73-82 - [c27]Michael T. Goodrich, Roberto Tamassia:
Dynamic Ray Shooting and Shortest Paths Via Balanced Geodesic Triangulations. SCG 1993: 318-327 - [c26]Ashim Garg, Michael T. Goodrich, Roberto Tamassia:
Area-Efficient Upward Tree Drawings. SCG 1993: 359-368 - [c25]Michael T. Goodrich, Jyh-Jong Tsay, Darren Erik Vengroff, Jeffrey Scott Vitter:
External-Memory Computational Geometry (Preliminary Version). FOCS 1993: 714-723 - [c24]Michael T. Goodrich, Yossi Matias, Uzi Vishkin:
Approximate Parallel Prefix Computation and its Applications. IPPS 1993: 318-325 - [c23]Mujtaba R. Ghouse, Michael T. Goodrich:
Experimental Evidence for the Power of Random Samplings in Practical Parallel Algorithms. IPPS 1993: 549-556 - [c22]Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott Vitter:
Blocking for External Graph Searching. PODS 1993: 222-232 - [c21]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 - 1992
- [j14]Richard Cole, Michael T. Goodrich:
Optimal Parallel Algorithms for Point-Set and Polygon Problems. Algorithmica 7(1): 3-23 (1992) - [j13]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) - [j12]Michael T. Goodrich:
Constructing the Convex Hull of a Partially Sorted Set of Points. Comput. Geom. 2: 267-278 (1992) - [j11]Michael T. Goodrich:
A polygonal approach to hidden-line and hidden-surface elimination. CVGIP Graph. Model. Image Process. 54(1): 1-12 (1992) - [c20]Michael T. Goodrich:
Planar Separators and Parallel Polygon Triangulation (Preliminary Version). STOC 1992: 507-516 - 1991
- [j10]Michael T. Goodrich:
Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors. SIAM J. Comput. 20(4): 737-755 (1991) - [j9]John K. Johnstone, Michael T. Goodrich:
A localized method for intersecting plane algebraic curve segments. Vis. Comput. 7(2): 60-71 (1991) - [c19]Michael T. Goodrich:
Using Approximation Algorithms to Design Parallel Algorithms that May Ignore Processor Allocation (Preliminary Version). FOCS 1991: 711-722 - [c18]Michael T. Goodrich:
Constructing Arrangements Optimally in Parallel (Preliminary Version). SPAA 1991: 169-179 - [c17]Mujtaba R. Ghouse, Michael T. Goodrich:
In-Place Techniques for Parallel Convex Hull Algorithms (Preliminary Version). SPAA 1991: 192-203 - [c16]Michael T. Goodrich, Roberto Tamassia:
Dynamic Trees and Dynamic Point Location (Preliminary Version). STOC 1991: 523-533 - 1990
- [j8]Michael T. Goodrich, Jack Snoeyink:
Stabbing Parallel Segments with a Convex Polygon. Comput. Vis. Graph. Image Process. 49(2): 152-170 (1990) - [j7]Michael T. Goodrich, Mikhail J. Atallah:
On Performing Robust Order Statistics in Tree-Structured Dictionary Machines. J. Parallel Distributed Comput. 9(1): 69-76 (1990) - [c15]Michael T. Goodrich, Steven B. Shauck, Sumanta Guha:
Parallel Methods for Visibility and Shortest Path Problems in Simple Polygons (Preliminary Version). SCG 1990: 73-82 - [c14]Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing:
Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version). ICALP 1990: 432-445 - [c13]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 - [c12]Michael T. Goodrich:
Applying Parallel Processing Techniques to Classification Problems in Constructive Solid Geometry. SODA 1990: 118-128 - [c11]Michael T. Goodrich, Mujtaba R. Ghouse, J. Bright:
Generalized Sweep Methods for Parallel Computational Geometry. SPAA 1990: 280-289 - [c10]Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich:
P-Complete Geometric Problems. SPAA 1990: 317-326
1980 – 1989
- 1989
- [j6]Michael T. Goodrich:
Triangulating a Polygon in Parallel. J. Algorithms 10(3): 327-351 (1989) - [j5]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) - [c9]Michael T. Goodrich, S. Rao Kosaraju:
Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation (Preliminary Version). FOCS 1989: 190-195 - [c8]Michael T. Goodrich:
Intersecting Line Segments in Parallel With an Output-Sensitive Number of Processors. SPAA 1989: 127-137 - [c7]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 - [c6]Michael T. Goodrich, Jack Snoeyink:
Stabbing Parallel Segments with a Convex Polygon (Extended Abstract). WADS 1989: 231-242 - 1988
- [j4]Mikhail J. Atallah, Michael T. Goodrich:
Parallel Algorithms for Some Functions of two Convex Polygons. Algorithmica 3: 535-548 (1988) - [j3]Hossam A. ElGindy, Michael T. Goodrich:
Parallel algorithms for shortest path problems in polygons. Vis. Comput. 3(6): 371-378 (1988) - [c5]Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju:
Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. AWOC 1988: 1-10 - [c4]Richard Cole, Michael T. Goodrich:
Optimal Parallel Algorithms for Polygon and Point-Set Problems. SCG 1988: 201-210 - 1987
- [b1]Michael T. Goodrich:
Efficient parallel techniques for computational geometry. Purdue University, USA, 1987 - [j2]Michael T. Goodrich:
Finding the Convex Hull of a Sorted Point Set in Parallel. Inf. Process. Lett. 26(4): 173-179 (1987) - [c3]Mikhail J. Atallah, Richard Cole, Michael T. Goodrich:
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms. FOCS 1987: 151-160 - 1986
- [j1]Mikhail J. Atallah, Michael T. Goodrich:
Efficient Parallel Solutions to Some Geometric Problems. J. Parallel Distributed Comput. 3(4): 492-507 (1986) - [c2]Mikhail J. Atallah, Michael T. Goodrich:
Efficient Plane Sweeping in Parallel. SCG 1986: 216-225 - 1985
- [c1]Mikhail J. Atallah, Michael T. Goodrich:
Efficient Parallel Solutions to Geometric Problems. ICPP 1985: 411-417
Coauthor Index
Matthew Dickerson
aka: Matthew T. Dickerson
aka: Matthew T. Dickerson
[c233] [c230] [i112] [j94] [j92] [c212] [c211] [c210] [i102] [i100] [i99] [j91] [c209] [c207] [c204] [c203] [c202] [c201] [i97] [i96] [i95] [i94] [i93] [i92] [c197] [c195] [c194] [c193] [i89] [i88] [c191] [c188] [i83] [i80] [j90] [c180] [c179] [c175] [i72] [i71] [i70] [j87] [j86] [c173] [c169] [i65] [i63] [j84] [j83] [j81] [c166] [c165] [i58] [j76] [j74] [c158] [c154] [c148] [c145] [i51] [i48] [i45] [i43] [i41] [j73] [c143] [c142] [c141] [c140] [c139] [c138] [i38] [i36] [i35] [i34] [i33] [i32] [j70] [c131] [c128] [c126] [i28] [i17] [j69] [j68] [c124] [c123] [c122] [c119] [i16] [i15] [i14] [i13] [j63] [j62] [j61] [c117] [c114] [i11] [c111] [i10] [i9] [j57] [c103] [c101] [c99] [c96] [i8] [i7] [i6] [i5] [i4] [c95] [c93] [c89] [c88] [i2] [i1]
[c200] [c198] [c190] [c187] [i78] [i77] [i75] [c177] [i74] [i66] [j82] [c168] [c167] [c161] [i60] [i57] [j79] [c157] [i50] [i46] [i42] [c138] [i32] [c129] [i24] [i19] [j66] [c125] [c120] [c113] [c112] [c105] [c104] [c102] [b5] [c94] [r1] [b4] [c92] [c91] [c90] [c87] [b3] [j49] [c80] [c77] [c75] [c69] [c68] [j41] [c65] [c61] [c60] [b2] [j36] [c54] [c53] [j31] [c51] [j26] [c44] [c43] [c40] [c27] [c26] [c16]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
