2008 |
23 | EE | Anna Pagh,
Rasmus Pagh:
Uniform Hashing in Constant Time and Optimal Space.
SIAM J. Comput. 38(1): 85-96 (2008) |
2007 |
22 | EE | Philip Bille,
Anna Pagh,
Rasmus Pagh:
Fast Evaluation of Union-Intersection Expressions.
ISAAC 2007: 739-750 |
21 | EE | Anna Pagh,
Rasmus Pagh,
Milan Ruzic:
Linear probing with constant independence.
STOC 2007: 318-327 |
20 | EE | Philip Bille,
Anna Pagh,
Rasmus Pagh:
Fast evaluation of union-intersection expressions
CoRR abs/0708.3259: (2007) |
2006 |
19 | EE | Anna Pagh,
Rasmus Pagh:
Scalable computation of acyclic joins.
PODS 2006: 225-232 |
18 | EE | Rolf Fagerberg,
Anna Pagh,
Rasmus Pagh:
External String Sorting: Faster and Cache-Oblivious.
STACS 2006: 68-79 |
17 | EE | Anna Pagh,
Rasmus Pagh,
Milan Ruzic:
Linear Probing with Constant Independence
CoRR abs/cs/0612055: (2006) |
2005 |
16 | EE | Anna Pagh,
Rasmus Pagh,
S. Srinivasa Rao:
An optimal Bloom filter replacement.
SODA 2005: 823-829 |
2004 |
15 | EE | Anna Pagh,
Rasmus Pagh,
Mikkel Thorup:
On Adaptive Integer Sorting.
ESA 2004: 556-579 |
14 | EE | Luisa Gargano,
Mikael Hammar,
Anna Pagh:
Limiting Flooding Expenses in On-demand Source-Initiated Protocols for Mobile Wireless Networks.
IPDPS 2004 |
2003 |
13 | EE | Anna Östlin,
Rasmus Pagh:
Uniform hashing in constant time and linear space.
STOC 2003: 622-628 |
12 | EE | Gerth Stølting Brodal,
Rolf Fagerberg,
Anna Östlin,
Christian N. S. Pedersen,
S. Srinivasa Rao:
Computing Refined Buneman Trees in Cubic Time.
WABI 2003: 259-270 |
2002 |
11 | EE | Anna Östlin,
Rasmus Pagh:
One-Probe Search.
ICALP 2002: 439-450 |
10 | EE | Gerth Stølting Brodal,
Rune B. Lyngsø,
Anna Östlin,
Christian N. S. Pedersen:
Solving the String Statistics Problem in Time O(n log n).
ICALP 2002: 728-739 |
2001 |
9 | EE | Gerth Stølting Brodal,
Rolf Fagerberg,
Christian N. S. Pedersen,
Anna Östlin:
The Complexity of Constructing Evolutionary Trees Using Experiments.
ICALP 2001: 140-151 |
8 | | Andrzej Lingas,
Hans Olsson,
Anna Östlin:
Efficient Merging and Construction of Evolutionary Trees.
J. Algorithms 41(1): 41-51 (2001) |
2000 |
7 | EE | Bogdan S. Chlebus,
Leszek Gasieniec,
Anna Östlin,
John Michael Robson:
Deterministic Radio Broadcasting.
ICALP 2000: 717-728 |
1999 |
6 | EE | Andrzej Lingas,
Hans Olsson,
Anna Östlin:
Efficient Merging, Construction, and Maintenance of Evolutionary Trees.
ICALP 1999: 544-553 |
5 | EE | Ming-Yang Kao,
Andrzej Lingas,
Anna Östlin:
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions.
STACS 1999: 184-196 |
4 | | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas,
Anna Östlin:
On the Complexity of Constructing Evolutionary Trees.
J. Comb. Optim. 3(2-3): 183-197 (1999) |
1998 |
3 | | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas,
Anna Östlin:
Inferring Ordered Trees from Local Constraints.
CATS 1998: 67-76 |
1997 |
2 | | Leszek Gasieniec,
Jesper Jansson,
Andrzej Lingas,
Anna Östlin:
On the Complexity of Computing Evolutionary Trees.
COCOON 1997: 134-145 |
1996 |
1 | | Christos Levcopoulos,
Anna Östlin:
Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract).
SWAT 1996: 271-283 |