2009 | ||
---|---|---|
214 | EE | David Eppstein, Michael T. Goodrich, Darren Strash: Linear-time algorithms for geometric graphs with sublinearly many crossings. SODA 2009: 150-159 |
213 | EE | Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker: On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem CoRR abs/0904.3756: (2009) |
212 | EE | Michael T. Goodrich: The Mastermind Attack on Genomic Data CoRR abs/0904.4458: (2009) |
211 | EE | Mikhail J. Atallah, Marina Blanton, Michael T. Goodrich, Stanislas Polu: Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric CoRR abs/0904.4670: (2009) |
210 | EE | Michael T. Goodrich: On the Algorithmic Complexity of the Mastermind Game with Black-Peg Results CoRR abs/0904.4911: (2009) |
2008 | ||
209 | EE | Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos: Super-Efficient Verification of Dynamic Outsourced Databases. CT-RSA 2008: 407-424 |
208 | EE | Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman: Straight Skeletons of Three-Dimensional Polyhedra. ESA 2008: 148-160 |
207 | EE | David Eppstein, Michael T. Goodrich: Studying (non-planar) road networks through an algorithmic lens. GIS 2008: 16 |
206 | EE | Matthew T. Dickerson, Michael T. Goodrich: Two-site Voronoi diagrams in geographic networks. GIS 2008: 59 |
205 | EE | David Eppstein, Michael T. Goodrich: Succinct Greedy Graph Drawing in the Hyperbolic Plane. Graph Drawing 2008: 14-25 |
204 | EE | Michael T. Goodrich, Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos: Athos: Efficient Authentication of Outsourced File Systems. ISC 2008: 80-96 |
203 | EE | Lars Arge, Michael T. Goodrich, Michael Nelson, Nodari Sitchinava: Fundamental parallel algorithms for private-cache chip multiprocessors. SPAA 2008: 197-206 |
202 | EE | David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf: Approximate topological matching of quadrilateral meshes. Shape Modeling International 2008: 83-92 |
201 | EE | Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman: Straight Skeletons of Three-Dimensional Polyhedra CoRR abs/0805.0022: (2008) |
200 | EE | David Eppstein, Michael T. Goodrich: Succinct Greedy Graph Drawing in the Hyperbolic Plane CoRR abs/0806.0341: (2008) |
199 | EE | David Eppstein, Michael T. Goodrich: Studying (Non-Planar) Road Networks Through an Algorithmic Lens CoRR abs/0808.3694: (2008) |
198 | EE | David Eppstein, Michael T. Goodrich, Darren Strash: Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings CoRR abs/0812.0893: (2008) |
197 | EE | Michael T. Goodrich, Darren Strash: Succinct Greedy Geometric Routing in R^2 CoRR abs/0812.3893: (2008) |
196 | EE | David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf: Motorcycle Graphs: Canonical Quad Mesh Partitioning. Comput. Graph. Forum 27(5): 1477-1486 (2008) |
195 | EE | Michael T. Goodrich: Probabilistic packet marking for large-scale IP traceback. IEEE/ACM Trans. Netw. 16(1): 15-24 (2008) |
194 | EE | David Eppstein, Michael T. Goodrich, Jonathan Z. Sun: Skip Quadtrees: Dynamic Data Structures for Multidimensional Point Sets. Int. J. Comput. Geometry Appl. 18(1/2): 131-160 (2008) |
193 | EE | Michael T. Goodrich, Daniel S. Hirschberg: Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis. J. Comb. Optim. 15(1): 95-121 (2008) |
192 | EE | Michael T. Goodrich, Roberto Tamassia, Danfeng (Daphne) Yao: Notarized federated ID management and authentication. Journal of Computer Security 16(4): 399-418 (2008) |
191 | EE | Michael T. Goodrich: Pipelined algorithms to detect cheating in long-term grid computations. Theor. Comput. Sci. 408(2-3): 199-207 (2008) |
2007 | ||
190 | EE | Michael T. Goodrich, Jonathan Z. Sun: Checking Value-Sensitive Data Structures in Sublinear Space. ISAAC 2007: 353-364 |
189 | EE | David Eppstein, Michael T. Goodrich, Nodari Sitchinava: Guard placement for efficient point-in-polygon proofs. Symposium on Computational Geometry 2007: 27-36 |
188 | EE | Mikhail J. Atallah, Marina Blanton, Michael T. Goodrich, Stanislas Polu: Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric. WADS 2007: 114-126 |
187 | EE | David Eppstein, Michael T. Goodrich: Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters. WADS 2007: 637-648 |
186 | EE | Michael T. Goodrich, Charalampos Papamanthou, Roberto Tamassia: On the Cost of Persistence and Authentication in Skip Lists. WEA 2007: 94-107 |
185 | EE | Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich: Deterministic sampling and range counting in geometric data streams. ACM Transactions on Algorithms 3(2): (2007) |
184 | EE | David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Layered Drawings. Algorithmica 47(4): 439-452 (2007) |
183 | EE | David Eppstein, Michael T. Goodrich: Space-Efficient Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters CoRR abs/0704.3313: (2007) |
182 | EE | David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg: Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. SIAM J. Comput. 36(5): 1360-1375 (2007) |
2006 | ||
181 | EE | Michael T. Goodrich, Roberto Tamassia, Danfeng Yao: Notarized Federated Identity Management for Web Services. DBSec 2006: 133-147 |
180 | EE | Michael B. Dillencourt, David Eppstein, Michael T. Goodrich: Choosing Colors for Geometric Graphs Via Color Space Embeddings. Graph Drawing 2006: 294-305 |
179 | EE | Michael T. Goodrich, Michael Sirivianos, John Solis, Gene Tsudik, Ersin Uzun: Loud and Clear: Human-Verifiable Authentication Based on Audio. ICDCS 2006: 10 |
178 | EE | Michael T. Goodrich, Michael J. Nelson, Jonathan Z. Sun: The rainbow skip graph: a fault-tolerant constant-degree distributed data structure. SODA 2006: 384-393 |
177 | EE | Michael T. Goodrich, Daniel S. Hirschberg: Efficient parallel algorithms for dead sensor diagnosis and multiple access channels. SPAA 2006: 118-127 |
176 | EE | David Eppstein, Michael T. Goodrich, Nodari Sitchinava: Guard Placement For Wireless Localization CoRR abs/cs/0603057: (2006) |
175 | EE | Michael B. Dillencourt, David Eppstein, Michael T. Goodrich: Choosing Colors for Geometric Graphs via Color Space Embeddings CoRR abs/cs/0609033: (2006) |
174 | EE | Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Chen Li, Michal Shmueli-Scheuer: Achieving Communication Efficiency through Push-Pull Partitioning of Semantic Spaces to Disseminate Dynamic Information. IEEE Trans. Knowl. Data Eng. 18(10): 1352-1367 (2006) |
2005 | ||
173 | EE | Wenliang Du, Michael T. Goodrich: Searching for High-Value Rare Events with Uncheatable Grid Computing. ACNS 2005: 122-137 |
172 | EE | Michael T. Goodrich, Mikhail J. Atallah, Roberto Tamassia: Indexing Information for Data Forensics. ACNS 2005: 206-221 |
171 | EE | Michael T. Goodrich, Roberto Tamassia, Danfeng Yao: Accredited DomainKeys: A Service Architecture for Improved Email Validation. CEAS 2005 |
170 | EE | Mikhail J. Atallah, Keith B. Frikken, Michael T. Goodrich, Roberto Tamassia: Secure Biometric Authentication for Weak Computational Devices. Financial Cryptography 2005: 357-371 |
169 | EE | David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Delta-Confluent Drawings. Graph Drawing 2005: 165-176 |
168 | EE | Michael T. Goodrich, George S. Lueker, Jonathan Z. Sun: C-Planarity of Extrovert Clustered Graphs. Graph Drawing 2005: 211-222 |
167 | EE | Michael T. Goodrich: Leap-Frog Packet Linking and Diverse Key Distributions for Improved Integrity in Network Broadcasts. IEEE Symposium on Security and Privacy 2005: 196-207 |
166 | EE | Lars Arge, David Eppstein, Michael T. Goodrich: Skip-webs: efficient distributed data structures for multi-dimensional data sets. PODC 2005: 69-76 |
165 | EE | David Eppstein, Michael T. Goodrich, Jonathan Z. Sun: The skip quadtree: a simple dynamic data structure for multidimensional data. Symposium on Computational Geometry 2005: 296-305 |
164 | EE | Amitabh Chaudhary, Michael T. Goodrich: Balanced Aspect Ratio Trees Revisited. WADS 2005: 73-85 |
163 | EE | David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg: Improved Combinatorial Group Testing for Real-World Problem Sizes. WADS 2005: 86-98 |
162 | EE | Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich: Biased Skip Lists. Algorithmica 42(1): 31-48 (2005) |
161 | EE | David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg: Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes CoRR abs/cs/0505048: (2005) |
160 | EE | David Eppstein, Michael T. Goodrich, Jonathan Z. Sun: The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data CoRR abs/cs/0507049: (2005) |
159 | EE | Lars Arge, David Eppstein, Michael T. Goodrich: Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets CoRR abs/cs/0507050: (2005) |
158 | EE | David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Layered Drawings CoRR abs/cs/0507051: (2005) |
157 | EE | David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Delta-confluent Drawings CoRR abs/cs/0510024: (2005) |
156 | EE | Gill Barequet, Prosenjit Bose, Matthew T. Dickerson, Michael T. Goodrich: Optimizing a constrained convex polygonal annulus. J. Discrete Algorithms 3(1): 1-26 (2005) |
155 | EE | Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. J. Graph Algorithms Appl. 9(1): 31-52 (2005) |
2004 | ||
154 | EE | Michael T. Goodrich, Jonathan Z. Sun, Roberto Tamassia: Efficient Tree-Based Revocation in Groups of Low-State Devices. CRYPTO 2004: 511-527 |
153 | EE | David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Layered Drawings. Graph Drawing 2004: 184-194 |
152 | EE | Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich: Deterministic sampling and range counting in geometric data streams. Symposium on Computational Geometry 2004: 144-151 |
151 | EE | Adam L. Buchsbaum, Michael T. Goodrich: Three-Dimensional Layers of Maxima. Algorithmica 39(4): 275-286 (2004) |
150 | EE | Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov: A multi-dimensional approach to force-directed layouts of large graphs. Comput. Geom. 29(1): 3-18 (2004) |
149 | EE | Gill Barequet, Michael T. Goodrich, Aya Levi-Steiner, Dvir Steiner: Contour interpolation by straight skeletons. Graphical Models 66(4): 245-260 (2004) |
148 | EE | Gill Barequet, Michael T. Goodrich, Chris Riley: Drawing Planar Graphs with Large Vertices and Thick Edges. J. Graph Algorithms Appl. 8: 3-20 (2004) |
2003 | ||
147 | EE | Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos, Robert F. Cohen: Authenticated Data Structures for Graph and Geometric Searching. CT-RSA 2003: 295-313 |
146 | EE | Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Shouhuai Xu: Constructing Disjoint Paths for Secure Communication. DISC 2003: 181-195 |
145 | EE | Michael T. Goodrich, Roberto Tamassia: Efficient and Scalable Infrastructure Support for Dynamic Coalitions. DISCEX (2) 2003: 246-251 |
144 | EE | Michael T. Goodrich, Michael Shin, Christian D. Straub, Roberto Tamassia: Distributed Data Authenication (System Demonstration). DISCEX (2) 2003: 58-59 |
143 | EE | Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. Graph Drawing 2003: 1-12 |
142 | EE | Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel: Selected Open Problems in Graph Drawing. Graph Drawing 2003: 515-539 |
141 | EE | Gill Barequet, Michael T. Goodrich, Aya Levi-Steiner, Dvir Steiner: Straight-skeleton based contour interpolation. SODA 2003: 119-127 |
140 | EE | Gill Barequet, Michael T. Goodrich, Chris Riley: Drawing Graphs with Large Vertices and Thick Edges. WADS 2003: 281-293 |
139 | EE | Michael T. Goodrich, Michael Shin, Roberto Tamassia, William H. Winsborough: Authenticated Dictionaries for Fresh Attribute Credentials. iTrust 2003: 332-347 |
138 | EE | Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich: Deterministic Sampling and Range Counting in Geometric Data Streams CoRR cs.CG/0307027: (2003) |
137 | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Planarity-preserving clustering and embedding for large planar graphs. Comput. Geom. 24(2): 95-114 (2003) | |
2002 | ||
136 | Stephen G. Kobourov, Michael T. Goodrich: Graph Drawing, 10th International Symposium, GD 2002, Irvine, CA, USA, August 26-28, 2002, Revised Papers Springer 2002 | |
135 | EE | Michael T. Goodrich: Efficient packet marking for large-scale IP traceback. ACM Conference on Computer and Communications Security 2002: 117-126 |
134 | EE | Adam L. Buchsbaum, Michael T. Goodrich: Three-Dimensional Layers of Maxima. ESA 2002: 257-269 |
133 | EE | Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich: Biased Skip Lists. ISAAC 2002: 1-13 |
132 | EE | Michael T. Goodrich, Roberto Tamassia, Jasminka Hasic: An Efficient Dynamic and Distributed Cryptographic Accumulator. ISC 2002: 372-388 |
131 | EE | Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink: Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. Algorithmica 33(2): 150-167 (2002) |
130 | EE | Michael T. Goodrich: Guest Editor's Foreword. Algorithmica 33(3): 271 (2002) |
129 | EE | Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way CoRR cs.CG/0212046: (2002) |
128 | Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia: Optimizing area and aspect ration in straight-line orthogonal tree drawings. Comput. Geom. 23(2): 153-162 (2002) | |
2001 | ||
127 | EE | Matthew Dickerson, Michael T. Goodrich: Matching points to a convex polygonal boundary. CCCG 2001: 89-92 |
126 | EE | Aris Anagnostopoulos, Michael T. Goodrich, Roberto Tamassia: Persistent Authenticated Dictionaries and Their Applications. ISC 2001: 379-393 |
125 | EE | Giuseppe Ateniese, Breno de Medeiros, Michael T. Goodrich: TRICERT: A Distributed Certified E-Mail Scheme. NDSS 2001 |
124 | EE | Michael T. Goodrich, Roberto Tamassia: Teaching internet algorithmics. SIGCSE 2001: 129-133 |
123 | EE | Mihai Pop, Christian A. Duncan, Gill Barequet, Michael T. Goodrich, Wenjing Huang, Subodh Kumar: Efficient perspective-accurate silhouette computation and applications. Symposium on Computational Geometry 2001: 60-68 |
122 | EE | Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, Vijay Kumar: Seller-Focused Algorithms for Online Auctioning. WADS 2001: 135-147 |
121 | EE | Gill Barequet, Matthew Dickerson, Michael T. Goodrich: Voronoi Diagrams for Convex Polygon-Offset Distance Functions. Discrete & Computational Geometry 25(2): 271-291 (2001) |
120 | EE | C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Drawing Planar Graphs with Circular Arcs. Discrete & Computational Geometry 25(3): 405-418 (2001) |
119 | EE | Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos: A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time. Discrete & Computational Geometry 26(2): 245-265 (2001) |
118 | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees. J. Algorithms 38(1): 303-333 (2001) | |
2000 | ||
117 | Adam L. Buchsbaum, Michael T. Goodrich, Jeffery Westbrook: Range Searching Over Tree Cross Products. ESA 2000: 120-131 | |
116 | Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich: K-D Trees Are Better when Cut on the Longest Side. ESA 2000: 179-190 | |
115 | EE | Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov: A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs. Graph Drawing 2000: 211-221 |
114 | EE | Stina S. Bridgeman, Michael T. Goodrich, Stephen G. Kobourov, Roberto Tamassia: PILOT: an interactive tool for learning and grading. SIGCSE 2000: 139-143 |
113 | EE | Stina S. Bridgeman, Michael T. Goodrich, Stephen G. Kobourov, Roberto Tamassia: SAIL: a system for generating, archiving, and retrieving specialized assignments using LATEX. SIGCSE 2000: 300-304 |
112 | EE | Michael T. Goodrich: Competitive tree-structured dictionaries. SODA 2000: 494-495 |
111 | EE | Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos: Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling. SODA 2000: 705-706 |
110 | EE | Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos: Linear-time triangulation of a simple polygon made easier via randomization. Symposium on Computational Geometry 2000: 201-212 |
109 | Michael T. Goodrich: Editorial. Comput. Geom. 16(1): 1-2 (2000) | |
108 | Michael T. Goodrich, Christopher G. Wagner: A Framework for Drawing Planar Graphs with Curves and Polylines. J. Algorithms 37(2): 399-421 (2000) | |
107 | EE | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs. J. Graph Algorithms Appl. 4(3): 19-46 (2000) |
1999 | ||
106 | Michael T. Goodrich, Catherine C. McGeoch: Algorithm Engineering and Experimentation, International Workshop ALENEX '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers Springer 1999 | |
105 | EE | Michael T. Goodrich, Mark Handy, Benoît Hudson, Roberto Tamassia: Accessing the Internal Organization of Data Structures in the JDSL Library. ALENEX 1999: 124-139 |
104 | EE | C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Drawing Planar Graphs with Circular Arcs. Graph Drawing 1999: 117-126 |
103 | EE | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Planarity-Preserving Clustering and Embedding for Large Planar Graphs. Graph Drawing 1999: 186-196 |
102 | EE | Ryan Shaun Baker, Michael Boilen, Michael T. Goodrich, Roberto Tamassia, B. Aaron Stibel: Testers and visualizers for teaching data structures. SIGCSE 1999: 261-265 |
101 | EE | Michael T. Goodrich, Roberto Tamassia: Using randomization in the teaching of data structures and algorithms. SIGCSE 1999: 53-57 |
100 | EE | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees. SODA 1999: 300-309 |
99 | EE | Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Subodh Kumar, Mihai Pop: Efficient Perspective-Accurate Silhouette Computation. Symposium on Computational Geometry 1999: 417-418 |
98 | EE | Michael T. Goodrich, John G. Kloss II: Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences. WADS 1999: 205-216 |
97 | Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Stina S. Bridgeman, Roberto Tamassia: GeomNet: Geometric Computing Over the Internet. IEEE Internet Computing 3(2): 21-29 (1999) | |
96 | EE | Michael T. Goodrich, Joseph S. B. Mitchell, Mark W. Orletsky: Approximate Geometric Pattern Matching Under Rigid Motions. IEEE Trans. Pattern Anal. Mach. Intell. 21(4): 371-379 (1999) |
95 | Michael T. Goodrich: Communication-Efficient Parallel Sorting. SIAM J. Comput. 29(2): 416-432 (1999) | |
1998 | ||
94 | EE | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs. Graph Drawing 1998: 111-124 |
93 | EE | Michael T. Goodrich, Christopher G. Wagner: A Framework for Drawing Planar Graphs with Curves and Polylines. Graph Drawing 1998: 153-166 |
92 | EE | Michael T. Goodrich, Roberto Tamassia: Teaching the analysis of algorithms with visual proofs. SIGCSE 1998: 207-211 |
91 | EE | Natasha Gelfand, Michael T. Goodrich, Roberto Tamassia: Teaching data structure design patterns. SIGCSE 1998: 331-335 |
90 | EE | Gill Barequet, Michael T. Goodrich: Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. Symposium on Computational Geometry 1998: 317-326 |
89 | Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich: Offset-polygon annulus placement problems. Comput. Geom. 11(3-4): 125-141 (1998) | |
88 | Michael T. Goodrich: An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction. Int. J. Comput. Geometry Appl. 8(1): 1-24 (1998) | |
87 | Michael T. Goodrich, Roberto Tamassia: Dynamic Trees and Dynamic Point Location. SIAM J. Comput. 28(2): 612-636 (1998) | |
1997 | ||
86 | Christian A. Duncan, Michael T. Goodrich, Edgar A. Ramos: Efficient Approximation and Optimization Algorithms for Computational Metrology. SODA 1997: 121-130 | |
85 | Michael T. Goodrich, Mark W. Orletsky, Kumar Ramaiyer: Methods for Achieving Fast Query Times in Point Location Data Structures. SODA 1997: 757-766 | |
84 | Michael T. Goodrich: Randomized Fully-Scalable BSP Techniques for Multi-Searching and Convex Hull Construction (Preliminary Version). SODA 1997: 767-776 | |
83 | EE | Michael T. Goodrich, Leonidas J. Guibas, John Hershberger, Paul J. Tanenbaum: Snap Rounding Line Segments Efficiently in Two and Three Dimensions. Symposium on Computational Geometry 1997: 284-293 |
82 | EE | Gill Barequet, Stina S. Bridgeman, Christian A. Duncan, Michael T. Goodrich, Roberto Tamassia: Classical Computational Geometry in GeomNet. Symposium on Computational Geometry 1997: 412-414 |
81 | EE | Gill Barequet, Amy J. Briggs, Matthew Dickerson, Cristian Dima, Michael T. Goodrich: Animating the Polygon-Offset Distance Function. Symposium on Computational Geometry 1997: 479-480 |
80 | Gill Barequet, Matthew Dickerson, Michael T. Goodrich: Voronoi Diagrams for Polygon-Offset Distance Functions. WADS 1997: 200-209 | |
79 | Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich: Offset-Polygon Annulus Placement Problems. WADS 1997: 378-391 | |
78 | L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets: Geometric Pattern Matching Under Euclidean Motion. Comput. Geom. 7: 113-124 (1997) | |
77 | Mujtaba R. Ghouse, Michael T. Goodrich: Fast Randomized Parallel Methods for Planar Convex Hull Construction. Comput. Geom. 7: 219-235 (1997) | |
76 | Gautam Das, Michael T. Goodrich: On the Complexity of Optimization Problems for 3-dimensional Convex Polyhedra and Decision Trees. Comput. Geom. 8: 123-137 (1997) | |
75 | EE | Michael T. Goodrich, Edgar A. Ramos: Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming. Discrete & Computational Geometry 18(4): 397-420 (1997) |
74 | Michael T. Goodrich, Roberto Tamassia: Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations. J. Algorithms 23(1): 51-73 (1997) | |
1996 | ||
73 | Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia: Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. Graph Drawing 1996: 63-75 | |
72 | Michael T. Goodrich: Fixed-Dimensional Parallel Linesr Programming via epsilon-Relative-Approximations. SODA 1996: 132-141 | |
71 | EE | Michael T. Goodrich: Communication-Efficient Parallel Sorting (Preliminary Version). STOC 1996: 247-256 |
70 | EE | Marek Chrobak, Michael T. Goodrich, Roberto Tamassia: Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version). Symposium on Computational Geometry 1996: 319-328 |
69 | Thomas H. Cormen, Michael T. Goodrich: A Bridging Model for Parallel Computation, Communication, and I/O. ACM Comput. Surv. 28(4es): 208 (1996) | |
68 | Michael T. Goodrich, Mujtaba R. Ghouse, J. Bright: Sweep Methods for Parallel Computational Geometry. Algorithmica 15(2): 126-153 (1996) | |
67 | Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott Vitter: Blocking for External Graph Searching. Algorithmica 16(2): 181-214 (1996) | |
66 | Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing: A Nearly Optimal Deterministic Parallel Voroni Diagram Algorithm. Algorithmica 16(6): 569-617 (1996) | |
65 | Ashim Garg, Michael T. Goodrich, Roberto Tamassia: Planar upward tree drawings with optimal area. Int. J. Comput. Geometry Appl. 6(3): 333-356 (1996) | |
64 | EE | Michael T. Goodrich, S. Rao Kosaraju: Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation. J. ACM 43(2): 331-361 (1996) |
1995 | ||
63 | Yi-Jen Chiang, Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, Jeffrey Scott Vitter: External-Memory Graph Algorithms. SODA 1995: 139-149 | |
62 | EE | Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos: Computing faces in segment and simplex arrangements (Preliminary Version). STOC 1995: 672-682 |
61 | Paul B. Callahan, Michael T. Goodrich, Kumar Ramaiyer: Topology B-Trees and Their Applications. WADS 1995: 381-392 | |
60 | Gautam Das, Michael T. Goodrich: On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version). WADS 1995: 74-85 | |
59 | Michael T. Goodrich: Efficient Piecewise-Linear Function Approximation Using the Uniform Metric. Discrete & Computational Geometry 14(4): 445-462 (1995) | |
58 | Hervé Brönnimann, Michael T. Goodrich: Almost Optimal Set Covers in Finite VC-Dimension. Discrete & Computational Geometry 14(4): 463-479 (1995) | |
57 | Michael T. Goodrich: Planar Separators and Parallel Polygon Triangulation. J. Comput. Syst. Sci. 51(3): 374-389 (1995) | |
1994 | ||
56 | Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos: Parallel Algorithms for Higher-Dimensional Convex Hulls FOCS 1994: 683-694 | |
55 | Paul J. Tanenbaum, Michael T. Goodrich, Edward R. Scheinerman: Characterization and Recognition of Point-Halfspace and Related Orders. Graph Drawing 1994: 234-245 | |
54 | Michael T. Goodrich, Yossi Matias, Uzi Vishkin: Optimal Parallel Approximation for Prefix Sums and Integer Sorting. SODA 1994: 241-250 | |
53 | EE | Michael T. Goodrich, Joseph S. B. Mitchell, Mark W. Orletsky: Practical Methods for Approximate Geometric Pattern Matching Under Rigid Motions (Preliminary Version). Symposium on Computational Geometry 1994: 103-112 |
52 | EE | Mikhail J. Atallah, Michael T. Goodrich, Kumar Ramaiyer: Biased Finger Trees and Three-Dimensional Layers of Maxima (Preliminary Version). Symposium on Computational Geometry 1994: 150-159 |
51 | EE | Hervé Brönnimann, Michael T. Goodrich: Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version). Symposium on Computational Geometry 1994: 293-302 |
50 | EE | Michael T. Goodrich: Efficient Piecewise-Linear Function Approximation Using the Uniform Metric (Preliminary Version). Symposium on Computational Geometry 1994: 322-331 |
49 | EE | Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju: Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. J. ACM 41(6): 1049-1088 (1994) |
1993 | ||
48 | L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets: Geometric Pattern Matching Under Euclidean Motion. CCCG 1993: 151-156 | |
47 | Michael T. Goodrich, Jyh-Jong Tsay, Darren Erik Vengroff, Jeffrey Scott Vitter: External-Memory Computational Geometry (Preliminary Version) FOCS 1993: 714-723 | |
46 | Michael T. Goodrich, Yossi Matias, Uzi Vishkin: Approximate Parallel Prefix Computation and its Applications. IPPS 1993: 318-325 | |
45 | Mujtaba R. Ghouse, Michael T. Goodrich: Experimental Evidence for the Power of Random Samplings in Practical Parallel Algorithms. IPPS 1993: 549-556 | |
44 | EE | Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott Vitter: Blocking for External Graph Searching. PODS 1993: 222-232 |
43 | EE | Michael T. Goodrich, Roberto Tamassia: Dynamic Ray Shooting and Shortest Paths Via Balanced Geodesic Triangulations. Symposium on Computational Geometry 1993: 318-327 |
42 | EE | Ashim Garg, Michael T. Goodrich, Roberto Tamassia: Area-Efficient Upward Tree Drawings. Symposium on Computational Geometry 1993: 359-368 |
41 | EE | Michael T. Goodrich: Geometric Partitioning Made Easier, Even in Parallel. Symposium on Computational Geometry 1993: 73-82 |
40 | Esther M. Arkin, Michael T. Goodrich, Joseph S. B. Mitchell, David M. Mount, Christine D. Piatko, Steven Skiena: Point Probe Decision Trees for Geometric Concept Classes. WADS 1993: 95-106 | |
39 | Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap: Constructing the Voronoi Diagram of a Set of Line Segments in Parallel. Algorithmica 9(2): 128-141 (1993) | |
38 | Michael T. Goodrich, Steven B. Shauck, Sumanta Guha: An Addendum to Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons. Algorithmica 9(5): 515-516 (1993) | |
37 | Michael T. Goodrich: Constructing Arrangement Optimally in Parallel. Discrete & Computational Geometry 9: 371-385 (1993) | |
36 | Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars: Output-Sensitive Methods for Rectilinear Hidden Surface Removal Inf. Comput. 107(1): 1-24 (1993) | |
35 | Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich: P-complete geometric problems. Int. J. Comput. Geometry Appl. 3(4): 443-462 (1993) | |
1992 | ||
34 | Michael T. Goodrich: Planar Separators and Parallel Polygon Triangulation (Preliminary Version) STOC 1992: 507-516 | |
33 | Richard Cole, Michael T. Goodrich: Optimal Parallel Algorithms for Point-Set and Polygon Problems. Algorithmica 7(1): 3-23 (1992) | |
32 | Michael T. Goodrich, Steven B. Shauck, Sumanta Guha: Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons. Algorithmica 8(5&6): 461-486 (1992) | |
31 | EE | Michael T. Goodrich: A polygonal approach to hidden-line and hidden-surface elimination. CVGIP: Graphical Model and Image Processing 54(1): 1-12 (1992) |
30 | Michael T. Goodrich: Constructing the Convex Hull of a Partially Sorted Set of Points. Comput. Geom. 2: 267-278 (1992) | |
1991 | ||
29 | Michael T. Goodrich: Using Approximation Algorithms to Design Parallel Algorithms that May Ignore Processor Allocation (Preliminary Version) FOCS 1991: 711-722 | |
28 | EE | Michael T. Goodrich: Constructing Arrangements Optimally in Parallel (Preliminary Version). SPAA 1991: 169-179 |
27 | EE | Mujtaba R. Ghouse, Michael T. Goodrich: In-Place Techniques for Parallel Convex Hull Algorithms (Preliminary Version). SPAA 1991: 192-203 |
26 | Michael T. Goodrich, Roberto Tamassia: Dynamic Trees and Dynamic Point Location (Preliminary Version) STOC 1991: 523-533 | |
25 | Michael T. Goodrich: Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors. SIAM J. Comput. 20(4): 737-755 (1991) | |
24 | John K. Johnstone, Michael T. Goodrich: A localized method for intersecting plane algebraic curve segments. The Visual Computer 7(2): 60-71 (1991) | |
1990 | ||
23 | Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing: Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version). ICALP 1990: 432-445 | |
22 | Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars: An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version). ICALP 1990: 689-702 | |
21 | Michael T. Goodrich: Applying Parallel Processing Techniques to Classification Problems in Constructive Solid Geometry. SODA 1990: 118-128 | |
20 | EE | Michael T. Goodrich, Mujtaba R. Ghouse, J. Bright: Generalized Sweep Methods for Parallel Computational Geometry. SPAA 1990: 280-289 |
19 | EE | Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich: P-Complete Geometric Problems. SPAA 1990: 317-326 |
18 | EE | Michael T. Goodrich, Steven B. Shauck, Sumanta Guha: Parallel Methods for Visibility and Shortest Path Problems in Simple Polygons (Preliminary Version). Symposium on Computational Geometry 1990: 73-82 |
17 | Michael T. Goodrich, Jack Snoeyink: Stabbing Parallel Segments with a Convex Polygon. Computer Vision, Graphics, and Image Processing 49(2): 152-170 (1990) | |
16 | Michael T. Goodrich, Mikhail J. Atallah: On Performing Robust Order Statistics in Tree-Structured Dictionary Machines. J. Parallel Distrib. Comput. 9(1): 69-76 (1990) | |
1989 | ||
15 | Michael T. Goodrich, S. Rao Kosaraju: Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation (Preliminary Version) FOCS 1989: 190-195 | |
14 | EE | Michael T. Goodrich: Intersecting Line Segments in Parallel With an Output-Sensitive Number of Processors. SPAA 1989: 127-137 |
13 | Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap: Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version). WADS 1989: 12-23 | |
12 | Michael T. Goodrich, Jack Snoeyink: Stabbing Parallel Segments with a Convex Polygon (Extended Abstract). WADS 1989: 231-242 | |
11 | Michael T. Goodrich: Triangulating a Polygon in Parallel. J. Algorithms 10(3): 327-351 (1989) | |
10 | Mikhail J. Atallah, Richard Cole, Michael T. Goodrich: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms. SIAM J. Comput. 18(3): 499-532 (1989) | |
1988 | ||
9 | Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju: Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. AWOC 1988: 1-10 | |
8 | EE | Richard Cole, Michael T. Goodrich: Optimal Parallel Algorithms for Polygon and Point-Set Problems. Symposium on Computational Geometry 1988: 201-210 |
7 | Mikhail J. Atallah, Michael T. Goodrich: Parallel Algorithms for Some Functions of two Convex Polygons. Algorithmica 3: 535-548 (1988) | |
6 | Hossam A. ElGindy, Michael T. Goodrich: Parallel algorithms for shortest path problems in polygons. The Visual Computer 3(6): 371-378 (1988) | |
1987 | ||
5 | Mikhail J. Atallah, Richard Cole, Michael T. Goodrich: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms FOCS 1987: 151-160 | |
4 | Michael T. Goodrich: Finding the Convex Hull of a Sorted Point Set in Parallel. Inf. Process. Lett. 26(4): 173-179 (1987) | |
1986 | ||
3 | EE | Mikhail J. Atallah, Michael T. Goodrich: Efficient Plane Sweeping in Parallel. Symposium on Computational Geometry 1986: 216-225 |
2 | Mikhail J. Atallah, Michael T. Goodrich: Efficient Parallel Solutions to Some Geometric Problems. J. Parallel Distrib. Comput. 3(4): 492-507 (1986) | |
1985 | ||
1 | Mikhail J. Atallah, Michael T. Goodrich: Efficient Parallel Solutions to Geometric Problems. ICPP 1985: 411-417 |