Travelled to:1 × Denmark
1 × Italy
8 × USA
Collaborated with:D.G.Kirkpatrick B.Chazelle R.J.Lipton J.I.Munro R.W.Brockett H.Edelsbrunner C.Yap G.R.Andrews P.J.Downey J.E.Boyce R.L.(.D.III L.J.Guibas
Talks about:polygon (2) detect (2) convex (2) evalu (2) form (2) preprocess (1) polyhedra (1) intersect (1) hierarchi (1) structur (1)
Person: David P. Dobkin
DBLP: Dobkin:David_P=
Contributed to:
1990
198619821982
1981198019791978197519741973Wrote 11 papers:
- ICALP-1990-DobkinK #approach
- Determining the Separation of Preprocessed Polyhedra — A Unified Approach (DPD, DGK), pp. 400–413.
- STOC-1986-DobkinEY
- Probing Convex Polytopes (DPD, HE, CKY), pp. 424–432.
- ICALP-1982-DobkinK #detection #performance
- Fast Detection of Polyhedral Intersections (DPD, DGK), pp. 154–165.
- STOC-1982-BoyceDDG
- Finding Extremal Polygons (JEB, DPD, RL(DI, LJG), pp. 282–289.
- ICSE-1981-AndrewsDD #data type
- Active Data Structures (GRA, DPD, PJD), pp. 354–362.
- STOC-1980-ChazelleD #detection
- Detection is Easier than Computation (BC, DPD), pp. 146–153.
- STOC-1979-ChazelleD
- Decomposing a Polygon into its Convex Parts (BC, DPD), pp. 38–48.
- ICALP-1978-DobkinM #bound #problem
- Time and Space Bounds for Selection Problems (DPD, JIM), pp. 192–204.
- STOC-1975-LiptonD #complexity #evaluation #integer #metric
- Complexity Measures and Hierarchies for the Evaluation of Integers, Polynomials, and n-linear Forms (RJL, DPD), pp. 1–5.
- STOC-1974-DobkinL #on the
- On Some Generalizations of Binary Search (DPD, RJL), pp. 310–316.
- STOC-1973-BrockettD #evaluation #on the #set
- On the Optimal Evaluation of a Set of Bilinear Forms (RWB, DPD), pp. 88–95.