Your search returned the following 24 documents:

24. Exploring unkown environments with obstacles
    Susanne Albers, Klaus Kursawe, and Sven Schuierer
    Algorithmica 32 (1): 123-143, 2002
    
23. Average-Case Analyses of First Fit and Random Fit Bin Packing
    Susanne Albers and Michael Mitzenmacher
    Random Structures & Algorithms 16 (3): 240 - 259, 2000
    
22. Minimizing stall time in single and parallel disk systems
    Susanne Albers, Naveen Garg, and Stefano Leonardi
    Journal of the ACM 47 (6): 969-986, 2000
    
21. Better bounds for online scheduling
    Susanne Albers
    SIAM Journal on Computing 29 (2): 459-473, 1999
    
20. Exploring unknown environments with obstacles
    Susanne Albers and Klaus Kursawe
    In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), Baltimore, USA, January 17-19, 1999, 842-843
    
19. Online-Algorithmen
    Susanne Albers
    Habilitation thesis, Universität des Saarlandes, 1999
    
18. Page replacement for general caching problems
    Susanne Albers, Sanjeev Arora, and Sanjeev Khanna
    In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), Baltimore, USA, January 17-19, 1999, 31-40
    
17. A competitive analysis of the list update problem with lookahead
    Susanne Albers
    Theoretical Computer Science 197 (1/2): 95-109, 1998
    
16. Average case analyses of First-Fit and Random-Fit bin packing
    Susanne Albers and Michael Mitzenmacher
    In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), San Francisco, USA, January, 25-27, 1998, 290-299
    
15. Average case analyses of list update algorithms, with applications to data compression
    Susanne Albers and Michael Mitzenmacher
    Algorithmica 21 (3): 312-329, 1998
    
14. Improved randomized on-line algorithms for the list update problem
    Susanne Albers
    SIAM Journal on Computing 27 (3): 682-693, 1998
    
13. Minimizing stall time in single and parallel disk systems
    Susanne Albers, Naveen Garg, and Stefano Leonardi
    In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), Dallas, USA, May 23-26, 1998, 454-462
    
12. New on-line algorithms for the page replication problem
    Susanne Albers and Hisashi Koga
    Journal of Algorithms 27: 75-96, 1998
    
11. On delayed information and action in on-line algorithms
    Susanne Albers, Moses Charikar, and Michael Mitzenmacher
    In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS-98), Palo Alto, USA, November 8-11, 1998, 71-80
    
10. Self-organizing data structures
    Susanne Albers and Jeffery Westbrook
    In: Online Algorithms: The State of the Art, 1998, 13-51
    
9. Better Bounds for Online Scheduling
   Susanne Albers
   In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), El Paso, Texas, May 4--6, 1997, 130-139
   
8. Exploring Unknown Environments
   Susanne Albers and Monika R. Henzinger
   In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), El Paso, Texas, May 4--6, 1997, 416-425
   
7. Improved Parallel Integer Sorting without Concurrent Writing
   Susanne Albers and Torben Hagerup
   Information and Computation 136 (1): 25-51, 1997
   
6. On the Influence of Lookahead in Competitive Paging Algorithms
   Susanne Albers
   Algorithmica 18 (3): 283-305, 1997
   
5. Revisiting the COUNTER algorithms for list update
   Susanne Albers and Michael Mitzenmacher
   Information Processing Letters 64 (3): 155-160, 1997
   
4. Average Case Analysis of List Update Algorithms, with Applications to Data Compression
   Susanne Albers and Michael Mitzenmacher
   In: Automata, Languages and Programming: 23rd International Colloquium (ICALP'96), Paderborn, Germany, July, 8 - 12, 1996, 514-525
   
3. A combined BIT and TIMESTAMP algorithm for the list update problem
   Susanne Albers, Bernhard von Stengel, and Ralph Wechner
   Information Processing Letters 56 (3): 135-139, 1995
   
2. Improved randomized on-line algorithms for the list update problem
   Susanne Albers
   In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), San Francisco, California, USA, January, 22nd - 24th, 1995, 412-419
   
1. Page migration with limited local memory capacity
   Susanne Albers and Hisashi Koga
   In: Algorithms and Data Structures: 4th International Workshop (WADS95), Kingston, Canada, August, 16th - 18th, 1995, 412-158