Susanne Albers

Prof. Dr. rer. nat.

1992 …2024

Research activity per year

Filter
Conference contribution

Search results

  • 2022

    Online Ad Allocation in Bounded-Degree Graphs

    Albers, S. & Schubert, S., 2022, Web and Internet Economics - 18th International Conference, WINE 2022, Proceedings. Hansen, K. A., Liu, T. X. & Malekian, A. (eds.). Springer Science and Business Media Deutschland GmbH, p. 60-77 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13778 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Scopus citations
  • Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities

    Albers, S. & Schubert, S., 1 Sep 2022, 30th Annual European Symposium on Algorithms, ESA 2022. Chechik, S., Navarro, G., Rotenberg, E. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 244).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    3 Scopus citations
  • 2021

    Algorithms for Energy Conservation in Heterogeneous Data Centers

    Albers, S. & Quedenfeld, J., 2021, Algorithms and Complexity - 12th International Conference, CIAC 2021, Proceedings. Calamoneri, T. & Corò, F. (eds.). Springer Science and Business Media Deutschland GmbH, p. 75-89 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12701 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    1 Scopus citations
  • Algorithms for right-sizing heterogeneous data centers

    Albers, S. & Quedenfeld, J., 6 Jul 2021, SPAA 2021 - Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 48-58 11 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    3 Scopus citations
  • Explorable Uncertainty in Scheduling with Non-uniform Testing Times

    Albers, S. & Eckl, A., 2021, Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Revised Selected Papers. Kaklamanis, C. & Levin, A. (eds.). Springer Science and Business Media Deutschland GmbH, p. 127-142 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12806 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    11 Scopus citations
  • Machine Covering in the Random-Order Model

    Albers, S., Gálvez, W. & Janke, M., 1 Dec 2021, 32nd International Symposium on Algorithms and Computation, ISAAC 2021. Ahn, H.-K. & Sadakane, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 52. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 212).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Scopus citations
  • Online Makespan Minimization with Budgeted Uncertainty

    Albers, S. & Janke, M., 2021, Algorithms and Data Structures - 17th International Symposium, WADS 2021, Proceedings. Lubiw, A. & Salavatipour, M. (eds.). Springer Science and Business Media Deutschland GmbH, p. 43-56 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12808 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    3 Scopus citations
  • Optimal algorithms for online b-matching with variable vertex capacities

    Albers, S. & Schubert, S., 1 Sep 2021, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021. Wootters, M. & Sanita, L. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 207).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    4 Scopus citations
  • Scheduling in the Secretary Model

    Albers, S. & Janke, M., 1 Dec 2021, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021. Bojanczyk, M. & Chekuri, C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 6. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 213).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Scopus citations
  • Scheduling with Testing on Multiple Identical Parallel Machines

    Albers, S. & Eckl, A., 2021, Algorithms and Data Structures - 17th International Symposium, WADS 2021, Proceedings. Lubiw, A. & Salavatipour, M. (eds.). Springer Science and Business Media Deutschland GmbH, p. 29-42 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12808 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    7 Scopus citations
  • 2020

    Best fit bin packing with random order revisited

    Albers, S., Khan, A. & Ladewig, L., 1 Aug 2020, 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020. Esparza, J., Kral�, D. & Kral�, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, MFCS-2020-7. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 170).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Scopus citations
  • New bounds for randomized list update in the paid exchange model

    Albers, S. & Janke, M., Mar 2020, 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020. Paul, C. & Blaser, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, LIPIcs-STACS-2020-12. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 154).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    4 Scopus citations
  • Scheduling in the random-order model

    Albers, S. & Janke, M., 1 Jun 2020, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020. Czumaj, A., Dawar, A. & Merelli, E. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 68. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 168).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    6 Scopus citations
  • 2019

    Improved online algorithms for knapsack and GAP in the random order model

    Albers, S., Khan, A. & Ladewig, L., Sep 2019, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019. Achlioptas, D. & Vegh, L. A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 22. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 145).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    6 Scopus citations
  • New results for the k-secretary problem

    Albers, S. & Ladewig, L., Dec 2019, 30th International Symposium on Algorithms and Computation, ISAAC 2019. Lu, P. & Zhang, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 18. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 149).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    3 Scopus citations
  • 2018

    Optimal algorithms for right-sizing data centers

    Albers, S. & Quedenfeld, J., 11 Jul 2018, SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 363-372 10 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    19 Scopus citations
  • 2017

    On energy conservation in data centers

    Albers, S., 24 Jul 2017, SPAA 2017 - Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 35-44 10 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures; vol. Part F129316).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    13 Scopus citations
  • On the value of penalties in time-inconsistent planning

    Albers, S. & Kraft, D., 1 Jul 2017, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. Muscholl, A., Indyk, P., Kuhn, F. & Chatzigiannakis, I. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 10. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 80).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    7 Scopus citations
  • The price of uncertainty in present-biased planning

    Albers, S. & Kraft, D., 2017, Web and Internet Economics - 13th International Conference, WINE 2017, Proceedings. Devanur, N. R. & Lu, P. (eds.). Springer Verlag, p. 325-339 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10660 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    6 Scopus citations
  • Tight bounds for online coloring of basic graph classes

    Albers, S. & Schraink, S., 1 Sep 2017, 25th European Symposium on Algorithms, ESA 2017. Sohler, C., Sohler, C. & Pruhs, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 7. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 87).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Scopus citations
  • 2016

    Motivating time-inconsistent agents: A computational approach

    Albers, S. & Kraft, D., 2016, Web and Internet Economics - 12th International Conference, WINE 2016, Proceedings. Vetta, A. & Cai, Y. (eds.). Springer Verlag, p. 309-323 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10123 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    4 Scopus citations
  • Scheduling on power-heterogeneous processors

    Albers, S., Bampis, E., Letsios, D., Lucarelli, G. & Stotz, R., 2016, LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Proceedings. Navarro, G., Kranakis, E. & Chávez, E. (eds.). Springer Verlag, p. 41-54 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9644).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    8 Scopus citations
  • 2015

    Minimizing stall time in single and parallel disk systems using multicommodity network flows

    Albers, S. & Witt, C., 2015, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 4th International Workshop on Approximation, Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Proceedings. Trevisan, L., Jansen, K., Goemans, M. & Rolim, J. D. P. (eds.). Springer Verlag, p. 12-24 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2129).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Quantifying competitiveness in paging with locality of reference

    Albers, S. & Frascaria, D., 2015, Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings. Halldorsson, M. M., Kobayashi, N., Speckmann, B. & Iwama, K. (eds.). Springer Verlag, p. 26-38 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9134).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 2014

    Online makespan minimization with parallel schedules

    Albers, S. & Hellwig, M., 2014, Algorithm Theory, SWAT 2014 - 14th Scandinavian Symposium and Workshops, Proceedings. Springer Verlag, p. 13-25 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8503 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    9 Scopus citations
  • 2013

    New online algorithms for story scheduling in web advertising

    Albers, S. & Passen, A., 2013, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings. PART 2 ed. p. 446-458 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7966 LNCS, no. PART 2).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    6 Scopus citations
  • Recent advances for a classical scheduling problem

    Albers, S., 2013, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings. PART 2 ed. p. 4-14 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7966 LNCS, no. PART 2).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    9 Scopus citations
  • Recent results for online makespan minimization (extended abstract)

    Albers, S., 2013, Computing and Combinatorics - 19th International Conference, COCOON 2013, Proceedings. p. 1-3 3 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7936 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2012

    On the value of job migration in online makespan minimization

    Albers, S. & Hellwig, M., 2012, Algorithms, ESA 2012 - 20th Annual European Symposium, Proceedings. p. 84-95 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7501 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    11 Scopus citations
  • Race to idle: New algorithms for speed scaling with a sleep state

    Albers, S. & Antoniadis, A., 2012, Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012. Association for Computing Machinery, p. 1266-1285 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    34 Scopus citations
  • 2011

    Algorithms for dynamic speed scaling

    Albers, S., 2011, 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011. p. 1-11 11 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 9).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    46 Scopus citations
  • On multi-processor speed scaling with migration: Extended abstract

    Albers, S., Antoniadis, A. & Greiner, G., 2011, SPAA'11 - Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures. p. 279-288 10 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    37 Scopus citations
  • 2010

    Algorithms for energy management (Invited talk)

    Albers, S., 2010, Computer Science - Theory and Applications - 5th International Computer Science Symposium in Russia, CSR 2010, Proceedings. p. 1-11 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6072 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Scopus citations
  • On approximate nash equilibria in network design

    Albers, S. & Lenzner, P., 2010, Internet and Network Economics - 6th International Workshop, WINE 2010, Proceedings. p. 14-25 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6484 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    7 Scopus citations
  • 2009

    Algorithms for energy saving

    Albers, S., 2009, Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday. Albers, S., Alt, H. & Naher, S. (eds.). p. 173-186 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5760 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    21 Scopus citations
  • Resource management in large networks

    Albers, S., 2009, Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation. Lerner, J., Wagner, D. & Zweig, K. A. (eds.). p. 227-246 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5515 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Scopus citations
  • 2008

    On list update with locality of reference

    Albers, S. & Lauer, S., 2008, Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings. PART 1 ed. p. 96-107 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5125 LNCS, no. PART 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    16 Scopus citations
  • On the value of coordination in network design

    Albers, S., 2008, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 294-303 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    27 Scopus citations
  • 2007

    An experimental study of new and known online packet buffering algorithms

    Albers, S. & Jacobs, T., 2007, Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings. Springer Verlag, p. 754-765 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4698 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    6 Scopus citations
  • Speed scaling on parallel processors

    Albers, S., Müller, F. & Schmelzer, S., 2007, SPAA'07: Proceedings of the Nineteenth Annual Symposium on Parallelism in Algorithms and Architectures. p. 289-298 10 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    86 Scopus citations
  • 2006

    Energy-efficient algorithms for flow time minimization

    Albers, S. & Fujiwara, H., 2006, STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. p. 621-633 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3884 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    36 Scopus citations
  • 2004

    Algorithms–ESA 2004: 12th Annual European Symposium Bergen, Norway, September 14-17, 2004 Proceedings

    Albers, S. & Radzik, T., 2004, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Albers, S. & Radzik, T. (eds.). Springer Verlag, (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3221).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2001

    An experimental study of online scheduling algorithms

    Albers, S. & Schröder, B., 2001, Algorithm Engineering - 4th International Workshop, WAE 2000, Proceedings. Naher, S. & Wagner, D. (eds.). Springer Verlag, p. 11-22 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1982 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    3 Scopus citations
  • Some algorithmic problems in large networks

    Albers, S., 2001, Algorithms - ESA 2001 - 9th Annual European Symposium, Proceedings. auf der Heide, F. M. (ed.). Springer Verlag, p. 30-32 3 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2161).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 1999

    Online algorithms: A study of graph-theoretic concepts

    Albers, S., 1999, Graph-Theoretic Concepts in Computer Science - 25th International Workshop, WG 1999, Proceedings. Widmayer, P., Neyer, G. & Eidenbenz, S. (eds.). Springer Verlag, p. 10-26 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1665).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    5 Scopus citations
  • Scheduling with unexpected machine breakdowns

    Albers, S. & Schmidt, G., 1999, Randomization, Approximation, and Combinatorial Optimization: Algorithms and Techniques - 3rd International Workshop on Randomization and Approximation Techniques in Computer Science and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, RANDOM-APPROX 1999, Proceedings. Rolim, J. D. P., Sinclair, A., Hochbaum, D. & Jansen, K. (eds.). Springer Verlag, p. 269-280 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1671).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    4 Scopus citations
  • 1998

    Self-organizing data structures

    Albers, S. & Westbrook, J., 1998, Online Algorithms - The State of the Art. Fiat, A. & Woeginger, G. J. (eds.). Springer Verlag, p. 13-51 39 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1442).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    40 Scopus citations
  • 1996

    Average case analyses of list update algorithms, with applications to data compression

    Albers, S. & Mitzenmacher, M., 1996, Automata, Languages and Programming - 23rd International Colloquium, ICALP 1996, Proceedings. Meyer auf der Heide, F. & Monien, B. (eds.). Springer Verlag, p. 514-525 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1099).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    5 Scopus citations
  • 1995

    Improved randomized on-line algorithms for the list update problem

    Albers, S., 22 Jan 1995, Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995. Association for Computing Machinery, p. 412-419 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    18 Scopus citations
  • Page migration with limited local memory capacity

    Albers, S. & Koga, H., 1995, Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings. Akl, S. G., Dehne, F., Sack, J.-R. & Santoro, N. (eds.). Springer Verlag, p. 147-158 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 955).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    9 Scopus citations