The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Anna Östlin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin
    On the Complexity of Computing Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:134-145 [Conf]
  2. Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Anna Östlin
    The Complexity of Constructing Evolutionary Trees Using Experiments. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:140-151 [Conf]
  3. Gerth Stølting Brodal, Rune B. Lyngsø, Anna Östlin, Christian N. S. Pedersen
    Solving the String Statistics Problem in Time O(n log n). [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:728-739 [Conf]
  4. Bogdan S. Chlebus, Leszek Gasieniec, Anna Östlin, John Michael Robson
    Deterministic Radio Broadcasting. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:717-728 [Conf]
  5. Andrzej Lingas, Hans Olsson, Anna Östlin
    Efficient Merging, Construction, and Maintenance of Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:544-553 [Conf]
  6. Anna Östlin, Rasmus Pagh
    One-Probe Search. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:439-450 [Conf]
  7. Ming-Yang Kao, Andrzej Lingas, Anna Östlin
    Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:184-196 [Conf]
  8. Anna Östlin, Rasmus Pagh
    Uniform hashing in constant time and linear space. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:622-628 [Conf]
  9. Christos Levcopoulos, Anna Östlin
    Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:271-283 [Conf]
  10. Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian N. S. Pedersen, S. Srinivasa Rao
    Computing Refined Buneman Trees in Cubic Time. [Citation Graph (0, 0)][DBLP]
    WABI, 2003, pp:259-270 [Conf]
  11. Andrzej Lingas, Hans Olsson, Anna Östlin
    Efficient Merging and Construction of Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:1, pp:41-51 [Journal]
  12. Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin
    On the Complexity of Constructing Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1999, v:3, n:2-3, pp:183-197 [Journal]

  13. Inferring Ordered Trees from Local Constraints. [Citation Graph (, )][DBLP]


Search in 0.013secs, Finished in 0.013secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002