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 × Germany
1 × Latvia
1 × Portugal
1 × USA
2 × Greece
Collaborated with:
U.Vishkin O.Weimann E.D.Demaine B.Schieber M.M.Yung Z.Galil P.Bille I.L.Gørtz M.Farach-Colton S.C.Sahinalp D.Tsur
Talks about:
tree (4) algorithm (2) parallel (2) approxim (2) string (2) match (2) distribut (1) construct (1) cartesian (1) broadcast (1)

Person: Gad M. Landau

DBLP DBLP: Landau:Gad_M=

Contributed to:

ICALP (1) 20132013
ICALP (1) 20092009
ICALP 20052005
ICALP 19871987
STOC 19861986
ICALP 19851985

Wrote 6 papers:

Tree Compression with Top Trees (PB, ILG, GML, OW), pp. 160–171.
ICALP-v1-2009-DemaineLW #on the #query
On Cartesian Trees and Range Minimum Queries (EDD, GML, OW), pp. 341–353.
ICALP-2005-Farach-ColtonLST #approximate #performance #string
Optimal Spaced Seeds for Faster Approximate String Matching (MFC, GML, SCS, DT), pp. 1251–1262.
ICALP-1987-LandauSV #parallel
Parallel Construction of a Suffix Tree (GML, BS, UV), pp. 314–325.
STOC-1986-LandauV #algorithm #approximate #parallel #performance #string
Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm (GML, UV), pp. 220–230.
ICALP-1985-LandauYG #algorithm #distributed #network
Distributed Algorithms in Synchronous Broadcasting Networks (GML, MMY, ZG), pp. 363–372.

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.