( en | de | ru )

 

Disambiguation of "Kirkpatrick, David G."

Author of the publication

copydeleteadd this publication to your clipboard
Finding Extrema with Unary Predicates.

, , , , and . Algorithmica, 9 (6): 591-600 (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

David G Wigg

David G Long

Gail Kirkpatrick

Grant Kirkpatrick

David J G Dwertmann

 

Other publications of authors with the same name

Simplifying Analyses of Chemical Reaction Networks for Approximate Majority., , , and . DNA, volume 10467 of Lecture Notes in Computer Science, page 188-209. Springer, (2017)Determining the Separation of Preprocessed Polyhedra - A Unified Approach., and . ICALP, volume 443 of Lecture Notes in Computer Science, page 400-413. Springer, (1990)M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns., , and . FUN, volume 7288 of Lecture Notes in Computer Science, page 198-209. Springer, (2012)On the Completeness of a Generalized Matching Problem, and . STOC, page 240-245. ACM, (1978)Determining Graph Properties from Matrix Representations. STOC, page 84-90. ACM, (1974)On the Additions Necessary to Compute Certain Functions. STOC, page 94-101. ACM, (1972)Closing a Long-Standing Complexity Gap for Selection: V 3(42) = 50.. Space-Efficient Data Structures, Streams, and Algorithms, volume 8066 of Lecture Notes in Computer Science, page 61-76. Springer, (2013)The Shape of a Set of Points in the Plane., , and . WG, page 157-162. Hanser, Munich, (1981)Algorithms for Degree Constrained Graph Factors of Minimum Deficiency., and . J. Algorithms, 14 (1): 115-138 (1993)On Generalized Matching Problems., and . Inf. Process. Lett., 12 (1): 33-35 (1981)