Skip to main content
  • Conference proceedings
  • © 1996

Algorithms - ESA '96

Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996. Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1136)

Conference series link(s): ESA: European Symposium on Algorithms

Conference proceedings info: ESA 1996.

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (41 papers)

  1. Front Matter

  2. Analysis of Shellsort and related algorithms

    • Robert Sedgewick
    Pages 1-11
  3. Drawing with colors

    • Ashim Garg, Roberto Tamassia, Paola Vocca
    Pages 12-26
  4. Approximating the unsatisfiability threshold of random formulas (Extended Abstract)

    • Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc
    Pages 27-38
  5. Scheduling jobs with communication delays: Using infeasible solutions for approximation

    • Rolf H. Möhring, Markus W. Schäffter, Andreas S. Schulz
    Pages 76-90
  6. Randomization of search trees by subtree size

    • Salvador Roura, Conrado Martínez
    Pages 91-106
  7. Efficient dynamic method-lookup for object oriented languages

    • Paolo Ferragina, S. Muthukrishnan
    Pages 107-120
  8. Simulated Annealing and its problems to color graphs

    • Andreas Nolte, Rainer Schrader
    Pages 138-151
  9. The capacitated K-center problem

    • Samir Khuller, Yoram J. Sussmann
    Pages 152-166
  10. Approximation algorithms for connected dominating sets

    • Sudipto Guha, Samir Khuller
    Pages 179-193
  11. On the depth of randomly generated circuits

    • Tatsuie Tsukiji, Fatos Xhafa
    Pages 208-220
  12. The analysis of linear probing hashing with buckets

    • Alfredo Viola, Patricio V. Poblete
    Pages 221-233
  13. Parallel algorithms for partitioning sorted sets and related problems

    • Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi
    Pages 234-245
  14. Fast generation of random permutations via networks simulation

    • Artur Czumaj, Przemysława Kanarek, Mirosław Kutyłowski, Krzysztof Loryś
    Pages 246-260

Other Volumes

  1. Algorithms — ESA '96

About this book

This book constitutes the refereed proceedings of the 4th European Symposium on Algorithms, ESA '96, held in Barcelona, Spain, in September 1996.
The book presents 40 revised full papers selected from 124 submissions; also are included extended abstracts of two invited presentations. The papers included cover all research areas on algorithms and their analysis as it is carried out in the fields of computer science, discrete applied and algorithmic mathematics, operations research, and all other areas of algorithms-oriented research, design and analysis.

Bibliographic Information

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access