Michael T. Goodrich

According to our database1, Michael T. Goodrich
  • authored at least 386 papers between 1985 and 2017.
  • has a "Dijkstra number"2 of three.

Awards

ACM Fellow

ACM Fellow 2009, "For contributions to data structures and algorithms for combinatorial and geometric problems.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
BIOS ORAM: Improved Privacy-Preserving Data Access for Parameterized Outsourced Storage.
CoRR, 2017

Answering Spatial Multiple-Set Intersection Queries Using 2-3 Cuckoo Hash-Filters.
CoRR, 2017

Algorithms for Stable Matching and Clustering in a Grid.
CoRR, 2017

Defining Equitable Geographic Districts in Road Networks via Stable Matching.
CoRR, 2017

Secure Fingerprint Alignment and Matching Protocols.
CoRR, 2017

BIOS ORAM: Improved Privacy-Preserving Data Access for Parameterized Outsourced Storage.
Proceedings of the 2017 on Workshop on Privacy in the Electronic Society, Dallas, TX, USA, October 30, 2017

Brief Announcement: Using Multi-Level Parallelism and 2-3 Cuckoo Filters for Set Intersection Queries and Sparse Boolean Matrix Multiplication.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Algorithms for Stable Matching and Clustering in a Grid.
Proceedings of the Combinatorial Image Analysis - 18th International Workshop, 2017

Auditable Data Structures.
Proceedings of the 2017 IEEE European Symposium on Security and Privacy, 2017

The Online House Numbering Problem: Min-Max Online List Labeling.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Accountable Storage.
Proceedings of the Applied Cryptography and Network Security, 2017

2016
Auditable Data Structures.
IACR Cryptology ePrint Archive, 2016

More Practical and Secure History-Independent Hash Tables.
IACR Cryptology ePrint Archive, 2016

Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection.
CoRR, 2016

A Topological Algorithm for Determining How Road Networks Evolve Over Time.
CoRR, 2016

Parallel Algorithms for Summing Floating-Point Numbers.
CoRR, 2016

Models and Algorithms for Graph Watermarking.
CoRR, 2016

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

J-Viz: Sibling-First Recursive Graph Drawing for Visualizing Java Bytecode.
CoRR, 2016

Capturing Lombardi Flow in Orthogonal Drawings by Minimizing the Number of Segments.
CoRR, 2016

J-Viz: Finding algorithmic complexity attacks via graph visualization of Java bytecode.
Proceedings of the 2016 IEEE Symposium on Visualization for Cyber Security, 2016

Parallel Algorithms for Summing Floating-Point Numbers.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees.
Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

Models and Algorithms for Graph Watermarking.
Proceedings of the Information Security - 19th International Conference, 2016

A topological algorithm for determining how road networks evolve over time.
Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2016, Burlingame, California, USA, October 31, 2016

More Practical and Secure History-Independent Hash Tables.
Proceedings of the Computer Security - ESORICS 2016, 2016

Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection.
Proceedings of the 16th Workshop on Algorithmic Approaches for Transportation Modelling, 2016

2015
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings.
J. Graph Algorithms Appl., 2015

Fully-Dynamic Verifiable Zero-Knowledge Order Queries for Network Data.
IACR Cryptology ePrint Archive, 2015

Knuthian Drawings of Series-Parallel Flowcharts.
CoRR, 2015

Knuthian Drawings of Series-Parallel Flowcharts.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014
Accountable Storage.
IACR Cryptology ePrint Archive, 2014

The Melbourne Shuffle: Improving Oblivious Storage in the Cloud.
CoRR, 2014

Data-Oblivious Graph Algorithms in Outsourced External Memory.
CoRR, 2014

Two-Phase Bicriterion Search for Finding Fast and Efficient Electric Vehicle Routes.
CoRR, 2014

Zig-zag Sort: A Simple Deterministic Data-Oblivious Sorting Algorithm Running in O(n log n) Time.
CoRR, 2014

Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket.
CoRR, 2014

Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets.
CoRR, 2014

