The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Susanne Albers: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Susanne Albers, Naveen Garg, Stefano Leonardi
    Minimizing Stall Time in Single and Parallel Disk Systems. [Citation Graph (1, 0)][DBLP]
    STOC, 1998, pp:454-462 [Conf]
  2. Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, Rüdiger Schultz
    05031 Abstracts Collection - Algorithms for Optimization with Incomplete Information. [Citation Graph (0, 0)][DBLP]
    Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
  3. Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, Rüdiger Schultz
    05031 Summary-- Algorithms for Optimization with Incomplete Information. [Citation Graph (0, 0)][DBLP]
    Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
  4. Susanne Albers, Robert Sedgewick, Dorothea Wagner
    04091 Abstracts Collection - Data Structures. [Citation Graph (0, 0)][DBLP]
    Data Structures, 2004, pp:- [Conf]
  5. Susanne Albers, Jeffery Westbrook
    Self-Organizing Data Structures. [Citation Graph (0, 0)][DBLP]
    Online Algorithms, 1996, pp:13-51 [Conf]
  6. Susanne Albers
    Some Algorithmic Problems in Large Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:30-32 [Conf]
  7. Susanne Albers
    The Influence of Lookahead in Competitive Paging Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:1-12 [Conf]
  8. Susanne Albers, Moses Charikar, Michael Mitzenmacher
    Delayed Information and Action in On-line Algorithms. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:71-81 [Conf]
  9. Susanne Albers, Michael Mitzenmacher
    Average Case Analyses of List Update Algorithms, with Applications to Data Compression. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:514-525 [Conf]
  10. Susanne Albers, Rob van Stee
    A Study of Integrated Document and Connection Caching. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:653-667 [Conf]
  11. Susanne Albers
    A Competitive Analysis of the List Update Problem with Lookahead. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:201-210 [Conf]
  12. Susanne Albers, Günter Schmidt
    Scheduling with Unexpected Machine Breakdowns. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:269-280 [Conf]
  13. Susanne Albers, Carsten Witt
    Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:12-23 [Conf]
  14. Susanne Albers
    Improved Randomized On-Line Algorithms for the List Update Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:412-419 [Conf]
  15. Susanne Albers, Sanjeev Arora, Sanjeev Khanna
    Page Replacement for General Caching Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:31-40 [Conf]
  16. Susanne Albers, Helge Bals
    Dynamic TCP acknowledgement: penalizing long delays. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:47-55 [Conf]
  17. Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, Liam Roditty
    On nash equilibria for a network creation game. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:89-98 [Conf]
  18. Susanne Albers, Torben Hagerup
    Improved Parallel Integer Sorting Without Concurrent Writing. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:463-472 [Conf]
  19. Susanne Albers, Klaus Kursawe, Sven Schuierer
    Exploring Unknown Environments with Obstacles. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:842-843 [Conf]
  20. Susanne Albers, Michael Mitzenmacher
    Average-Case Analyses of First Fit and Random Fit Bin Packing. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:290-299 [Conf]
  21. Susanne Albers
    Generalized connection caching. [Citation Graph (0, 0)][DBLP]
    SPAA, 2000, pp:70-78 [Conf]
  22. Susanne Albers
    New results on web caching with request reordering. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:84-92 [Conf]
  23. Susanne Albers, Markus Büttner
    Integrated prefetching and caching in single and parallel disk systems. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:109-117 [Conf]
  24. Susanne Albers, Hiroshi Fujiwara
    Energy-Efficient Algorithms for Flow Time Minimization. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:621-633 [Conf]
  25. Susanne Albers
    On randomized online scheduling. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:134-143 [Conf]
  26. Susanne Albers
    Better Bounds for Online Scheduling. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:130-139 [Conf]
  27. Susanne Albers, Lene M. Favrholdt, Oliver Giel
    On paging with locality of reference. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:258-267 [Conf]
  28. Susanne Albers, Monika Rauch Henzinger
    Exploring Unknown Environments. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:416-425 [Conf]
  29. Susanne Albers, Markus Schmidt
    On the performance of greedy algorithms in packet buffering. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:35-44 [Conf]
  30. Susanne Albers, Hisashi Koga
    New On-Line Algorithms for the Page Replication Problem. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:25-36 [Conf]
  31. Susanne Albers, Markus Büttner
    Integrated Prefetching and Caching with Read and Write Requests. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:162-173 [Conf]
  32. Susanne Albers, Hisashi Koga
    Page Migration with Limited Local Memory Capacity. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:147-158 [Conf]
  33. Susanne Albers, Bianca Schröder
    An Experimental Study of Online Scheduling Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2000, pp:11-22 [Conf]
  34. Susanne Albers
    Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:10-26 [Conf]
  35. Susanne Albers
    On the Influence of Lookahead in Competitive Paging Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:3, pp:283-305 [Journal]
  36. Susanne Albers, Klaus Kursawe, Sven Schuierer
    Exploring Unknown Environments with Obstacles. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:1, pp:123-143 [Journal]
  37. Susanne Albers, Michael Mitzenmacher
    Average Case Analyses of List Update Algorithms, with Applications to Data Compression. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:21, n:3, pp:312-329 [Journal]
  38. Susanne Albers, Tomasz Radzik
    Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:1, pp:1-2 [Journal]
  39. Susanne Albers, Stefano Leonardi
    On-line Algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1999, v:31, n:3es, pp:4- [Journal]
  40. Susanne Albers, Peter Brucker
    The Complexity of One-Machine Batching Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:47, n:2, pp:87-107 [Journal]
  41. Susanne Albers, Günter Schmidt
    Scheduling with unexpected machine breakdowns. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:85-99 [Journal]
  42. Susanne Albers, Torben Hagerup
    Improved Parallel Integer Sorting without Concurrent Writing. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:136, n:1, pp:25-51 [Journal]
  43. Susanne Albers, Markus Büttner
    Integrated prefetching and caching in single and parallel disk systems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:198, n:1, pp:24-39 [Journal]
  44. Susanne Albers, Moses Charikar, Michael Mitzenmacher
    Delayed Information and Action in On-Line Algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:170, n:2, pp:135-152 [Journal]
  45. Susanne Albers, Marek Karpinski
    Randomized splay trees: Theoretical and experimental results. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:4, pp:213-221 [Journal]
  46. Susanne Albers, Michael Mitzenmacher
    Revisiting the Counter Algorithms for List Update. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:3, pp:155-160 [Journal]
  47. Susanne Albers, Bernhard von Stengel, Ralph Werchner
    A Combined BIT and TIMESTAMP Algorithm for the List Update Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:3, pp:135-139 [Journal]
  48. Susanne Albers, Naveen Garg, Stefano Leonardi
    Minimizing stall time in single and parallel disk systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:6, pp:969-986 [Journal]
  49. Susanne Albers, Hisashi Koga
    New On-Line Algorithms for the Page Replication Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:27, n:1, pp:75-96 [Journal]
  50. Susanne Albers, Lene M. Favrholdt, Oliver Giel
    On paging with locality of reference. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:70, n:2, pp:145-175 [Journal]
  51. Susanne Albers, Bianca Schröder
    An Experimental Study of Online Scheduling Algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2002, v:7, n:, pp:3- [Journal]
  52. Susanne Albers
    On Generalized Connection Caching. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:3, pp:251-267 [Journal]
  53. Susanne Albers, Michael Mitzenmacher
    Average-case analyses of first fit and random fit bin packing. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:3, pp:240-259 [Journal]
  54. Susanne Albers, Monika Rauch Henzinger
    Exploring Unknown Environments. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:4, pp:1164-1188 [Journal]
  55. Susanne Albers, Markus Schmidt
    On the Performance of Greedy Algorithms in Packet Buffering. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:278-304 [Journal]
  56. Susanne Albers
    Improved Randomized On-Line Algorithms for the List Update Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:3, pp:682-693 [Journal]
  57. Susanne Albers
    Better Bounds for Online Scheduling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:459-473 [Journal]
  58. Susanne Albers, Helge Bals
    Dynamic TCP Acknowledgment: Penalizing Long Delays. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:4, pp:938-951 [Journal]
  59. Susanne Albers
    A Competitive Analysis of the List Update Problem with Lookahead. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:197, n:1-2, pp:95-109 [Journal]
  60. Susanne Albers, Tobias Jacobs
    An Experimental Study of New and Known Online Packet Buffering Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:754-765 [Conf]
  61. Susanne Albers, Fabian Müller, Swen Schmelzer
    Speed scaling on parallel processors. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:289-298 [Conf]
  62. Susanne Albers, Rob van Stee
    A Study of Integrated Document and Connection Caching in the WWW. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:3, pp:239-252 [Journal]

  63. Algorithms for Energy Saving. [Citation Graph (, )][DBLP]


  64. Algorithms for Energy Management. [Citation Graph (, )][DBLP]


  65. Resource Management in Large Networks. [Citation Graph (, )][DBLP]


  66. On List Update with Locality of Reference. [Citation Graph (, )][DBLP]


  67. On the value of coordination in network design. [Citation Graph (, )][DBLP]


  68. Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science. [Citation Graph (, )][DBLP]


  69. Preface - 25th International Symposium on Theoretical Aspects of Computer Science. [Citation Graph (, )][DBLP]


  70. Preface - 26th International Symposium on Theoretical Aspects of Computer Science. [Citation Graph (, )][DBLP]


  71. Energy-efficient algorithms. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002