Michael T. Goodrich | Academic Influence

Michael T. Goodrich's AcademicInfluence.com Rankings

Michael T. Goodrich

Computer Science

#2208

World Rank

#2298

Historical Rank

#999

USA Rank

Theoretical Computer Science

#78

World Rank

#78

Historical Rank

#22

USA Rank

computer-science Degrees

Michael T. Goodrich

Mathematics

#4771

World Rank

#6762

Historical Rank

#1616

USA Rank

Graph Theory

#77

World Rank

#85

Historical Rank

#12

USA Rank

Measure Theory

#1160

World Rank

#1480

Historical Rank

#421

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Michael T. Goodrich's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University
Bachelors Mathematics University of California, Irvine

Similar Degrees You Can Earn

Why Is Michael T. Goodrich Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Michael T. Goodrich is a mathematician and computer scientist. He is a distinguished professor of computer science and the former chair of the department of computer science in the Donald Bren School of Information and Computer Sciences at the University of California, Irvine.

(See a Problem?)

Michael T. Goodrich's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Almost optimal set covers in finite VC-dimension (1995) (523)
External-memory graph algorithms (1995) (375)
Loud and Clear: Human-Verifiable Authentication Based on Audio (2006) (271)
Data Structures and Algorithms in Java (1998) (271)
Algorithm design - foundations, analysis and internet examples (2001) (264)
Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation (2010) (256)
Privacy-preserving group data access via stateless oblivious RAM simulation (2011) (237)
External-memory computational geometry (1993) (226)
Cascading divide-and-conquer: A technique for designing parallel algorithms (1989) (220)
Efficient packet marking for large-scale IP traceback (2002) (218)
Sorting, Searching, and Simulation in the MapReduce Framework (2011) (215)
Invertible bloom lookup tables (2011) (188)
Efficient Tree-Based Revocation in Groups of Low-State Devices (2004) (187)
Geometric Pattern Matching Under Euclidean Motion (1993) (169)
A multi-dimensional approach to force-directed layouts of large graphs (2000) (166)
Oblivious RAM simulation with efficient worst-case access overhead (2011) (149)
Communication-Efficient Parallel Sorting (1999) (144)
Probabilistic Packet Marking for Large-Scale IP Traceback (2008) (142)
What's the difference?: efficient set reconciliation without prior context (2011) (142)
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way (2002) (140)
Persistent Authenticated Dictionaries and Their Applications (2001) (129)
Fundamental parallel algorithms for private-cache chip multiprocessors (2008) (125)
Planar Separators and Parallel Polygon Triangulation (1995) (120)
An Efficient Dynamic and Distributed Cryptographic Accumulator (2002) (116)
PILOT: an interactive tool for learning and grading (2000) (115)
The skip quadtree: a simple dynamic data structure for multidimensional data (2005) (113)
Efficient Parallel Solutions to Some Geometric Problems (1986) (106)
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees (1999) (100)
Dynamic trees and dynamic point location (1991) (99)
Studying (non-planar) road networks through an algorithmic lens (2008) (99)
Indexing Information for Data Forensics (2005) (94)
Parallel algorithms for higher-dimensional convex hulls (1994) (91)
Efficient piecewise-linear function approximation using the uniform metric (1995) (88)
Zig-zag sort: a simple deterministic data-oblivious sorting algorithm running in O(n log n) time (2014) (88)
Practical oblivious storage (2012) (88)
Blocking for external graph searching (1992) (87)
Approximate Geometric Pattern Matching Under Rigid Motions (1999) (87)
Authenticated Data Structures for Graph and Geometric Searching (2003) (84)
Data structures and algorithms in C++ (2003) (82)
Convex drawings of graphs in two and three dimensions (preliminary version) (1996) (82)
Efficient Authenticated Dictionaries with Skip Lists and Commutative Hashing (2000) (79)
Randomized Shellsort: a simple oblivious sorting algorithm (2009) (78)
A bridging model for parallel computation, communication, and I/O (1996) (77)
On the Density of Maximal 1-Planar Graphs (2012) (75)
Snap rounding line segments efficiently in two and three dimensions (1997) (72)
Motorcycle Graphs: Canonical Quad Mesh Partitioning (2008) (72)
Testers and visualizers for teaching data structures (1999) (68)
Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations (1997) (66)
Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes (2005) (65)
The Melbourne Shuffle: Improving Oblivious Storage in the Cloud (2014) (64)
Lombardi Drawings of Graphs (2010) (64)
Practical methods for approximate geometric pattern matching under rigid motions: (preliminary version) (1994) (63)
Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters (2007) (62)
Efficient plane sweeping in parallel (1986) (62)
Planar upward tree drawings with optimal area (1996) (62)
Intersecting line segments in parallel with an output-sensitive number of processors (1989) (61)
TRICERT: A Distributed Certified E-Mail Scheme (2001) (61)
Selected Open Problems in Graph Drawing (2003) (60)
On the Complexity of Optimization Problems for 3-dimensional Convex Polyhedra and Decision Trees (1997) (60)
Straight-skeleton based contour interpolation (2003) (59)
Geometric partitioning made easier, even in parallel (1993) (59)
The Mastermind Attack on Genomic Data (2009) (58)
Efficient approximation and optimization algorithms for computational metrology (1997) (58)
Succinct Greedy Graph Drawing in the Hyperbolic Plane (2008) (58)
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions (1998) (57)
Algorithm Design and Applications (2014) (57)
The rainbow skip graph: a fault-tolerant constant-degree distributed data structure (2006) (56)
Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems (2009) (56)
Drawing planar graphs with circular arcs (1999) (55)
Optimizing area and aspect ration in straight-line orthogonal tree drawings (1996) (55)
Succinct Greedy Geometric Routing in the Euclidean Plane (2008) (55)
Succinct Greedy Geometric Routing Using Hyperbolic Geometry (2011) (54)
Deterministic sampling and range counting in geometric data streams (2004) (52)
Athos: Efficient Authentication of Outsourced File Systems (2008) (52)
Optimal parallel algorithms for polygon and point-set problems (1988) (50)
Force-Directed Graph Drawing Using Social Gravity and Scaling (2012) (49)
A Fast Multi-Dimensional Algorithm for Drawing Large Graphs? (2000) (48)
Super-Efficient Verification of Dynamic Outsourced Databases (2008) (48)
Confluent Layered Drawings (2004) (48)
Contour interpolation by straight skeletons (2004) (48)
Force-Directed Lombardi-Style Graph Drawing (2011) (46)
Triangulating a Polygon in Parallel (1989) (46)
Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling (2000) (45)
Parallel external memory graph algorithms (2010) (45)
On the algorithmic complexity of the Mastermind game with black-peg results (2009) (45)
Finding the Convex Hull of a Sorted Point Set in Parallel (1987) (44)
Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data (2011) (44)
Using approximation algorithms to design parallel algorithms that may ignore processor allocation (1991) (43)
Sorting on a parallel pointer machine with applications to set expression evaluation (1989) (43)
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs (1998) (41)
Skip-webs: efficient distributed data structures for multi-dimensional data sets (2005) (41)
Using audio in secure device pairing (2009) (41)
Planar Orthogonal and Polyline Drawing Algorithms (2013) (41)
Communication-efficient parallel sorting (preliminary version) (1996) (40)
Biased Skip Lists (2002) (40)
MapReduce Parallel Cuckoo Hashing and Oblivious RAM Simulations (2010) (40)
Range Searching Over Tree Cross Products (2000) (40)
Almost optimal set covers in finite VC-dimension: (preliminary version) (1994) (39)
Privacy-preserving data-oblivious geometric algorithms for geographic data (2010) (38)
Dynamic ray shooting and shortest paths via balanced geodesic triangulations (1993) (38)
C-Planarity of Extrovert Clustered Graphs (2005) (38)
Topology B-Trees and Their Applications (1995) (37)
A Framework for Drawing Planar Graphs with Curves and Polylines (1998) (37)
Drawing Trees with Perfect Angular Resolution and Polynomial Area (2010) (37)
Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm (2011) (37)
Straight skeletons of three-dimensional polyhedra (2008) (37)
Authenticated Dictionaries for Fresh Attribute Credentials (2003) (37)
Algorithm design (2001) (35)
Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis (2009) (35)
A polygonal approach to hidden-line and hidden-surface elimination (1992) (35)
Voronoi diagrams for convex polygon-offset distance functions (2001) (35)
Accountable Storage (2014) (34)
Bureaucratic protocols for secure two-party sorting, selection, and permuting (2010) (34)
Methods for achieving fast query times in point location data structures (1997) (33)
Delta-Confluent Drawings (2005) (33)
Computing faces in segment and simplex arrangements (1995) (33)
A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time (2001) (32)
Stabbing Parallel Segments with a Convex Polygon (1990) (32)
Area-efficient upward tree drawings (1993) (32)
Efficient parallel techniques for computational geometry (1987) (31)
Searching for High-Value Rare Events with Uncheatable Grid Computing (2005) (31)
Efficient perspective-accurate silhouette computation (1999) (31)
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area (2010) (31)
Efficient Verification of Web-Content Searching Through Authenticated Web Crawlers (2012) (30)
Efficient perspective-accurate silhouette computation and applications (2001) (30)
Offset-polygon annulus placement problems (1997) (29)
SAIL: a system for generating, archiving, and retrieving specialized assignments using LATEX (2000) (29)
Skip Quadtrees: Dynamic Data Structures for Multidimensional Point Sets (2008) (29)
Secure Biometric Authentication for Weak Computational Devices (2005) (28)
Teaching data structure design patterns (1998) (28)
In-place techniques for parallel convex hull algorithms (preliminary version) (1991) (28)
Randomized fully-scalable BSP techniques for multi-searching and convex hull construction (1997) (27)
Linear-time triangulation of a simple polygon made easier via randomization (2000) (27)
Efficient piecewise-linear function approximation using the uniform metric: (preliminary version) (1994) (27)
Efficient Parallel Solutions to Geometric Problems (1985) (26)
Guard placement for efficient point-in-polygon proofs (2007) (26)
Planar and Poly-arc Lombardi Drawings (2011) (25)
Planarity-preserving clustering and embedding for large planar graphs (1999) (25)
Two-phase bicriterion search for finding fast and efficient electric vehicle routes (2014) (25)
Data Structures and Algorithms in Java with Cdrom (1998) (25)
Constructing arrangements optimally in parallel (1993) (24)
Parallel methods for visibility and shortest path problems in simple polygons (preliminary version) (1990) (24)
LAAC: A Location-Aware Access Control Protocol (2006) (24)
External-Memory Network Analysis Algorithms for Naturally Sparse Graphs (2011) (23)
Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket (2014) (23)
Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version) (1990) (23)
Application of a validation strategy to Darcy's experiment (1992) (23)
Teaching the analysis of algorithms with visual proofs (1998) (23)
P-complete geometric problems (1990) (22)
2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection (2017) (22)
Choosing Colors for Geometric Graphs via Color Space Embeddings (2006) (22)
Three-Dimensional Layers of Maxima (2002) (22)
Parallel algorithms for evaluating sequences of set-manipulation operations (1988) (21)
Extended dynamic subgraph statistics using h-index parameterized data structures (2010) (21)
Planar separators and parallel polygon triangulation (preliminary version) (1992) (21)
K-D Trees Are Better when Cut on the Longest Side (2000) (21)
On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version) (1995) (21)
On the Cost of Persistence and Authentication in Skip Lists (2007) (21)
Efficient and Secure Network Routing Algorithms (2001) (20)
Improved Combinatorial Group Testing for Real-World Problem Sizes (2005) (20)
Deterministic sampling and range counting in geometric data streams (2003) (20)
Merging free tree in parallel for efficient voronoi diagram construction (1990) (20)
Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming (1997) (20)
Leap-frog packet linking and diverse key distributions for improved integrity in network broadcasts (2005) (20)
Constructing Disjoint Paths for Secure Communication (2003) (19)
Quantification of Uncertainty in Exposure Assessments at Hazardous Waste Sites (1995) (19)
Data-Oblivious Graph Drawing Model and Algorithms (2012) (19)
Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters (2007) (18)
Optimal parallel approximation for prefix sums and integer sorting (1994) (18)
Pipelined algorithms to detect cheating in long-term grid computations (2008) (18)
An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version) (1990) (17)
Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs (2000) (17)
Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences (1999) (17)
Planar Drawings of Higher-Genus Graphs (2009) (17)
Voronoi Diagrams for Polygon-Offset Distance Functions (1997) (17)
Fixed-dimensional parallel linear programming via relative ε-approximations (1996) (16)
Seller-Focused Algorithms for Online Auctioning (2001) (16)
Parallel algorithms for some functions of two convex polygons (1988) (16)
Accredited DomainKeys: A Service Architecture for Improved Email Validation (2005) (16)
Accessing the Internal Organization of Data Structures in the JDSL Library (1999) (16)
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings (2014) (16)
Parallel algorithms column 1: models of computation (1993) (15)
Fully-Dynamic Verifiable Zero-Knowledge Order Queries for Network Data (2015) (15)
A proposed strategy for the validation of ground-water flow and solute transport models (1990) (15)
Drawing Planar Graphs with Large Vertices and Thick Edges (2004) (14)
Generalized sweep methods for parallel computational geometry (1990) (14)
Applying parallel processing techniques to classification problems in constructive solid geometry (1990) (14)
Simulating Parallel Algorithms in the MapReduce Framework with Applications to Parallel Computational Geometry (2010) (14)
Category-based routing in social networks: Membership dimension and the small-world phenomenon (2011) (13)
Going off-road: transversal complexity in road networks (2009) (13)
Point Probe Decision Trees for Geometric Concept Classes (1993) (13)
Privacy-enhanced reputation-feedback methods to reduce feedback extortion in online auctions (2011) (13)
External-Memory Computational Geometry (Preliminary Version) (1993) (12)
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity (2018) (12)
Parallel methods for visibility and shortest-path problems in simple polygons (1992) (12)
Two-site Voronoi diagrams in geographic networks (2008) (12)
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings (2008) (12)
Models and Algorithms for Graph Watermarking (2016) (12)
Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets (2014) (12)
Introduction to Computer Security (2010) (11)
Output-Sensitive Methods for Rectilinear Hidden Surface Removal (1993) (11)
Streamed Graph Drawing and the File Maintenance Problem (2013) (11)
Balanced Circle Packings for Planar Graphs (2014) (11)
Components of an overall performance assessment methodology (1990) (11)
Notarized Federated Identity Management for Web Services (2006) (11)
Tracking Paths in Planar Graphs (2019) (11)
Privacy-Enhanced Methods for Comparing Compressed DNA Sequences (2011) (11)
Notarized federated ID management and authentication (2008) (11)
Defining Equitable Geographic Districts in Road Networks via Stable Matching (2017) (11)
Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps (2011) (11)
Constructing the Voronoi diagram of a set of line segments in parallel (1993) (10)
Data Structures and Algorithms in Python (2013) (10)
Geometric Data Structures (2000) (10)
Efficient parallel algorithms for dead sensor diagnosis and multiple access channels (2006) (10)
JDSL: The data structures library in java (2001) (10)
Computing k-Modal Embeddings of Planar Digraphs (2019) (9)
Anonymous Card Shuffling and Its Applications to Parallel Mixnets (2012) (9)
GeomNet: Geometric Computing Over the Internet (1999) (9)
Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection (2016) (9)
A nearly optimal deterministic parallel Voronoi diagram algorithm (1996) (9)
Combinatorial Pair Testing: Distinguishing Workers from Slackers (2013) (9)
Optimal parallel approximation algorithms for prefix sums and integer sorting (1994) (9)
Sweep methods for parallel computational geometry (1996) (9)
Turning privacy leaks into floods: surreptitious discovery of social network friendships and other sensitive binary attribute vectors (2010) (9)
Data-Oblivious Graph Algorithms in Outsourced External Memory (2014) (9)
Guard Placement For Wireless Localization (2006) (8)
Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability (2012) (8)
Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage (2012) (8)
Nonadaptive Mastermind Algorithms for String and Vector Databases, with Case Studies (2010) (8)
Linear-time algorithms for geometric graphs with sublinearly many crossings (2009) (8)
Approximate parallel prefix computation and its applications (1993) (8)
Biased finger trees and three-dimensional layers of maxima: (preliminary version) (1994) (8)
The Rainbow Skip Graph: A Fault-Tolerant Constant-Degree P2P Relay Structure (2009) (8)
Spin-the-Bottle Sort and Annealing Sort: Oblivious Sorting via Round-Robin Random Comparisons (2010) (7)
Stabbing Parallel Segments with a Convex Polygon (Extended Abstract) (1989) (7)
Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees (2016) (7)
Decision Tree Construction in Fixed Dimensions: Being Global is Hard but Local Greed is Good (1995) (7)
Tracking Moving Objects with Few Handovers (2011) (7)
Benchmark testing and independent verification of the VS2DT computer code (1994) (7)
Approximate topological matching of quad meshes (2009) (7)
Optimizing a constrained convex polygonal annulus (2005) (7)
Fast Randomized Parallel Methods for Planar Convex Hull Construction (1997) (7)
Achieving Communication Efficiency through Push-Pull Partitioning of Semantic Spaces to Disseminate Dynamic Information (2006) (7)
An Overview of JDSL 2 . 0 , the Data Structures Library in Java ∗ (2003) (7)
Succinct Greedy Geometric Routing in R^2 (2008) (6)
Algorithms for Stable Matching and Clustering in a Grid (2017) (6)
Fully Retroactive Approximate Range and Nearest Neighbor Searching (2011) (6)
Oblivious Storage with Low I/O Overhead (2011) (6)
Constructing the Convex Hull of a Partially Sorted Set of Points (1993) (6)
Characterization and Recognition of Point-Halfspace and Related Orders (1994) (6)
Cloning Voronoi Diagrams via Retroactive Data Structures (2010) (6)
Secure Fingerprint Alignment and Matching Protocols (2017) (6)
Optimal parallel algorithms for point-set and polygon problems (1992) (6)
Parallel algorithms in geometry (2004) (6)
An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction (1998) (5)
Teaching internet algorithmics (2001) (5)
Implementation of an Authenticated Dictionary (2001) (5)
An Optimal Parallel Algorithm For the All Nearest - - Neighbor Problem for a Convex Polygon (1985) (5)
BIOS ORAM: Improved Privacy-Preserving Data Access for Parameterized Outsourced Storage (2017) (5)
More Practical and Secure History-Independent Hash Tables (2016) (5)
Computing betweenness centrality in external memory (2013) (5)
Classical computational geometry in GeomNet (1997) (5)
Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks (2010) (5)
Approximate topological matching of quadrilateral meshes (2008) (5)
Probabilistic Packet Marking for Large-Scale (2008) (5)
Approximate Geometric Query Structures (2004) (5)
Reconstructing Binary Trees in Parallel (2020) (5)
Reconstructing Biological and Digital Phylogenetic Trees in Parallel (2020) (5)
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width (2019) (5)
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem (2009) (5)
Biased Finger Trees and Thr ee-Dimensional Layers of Maxima (1993) (4)
Parallel algorithms for shortest path problems in polygons (1988) (4)
Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data (2018) (4)
Output-Sensitive Hidden Surface Elimination for Rectangles (1988) (4)
External-Memory Graph Algorithms (extended abstract) (1994) (4)
Using randomization in the teaching of data structures and algorithms (1999) (4)
Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version) (1989) (4)
Cole's Parametric Search Technique Made Practical (2013) (4)
Selected papers from the International Workshop on Algorithm Engineering and Experimentation (1999) (4)
Parallel external memory model - a parallel model for multi-core architectures (2009) (4)
Auditable Data Structures (2017) (4)
Studying Geometric Graph Properties of Road Networks Through an Algorithmic Lens (2008) (4)
Learning Character Strings via Mastermind Queries, With a Case Study Involving mtDNA (2009) (4)
Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model (2021) (4)
Parallel Network Mapping Algorithms (2021) (3)
Drawing Graphs with Large Vertices and Thick Edges (2003) (3)
Applicable and Robust Geometric Computing (2001) (3)
Reactive Proximity Data Structures for Graphs (2018) (3)
Optimally Sorting Evolving Data (2018) (3)
Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics (2010) (3)
Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors, and Jumbled-Index Queries in String Reconstruction (2020) (3)
BOOK REVIEW (2015) (3)
Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains (2019) (3)
Isogrammic-Fusion ORAM: Improved Statistically Secure Privacy-Preserving Cloud Data Access for Thin Clients (2018) (3)
Data Structures (2004) (3)
Constructing arrangements optimally in parallel (preliminary version) (1991) (3)
Sorting in Parallel External-Memory Multicores (2007) (3)
Competitive tree-structured dictionaries (2000) (2)
Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric (2007) (2)
Graph drawing : 10th International Symposium, GD 2002, Irvine, CA, USA, August 26-28, 2002 : revised papers (2002) (2)
Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis (2016) (2)
On Performing Robust Order Statistics in Tree-Structured Dictionary Machines (1990) (2)
External-Memory Multimaps (2011) (2)
Priority Range Trees (2010) (2)
Data Structures and Algorithms in Java 6th Edition International Student Version (2014) (2)
J-Viz: Finding algorithmic complexity attacks via graph visualization of Java bytecode (2016) (2)
Parallel Algorithms for Summing Floating-Point Numbers (2016) (2)
An Efficient Dynamic and Distributed RSA Accumulator (2009) (2)
Contour interpolation by straight skeletons q (2004) (2)
A competitive analysis for the Start-Gap algorithm for online memory wear leveling (2021) (2)
The Online House Numbering Problem: Min-Max Online List Labeling (2017) (2)
How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths (2021) (2)
Simplified Analyses of Randomized Algorithms for Searching, Sorting, and Selection (2001) (1)
Nonperiodic Modes in Two-Dimensional (2-D) Recursive Digital Filters under Finite Wordlength Effects (1989) (1)
Selected papers from the 12th annual symposium on Computational Geometry (1999) (1)
DISCUSSION OF “The Modeling Process and Model Validation,” by Chin-Fu Tsang (1992) (1)
On the Optical Accuracy of the Salvator Mundi (2019) (1)
Capturing Lombardi Flow in Orthogonal Drawings by Minimizing the Number of Segments (2016) (1)
Reliable Resource Searching in P2P Networks (2009) (1)
A topological algorithm for determining how road networks evolve over time (2016) (1)
Low Ply Drawings of Trees and 2-Trees (2018) (1)
Acknowledgments Discussions With (1996) (1)
Practical methods for geometric searching problems with experimental validation (1996) (1)
Mapping Networks via Parallel kth-Hop Traceroute Queries (2022) (1)
Data Structures in JDSL (2004) (1)
Algorithm Engineering and Experimentation (2002) (1)
Minimum-Width Drawings of Phylogenetic Trees (2019) (1)
Data Structures and Algorithms in C++, 2/E (2016) (1)
Geometric data structures and applications (1996) (1)
Set-Difference Range Queries (2013) (1)
An addendum to parallel methods for visibility and shortest-path problems in simple polygons (1993) (1)
Applied spatial data structures for large data sets (2003) (1)
Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching (2018) (1)
A preliminary parametric performance assessment for the disposal of alpha-contaminated mixed low-level waste stored at the Idaho National Engineering Laboratory (1995) (1)
Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms (2018) (1)
Drawing Trees with Perfect Angular Resolution and Polynomial Area (2012) (1)
Teaching Internet algorithmics (invited talk) (2001) (1)
Achieving Communication Efficiency through Push-Pull Partitioning of Semantic Spaces in Client-Server Architectures (2005) (1)
Data structures and algorithms in Java (3. ed.) (2003) (1)
Brief Announcement: Using Multi-Level Parallelism and 2-3 Cuckoo Filters for Set Intersection Queries and Sparse Boolean Matrix Multiplication (2017) (1)
Experimental evidence for the power of random sampling in practical parallel algorithms (1993) (1)
New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs (2019) (1)
More Graph Drawing in the Cloud: Data-Oblivious st-Numbering, Visibility Representations, and Orthogonal Drawing of Biconnected Planar Graphs (2012) (1)
Low Ply Drawings of Trees of Bounded Degrees (2017) (0)
Foundational Algorithms for Computational Distributed Robot Swarms (2008) (0)
Algorithm Engineering and Experimentation: International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers (1999) (0)
Algorithms for sparse geometric graphs and social networks (2011) (0)
Verifying Search Results Over Web Collections (2012) (0)
Improved kernels for tracking paths (2023) (0)
Balanced Aspect Ratio Trees Revisited (2005) (0)
TRIANGULATING A 1 lOLYGON IN PARALLEL (2013) (0)
Computing k-Modal Embeddings of Planar (2019) (0)
Editorial (2000) (0)
Report of the Working Group on Storage Iio Issues in Large-scale Computing Acm Workshop on Strategic Directions in Computing Research Edited (1996) (0)
Big Data – Privacy and Management (2020) (0)
Classic-Style뀀ȠSeries-Parallel뀀ȠDrawings Single-Row뀀ȠTheorems/Figures뀀Ƞ Fixed-Width뀀ȠTheorems/Figures Experiments (2011) (0)
Proceeding of the Annual ACM-SIAM Symposium on Discrete Algorithms: Preface (2005) (0)
Data Structures and Algorithms in C++: WITH Wiley Plus (2008) (0)
Alenex workshop preface (2005) (0)
Poster : Zero-Knowledge Authenticated Order Queries and Applications (2015) (0)
Geomnet's Layered Client- Server Architecture Lets Users Perform Distributed Geometric Computing over the Geomnet: Geometric Computing over the Internet (1999) (0)
Introduction to Security and Applied Cryptography (2006) (0)
Retroactive Data Structures (2011) (0)
[XOK90] T. Hagerup and C. Rub. Optimal Merging and Sorting on the EREW PRAM. Technical Report, Universit/it des Saarlandes, 1989. (2007) (0)
Confluent drawings (2006) (0)
Comparison of two risk assessment methodologies for high-level waste disposal in unsaturated media (1991) (0)
Succinct Greedy Graph Drawing in R 2 (2009) (0)
Wiley Plus/Blackboard Stand-alone to accompany Data Structures and Algorithms in Java (Wiley Plus Products) (2006) (0)
Education forum: Web Enhanced Textbooks (1998) (0)
Exact Learning of Multitrees and Almost-Trees Using Path Queries (2022) (0)
Session details: SESSION 2 (2017) (0)
Order Statistics and Other Complex Data Operations On Tree-Structured Dictionary Machines (1985) (0)
Dynamic Trees and Dynamic Point Location (Preliminary Version) (1991) (0)
Foundational Algorithms for Distributed Robot Swarms (2007) (0)
A localized method for intersecting plane algebraic curve segments (1991) (0)
Revised Papers from the 10th International Symposium on Graph Drawing (2002) (0)
Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees (2022) (0)
Discrete Algorithms Seminar Title: " Paired Approximation Problems and Incompatible Inapproximabilities " Title: " Guard Placement for Wireless Localization " (2010) (0)
Distributed Peer-to-Peer Data Structures (2007) (0)
Computing faces in segment and simplex arrangements (Preliminary Version). (1995) (0)
Animating the polygon-offset distance function (1997) (0)
Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching (2022) (0)
Technical basis for review of high-level waste repository modeling (1990) (0)
Fixed-Dimensional Parallel Linesr Programming via epsilon-Relative-Approximations (1996) (0)
Editor's ForewordEDITORS' FOREWORD (1996) (0)
46 PARALLEL ALGORITHMS IN GEOMETRY (2016) (0)
Inverse-Rendering-Based Analysis of the Fine Illumination Effects in Salvator Mundi (2020) (0)
Algorithm Basics (2019) (0)
The grand challenges of geometric computing (1994) (0)
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada (1994) (0)
Answering Spatial Multiple-Set Intersection Queries Using 2-3 Cuckoo Hash-Filters (2017) (0)
Knuthian Drawings of Series-Parallel Flowcharts (2015) (0)
Matching points to a convex polygonal boundary (2001) (0)
Fast parallel algorithms for Voronoi diagrams: Computer science report CSD-TR-538 (1985) (0)
External-Memory Multimaps (2013) (0)
Distributed Data Authenication (System Demonstration) (2003) (0)
Optimally Confining Lattice Polymers (2022) (0)
Title Balanced circle packings for planar graphs Permalink (2014) (0)
Sweep Methods for Parallel Computational Geometry 1 (2005) (0)
Computer Science Issues in the National Virtual Observatory (2001) (0)
Wiley Plus Stand-alone to accompany Data Structures and Algorithms in C++ (Wiley Plus Products) (2006) (0)
Spin-the-Bottle Sort and Annealing Sort: Oblivious Sorting via Round-Robin Random Comparisons (2012) (0)
Monte Carlo stochastic analysis of macrodispersivities for non-ergodic transport through heterogeneous vadose zones (1995) (0)
Checking Value-Sensitive Data Structures in Sublinear Space (2007) (0)
Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons (2018) (0)
Efficient and scalable infrastructure support for dynamic coalitions (2003) (0)
Achieving Good Angular Resolution in 3D Arc Diagrams (2013) (0)
Parameterized Balanced Aspect Ratio Trees (0)
Force-Directed 3D Arc Diagrams (2014) (0)
Simplified Chernoff Bounds with Powers-of-Two Probabilities (2023) (0)
J-Viz: Sibling-First Recursive Graph Drawing for Visualizing Java Bytecode (2016) (0)
Algorithm Engineering (2000) (0)
Session details: Applied cryptography II (2006) (0)
An Overview of the net . datastructures package ∗ (2005) (0)
Modeling the small-world phenomenon with road networks (2022) (0)
Brief announcement: large-scale multimaps (2011) (0)

This paper list is powered by the following services:

Other Resources About Michael T. Goodrich

en.wikipedia.org

What Schools Are Affiliated With Michael T. Goodrich?

Michael T. Goodrich is affiliated with the following schools: