David P. Dobkin

Known as: David Dobkin (professor), Dobkin 
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)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2016
024619772016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
From the Department of Neurology, the Neurologic Rehabilitation and Research Program, Geffen School of Medicine, University of… (More)
  • table 1
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)
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Is this relevant?
1999
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
Dobkin and Lipton introduced the connected components argument to prove lower bounds in the linear decision tree model for… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We consider the problem of selecting a specified number of points, k, from a given set S, subject to some optimization criterion… (More)
  • figure 1
  • figure 2
Is this relevant?
1989
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
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
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
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
~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?