The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings.
CoRR, 2014

Balanced Circle Packings for Planar Graphs.
CoRR, 2014

Spin-the-Bottle Sort and Annealing Sort: Oblivious Sorting via Round-Robin Random Comparisons.
Algorithmica, 2014

Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Zig-zag sort: a simple deterministic data-oblivious sorting algorithm running in O(n log n) time.
Proceedings of the Symposium on Theory of Computing, 2014

The Melbourne Shuffle: Improving Oblivious Storage in the Cloud.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Two-phase bicriterion search for finding fast and efficient electric vehicle routes.
Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014

The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

Balanced Circle Packings for Planar Graphs.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

Data-Oblivious Graph Algorithms in Outsourced External Memory.
Proceedings of the Combinatorial Optimization and Applications, 2014

Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Planar Orthogonal and Polyline Drawing Algorithms.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Nonadaptive Mastermind Algorithms for String and Vector Databases, with Case Studies.
IEEE Trans. Knowl. Data Eng., 2013

Category-based routing in social networks: Membership dimension and the small-world phenomenon.
Theor. Comput. Sci., 2013

Drawing Trees with Perfect Angular Resolution and Polynomial Area.
Discrete & Computational Geometry, 2013

Combinatorial Pair Testing: Distinguishing Workers from Slackers
CoRR, 2013

Achieving Good Angular Resolution in 3D Arc Diagrams.
CoRR, 2013

Streamed Graph Drawing and the File Maintenance Problem.
CoRR, 2013

Cole's Parametric Search Technique Made Practical.
CoRR, 2013

Set-Difference Range Queries.
CoRR, 2013

External-Memory Multimaps.
Algorithmica, 2013

Combinatorial Pair Testing: Distinguishing Workers from Slackers.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Streamed Graph Drawing and the File Maintenance Problem.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

Achieving Good Angular Resolution in 3D Arc Diagrams.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

Cole's Parametric Search Technique Made Practical.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Set-Difference Range Queries.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Computing betweenness centrality in external memory.
Proceedings of the 2013 IEEE International Conference on Big Data, 2013

2012
Learning Character Strings via Mastermind Queries, With a Case Study Involving mtDNA.
IEEE Trans. Information Theory, 2012

Extended dynamic subgraph statistics using h-index parameterized data structures.
Theor. Comput. Sci., 2012

Efficient Verification of Web-Content Searching Through Authenticated Web Crawlers.
PVLDB, 2012

Lombardi Drawings of Graphs.
J. Graph Algorithms Appl., 2012

Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area.
J. Graph Algorithms Appl., 2012

Data-Oblivious Graph Drawing Model and Algorithms
CoRR, 2012

Force-Directed Graph Drawing Using Social Gravity and Scaling
CoRR, 2012

Anonymous Card Shuffling and its Applications to Parallel Mixnets
CoRR, 2012

Verifying Search Results Over Web Collections
CoRR, 2012

Privacy-preserving group data access via stateless oblivious RAM simulation.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability.
Proceedings of the Design and Analysis of Algorithms, 2012

Anonymous Card Shuffling and Its Applications to Parallel Mixnets.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

More Graph Drawing in the Cloud: Data-Oblivious st-Numbering, Visibility Representations, and Orthogonal Drawing of Biconnected Planar Graphs.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

On the Density of Maximal 1-Planar Graphs.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Force-Directed Graph Drawing Using Social Gravity and Scaling.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Practical oblivious storage.
Proceedings of the Second ACM Conference on Data and Application Security and Privacy, 2012

2011
Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters.
IEEE Trans. Knowl. Data Eng., 2011

Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks.
Trans. Computational Science, 2011

Succinct Greedy Geometric Routing Using Hyperbolic Geometry.
IEEE Trans. Computers, 2011

Planar Drawings of Higher-Genus Graphs.
J. Graph Algorithms Appl., 2011

Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm.
J. ACM, 2011

Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full)
CoRR, 2011

