Travelled to:1 × Czech Republic
1 × Greece
1 × Spain
1 × Switzerland
1 × USA
Collaborated with:R.Pagh G.S.Brodal C.N.S.Pedersen A.Lingas H.Olsson R.B.Lyngsø R.Fagerberg B.S.Chlebus L.Gasieniec J.M.Robson
Talks about:evolutionari (2) construct (2) tree (2) time (2) determinist (1) broadcast (1) constant (1) uniform (1) statist (1) problem (1)
Person: Anna Östlin
DBLP: =Ouml=stlin:Anna
Contributed to:
2003
2002200120001999Wrote 6 papers:
- STOC-2003-OstlinP #constant #linear
- Uniform hashing in constant time and linear space (AÖ, RP), pp. 622–628.
- ICALP-2002-BrodalLOP #problem #statistics #string
- Solving the String Statistics Problem in Time O(n log n) (GSB, RBL, AÖ, CNSP), pp. 728–739.
- ICALP-2002-OstlinP
- One-Probe Search (AÖ, RP), pp. 439–450.
- ICALP-2001-BrodalFPO #complexity #using
- The Complexity of Constructing Evolutionary Trees Using Experiments (GSB, RF, CNSP, AÖ), pp. 140–151.
- ICALP-2000-ChlebusGOR
- Deterministic Radio Broadcasting (BSC, LG, AÖ, JMR), pp. 717–728.
- ICALP-1999-LingasOO #maintenance #performance
- Efficient Merging, Construction, and Maintenance of Evolutionary Trees (AL, HO, AÖ), pp. 544–553.