Anna Pagh

According to our database, Anna Pagh authored at least 23 papers between 1996 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

Linear Probing with 5-wise Independence.

Anna Pagh, Rasmus Pagh, Milan Ruzic

SIAM Rev., 2011

2009

Linear Probing with Constant Independence.

Anna Pagh, Rasmus Pagh, Milan Ruzic

SIAM J. Comput., 2009

2008

Uniform Hashing in Constant Time and Optimal Space.

Anna Pagh, Rasmus Pagh

SIAM J. Comput., 2008

2007

Fast Evaluation of Union-Intersection Expressions.

Philip Bille, Anna Pagh, Rasmus Pagh

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

External String Sorting: Faster and Cache-Oblivious.

Rolf Fagerberg, Anna Pagh, Rasmus Pagh

Proceedings of the STACS 2006, 2006

Scalable computation of acyclic joins.

Anna Pagh, Rasmus Pagh

Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

2005

An optimal Bloom filter replacement.

Anna Pagh, Rasmus Pagh, S. Srinivasa Rao

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

Limiting Flooding Expenses in On-demand Source-Initiated Protocols for Mobile Wireless Networks.

Luisa Gargano, Mikael Hammar, Anna Pagh

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

On Adaptive Integer Sorting.

Anna Pagh, Rasmus Pagh, Mikkel Thorup

Proceedings of the Algorithms, 2004

2003

Computing Refined Buneman Trees in Cubic Time.

Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian N. S. Pedersen, S. Srinivasa Rao

Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

Uniform hashing in constant time and linear space.

Anna Östlin, Rasmus Pagh

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002

One-Probe Search.

Anna Östlin, Rasmus Pagh

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Solving the String Statistics Problem in Time O(n log n).

Gerth Stølting Brodal, Rune B. Lyngsø, Anna Östlin, Christian N. S. Pedersen

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

Constructing Evolutionary Trees - Algorithms and Complexity.

Anna Östlin

PhD thesis, 2001

Efficient Merging and Construction of Evolutionary Trees.

Andrzej Lingas, Hans Olsson, Anna Östlin

J. Algorithms, 2001

The Complexity of Constructing Evolutionary Trees Using Experiments.

Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Anna Östlin

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

Deterministic Radio Broadcasting.

Bogdan S. Chlebus, Leszek Gasieniec, Anna Östlin, John Michael Robson

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999

On the Complexity of Constructing Evolutionary Trees.

Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin

J. Comb. Optim., 1999

Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions.

Ming-Yang Kao, Andrzej Lingas, Anna Östlin

Proceedings of the STACS 99, 1999

Efficient Merging, Construction, and Maintenance of Evolutionary Trees.

Andrzej Lingas, Hans Olsson, Anna Östlin

Proceedings of the Automata, 1999

1998

Inferring Ordered Trees from Local Constraints.

Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin

Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1997

On the Complexity of Computing Evolutionary Trees.

Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996

Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract).

Christos Levcopoulos, Anna Östlin

Proceedings of the Algorithm Theory, 1996