activity
20032025
most citedZig-zag Sort: A Simple Deterministic Data-Oblivious Sorting Algorithm Running in O(n log n) Time

73 citations · 634 across the 97 of their papers we have counts for

collaborators
Showing 2016 · cs.DSShow all

5 papers · 2 filters

cs.DS2016★ 2 cited

A Topological Algorithm for Determining How Road Networks Evolve Over Time

M T Goodrich, Siddharth Gupta, Manuel R. Torres

We provide an efficient algorithm for determining how a road network has evolved over time, given two snapshot instances from different dates. To allow for such determinations acro…

cs.DS2016★ 12 cited

Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection

Juan José Besa Vial, William E. Devanny, David Eppstein +1

We study various versions of the problem of scheduling platoons of autonomous vehicles through an unregulated intersection, where an algorithm must schedule which platoons should w…

cs.DS2016

J-Viz: Sibling-First Recursive Graph Drawing for Visualizing Java Bytecode

Md. Jawaherul Alam, Michael T. Goodrich, Timothy Johnson

We describe a graph visualization tool for visualizing Java bytecode. Our tool, which we call J-Viz, visualizes connected directed graphs according to a canonical node ordering, wh…

cs.DS2016

Parallel Algorithms for Summing Floating-Point Numbers

Michael T. Goodrich, Ahmed Eldawy

The problem of exactly summing n floating-point numbers is a fundamental problem that has many applications in large-scale simulations and computational geometry. Unfortunately, du…

cs.DS2016★ 1 cited

Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis

William E. Devanny, Michael T. Goodrich, Kristopher Jetviroj

We study parallel comparison-based algorithms for finding all equivalence classes of a set of elements, where sorting according to some total order is not possible. Such scenar…