Travelled to:1 × France
1 × Spain
2 × Finland
2 × USA
Collaborated with:R.E.Tarjan M.Peinado D.Theune E.Wanke ∅ J.R.Gilbert S.Bickel J.Bogojeska T.Scheffer
Talks about:graph (3) algorithm (2) problem (2) effici (2) space (2) dobrushin (1) tradeoff (1) properti (1) polynomi (1) hierarch (1)
Person: Thomas Lengauer
DBLP: Lengauer:Thomas
Contributed to:
2008
1998
1991198819861979Wrote 7 papers:
- ICML-2008-BickelBLS #learning #multi
- Multi-task learning for HIV therapy screening (SB, JB, TL, TS), pp. 56–63.
- STOC-1998-PeinadoL #embedded #generative #graph #random
- Random Generation of Embedded Graphs and an Extension to Dobrushin Uniqueness (MP, TL), pp. 176–185.
- ICALP-1991-LengauerT #algorithm #performance #problem
- Efficient Algorithms for Path Problems with Gernal Cost Citeria (TL, DT), pp. 314–326.
- ICALP-1988-LengauerW #analysis #graph #performance
- Efficient Analysis of Graph Properties on Context-free Graph Languages (TL, EW), pp. 379–393.
- ICALP-1986-Lengauer #algorithm #testing
- Hierarchical Planary Testing Algorithms (TL), pp. 215–225.
- STOC-1979-GilbertLT #polynomial #problem
- The Pebbling Problem is Complete in Polynomial Space (JRG, TL, RET), pp. 237–248.
- STOC-1979-LengauerT #bound #trade-off
- Upper and Lower Bounds on Time-Space Tradeoffs (TL, RET), pp. 262–277.