Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract). - Christos Levcopoulos; Anna Östlin (SWAT, 1996)

On the Complexity of Computing Evolutionary Trees. - Leszek Gasieniec; Jesper Jansson 001; Andrzej Lingas; Anna Östlin (COCOON, 1997)

Inferring Ordered Trees from Local Constraints. - Leszek Gasieniec; Jesper Jansson 001; Andrzej Lingas; Anna Östlin (CATS, 1998)

Efficient Merging, Construction, and Maintenance of Evolutionary Trees. - Andrzej Lingas; Hans Olsson; Anna Östlin (ICALP, 1999)

Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions. - Ming-Yang Kao; Andrzej Lingas; Anna Östlin (STACS, 1999)

On the Complexity of Constructing Evolutionary Trees. - Leszek Gasieniec; Jesper Jansson 001; Andrzej Lingas; Anna Östlin (J. Comb. Optim., 1999)

Deterministic Radio Broadcasting. - Bogdan S. Chlebus; Leszek Gasieniec; Anna Östlin; John Michael Robson (ICALP, 2000)

The Complexity of Constructing Evolutionary Trees Using Experiments. - Gerth Stølting Brodal; Rolf Fagerberg; Christian N. S. Pedersen; Anna Östlin (ICALP, 2001)

Efficient Merging and Construction of Evolutionary Trees. - Andrzej Lingas; Hans Olsson; Anna Östlin (J. Algorithms, 2001)

Constructing Evolutionary Trees - Algorithms and Complexity. - Anna Östlin (2001)

Solving the String Statistics Problem in Time O(n log n). - Gerth Stølting Brodal; Rune B. Lyngsø; Anna Östlin; Christian N. S. Pedersen (ICALP, 2002)

One-Probe Search. - Anna Östlin; Rasmus Pagh (ICALP, 2002)

Uniform hashing in constant time and linear space. - Anna Östlin; Rasmus Pagh (STOC, 2003)

Computing Refined Buneman Trees in Cubic Time. - Gerth Stølting Brodal; Rolf Fagerberg; Anna Östlin; Christian N. S. Pedersen; S. Srinivasa Rao 001 (WABI, 2003)

On Adaptive Integer Sorting. - Anna Pagh; Rasmus Pagh; Mikkel Thorup (ESA, 2004)

Limiting Flooding Expenses in On-demand Source-Initiated Protocols for Mobile Wireless Networks. - Luisa Gargano; Mikael Hammar; Anna Pagh (IPDPS, 2004)

An optimal Bloom filter replacement. - Anna Pagh; Rasmus Pagh; S. Srinivasa Rao 001 (SODA, 2005)

Scalable computation of acyclic joins. - Anna Pagh; Rasmus Pagh (PODS, 2006)

External String Sorting: Faster and Cache-Oblivious. - Rolf Fagerberg; Anna Pagh; Rasmus Pagh (STACS, 2006)

Fast Evaluation of Union-Intersection Expressions. - Philip Bille; Anna Pagh; Rasmus Pagh (ISAAC, 2007)

Uniform Hashing in Constant Time and Optimal Space. - Anna Pagh; Rasmus Pagh (SIAM J. Comput., 2008)

Linear Probing with Constant Independence. - Anna Pagh; Rasmus Pagh; Milan Ruzic (SIAM J. Comput., 2009)

Linear Probing with 5-wise Independence. - Anna Pagh; Rasmus Pagh; Milan Ruzic (SIAM Rev., 2011)