( en | de | ru )

 

Disambiguation of "Kenyon, Claire"

Author of the publication

copydeleteadd this publication to your clipboard
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version).

, , and . SODA, page 351-358. ACM/SIAM, (1996)

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.

Peter Kenyon Macnicol

Bärbel Maria Kenyon

Claire Eschbach

Claire Hunkeler

Claire Kieser

 

Other publications of authors with the same name

OPT versus LOAD in dynamic storage allocation., , , , and . STOC, page 556-564. ACM, (2003)Scheduling Independent Multiprocessor Tasks., , , and . ESA, volume 1284 of Lecture Notes in Computer Science, page 1-12. Springer, (1997)A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding., and . RANDOM-APPROX, volume 2764 of Lecture Notes in Computer Science, page 329-340. Springer, (2003)Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming., and . CPAIOR, volume 3990 of Lecture Notes in Computer Science, page 126-138. Springer, (2006)Approximation Schemes for Metric Clustering Problems.. STACS, volume 2996 of Lecture Notes in Computer Science, page 1-3. Springer, (2004)On Boolean Decision Trees with Faulty Nodes., and . ISTCS, volume 601 of Lecture Notes in Computer Science, page 24-31. Springer, (1992)A Randomized Approximation Scheme for Metric MAX-CUT., and . FOCS, page 468-471. IEEE Computer Society, (1998)Selection in the Presence of Noise: The Design of Playoff Systems., , , , and . SODA, page 564-572. ACM/SIAM, (1994)Approximation schemes for clustering problems., , , and . STOC, page 50-58. ACM, (2003)Polynomial-time approximation scheme for data broadcast., , and . STOC, page 659-666. ACM, (2000)