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 - [i117]Ofek Gila, Evrim Ozel, Michael T. Goodrich:
Highway Preferential Attachment Models for Geographic Routing. CoRR abs/2403.08105 (2024) - [i116]Michael T. Goodrich, Ryuto Kitagawa:
Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm. CoRR abs/2409.19784 (2024) - [i115]David Eppstein, Michael T. Goodrich, Abraham M. Illickan:
Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature. CoRR abs/2410.12083 (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]