The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Claire Kenyon: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. János Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber
    A Self Organizing Bin Packing Heuristic. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:246-265 [Conf]
  2. Marek Chrobak, Claire Kenyon, Neal E. Young
    The Reverse Greedy Algorithm for the Metric K-Median Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:654-660 [Conf]
  3. Claire Kenyon, Richard Kenyon
    How to Take Short Cuts. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:250-255 [Conf]
  4. Claire Kenyon, Meinolf Sellmann
    Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2006, pp:126-138 [Conf]
  5. Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis
    Scheduling Independent Multiprocessor Tasks. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:1-12 [Conf]
  6. Guy Louchard, Claire Kenyon, René Schott
    Data Structures Maxima. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:339-349 [Conf]
  7. 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. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:32-44 [Conf]
  8. Claire Kenyon, Richard Kenyon
    Tiling a Polygon with Rectangles [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:610-619 [Conf]
  9. Claire Kenyon, Michael Mitzenmacher
    Linear Waste of Best Fit Bin Packing on Skewed Distributions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:582-589 [Conf]
  10. Claire Kenyon, Elchanan Mossel, Yuval Peres
    Glauber Dynamics on Trees and Hyperbolic Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:568-578 [Conf]
  11. Claire Kenyon, Eric Rémila
    Approximate Strip Packing. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:31-36 [Conf]
  12. Wenceslas Fernandez de la Vega, Claire Kenyon
    A Randomized Approximation Scheme for Metric MAX-CUT. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:468-471 [Conf]
  13. Foto N. Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon
    Scheduling to Minimize the Average Completion Time of Dedicated Tasks. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:454-464 [Conf]
  14. Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda
    d-Dimensional Range Search on Multicomputers. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:616-620 [Conf]
  15. Jérémy Barbay, Claire Kenyon
    Deterministic Algorithm for the t-Threshold Set Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:575-584 [Conf]
  16. Claire Kenyon, Valerie King
    On Boolean Decision Trees with Faulty Nodes. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1992, pp:24-31 [Conf]
  17. Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
    Oblivious Medians Via Online Bidding. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:311-322 [Conf]
  18. G. Brightwell, Claire Kenyon, Hélène Paugam-Moisy
    Multilayer Neural Networks: One or Two Hidden Layers? [Citation Graph (0, 0)][DBLP]
    NIPS, 1996, pp:148-154 [Conf]
  19. Foto N. Afrati, Evripidis Bampis, Claire Kenyon, Ioannis Milis
    Scheduling on a Constant Number of Machines. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:281-287 [Conf]
  20. Richard M. Karp, Claire Kenyon
    A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:329-340 [Conf]
  21. Micah Adler, Peter Gemmell, Mor Harchol-Balter, Richard M. Karp, Claire Kenyon
    Selection in the Presence of Noise: The Design of Playoff Systems. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:564-572 [Conf]
  22. Jérémy Barbay, Claire Kenyon
    On the discrete Bak-Sneppen model of self-organized criticality. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:928-933 [Conf]
  23. Jérémy Barbay, Claire Kenyon
    Adaptive intersection and t-threshold problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:390-399 [Conf]
  24. José R. Correa, Claire Kenyon
    Approximation schemes for multidimensional packing. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:186-195 [Conf]
  25. János Csirik, David S. Johnson, Claire Kenyon
    Better approximation algorithms for bin covering. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:557-566 [Conf]
  26. Venkatesan Guruswami, Jason D. Hartline, Anna R. Karlin, David Kempe, Claire Kenyon, Frank McSherry
    On profit-maximizing envy-free pricing. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:1164-1173 [Conf]
  27. Richard M. Karp, Claire Kenyon, Orli Waarts
    Error-Resilient DNA Computation. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:458-467 [Conf]
  28. Claire Kenyon
    Best-Fit Bin-Packing with Random Order. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:359-364 [Conf]
  29. Claire Kenyon, Yuval Rabani, Alistair Sinclair
    Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:351-358 [Conf]
  30. Claire Kenyon, Nicolas Schabanel
    The Data Broadcast Problem with Non-Uniform Transmission Rimes. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:547-556 [Conf]
  31. Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon
    Approximation schemes for Metric Bisection and partitioning. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:506-515 [Conf]
  32. Claire Kenyon
    Approximation Schemes for Metric Clustering Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:1-3 [Conf]
  33. Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup
    OPT versus LOAD in dynamic storage allocation. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:556-564 [Conf]
  34. 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. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:208-217 [Conf]
  35. Mordecai J. Golin, Claire Kenyon, Neal E. Young
    Huffman coding with unequal letter costs. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:785-791 [Conf]
  36. Anna R. Karlin, Claire Kenyon, Dana Randall
    Dynamic TCP acknowledgement and other stories about e/(e-1). [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:502-509 [Conf]
  37. Claire Kenyon, Yuval Rabani, Alistair Sinclair
    Low distortion maps between point sets. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:272-280 [Conf]
  38. Claire Kenyon, Dana Randall, Alistair Sinclair
    Matchings in lattice graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:738-746 [Conf]
  39. Claire Kenyon, Nicolas Schabanel, Neal E. Young
    Polynomial-time approximation scheme for data broadcast. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:659-666 [Conf]
  40. Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani
    Approximation schemes for clustering problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:50-58 [Conf]
  41. Aparna Das, Claire Kenyon
    On Hierarchical Diameter-Clustering, and the Supplier Problem. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:132-145 [Conf]
  42. Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis
    Scheduling Independent Multiprocessor Tasks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:2, pp:247-261 [Journal]
  43. Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda
    d-Dimensional Range Search on Multicomputers. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:24, n:3-4, pp:195-208 [Journal]
  44. Anna R. Karlin, Claire Kenyon, Dana Randall
    Dynamic TCP Acknowledgment and Other Stories about e/(e-1). [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:3, pp:209-224 [Journal]
  45. Claire Kenyon, Nicolas Schabanel
    The Data Broadcast Problem with Non-Uniform Transmission Times. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:35, n:2, pp:146-175 [Journal]
  46. Claire Kenyon, Jeffrey Scott Vitter
    Maximum Queue Size and Hashing with Lazy Deletion. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:4, pp:597-619 [Journal]
  47. Claire Kenyon, Hélène Paugam-Moisy
    Multilayer Neural Networks and Polyhedral Dichotomies. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1998, v:24, n:1-4, pp:115-128 [Journal]
  48. Claire Kenyon, Nicolas Schabanel, Neal E. Young
    Polynomial-Time Approximation Scheme for Data Broadcast [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  49. Mordecai J. Golin, Claire Kenyon, Neal E. Young
    Huffman Coding with Unequal Letter Costs [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  50. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  51. Claire Kenyon, Richard Kenyon
    How to Take Short Cuts. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:251-264 [Journal]
  52. Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani
    Polynomial Time Approximation Schemes for Metric Min-Sum Clustering [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:025, pp:- [Journal]
  53. Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon
    A Polynomial Time Approximation Scheme for Metric MIN-BISECTION [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:041, pp:- [Journal]
  54. Claire Kenyon, Samuel Kutin
    Sensitivity, block sensitivity, and l-block sensitivity of boolean functions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:189, n:1, pp:43-53 [Journal]
  55. Claire Kenyon, Andrew Chi-Chih Yao
    On Evaluating Boolean Functions with Unreliable Tests. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1990, v:1, n:1, pp:1-10 [Journal]
  56. Marek Chrobak, Claire Kenyon, Neal E. Young
    The reverse greedy algorithm for the metric k-median problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:2, pp:68-72 [Journal]
  57. Pierre Fraigniaud, Claire Kenyon, Andrzej Pelc
    Finding a Target Subnetwork in Sparse Networks with Random Faults. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:6, pp:297-303 [Journal]
  58. 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. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:1, pp:1-65 [Journal]
  59. Claire Kenyon, Yuval Rabani, Alistair Sinclair
    Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:27, n:2, pp:218-235 [Journal]
  60. Wenceslas Fernandez de la Vega, Claire Kenyon
    A Randomized Approximation Scheme for Metric MAX-CUT. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:4, pp:531-541 [Journal]
  61. Claire Kenyon, Eric Rémila
    A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2000, v:25, n:4, pp:645-656 [Journal]
  62. Richard M. Karp, Claire Kenyon, Orli Waarts
    Error-resilient DNA computation. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:15, n:3-4, pp:450-466 [Journal]
  63. Claire Kenyon, Valerie King
    On Boolean Decision Trees with Faulty Nodes. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:3, pp:453-464 [Journal]
  64. Claire Kenyon, Michael Mitzenmacher
    Linear waste of best fit bin packing on skewed distributions. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:3, pp:441-464 [Journal]
  65. Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup
    OPT Versus LOAD in Dynamic Storage Allocation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:3, pp:632-646 [Journal]
  66. Wayne Goddard, Claire Kenyon, Valerie King, Leonard J. Schulman
    Optimal Randomized Algorithms for Local Sorting and Set-Maxima. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:272-283 [Journal]
  67. Guy Louchard, Claire Kenyon, René Schott
    Data Structures' Maxima. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:4, pp:1006-1042 [Journal]
  68. Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
    Oblivious Medians via Online Bidding [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  69. Marek Chrobak, Claire Kenyon, Neal E. Young
    The reverse greedy algorithm for the metric k-median problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  70. Claire Kenyon, Eric Rémila
    Perfect matchings in the triangular lattice. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:152, n:1-3, pp:191-210 [Journal]

  71. Incremental Medians via Online Bidding. [Citation Graph (, )][DBLP]


  72. On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing [Citation Graph (, )][DBLP]


Search in 0.659secs, Finished in 0.661secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002