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 × USA
Collaborated with:
A.Chakrabarti B.Chazelle A.Lvov X.Yu Y.Chen R.Y.Wang K.Li A.Krishnamurthy T.E.Anderson
Talks about:
neighbor (1) approxim (1) perform (1) nearest (1) complex (1) search (1) trade (1) lower (1) capac (1) bound (1)

Person: Benjamin Gum

DBLP DBLP: Gum:Benjamin

Contributed to:

OSDI 20002000
STOC 19991999

Wrote 2 papers:

OSDI-2000-YuGCWLKA #array #capacity #performance
Trading Capacity for Performance in a Disk Array (XY, BG, YC, RYW, KL, AK, TEA), pp. 243–258.
STOC-1999-ChakrabartiCGL #approximate #bound #complexity #nearest neighbour
A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube (AC, BC, BG, AL), pp. 305–311.

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.