Travelled to:1 × France
1 × Latvia
1 × Portugal
1 × Spain
1 × United Kingdom
Collaborated with:P.Bille S.Vind V.Nagarajan R.Saket J.Kristensen G.M.Landau O.Weimann S.Alstrup T.Rauhe M.Thorup U.Zwick J.Fischer T.Kopelowitz B.Sach H.W.Vildhøj
Talks about:tree (4) compress (2) space (2) fingerprint (1) construct (1) structur (1) stochast (1) constant (1) recours (1) problem (1)
Person: Inge Li Gørtz
DBLP: G=oslash=rtz:Inge_Li
Contributed to:
2015
2013201220122005Wrote 7 papers:
- LATA-2015-BilleGV #data type
- Compressed Data Structures for Range Searching (PB, ILG, SV), pp. 577–586.
- ICALP-v1-2013-BilleFGKSV
- Sparse Suffix Tree Construction in Small Space (PB, JF, ILG, TK, BS, HWV), pp. 148–159.
- ICALP-v1-2013-BilleGLW
- Tree Compression with Top Trees (PB, ILG, GML, OW), pp. 160–171.
- ICALP-v1-2012-GortzNS #probability
- Stochastic Vehicle Routing with Recourse (ILG, VN, RS), pp. 411–423.
- LATA-2012-BilleGK
- Longest Common Extensions via Fingerprinting (PB, ILG, JK), pp. 119–130.
- ICALP-2005-AlstrupGRTZ #constant
- Union-Find with Constant Time Deletions (SA, ILG, TR, MT, UZ), pp. 78–89.
- ICALP-2005-BilleG #performance #problem
- The Tree Inclusion Problem: In Optimal Space and Faster (PB, ILG), pp. 66–77.