Read Anywhere and on Any Device!

Subscribe to Read | $0.00

Join today and start reading your favorite books for Free!

Read Anywhere and on Any Device!

  • Download on iOS
  • Download on Android
  • Download on iOS

Algorithms - ESA '93: First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993. Proceedings

Algorithms - ESA '93: First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993. Proceedings

Thomas Lengauer
0/5 ( ratings)
Symposium on Algorithms , held in Bad Honnef, near Boon, in Germany, September 30 - October 2, 1993. The symposium is intended to launchan annual series of international conferences, held in early fall, covering the field of algorithms. Within the scope of the symposium lies all research on algorithms, theoretical as well as applied, that is carried out in the fields of computer science and discrete applied mathematics. The symposium aims to cater to both of these research communities and to intensify the exchange between them. The volume contains 35 contributed papers selected from 101 proposals submitted in response to the call for papers, as well as three invited lectures: "Evolution of an algorithm" by Michael Paterson, "Complexity of disjoint paths problems in planar graphs" by Alexander Schrijver, and "Sequence comparison and statistical significance in molecular biology" by Michael S. Waterman.
Language
English
Pages
418
Format
Paperback
Publisher
Springer
Release
September 21, 1993
ISBN
3540572732
ISBN 13
9783540572732

Algorithms - ESA '93: First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993. Proceedings

Thomas Lengauer
0/5 ( ratings)
Symposium on Algorithms , held in Bad Honnef, near Boon, in Germany, September 30 - October 2, 1993. The symposium is intended to launchan annual series of international conferences, held in early fall, covering the field of algorithms. Within the scope of the symposium lies all research on algorithms, theoretical as well as applied, that is carried out in the fields of computer science and discrete applied mathematics. The symposium aims to cater to both of these research communities and to intensify the exchange between them. The volume contains 35 contributed papers selected from 101 proposals submitted in response to the call for papers, as well as three invited lectures: "Evolution of an algorithm" by Michael Paterson, "Complexity of disjoint paths problems in planar graphs" by Alexander Schrijver, and "Sequence comparison and statistical significance in molecular biology" by Michael S. Waterman.
Language
English
Pages
418
Format
Paperback
Publisher
Springer
Release
September 21, 1993
ISBN
3540572732
ISBN 13
9783540572732

Rate this book!

Write a review?

loader