Claire Kenyon

Publication Activity (10 Years)

Years Active: 1990-2009
Publications (10 Years): 0

Publications

Claire Kenyon, Yuval Rabani, Alistair Sinclair
Low Distortion Maps Between Point Sets. SIAM J. Comput. 39 (4) (2009)
Jérémy Barbay, Claire Kenyon
Alternation and redundancy analysis of the intersection problem. ACM Trans. Algorithms 4 (1) (2008)
Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
Incremental Medians via Online Bidding. Algorithmica 50 (4) (2008)
Aparna Das, Claire Kenyon
On Hierarchical Diameter-Clustering, and the Supplier Problem. WAOA (2006)
Marek Chrobak, Claire Kenyon, Neal E. Young
-median problem. Inf. Process. Lett. 97 (2) (2006)
János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
On the Sum-of-Squares algorithm for bin packing. J. ACM 53 (1) (2006)
Claire Kenyon, Meinolf Sellmann
Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming. CPAIOR (2006)
Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
Oblivious Medians Via Online Bidding. LATIN (2006)
Nikhil Bansal, José R. Correa, Claire Kenyon, Maxim Sviridenko
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes. Math. Oper. Res. 31 (1) (2006)
János Csirik, David S. Johnson, Claire Kenyon
On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing CoRR (2005)
Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
Oblivious Medians via Online Bidding CoRR (2005)
Marek Chrobak, Claire Kenyon, Neal E. Young
-Median Problem. COCOON (2005)
Venkatesan Guruswami, Jason D. Hartline, Anna R. Karlin, David Kempe, Claire Kenyon, Frank McSherry
On profit-maximizing envy-free pricing. SODA (2005)
Marek Chrobak, Claire Kenyon, Neal E. Young
The reverse greedy algorithm for the metric k-median problem CoRR (2005)
Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup
OPT Versus LOAD in Dynamic Storage Allocation. SIAM J. Comput. 33 (3) (2004)
Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon
Approximation schemes for Metric Bisection and partitioning. SODA (2004)
Claire Kenyon
Approximation Schemes for Metric Clustering Problems. STACS (2004)
Claire Kenyon, Yuval Rabani, Alistair Sinclair
Low distortion maps between point sets. STOC (2004)
Claire Kenyon, Samuel Kutin
Sensitivity, block sensitivity, and l-block sensitivity of boolean functions. Inf. Comput. 189 (1) (2004)
José R. Correa, Claire Kenyon
Approximation schemes for multidimensional packing. SODA (2004)
Claire Kenyon, Nicolas Schabanel
The Data Broadcast Problem with Non-Uniform Transmission Times. Algorithmica 35 (2) (2003)
Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani
Approximation schemes for clustering problems. STOC (2003)
Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup
OPT versus LOAD in dynamic storage allocation. STOC (2003)
Anna R. Karlin, Claire Kenyon, Dana Randall
Dynamic TCP Acknowledgment and Other Stories about e/(e-1). Algorithmica 36 (3) (2003)
Jérémy Barbay, Claire Kenyon
Deterministic Algorithm for the t-Threshold Set Problem. ISAAC (2003)
Richard M. Karp, Claire Kenyon
A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding. RANDOM-APPROX (2003)
Claire Kenyon, Michael Mitzenmacher
Linear waste of best fit bin packing on skewed distributions. Random Struct. Algorithms 20 (3) (2002)
Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis
Scheduling Independent Multiprocessor Tasks. Algorithmica 32 (2) (2002)
Jérémy Barbay, Claire Kenyon
Adaptive intersection and t-threshold problems. SODA (2002)
Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon
A Polynomial Time Approximation Scheme for Metric MIN-BISECTION Electron. Colloquium Comput. Complex. (041) (2002)
Mordecai J. Golin, Claire Kenyon, Neal E. Young
Huffman coding with unequal letter costs. STOC (2002)
Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani
Polynomial Time Approximation Schemes for Metric Min-Sum Clustering Electron. Colloquium Comput. Complex. (025) (2002)
Claire Kenyon, Nicolas Schabanel, Neal E. Young
Polynomial-Time Approximation Scheme for Data Broadcast CoRR (2002)
János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
On the Sum-of-Squares Algorithm for Bin Packing CoRR (2002)
Mordecai J. Golin, Claire Kenyon, Neal E. Young
Huffman Coding with Unequal Letter Costs CoRR (2002)
Jérémy Barbay, Claire Kenyon
On the discrete Bak-Sneppen model of self-organized criticality. SODA (2001)
János Csirik, David S. Johnson, Claire Kenyon
Better approximation algorithms for bin covering. SODA (2001)
Claire Kenyon, Elchanan Mossel, Yuval Peres
Glauber Dynamics on Trees and Hyperbolic Graphs. FOCS (2001)
Anna R. Karlin, Claire Kenyon, Dana Randall
Dynamic TCP acknowledgement and other stories about e/(e-1). STOC (2001)
Wenceslas Fernandez de la Vega, Claire Kenyon
A Randomized Approximation Scheme for Metric MAX-CUT. J. Comput. Syst. Sci. 63 (4) (2001)
János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
On the sum-of-squares algorithm for bin packing. STOC (2000)
Claire Kenyon, Eric Rémila
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem. Math. Oper. Res. 25 (4) (2000)
Foto N. Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon
Scheduling to Minimize the Average Completion Time of Dedicated Tasks. FSTTCS (2000)
Claire Kenyon, Michael Mitzenmacher
Linear Waste of Best Fit Bin Packing on Skewed Distributions. FOCS (2000)
Claire Kenyon, Nicolas Schabanel, Neal E. Young
Polynomial-time approximation scheme for data broadcast. STOC (2000)
Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda
-Dimensional Range Search on Multicomputers. Algorithmica 24 (3-4) (1999)
Claire Kenyon, Nicolas Schabanel
The Data Broadcast Problem with Non-Uniform Transmission Rimes. SODA (1999)
Richard M. Karp, Claire Kenyon, Orli Waarts
Error-resilient DNA computation. Random Struct. Algorithms 15 (3-4) (1999)
Foto N. Afrati, Evripidis Bampis, Claire Kenyon, Ioannis Milis
Scheduling on a Constant Number of Machines. RANDOM-APPROX (1999)
János Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber
A Self Organizing Bin Packing Heuristic. ALENEX (1999)
Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. FOCS (1999)
Wenceslas Fernandez de la Vega, Claire Kenyon
A Randomized Approximation Scheme for Metric MAX-CUT. FOCS (1998)
Claire Kenyon, Yuval Rabani, Alistair Sinclair
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing. J. Algorithms 27 (2) (1998)
Claire Kenyon, Hélène Paugam-Moisy
Multilayer Neural Networks and Polyhedral Dichotomies. Ann. Math. Artif. Intell. 24 (1-4) (1998)
Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda
d-Dimensional Range Search on Multicomputers. IPPS (1997)
Guy Louchard, Claire Kenyon, René Schott
Data Structures' Maxima. SIAM J. Comput. 26 (4) (1997)
Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis
Scheduling Independent Multiprocessor Tasks. ESA (1997)
Graham R. Brightwell, Claire Kenyon, Hélène Paugam-Moisy
Multilayer Neural Networks: One or Two Hidden Layers? NIPS (1996)
Claire Kenyon, Yuval Rabani, Alistair Sinclair
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version). SODA (1996)
Richard M. Karp, Claire Kenyon, Orli Waarts
Error-Resilient DNA Computation. SODA (1996)
Thomas Chaboud, Claire Kenyon
Planar Cayley Graphs with Regular Dual. Int. J. Algebra Comput. 6 (5) (1996)
Claire Kenyon
Best-Fit Bin-Packing with Random Order. SODA (1996)
Claire Kenyon, Eric Rémila
Approximate Strip Packing. FOCS (1996)
Claire Kenyon, Eric Rémila
Perfect matchings in the triangular lattice. Discret. Math. 152 (1-3) (1996)
Frank Dehne, Claire Kenyon, Andreas Fabri
Scalable and architecture independent parallel geometric algorithms with high probability optimal time. SPDP (1994)
Micah Adler, Peter Gemmell, Mor Harchol-Balter, Richard M. Karp, Claire Kenyon
Selection in the Presence of Noise: The Design of Playoff Systems. SODA (1994)
Claire Kenyon, Valerie King
On Boolean Decision Trees with Faulty Nodes. Random Struct. Algorithms 5 (3) (1994)
Wayne Goddard, Claire Kenyon, Valerie King, Leonard J. Schulman
Optimal Randomized Algorithms for Local Sorting and Set-Maxima. SIAM J. Comput. 22 (2) (1993)
Claire Kenyon, Dana Randall, Alistair Sinclair
Matchings in lattice graphs. STOC (1993)
Pierre Fraigniaud, Claire Kenyon, Andrzej Pelc
Finding a Target Subnetwork in Sparse Networks with Random Faults. Inf. Process. Lett. 48 (6) (1993)
Claire Kenyon, Valerie King
On Boolean Decision Trees with Faulty Nodes. ISTCS (1992)
Claire Kenyon, Richard W. Kenyon
How to Take Short Cuts. Discret. Comput. Geom. 8 (1992)
Claire Kenyon, Richard W. Kenyon
Tiling a Polygon with Rectangles FOCS (1992)
Claire Kenyon, Richard W. Kenyon
How to Take Short Cuts. SCG (1991)
Claire Kenyon, Jeffrey Scott Vitter
Maximum Queue Size and Hashing with Lazy Deletion. Algorithmica 6 (4) (1991)
Guy Louchard, Claire Kenyon, René Schott
Data Structures Maxima. FCT (1991)
Claire Kenyon, Andrew Chi-Chih Yao
On Evaluating Boolean Functions with Unreliable Tests. Int. J. Found. Comput. Sci. 1 (1) (1990)