Claire Kenyon - RankMe

76 papers A* 25A 3B 5Misc 1Journal 33Unranked 8

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