Google
Google Scholar
Semantic Scholar
MS Academic
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
- 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)- 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. Graph Drawing 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. Graph Drawing 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. Graph Drawing 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. 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. Graph Drawing 2013: 161-172 - [c170]Michael T. Goodrich, Pawel Pszona:
Streamed Graph Drawing and the File Maintenance Problem. Graph Drawing 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. Graph Drawing 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. Graph Drawing 2012: 327-338 - [c165]Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott:
Force-Directed Graph Drawing Using Social Gravity and Scaling. Graph Drawing 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. Graph Drawing 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]