default search action
Anna Pagh
Person information
- affiliation: IT University of Copenhagen, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [j5]Anna Pagh, Rasmus Pagh, Milan Ruzic:
Linear Probing with 5-wise Independence. SIAM Rev. 53(3): 547-558 (2011)
2000 – 2009
- 2009
- [j4]Anna Pagh, Rasmus Pagh, Milan Ruzic:
Linear Probing with Constant Independence. SIAM J. Comput. 39(3): 1107-1120 (2009) - 2008
- [j3]Anna Pagh, Rasmus Pagh:
Uniform Hashing in Constant Time and Optimal Space. SIAM J. Comput. 38(1): 85-96 (2008) - 2007
- [c18]Philip Bille, Anna Pagh, Rasmus Pagh:
Fast Evaluation of Union-Intersection Expressions. ISAAC 2007: 739-750 - [c17]Anna Pagh, Rasmus Pagh, Milan Ruzic:
Linear probing with constant independence. STOC 2007: 318-327 - [i2]Philip Bille, Anna Pagh, Rasmus Pagh:
Fast evaluation of union-intersection expressions. CoRR abs/0708.3259 (2007) - 2006
- [c16]Anna Pagh, Rasmus Pagh:
Scalable computation of acyclic joins. PODS 2006: 225-232 - [c15]Rolf Fagerberg, Anna Pagh, Rasmus Pagh:
External String Sorting: Faster and Cache-Oblivious. STACS 2006: 68-79 - [i1]Anna Pagh, Rasmus Pagh, Milan Ruzic:
Linear Probing with Constant Independence. CoRR abs/cs/0612055 (2006) - 2005
- [c14]Anna Pagh, Rasmus Pagh, S. Srinivasa Rao:
An optimal Bloom filter replacement. SODA 2005: 823-829 - 2004
- [c13]Anna Pagh, Rasmus Pagh, Mikkel Thorup:
On Adaptive Integer Sorting. ESA 2004: 556-579 - [c12]Luisa Gargano, Mikael Hammar, Anna Pagh:
Limiting Flooding Expenses in On-demand Source-Initiated Protocols for Mobile Wireless Networks. IPDPS 2004 - 2003
- [c11]Anna Östlin, Rasmus Pagh:
Uniform hashing in constant time and linear space. STOC 2003: 622-628 - [c10]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
- [c9]Anna Östlin, Rasmus Pagh:
One-Probe Search. ICALP 2002: 439-450 - [c8]Gerth Stølting Brodal
Solving the String Statistics Problem in Time O(n log n). ICALP 2002: 728-739 - 2001
- [b1]Anna Östlin:
Constructing Evolutionary Trees - Algorithms and Complexity. Lund University, Sweden, 2001 - [j2]Andrzej Lingas, Hans Olsson, Anna Östlin:
Efficient Merging and Construction of Evolutionary Trees. J. Algorithms 41(1): 41-51 (2001) - [c7]Gerth Stølting Brodal
The Complexity of Constructing Evolutionary Trees Using Experiments. ICALP 2001: 140-151 - 2000
- [c6]Bogdan S. Chlebus, Leszek Gasieniec, Anna Östlin, John Michael Robson:
Deterministic Radio Broadcasting. ICALP 2000: 717-728
1990 – 1999
- 1999
- [j1]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin:
On the Complexity of Constructing Evolutionary Trees. J. Comb. Optim. 3(2-3): 183-197 (1999) - [c5]Andrzej Lingas, Hans Olsson, Anna Östlin:
Efficient Merging, Construction, and Maintenance of Evolutionary Trees. ICALP 1999: 544-553 - [c4]Ming-Yang Kao, Andrzej Lingas, Anna Östlin:
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions. STACS 1999: 184-196 - 1998
- [c3]Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin:
Inferring Ordered Trees from Local Constraints. CATS 1998: 67-76 - 1997
- [c2]Leszek Gasieniec, Jesper Jansson
On the Complexity of Computing Evolutionary Trees. COCOON 1997: 134-145 - 1996
- [c1]Christos Levcopoulos, Anna Östlin:
Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract). SWAT 1996: 271-283
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: