World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
30
Citations
4276
World Ranking
14041
National Ranking
5573

Mathematics

D-Index
30
Citations
4013
World Ranking
3512
National Ranking
1360

Overview

Claire Kenyon is affiliated with Brown University in the United States. Their recent research contributions focus on early years education, particularly addressing policy and sector challenges through commentary and analysis in the publication Early Years Educator.

Kenyon has published at least three papers in this venue:

  • Early Years Equality protest the Government's childcare policy (2023) in Early Years Educator
  • 'The proposed changes do absolutely nothing to address the challenges facing our sector.' (2024) in Early Years Educator
  • 'When will the Government realise how silly they sound?' (2024) in Early Years Educator

All their recent work is published in Early Years Educator, indicating a focused engagement with the issues and debates within early childhood education policy and practice.

Best Publications

  • On profit-maximizing envy-free pricing

    Venkatesan Guruswami;Jason D. Hartline;Anna R. Karlin;David Kempe

  • Broadcasting on trees and the Ising model

    William Evans;Claire Kenyon;Yuval Peres;Leonard J. Schulman

  • A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem

    Claire Kenyon;Eric Rémila

  • Approximation schemes for minimizing average weighted completion time with release dates

    F. Afrati;E. Bampis;C. Chekuri;D. Karger

  • Dynamic TCP acknowledgement and other stories about e/(e-1)

    Anna R. Karlin;Claire Kenyon;Dana Randall

  • Approximation schemes for clustering problems

    W. Fernandez de la Vega;Marek Karpinski;Claire Kenyon;Yuval Rabani

  • Glauber dynamics on trees and hyperbolic graphs

    Noam Berger;Claire Kenyon;Elchanan Mossel;Yuval Peres

  • Best-fit bin-packing with random order

    Claire Kenyon

  • Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes

    Nikhil Bansal;Jos R. Correa;Claire Kenyon;Maxim Sviridenko

  • Low Distortion Maps Between Point Sets

    Claire Kenyon;Yuval Rabani;Alistair Sinclair

  • On the Sum-of-Squares algorithm for bin packing

    Janos Csirik;David S. Johnson;Claire Kenyon;James B. Orlin

  • Dynamic TCP Acknowledgment and Other Stories about e /( e - 1)

    Anna R. Karlin;Claire Kenyon;Dana Randall

  • Approximate strip packing

    C. Kenyon;E. Remila

  • Scheduling Independent Multiprocessor Tasks

    Abdel Krim Amoura;Evripidis Bampis;Claire Kenyon;Yannis Manoussakis

  • Tiling a polygon with rectangles

    C. Kenyon;R. Kenyon

  • The data broadcast problem with non-uniform transmission times

    Claire Kenyon;Nicolas Schabanel

  • Adaptive intersection and t-threshold problems

    Jérémy Barbay;Claire Kenyon

  • A Randomized Approximation Scheme for Metric MAX-CUT

    W. Fernandez de la Vega;Claire Kenyon

  • Approximating the number of monomer-dimer coverings of a lattice

    Claire Kenyon;Dana Randall;Alistair Sinclair

  • OPT Versus LOAD in Dynamic Storage Allocation

    Adam L. Buchsbaum;Howard Karloff;Claire Kenyon;Nick Reingold

  • Glauber dynamics on trees and hyperbolic graphs

    C. Kenyon;E. Mossel;Y. Peres

Frequent Co-Authors

Neal E. Young
Neal E. Young University of California, Riverside
Marek Chrobak
Marek Chrobak University of California, Riverside
János Csirik
János Csirik University of Szeged
Alistair Sinclair
Alistair Sinclair University of California, Berkeley
David S. Johnson
David S. Johnson AT&T (United States)
Yuval Rabani
Yuval Rabani Hebrew University of Jerusalem
Richard M. Karp
Richard M. Karp University of California, Berkeley
Klaus Jansen
Klaus Jansen Kiel University
Richard Weber
Richard Weber University of Cambridge

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens a gateway to many related online degrees and certifications. If you are interested in the fundamentals of science and technology, an online physics degree can provide a strong theoretical background for careers in research and development.

Those focused on trends in tech may be interested in following a data science learning path. This route prepares professionals for careers in machine learning, AI, and data analytics—fields with a rapidly growing demand for skilled workers.

Additionally, technology enthusiasts may consider accredited online electrical engineering programs. These programs blend computer science concepts with practical engineering skills, opening opportunities in electronics, robotics, and more.

For those looking for fast, practical credentials, there are 3-month certificate programs that pay well. These can quickly boost your resume and earnings potential, especially if you want to enter the workforce or specialize in a particular tech skill.

Best Scientists Citing Claire Kenyon

Trending Scientists