Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Dobkin, D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Maintenance of geometric extrema
D. Dobkin
,
S. Suri
Journal of the ACM
38
(2), 1991, April, pp. 275-298
Dynamically computing the maxima of decomposable functions, with applications
D. Dobkin
,
S. Suri
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 488-493
Intersection of convex objects in two and three dimensions
B. Chazelle
,
D.P. Dobkin
Journal of the ACM
34
(1), 1987, pp. 1-27
Space searching for intersecting objects
D.P. Dobkin
,
H. Edelsbrunner
Journal of Algorithms
8
(3), 1987, September, pp. 348-361
Delaunay graphs are almost as good as complete graphs
D.P. Dobkin
,
S.J. Friedman
,
K.J. Supowit
Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, FOCS'87 (Los Angeles, CA, October 12-14, 1987)
, 1987, pp. 20-26
Probing convex polytopes
D. Dobkin
,
H. Edelsbrunner
,
C.K. Yap
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 424-432
Finding extremal polygons
J.E. Boyce
,
D.P. Dobkin
,
R.L. Drysdale III
,
L.J. Guibas
SIAM Journal on Computing
14
(1), 1985, February, pp. 134-147
A linear algorithm for determining the separation of convex polyhedra
D.P. Dobkin
,
D.G. Kirkpatrick
Journal of Algorithms
6
(3), 1985, pp. 381-392
Efficient uses of the past
D.P. Dobkin
,
J.I. Munro
Journal of Algorithms
6
(4), 1985, pp. 455-465
Space searching for intersecting objects
D.P. Dobkin
,
H. Edelsbrunner
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 387-392
Ham-sandwich theorems applied to intrsection problems
D.P. Dobkin
,
H. Edelsbrunner
Applied Computer Science
, 1984, pp. 88-99
Fast detection of polyhedral intersection
D.P. Dobkin
,
D.G. Kirkpatrick
Theoretical Computer Science
27
(3), 1983, pp. 241-253
Finding extremal polygons
J.E. Boyce
,
D.P. Dobkin
,
R.L. (Scot) Drysdale III
,
L.J. Guibas
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC'82 (San Francisco, CA, May 5-7, 1982)
, 1982, pp. 282-289
Optimal time minimal space selection algorithms
D. Dobkin
,
J.I. Munro
Journal of the ACM
28
(3), 1981, pp. 454-461
Detection is easier than computation
B. Chazelle
,
D.P. Dobkin
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, STOC'80 (Los Angeles, CA, April 28-30, 1980)
, 1980, pp. 146-153
Addition chain methods for the evaluation of specific polynomials
D. Dobkin
,
R.J. Lipton
SIAM Journal on Computing
9
(1), 1980, February, pp. 121-125
Determining the mode
D.P. Dobkin
,
J.I. Munro
Theoretical Computer Science
12
, 1980, pp. 255-263
Efficient uses of the past
D.P. Dobkin
,
J.I. Munro
Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, FOCS'80 (Syracuse, NY, October 13-15, 1980)
, 1980, pp. 200-206
The complexity of linear programming
D.P. Dobkin
,
S.P. Reiss
Theoretical Computer Science
11
, 1980, pp. 1-18
Decomposing a polygon into its convex parts
B. Chazelle
,
D. Dobkin
Proceedings of the 11th Annual ACM Symposium on Theory of Computing, STOC'79 (Atlanta, GA, April 30 - May 2, 1979)
, 1979, pp. 38-48
Linear programming is log-space hard for
P
D. Dobkin
,
R.J. Lipton
,
S. Reiss
Information Processing Letters
8
(2), 1979, February, pp. 96-97
On the complexity of computations under varying sets of primitives
D.P. Dobkin
,
R.J. Lipton
Journal of Computer and System Sciences
18
(1), 1979, February, pp. 86-91
On a general method for maximizing and minimizing among certain geometric problems
D.P. Dobkin
,
L. Snyder
Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, FOCS'79 (San Juan, PR, October 29-31, 1979)
, 1979, pp. 9-17
Errata: On the number of multiplications required for matrix multiplication
R.W. Brockett
,
D. Dobkin
SIAM Journal on Computing
7
, 1978, pp. 238
A lower bound of the
{1\over 2}n^2
on linear search programs for the knapsack problem
D. Dobkin
,
Richard J. Lipton
Journal of Computer and System Sciences
16
, 1978, June, pp. 413-417
Seiten 1
2
>