BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
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 DBLP: Dobkin:David_P=

Contributed to:

ICALP 19901990
STOC 19861986
ICALP 19821982
STOC 19821982
ICSE 19811981
STOC 19801980
STOC 19791979
ICALP 19781978
STOC 19751975
STOC 19741974
STOC 19731973

Wrote 11 papers:

ICALP-1990-DobkinK #approach
Determining the Separation of Preprocessed Polyhedra — A Unified Approach (DPD, DGK), pp. 400–413.
Probing Convex Polytopes (DPD, HE, CKY), pp. 424–432.
ICALP-1982-DobkinK #detection #performance
Fast Detection of Polyhedral Intersections (DPD, DGK), pp. 154–165.
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.
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.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.