Oblivious Storage with Low I/O Overhead
CoRR, 2011

Planar and Poly-Arc Lombardi Drawings
CoRR, 2011

Fully Retroactive Approximate Range and Nearest Neighbor Searching
CoRR, 2011

Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short)
CoRR, 2011

Oblivious RAM Simulation with Efficient Worst-Case Access Overhead
CoRR, 2011

Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps
CoRR, 2011

Privacy-Enhanced Methods for Comparing Compressed DNA Sequences
CoRR, 2011

External-Memory Network Analysis Algorithms for Naturally Sparse Graphs
CoRR, 2011

Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation
CoRR, 2011

Tracking Moving Objects with Few Handovers
CoRR, 2011

External-Memory Multimaps
CoRR, 2011

Data-Oblivious External-Memory Algorithms for the Compaction, Selection, and Sorting of Outsourced Data
CoRR, 2011

Privacy-Enhanced Reputation-Feedback Methods to Reduce Feedback Extortion in Online Auctions
CoRR, 2011

Invertible Bloom Lookup Tables
CoRR, 2011

Sorting, Searching, and Simulation in the MapReduce Framework
CoRR, 2011

Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems.
Algorithmica, 2011

Tracking Moving Objects with Few Handovers.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Brief announcement: large-scale multimaps.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

What's the difference?: efficient set reconciliation without prior context.
Proceedings of the ACM SIGCOMM 2011 Conference on Applications, 2011

Sorting, Searching, and Simulation in the MapReduce Framework.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Fully Retroactive Approximate Range and Nearest Neighbor Searching.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

External-Memory Multimaps.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Planar and Poly-arc Lombardi Drawings.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

Force-Directed Lombardi-Style Graph Drawing.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

External-Memory Network Analysis Algorithms for Naturally Sparse Graphs.
Proceedings of the Algorithms - ESA 2011, 2011

Privacy-enhanced reputation-feedback methods to reduce feedback extortion in online auctions.
Proceedings of the First ACM Conference on Data and Application Security and Privacy, 2011

Oblivious RAM simulation with efficient worst-case access overhead.
Proceedings of the 3rd ACM Cloud Computing Security Workshop, 2011

Category-based routing in social networks: Membership dimension and the small-world phenomenon.
Proceedings of the International Conference on Computational Aspects of Social Networks, 2011

Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons.
Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011

Invertible bloom lookup tables.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings.
SIAM J. Comput., 2010

Nonadaptive Mastermind Algorithms for String and Vector Databases, with Case Studies
CoRR, 2010

Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons
CoRR, 2010

Priority Range Trees
CoRR, 2010

Privacy-Preserving Data-Oblivious Geometric Algorithms for Geographic Data
CoRR, 2010

Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics
CoRR, 2010

Drawing Trees with Perfect Angular Resolution and Polynomial Area
CoRR, 2010

Lombardi Drawings of Graphs
CoRR, 2010

Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area
CoRR, 2010

MapReduce Parallel Cuckoo Hashing and Oblivious RAM Simulations
CoRR, 2010

Cloning Voronoi Diagrams via Retroactive Data Structures
CoRR, 2010

Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks
CoRR, 2010

Simulating Parallel Algorithms in the MapReduce Framework with Applications to Parallel Computational Geometry
CoRR, 2010

Turning privacy leaks into floods: surreptitious discovery of social network friendships and other sensitive binary attribute vectors.
Proceedings of the 2010 ACM Workshop on Privacy in the Electronic Society, 2010

Randomized Shellsort: A Simple Oblivious Sorting Algorithm.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks.
Proceedings of the Seventh International Symposium on Voronoi Diagrams in Science and Engineering, 2010

Priority Range Trees.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Parallel external memory graph algorithms.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Privacy-preserving data-oblivious geometric algorithms for geographic data.
Proceedings of the 18th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2010

Lombardi Drawings of Graphs.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

