BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Belgium
1 × Denmark
1 × Italy
1 × Spain
1 × Switzerland
2 × USA
Collaborated with:
E.A.Fox Q.F.Chen S.Istrail E.L.Green B.J.Keller Z.Dias U.Dias J.C.Setubal A.M.Daoud L.T.Nowell R.K.France D.Hix N.Sundaravaradan K.S.M.T.Hossain V.Sreedharan D.J.Slotta J.P.C.Vergara N.Ramakrishnan
Talks about:
function (2) perfect (2) system (2) minim (2) hash (2) comprehend (1) noncommut (1) construct (1) algorithm (1) signatur (1)

Person: Lenwood S. Heath

DBLP DBLP: Heath:Lenwood_S=

Contributed to:

SAC 20122012
KDD 20102010
RTA 19971997
SIGIR 19961996
SIGIR 19921992
SIGIR 19901990
STOC 19871987

Wrote 7 papers:

SAC-2012-DiasDHS #sorting #symmetry #using
Sorting genomes using almost-symmetric inversions (ZD, UD, LSH, JCS), pp. 1368–1374.
KDD-2010-SundaravaradanHSSVHR #biology #modelling
Extracting temporal signatures for comprehending systems biology models (NS, KSMTH, VS, DJS, JPCV, LSH, NR), pp. 453–462.
RTA-1997-GreenHK #commutative #named
Opal: A System for Computing Noncommutative Gröbner Bases (ELG, LSH, BJK), pp. 331–334.
SIGIR-1996-NowellFHHF #similarity #visualisation
Visualizing Search Results: Some Alternatives to Query-Document Similarity (LTN, RKF, DH, LSH, EAF), pp. 67–75.
SIGIR-1992-FoxCH #algorithm #performance
A Faster Algorithm for Constructing Minimal Perfect Hash Functions (EAF, QFC, LSH), pp. 266–273.
SIGIR-1990-FoxCDH #information retrieval #order
Order Preserving Minimal Perfect Hash Functions and Information Retrieval (EAF, QFC, AMD, LSH), pp. 279–311.
STOC-1987-HeathI #graph
The Pagenumber of Genus g Graphs is O(g) (LSH, SI), pp. 388–397.

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.