| 2011 |
|---|
| 50 | Learning how to match fresco fragments. Thomas A. Funkhouser, Hijung Shin, Corey Toler-Franklin, Antonio García Castañeda, Benedict J. Brown, David P. Dobkin, Szymon Rusinkiewicz, Tim Weyrich. JOCCH (4): 7 (2011). Web SearchBibTeXDownload |
| 2004 |
|---|
| 49 | Modeling by example. Thomas A. Funkhouser, Michael M. Kazhdan, Philip Shilane, Patrick Min, William Kiefer, Ayellet Tal, Szymon Rusinkiewicz, David P. Dobkin. ACM Trans. Graph. (23): 652-663 (2004). Web SearchBibTeXDownload |
| 2003 |
|---|
| 48 | A search engine for 3D models. Thomas A. Funkhouser, Patrick Min, Michael M. Kazhdan, Joyce Chen, J. Alex Halderman, David P. Dobkin, David Pokrass Jacobs. ACM Trans. Graph. (22): 83-105 (2003). Web SearchBibTeXDownload |
| 47 | A Reflective Symmetry Descriptor for 3D Models. Michael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Thomas A. Funkhouser, Szymon Rusinkiewicz. Algorithmica (38): 201-225 (2003). Web SearchBibTeXDownload |
| 2002 |
|---|
| 46 | Shape distributions. Robert Osada, Thomas A. Funkhouser, Bernard Chazelle, David P. Dobkin. ACM Trans. Graph. (21): 807-832 (2002). Web SearchBibTeXDownload |
| 45 | A Reflective Symmetry Descriptor. Michael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Adam Finkelstein, Thomas A. Funkhouser. ECCV (2) 2002, 642-656. Web SearchBibTeXDownload |
| 2001 |
|---|
| 44 | Matching 3D Models with Shape Distributions. Robert Osada, Thomas A. Funkhouser, Bernard Chazelle, David P. Dobkin. Shape Modeling International 2001, 154-166. Web SearchBibTeXDownload |
| 1999 |
|---|
| 43 | Emerging Challenges in Computational Topology. Marshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin. CoRR (cs.CG/9909001) (1999). Web SearchBibTeXDownload |
| 42 | Uncluttering Force-Directed Graph Layouts. David P. Dobkin, Alejo Hausner, Emden R. Gansner, Stephen C. North. Symposium on Computational Geometry 1999, 425-426. Web SearchBibTeXDownload |
| 1997 |
|---|
| 41 | Implementing a General-Purpose Edge Router. David P. Dobkin, Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North. Graph Drawing 1997, 262-271. Web SearchBibTeXDownload |
| 1996 |
|---|
| 40 | Computing the Maximum Bichromatic Discrepancy with Applications to Computer Graphics and Machine Learning. David P. Dobkin, Dimitrios Gunopulos, Wolfgang Maass. J. Comput. Syst. Sci. (52): 453-470 (1996). Cited by 28Web SearchBibTeXDownload |
| 39 | Geometric Problems in Machine Learning. David P. Dobkin, Dimitrios Gunopulos. WACG 1996, 121-132. Cited by 1Web SearchBibTeXDownload |
| 1995 |
|---|
| 38 | Concept Learning with Geometric Hypotheses. David P. Dobkin, Dimitrios Gunopulos. COLT 1995, 329-336. Cited by 17Web SearchBibTeXDownload |
| 1994 |
|---|
| 37 | Visibility with a Moving Point of View. Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman. Algorithmica (11): 360-378 (1994). Cited by 81Web SearchBibTeXDownload |
| 36 | Computing the Maximum Bichromatic Discrepancy, with applications to Computer Graphics and Machine Learning. David P. Dobkin, Dimitrios Gunopulos, Wolfgang Maass. Electronic Colloquium on Computational Complexity (ECCC) (1) (1994). Web SearchBibTeXDownload |
| 35 | Computing the Rectangle Discrepancy. David P. Dobkin, Dimitrios Gunopulos. Symposium on Computational Geometry 1994, 385-386. Cited by 12Web SearchBibTeXDownload |
| 1993 |
|---|
| 34 | Computing the Intersection-Depth of Polyhedra. David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri. Algorithmica (9): 518-533 (1993). Web SearchBibTeXDownload |
| 33 | An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon. David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink. Algorithmica (10): 1-23 (1993). Web SearchBibTeXDownload |
| 32 | On Sparse Spanners of Weighted Graphs. Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, José Soares. Discrete & Computational Geometry (9): 81-100 (1993). Cited by 242Web SearchBibTeXDownload |
| 1991 |
|---|
| 31 | Maintenance of Geometric Extrema. David P. Dobkin, Subhash Suri. J. ACM (38): 275-298 (1991). Web SearchBibTeXDownload |
| 1990 |
|---|
| 30 | Determining the Separation of Preprocessed Polyhedra - A Unified Approach. David P. Dobkin, David G. Kirkpatrick. ICALP 1990, 400-413. Web SearchBibTeXDownload |
| 29 | Implicitly Searching Convolutions and Computing Depth of Collision. David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri. SIGAL International Symposium on Algorithms 1990, 165-180. Web SearchBibTeXDownload |
| 28 | Visibility with a Moving Point of View. Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman. SODA 1990, 107-117. Cited by 81Web SearchBibTeXDownload |
| 27 | Generating Sparse Spanners for Weighted Graphs. Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph. SWAT 1990, 26-37. Cited by 34Web SearchBibTeXDownload |
| 1989 |
|---|
| 26 | Dynamically Computing the Maxima of Decomposable Functions, with Applications. David P. Dobkin, Subhash Suri. FOCS 1989, 488-493. Web SearchBibTeXDownload |
| 25 | Partitioning Space for Range Queries. F. Frances Yao, David P. Dobkin, Herbert Edelsbrunner, Mike Paterson. SIAM J. Comput. (18): 371-384 (1989). Web SearchBibTeXDownload |
| 1988 |
|---|
| 24 | An efficient algorithm for finding the CSG representation of a simple polygon. David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink. SIGGRAPH 1988, 31-40. Web SearchBibTeXDownload |
| 1986 |
|---|
| 23 | Probing Convex Polytopes. David P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap. STOC 1986, 424-432. Web SearchBibTeXDownload |
| 1985 |
|---|
| 22 | Efficient Uses of the Past. David P. Dobkin, J. Ian Munro. J. Algorithms (6): 455-465 (1985). Web SearchBibTeXDownload |
| 21 | A Linear Algorithm for Determining the Separation of Convex Polyhedra. David P. Dobkin, David G. Kirkpatrick. J. Algorithms (6): 381-392 (1985). Web SearchBibTeXDownload |
| 1983 |
|---|
| 20 | Fast Detection of Polyhedral Intersection. David P. Dobkin, David G. Kirkpatrick. Theor. Comput. Sci. (27): 241-253 (1983). Web SearchBibTeXDownload |
| 1982 |
|---|
| 19 | Fast Detection of Polyhedral Intersections. David P. Dobkin, David G. Kirkpatrick. ICALP 1982, 154-165. Web SearchBibTeXDownload |
| 1981 |
|---|
| 18 | Optimal Time Minimal Space Selection Algorithms. David P. Dobkin, J. Ian Munro. J. ACM (28): 454-461 (1981). Web SearchBibTeXDownload |
| 1980 |
|---|
| 17 | Efficient Uses of the Past. David P. Dobkin, J. Ian Munro. FOCS 1980, 200-206. Web SearchBibTeXDownload |
| 16 | Addition Chain Methods for the Evaluation of Specific Polynomials. David P. Dobkin, Richard J. Lipton. SIAM J. Comput. (9): 121-125 (1980). Web SearchBibTeXDownload |
| 15 | Determining the Mode. David P. Dobkin, J. Ian Munro. Theor. Comput. Sci. (12): 255-263 (1980). Web SearchBibTeXDownload |
| 14 | The Complexity of Linear Programming. David P. Dobkin, Steven P. Reiss. Theor. Comput. Sci. (11): 1-18 (1980). Web SearchBibTeXDownload |
| 1979 |
|---|
| 13 | Secure Databases: Protection Against User Influence. David P. Dobkin, Anita K. Jones, Richard J. Lipton. ACM Trans. Database Syst. (4): 97-106 (1979). Web SearchBibTeXDownload |
| 12 | On a General Method for Maximizing and Minimizing among Certain Geometric Problems (Extended Abstract). David P. Dobkin, Lawrence Snyder. FOCS 1979, 9-17. Web SearchBibTeXDownload |
| 11 | Linear Programming is Log-Space Hard for P. David P. Dobkin, Richard J. Lipton, Steven P. Reiss. Inf. Process. Lett. (8): 96-97 (1979). Web SearchBibTeXDownload |
| 10 | On the Complexity of Computations under Varying Sets of Primitives. David P. Dobkin, Richard J. Lipton. J. Comput. Syst. Sci. (18): 86-91 (1979). Web SearchBibTeXDownload |
| 1978 |
|---|
| 9 | Time and Space Bounds for Selection Problems. David P. Dobkin, J. Ian Munro. ICALP 1978, 192-204. Web SearchBibTeXDownload |
| 8 | Even Data Bases That Lie Can Be Compromised. Richard A. DeMillo, David P. Dobkin, Richard J. Lipton. IEEE Trans. Software Eng. (4): 73-75 (1978). Web SearchBibTeXDownload |
| 7 | A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem. David P. Dobkin, Richard J. Lipton. J. Comput. Syst. Sci. (16): 413-417 (1978). Web SearchBibTeXDownload |
| 1976 |
|---|
| 6 | A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem. David P. Dobkin, Richard J. Lipton. MFCS 1976, 265-269. Web SearchBibTeXDownload |
| 5 | Multidimensional Searching Problems. David P. Dobkin, Richard J. Lipton. SIAM J. Comput. (5): 181-186 (1976). Web SearchBibTeXDownload |
| 4 | Complexity Measures and Hierarchies for the Evaluation of Integers and Polynomials. Richard J. Lipton, David P. Dobkin. Theor. Comput. Sci. (3): 349-357 (1976). Web SearchBibTeXDownload |
| 1975 |
|---|
| 3 | On the complexity of computations under varying sets of primitives. David P. Dobkin, Richard J. Lipton. Automata Theory and Formal Languages 1975, 110-117. Web SearchBibTeXDownload |
| 2 | Complexity Measures and Hierarchies for the Evaluation of Integers, Polynomials, and n-linear Forms. Richard J. Lipton, David P. Dobkin. STOC 1975, 1-5. Web SearchBibTeXDownload |
| 1974 |
|---|
| 1 | On Some Generalizations of Binary Search. David P. Dobkin, Richard J. Lipton. STOC 1974, 310-316. Web SearchBibTeXDownload |