Drawing Trees with Perfect Angular Resolution and Polynomial Area.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

Cloning Voronoi Diagrams via Retroactive Data Structures.
Proceedings of the Algorithms, 2010

Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures.
Proceedings of the Combinatorial Optimization and Applications, 2010

Bureaucratic protocols for secure two-party sorting, selection, and permuting.
Proceedings of the 5th ACM Symposium on Information, 2010

2009
Approximate topological matching of quad meshes.
The Visual Computer, 2009

On the algorithmic complexity of the Mastermind game with black-peg results.
Inf. Process. Lett., 2009

Using audio in secure device pairing.
IJSN, 2009

Going Off-road: Transversal Complexity in Road Networks
CoRR, 2009

Randomized Shellsort: A Simple Oblivious Sorting Algorithm
CoRR, 2009

Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems
CoRR, 2009

Planar Drawings of Higher-Genus Graphs
CoRR, 2009

Pipelined Algorithms to Detect Cheating in Long-Term Grid Computations
CoRR, 2009

The Rainbow Skip Graph: A Fault-Tolerant Constant-Degree P2P Relay Structure
CoRR, 2009

Improved Adaptive Group Testing Algorithms with Applications to Multiple Access Channels and Dead Sensor Diagnosis
CoRR, 2009

An Efficient Dynamic and Distributed RSA Accumulator
CoRR, 2009

On the Algorithmic Complexity of the Mastermind Game with Black-Peg Results
CoRR, 2009

Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric
CoRR, 2009

The Mastermind Attack on Genomic Data
CoRR, 2009

On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
CoRR, 2009

On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

The Mastermind Attack on Genomic Data.
Proceedings of the 30th IEEE Symposium on Security and Privacy (S&P 2009), 2009

Linear-time algorithms for geometric graphs with sublinearly many crossings.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Reliable Resource Searching in P2P Networks.
Proceedings of the Security and Privacy in Communication Networks, 2009

Succinct Greedy Geometric Routing in the Euclidean Plane.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Going off-road: transversal complexity in road networks.
Proceedings of the 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2009

Planar Drawings of Higher-Genus Graphs.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

2008
Probabilistic packet marking for large-scale IP traceback.
IEEE/ACM Trans. Netw., 2008

Pipelined algorithms to detect cheating in long-term grid computations.
Theor. Comput. Sci., 2008

Notarized federated ID management and authentication.
Journal of Computer Security, 2008

Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis.
J. Comb. Optim., 2008

Skip Quadtrees: Dynamic Data Structures for Multidimensional Point Sets.
Int. J. Comput. Geometry Appl., 2008

Succinct Greedy Geometric Routing in R^2
CoRR, 2008

Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
CoRR, 2008

Studying (Non-Planar) Road Networks Through an Algorithmic Lens
CoRR, 2008

Succinct Greedy Graph Drawing in the Hyperbolic Plane
CoRR, 2008

Straight Skeletons of Three-Dimensional Polyhedra
CoRR, 2008

Motorcycle Graphs: Canonical Quad Mesh Partitioning.
Comput. Graph. Forum, 2008

Fundamental parallel algorithms for private-cache chip multiprocessors.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Approximate topological matching of quadrilateral meshes.
Proceedings of the 2008 International Conference on Shape Modeling and Applications (SMI 2008), 2008

Athos: Efficient Authentication of Outsourced File Systems.
Proceedings of the Information Security, 11th International Conference, 2008

Studying (non-planar) road networks through an algorithmic lens.
Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

Two-site Voronoi diagrams in geographic networks.
Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

Succinct Greedy Graph Drawing in the Hyperbolic Plane.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

Straight Skeletons of Three-Dimensional Polyhedra.
Proceedings of the Algorithms, 2008

Super-Efficient Verification of Dynamic Outsourced Databases.
Proceedings of the Topics in Cryptology, 2008

2007
Distributed Peer-to-Peer Data Structures.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Deterministic sampling and range counting in geometric data streams.
ACM Trans. Algorithms, 2007

Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes.
SIAM J. Comput., 2007

