David Paul Dobkin is the Dean of the Faculty and Phillip Y. Goldman '86 Professor of Computer Science at Princeton University. Dobkin was bornâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2005

Highly Cited

2005

- Bruce Dobkin
- 2005

From the Department of Neurology, the Neurologic Rehabilitation and Research Program, Geffen School of Medicine, University ofâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Steven L. Puller
- 2001

This paper analyzes the pricing behavior of electricity generating firms in the restructured California market from its inceptionâ€¦Â (More)

Is this relevant?

1999

1999

- Marshall W. Bern, David Eppstein, +19 authors Denis Zorin
- ArXiv
- 1999

Here we present the results of the NSF-funded Workshop on Computational Topology, which met on June 11 and 12 in Miami Beachâ€¦Â (More)

Is this relevant?

1995

1995

- Hank Chien, William L. Steiger
- ISAAC
- 1995

Dobkin and Lipton introduced the connected components argument to prove lower bounds in the linear decision tree model forâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri
- J. Algorithms
- 1991

We consider the problem of selecting a specified number of points, k, from a given set S, subject to some optimization criterionâ€¦Â (More)

Is this relevant?

1989

1989

- Mike Paterson, F. Frances Yao
- Symposium on Computational Geometry
- 1989

We consider schemes for recursively dividing a set of geometric objects by hyperplanes until all objects are separated. Such aâ€¦Â (More)

Is this relevant?

1985

1985

- Friedhelm Meyer auf der Heide
- J. ACM
- 1985

The problem of recognizing the language <italic>L<subscrpt>n</subscrpt></italic>(<italic>L<subscrpt>n, k</subscrpt></italic>) ofâ€¦Â (More)

Is this relevant?

Highly Cited

1983

Highly Cited

1983

- Friedhelm Meyer auf der Heide
- STOC
- 1983

We present a Linear Search Algorithm which decides the n-dimensional knapsack problem in n4log(n) + 0.(n3) steps. This algorithmâ€¦Â (More)

Is this relevant?

Highly Cited

1983

Highly Cited

1983

- Michael Ben-Or
- 1983

A topological method is given for obtaining lower bounds for the height of algebraic computation trees, and algebraic decisionâ€¦Â (More)

Is this relevant?

1978

1978

- Piotr Berman
- ICALP
- 1978

~et Z be an arbitrary alphabet. ~ denotes ~ uiu ... u~ n . We say that a function t, t : ~ ~ is f-sparse iff card ~t f(n) forâ€¦Â (More)

Is this relevant?