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: Landau:Gad_M=
Contributed to:
2013200920051987
19861985Wrote 6 papers:
- ICALP-v1-2013-BilleGLW
- 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.