Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

David G. Kirkpatrick

David Galer Kirkpatrick is a professor of computer science at the University of British Columbia. He is known for the Kirkpatrick–Seidel algorithm… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Old and new algorithms for the Maximum Satisfiability problem are studied. We first summarize the different heuristics previously… Expand
  • table 6-1
  • table 6.2
  • table 6-3
  • table 6-4
  • table 6-5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The tremendous evolution of programmable graphics hardware has made high-quality real-time volume graphics a reality. In addition… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Abstract: By using a simple interpolation argument, in previous work we have proven the existence of the thermodynamic limit, for… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Abstract: We present a simple strategy in order to show the existence and uniqueness of the infinite volume limit of… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The brain is perhaps the most complex system to have ever been subjected to rigorous scientific investigation. The scale is… Expand
  • figure 2.1
  • figure 6.2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We study the fluctuations of free energy, energy and entropy in the high temperature regime for the Sherrington-Kirkpatrick model… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
concept (as opposed to the instance thereof found inside the string xyz). Many people, eager to construct a successor to Platonic… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We give a deterministic algorithm for triangulating a simple polygon in linear time. The basic strategy is to build a coarse… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Statistical cooling is a new combinatorial optimization technique based on Monte-Carlo iterative improvement. The method… Expand
Is this relevant?
Highly Cited
1963
Highly Cited
1963
1. RICHARD S. VARGA, Matrix Iterative Analysis, Prentice-Hall, Inc., 1962. 2. E. G. D'YAKONOV, "On a Method of Solving the… Expand
Is this relevant?