Space-Efficient Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters
CoRR, 2007

Confluent Layered Drawings.
Algorithmica, 2007

On the Cost of Persistence and Authentication in Skip Lists.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Checking Value-Sensitive Data Structures in Sublinear Space.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Guard placement for efficient point-in-polygon proofs.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

2006
Achieving Communication Efficiency through Push-Pull Partitioning of Semantic Spaces to Disseminate Dynamic Information.
IEEE Trans. Knowl. Data Eng., 2006

Choosing Colors for Geometric Graphs via Color Space Embeddings
CoRR, 2006

Guard Placement For Wireless Localization
CoRR, 2006

Efficient parallel algorithms for dead sensor diagnosis and multiple access channels.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

The rainbow skip graph: a fault-tolerant constant-degree distributed data structure.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

LAAC: A Location-Aware Access Control Protocol.
Proceedings of the 3rd Annual International ICST Conference on Mobile and Ubiquitous Systems: Computing, 2006

Loud and Clear: Human-Verifiable Authentication Based on Audio.
Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 2006

Choosing Colors for Geometric Graphs Via Color Space Embeddings.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006

Notarized Federated Identity Management for Web Services.
Proceedings of the Data and Applications Security XX, 2006

2005
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way.
J. Graph Algorithms Appl., 2005

Optimizing a constrained convex polygonal annulus.
J. Discrete Algorithms, 2005

Loud and Clear: Human-Verifiable Authentication Based on Audio.
IACR Cryptology ePrint Archive, 2005

Delta-confluent Drawings
CoRR, 2005

Confluent Layered Drawings
CoRR, 2005

Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets
CoRR, 2005

The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data
CoRR, 2005

Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes
CoRR, 2005

Biased Skip Lists.
Algorithmica, 2005

Improved Combinatorial Group Testing for Real-World Problem Sizes.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Balanced Aspect Ratio Trees Revisited.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Leap-Frog Packet Linking and Diverse Key Distributions for Improved Integrity in Network Broadcasts.
Proceedings of the 2005 IEEE Symposium on Security and Privacy (S&P 2005), 2005

Skip-webs: efficient distributed data structures for multi-dimensional data sets.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

C-Planarity of Extrovert Clustered Graphs.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

Delta-Confluent Drawings.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

Secure Biometric Authentication for Weak Computational Devices.
Proceedings of the Financial Cryptography and Data Security, 2005

The skip quadtree: a simple dynamic data structure for multidimensional data.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Accredited DomainKeys: A Service Architecture for Improved Email Validation.
Proceedings of the CEAS 2005, 2005

Indexing Information for Data Forensics.
Proceedings of the Applied Cryptography and Network Security, 2005

Searching for High-Value Rare Events with Uncheatable Grid Computing.
Proceedings of the Applied Cryptography and Network Security, 2005

2004
Data Structures in JDSL.
Proceedings of the Handbook of Data Structures and Applications., 2004

Approximate Geometric Query Structures.
Proceedings of the Handbook of Data Structures and Applications., 2004

Parallel algorithms in geometry.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Drawing Planar Graphs with Large Vertices and Thick Edges.
J. Graph Algorithms Appl., 2004

Contour interpolation by straight skeletons.
Graphical Models, 2004

A multi-dimensional approach to force-directed layouts of large graphs.
Comput. Geom., 2004

Three-Dimensional Layers of Maxima.
Algorithmica, 2004

Confluent Layered Drawings.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

Efficient Tree-Based Revocation in Groups of Low-State Devices.
Proceedings of the Advances in Cryptology, 2004

Deterministic sampling and range counting in geometric data streams.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Data structures and algorithms in C++.
Wiley, ISBN: 978-0-471-42924-1, 2004

2003
Deterministic Sampling and Range Counting in Geometric Data Streams
CoRR, 2003

Planarity-preserving clustering and embedding for large planar graphs.
Comput. Geom., 2003

