BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
2 × Canada
2 × USA
Collaborated with:
S.Choi V.H.Vu J.Kahn M.T.Hajiaghayi T.Leighton H.Räcke
Talks about:
graph (3) random (2) regular (1) generat (1) entropi (1) complex (1) oblivi (1) direct (1) demand (1) queri (1)

Person: Jeong Han Kim

DBLP DBLP: Kim:Jeong_Han

Contributed to:

STOC 20082008
STOC 20052005
STOC 20032003
STOC 19921992

Wrote 4 papers:

STOC-2008-ChoiK #bound #complexity #graph #query
Optimal query complexity bounds for finding graphs (SSC, JHK), pp. 749–758.
STOC-2005-HajiaghayiKLR #graph #random
Oblivious routing in directed graphs with random demands (MTH, JHK, TL, HR), pp. 193–201.
STOC-2003-KimV #generative #graph #random
Generating random regular graphs (JHK, VHV), pp. 213–222.
STOC-1992-KahnK #sorting
Entropy and Sorting (JK, JHK), pp. 178–187.

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.