Guest Editors’ Foreword

@article{Bose2004GuestEF,
  title={Guest Editors’ Foreword},
  author={Prosenjit Bose and Pat Morin},
  journal={Algorithmica},
  year={2004},
  volume={42},
  pages={1-2}
}
As suggested by its name, the International Symposium on Algorithms and Computation (ISAAC) is an annual conference dedicated to promoting research in the broad areas of Algorithms and Computing. This yearly event offers reseachers working in these areas of Computer Science an opportunity to promote their latest research and exchange ideas. With the help of the program committee of ISAAC 2002, we selected seven outstanding papers for this special issue of Algorithmica, including the paper that… 

References

SHOWING 1-3 OF 3 REFERENCES
Self-adjusting binary search trees
TLDR
The splay tree, a self-adjusting form of binary search tree, is developed and analyzed and is found to be as efficient as balanced trees when total running time is the measure of interest.
Skip Lists: A Probabilistic Alternative to Balanced Trees
TLDR
This paper describes and analyzes skip lists and presents new techniques for analyzing probabilistic algorithms.
On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future?
  • R. Karp
  • Computer Science
    IFIP Congress
  • 1992