Constructing Disjoint Paths for Secure Communication.
Proceedings of the Distributed Computing, 17th International Conference, 2003

Drawing Graphs with Large Vertices and Thick Edges.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Straight-skeleton based contour interpolation.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Authenticated Dictionaries for Fresh Attribute Credentials.
Proceedings of the Trust Management, First International Conference, 2003

Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

Selected Open Problems in Graph Drawing.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

Efficient and Scalable Infrastructure Support for Dynamic Coalitions.
Proceedings of the 3rd DARPA Information Survivability Conference and Exposition (DISCEX-III 2003), 2003

Distributed Data Authenication (System Demonstration).
Proceedings of the 3rd DARPA Information Survivability Conference and Exposition (DISCEX-III 2003), 2003

Authenticated Data Structures for Graph and Geometric Searching.
Proceedings of the Topics in Cryptology, 2003

Data structures and algorithms in Java (3. ed.).
Wiley, ISBN: 978-0-471-64452-1, 2003

2002
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
CoRR, 2002

Optimizing area and aspect ration in straight-line orthogonal tree drawings.
Comput. Geom., 2002

Guest Editor's Foreword.
Algorithmica, 2002

Efficiently Approximating Polygonal Paths in Three and Higher Dimensions.
Algorithmica, 2002

An Efficient Dynamic and Distributed Cryptographic Accumulator.
Proceedings of the Information Security, 5th International Conference, 2002

Biased Skip Lists.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Three-Dimensional Layers of Maxima.
Proceedings of the Algorithms, 2002

Efficient packet marking for large-scale IP traceback.
Proceedings of the 9th ACM Conference on Computer and Communications Security, 2002

Algorithm design - foundations, analysis and internet examples.
Wiley, ISBN: 978-0-471-38365-9, 2002

2001
Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees.
J. Algorithms, 2001

Drawing Planar Graphs with Circular Arcs.
Discrete & Computational Geometry, 2001

Voronoi Diagrams for Convex Polygon-Offset Distance Functions.
Discrete & Computational Geometry, 2001

A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time.
Discrete & Computational Geometry, 2001

Seller-Focused Algorithms for Online Auctioning.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Teaching internet algorithmics.
Proceedings of the 32rd SIGCSE Technical Symposium on Computer Science Education, 2001

TRICERT: A Distributed Certified E-Mail Scheme.
Proceedings of the Network and Distributed System Security Symposium, 2001

Persistent Authenticated Dictionaries and Their Applications.
Proceedings of the Information Security, 4th International Conference, 2001

Efficient perspective-accurate silhouette computation and applications.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Matching points to a convex polygonal boundary.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs.
J. Graph Algorithms Appl., 2000

A Framework for Drawing Planar Graphs with Curves and Polylines.
J. Algorithms, 2000

Editorial.
Comput. Geom., 2000

Competitive tree-structured dictionaries.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

SAIL: a system for generating, archiving, and retrieving specialized assignments using LATEX.
Proceedings of the 31st SIGCSE Technical Symposium on Computer Science Education, 2000

PILOT: an interactive tool for learning and grading.
Proceedings of the 31st SIGCSE Technical Symposium on Computer Science Education, 2000

A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs.
Proceedings of the Graph Drawing, 8th International Symposium, 2000

K-D Trees Are Better when Cut on the Longest Side.
Proceedings of the Algorithms, 2000

Range Searching Over Tree Cross Products.
Proceedings of the Algorithms, 2000

Linear-time triangulation of a simple polygon made easier via randomization.
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999
Communication-Efficient Parallel Sorting.
SIAM J. Comput., 1999

Approximate Geometric Pattern Matching Under Rigid Motions.
IEEE Trans. Pattern Anal. Mach. Intell., 1999

GeomNet: Geometric Computing Over the Internet.
IEEE Internet Computing, 1999

Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Using randomization in the teaching of data structures and algorithms.
Proceedings of the 30th SIGCSE Technical Symposium on Computer Science Education, 1999

