BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Greece
4 × USA
Collaborated with:
A.Sinclair N.E.Young D.Randall Y.Rabani M.J.Golin A.R.Karlin N.Schabanel W.F.d.l.Vega M.Karpinski A.L.Buchsbaum H.J.Karloff N.Reingold M.Thorup J.Csirik D.S.Johnson J.B.Orlin P.W.Shor R.R.Weber
Talks about:
approxim (2) scheme (2) dynam (2) acknowledg (1) broadcast (1) algorithm (1) polynomi (1) problem (1) huffman (1) distort (1)

Person: Claire Kenyon

DBLP DBLP: Kenyon:Claire

Contributed to:

STOC 20042004
STOC 20032003
STOC 20022002
STOC 20012001
STOC 20002000
STOC 19931993

Wrote 8 papers:

STOC-2004-KenyonRS #set
Low distortion maps between point sets (CK, YR, AS), pp. 272–280.
OPT versus LOAD in dynamic storage allocation (ALB, HJK, CK, NR, MT), pp. 556–564.
STOC-2003-VegaKKR #approximate #clustering #problem
Approximation schemes for clustering problems (WFdlV, MK, CK, YR), pp. 50–58.
Huffman coding with unequal letter costs (MJG, CK, NEY), pp. 785–791.
Dynamic TCP acknowledgement and other stories about e/(e-1) (ARK, CK, DR), pp. 502–509.
STOC-2000-CsirikJKOSW #algorithm #on the
On the sum-of-squares algorithm for bin packing (JC, DSJ, CK, JBO, PWS, RRW), pp. 208–217.
STOC-2000-KenyonSY #approximate #polynomial
Polynomial-time approximation scheme for data broadcast (CK, NS, NEY), pp. 659–666.
STOC-1993-KenyonRS #graph
Matchings in lattice graphs (CK, DR, AS), pp. 738–746.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.