The following pages link to Michael T. Goodrich (Q378240):
Displaying 50 items.
- External-memory multimaps (Q378243) (← links)
- Category-based routing in social networks: membership dimension and the small-world phenomenon (Q386908) (← links)
- Extended dynamic subgraph statistics using \(h\)-index parameterized data structures (Q443712) (← links)
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons (Q476439) (← links)
- Efficient authenticated data structures for graph connectivity and geometric search problems (Q548654) (← links)
- Fast randomized parallel methods for planar convex hull construction (Q676065) (← links)
- Geometric pattern matching under Euclidean motion (Q676592) (← links)
- How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889) (← links)
- Confluent layered drawings (Q879954) (← links)
- Pipelined algorithms to detect cheating in long-term grid computations (Q959812) (← links)
- Planar separators and parallel polygon triangulation. (Q960516) (← links)
- On the algorithmic complexity of the Mastermind game with black-peg results (Q989451) (← links)
- (Q1104088) (redirect page) (← links)
- Parallel algorithms for shortest path problems in polygons (Q1104089) (← links)
- Parallel algorithms for some functions of two convex polygons (Q1105374) (← links)
- Finding the convex hull of a sorted point set in parallel (Q1108791) (← links)
- Optimal parallel algorithms for point-set and polygon problems (Q1187196) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- Constructing the Voronoi diagram of a set of line segments in parallel (Q1206435) (← links)
- Offset-polygon annulus placement problems (Q1276941) (← links)
- Output-sensitive methods for rectilinear hidden surface removal (Q1317431) (← links)
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees (Q1367169) (← links)
- Bounded-independance derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming (Q1380803) (← links)
- Efficiently approximating polygonal paths in three and higher dimensions (Q1601006) (← links)
- Subexponential-time and FPT algorithms for embedded flat clustered planarity (Q1627160) (← links)
- Optimizing a constrained convex polygonal annulus (Q1775012) (← links)
- Biased skip lists (Q1777273) (← links)
- Computing convex-straight-skeleton Voronoi diagrams for segments and convex polygons (Q1790962) (← links)
- Models and algorithms for graph watermarking (Q1799199) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
- Constructing the convex hull of a partially sorted set of points (Q1803271) (← links)
- A nearly optimal deterministic parallel Voronoi diagram algorithm (Q1817002) (← links)
- Optimizing area and aspect ratio in straight-line orthogonal tree drawings (Q1862119) (← links)
- Planarity-preserving clustering and embedding for large planar graphs (Q1869744) (← links)
- Three-dimensional layers of maxima (Q1882405) (← links)
- A multi-dimensional approach to force-directed layouts of large graphs (Q1883577) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
- Blocking for external graph searching (Q1920428) (← links)
- Drawing trees with perfect angular resolution and polynomial area (Q1943652) (← links)
- Convex-straight-skeleton Voronoi diagrams for segments and convex polygons (Q2037112) (← links)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- A competitive analysis for the start-gap algorithm for online memory wear leveling (Q2224854) (← links)
- Reactive proximity data structures for graphs (Q2294736) (← links)
- An addendum to parallel methods for visibility and shortest-path problems in simple polygons (Q2366233) (← links)
- Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis (Q2426667) (← links)
- Improved kernels for tracking paths (Q2681404) (← links)
- Balanced aspect ratio trees: Combining the advantages of \(k\)-\(d\) trees and octrees (Q2709802) (← links)
- (Q2753929) (← links)
- (Q2753934) (← links)