Testers and visualizers for teaching data structures.
Proceedings of the 30th SIGCSE Technical Symposium on Computer Science Education, 1999

Planarity-Preserving Clustering and Embedding for Large Planar Graphs.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

Drawing Planar Graphs with Circular Arcs.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

Efficient Perspective-Accurate Silhouette Computation.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

Accessing the Internal Organization of Data Structures in the JDSL Library.
Proceedings of the Algorithm Engineering and Experimentation, 1999

1998
Dynamic Trees and Dynamic Point Location.
SIAM J. Comput., 1998

An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction.
Int. J. Comput. Geometry Appl., 1998

Offset-polygon annulus placement problems.
Comput. Geom., 1998

Teaching the analysis of algorithms with visual proofs.
Proceedings of the 29th SIGCSE Technical Symposium on Computer Science Education, 1998, Atlanta, Georgia, USA, February 26, 1998

Teaching data structure design patterns.
Proceedings of the 29th SIGCSE Technical Symposium on Computer Science Education, 1998, Atlanta, Georgia, USA, February 26, 1998

A Framework for Drawing Planar Graphs with Curves and Polylines.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

Efficiently Approximating Polygonal Paths in Three and Higher Dimensions.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Data structures and algorithms in Java.
World wide series in computer science, Wiley, ISBN: 978-0-471-19308-1, 1998

1997
Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations.
J. Algorithms, 1997

Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming.
Discrete & Computational Geometry, 1997

Fast Randomized Parallel Methods for Planar Convex Hull Construction.
Comput. Geom., 1997

On the Complexity of Optimization Problems for 3-dimensional Convex Polyhedra and Decision Trees.
Comput. Geom., 1997

Geometric Pattern Matching Under Euclidean Motion.
Comput. Geom., 1997

Voronoi Diagrams for Polygon-Offset Distance Functions.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Offset-Polygon Annulus Placement Problems.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Methods for Achieving Fast Query Times in Point Location Data Structures.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Randomized Fully-Scalable BSP Techniques for Multi-Searching and Convex Hull Construction (Preliminary Version).
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Efficient Approximation and Optimization Algorithms for Computational Metrology.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Snap Rounding Line Segments Efficiently in Two and Three Dimensions.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Classical Computational Geometry in GeomNet.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Animating the Polygon-Offset Distance Function.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation.
J. ACM, 1996

Planar upward tree drawings with optimal area.
Int. J. Comput. Geometry Appl., 1996

A Bridging Model for Parallel Computation, Communication, and I/O.
ACM Comput. Surv., 1996

Blocking for External Graph Searching.
Algorithmica, 1996

Sweep Methods for Parallel Computational Geometry.
Algorithmica, 1996

A Nearly Optimal Deterministic Parallel Voroni Diagram Algorithm.
Algorithmica, 1996

Communication-Efficient Parallel Sorting (Preliminary Version).
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Fixed-Dimensional Parallel Linesr Programming via epsilon-Relative-Approximations.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version).
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995
Planar Separators and Parallel Polygon Triangulation.
J. Comput. Syst. Sci., 1995

Efficient Piecewise-Linear Function Approximation Using the Uniform Metric.
Discrete & Computational Geometry, 1995

Almost Optimal Set Covers in Finite VC-Dimension.
Discrete & Computational Geometry, 1995

On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version).
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Topology B-Trees and Their Applications.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Computing faces in segment and simplex arrangements (Preliminary Version).
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

External-Memory Graph Algorithms.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1994
Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations.
J. ACM, 1994

Optimal Parallel Approximation for Prefix Sums and Integer Sorting.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Characterization and Recognition of Point-Halfspace and Related Orders.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Parallel Algorithms for Higher-Dimensional Convex Hulls
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

Practical Methods for Approximate Geometric Pattern Matching Under Rigid Motions (Preliminary Version).
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Efficient Piecewise-Linear Function Approximation Using the Uniform Metric (Preliminary Version).
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version).
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Biased Finger Trees and Three-Dimensional Layers of Maxima (Preliminary Version).
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993
Output-Sensitive Methods for Rectilinear Hidden Surface Removal
Inf. Comput., November, 1993

P-complete geometric problems.
Int. J. Comput. Geometry Appl., 1993

Constructing Arrangement Optimally in Parallel.
Discrete & Computational Geometry, 1993

An Addendum to Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons.
Algorithmica, 1993

Constructing the Voronoi Diagram of a Set of Line Segments in Parallel.
Algorithmica, 1993

Point Probe Decision Trees for Geometric Concept Classes.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Blocking for External Graph Searching.
Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1993

Approximate Parallel Prefix Computation and its Applications.
Proceedings of the Seventh International Parallel Processing Symposium, 1993

Experimental Evidence for the Power of Random Samplings in Practical Parallel Algorithms.
Proceedings of the Seventh International Parallel Processing Symposium, 1993

External-Memory Computational Geometry (Preliminary Version)
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

Dynamic Ray Shooting and Shortest Paths Via Balanced Geodesic Triangulations.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

Geometric Partitioning Made Easier, Even in Parallel.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

Area-Efficient Upward Tree Drawings.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

Geometric Pattern Matching Under Euclidean Motion.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
A polygonal approach to hidden-line and hidden-surface elimination.
CVGIP: Graphical Model and Image Processing, 1992

Constructing the Convex Hull of a Partially Sorted Set of Points.
Comput. Geom., 1992

Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons.
Algorithmica, 1992

Optimal Parallel Algorithms for Point-Set and Polygon Problems.
Algorithmica, 1992

Planar Separators and Parallel Polygon Triangulation (Preliminary Version)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991
A localized method for intersecting plane algebraic curve segments.
The Visual Computer, 1991

Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors.
SIAM J. Comput., 1991

Dynamic Trees and Dynamic Point Location (Preliminary Version)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Constructing Arrangements Optimally in Parallel (Preliminary Version).
SPAA, 1991

In-Place Techniques for Parallel Convex Hull Algorithms (Preliminary Version).
SPAA, 1991

Using Approximation Algorithms to Design Parallel Algorithms that May Ignore Processor Allocation (Preliminary Version)
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
On Performing Robust Order Statistics in Tree-Structured Dictionary Machines.
J. Parallel Distrib. Comput., 1990

Stabbing Parallel Segments with a Convex Polygon.
Computer Vision, Graphics, and Image Processing, 1990

Generalized Sweep Methods for Parallel Computational Geometry.
SPAA, 1990

P-Complete Geometric Problems.
SPAA, 1990

Applying Parallel Processing Techniques to Classification Problems in Constructive Solid Geometry.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version).
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version).
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

Parallel Methods for Visibility and Shortest Path Problems in Simple Polygons (Preliminary Version).
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms.
SIAM J. Comput., 1989

Triangulating a Polygon in Parallel.
J. Algorithms, 1989

Stabbing Parallel Segments with a Convex Polygon (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 1989

Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version).
Proceedings of the Algorithms and Data Structures, 1989

Intersecting Line Segments in Parallel With an Output-Sensitive Number of Processors.
SPAA, 1989

Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation (Preliminary Version)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988
Parallel algorithms for shortest path problems in polygons.
The Visual Computer, 1988

Parallel Algorithms for Some Functions of two Convex Polygons.
Algorithmica, 1988

Optimal Parallel Algorithms for Polygon and Point-Set Problems.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987
Finding the Convex Hull of a Sorted Point Set in Parallel.
Inf. Process. Lett., 1987

Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986
Efficient Parallel Solutions to Some Geometric Problems.
J. Parallel Distrib. Comput., 1986

Efficient Plane Sweeping in Parallel.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985
Efficient Parallel Solutions to Geometric Problems.
Proceedings of the International Conference on Parallel Processing, 1985


  Loading...