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

Thomas Lengauer

ISBN 10: 3540572732 / ISBN 13: 9783540572732

Verlag: Springer, Berlin, Springer Berlin Heidelberg, Springer, 1993

Beschreibung

Neuware - Symposium on Algorithms (ESA '93), held in Bad Honnef, nearBoon, in Germany, September 30 - October 2, 1993. Thesymposium is intended to launchan annual series ofinternational conferences, held in early fall, covering thefield of algorithms. Within the scope of the symposium liesall research on algorithms, theoretical as well as applied,that is carried out in the fields of computer science anddiscrete applied mathematics. The symposium aims to cater toboth of these research communities and to intensify theexchange between them.The volume contains 35 contributed papers selected from 101proposals submitted in response to the call for papers, aswell as three invited lectures: 'Evolution of an algorithm'by Michael Paterson, 'Complexity of disjoint paths problemsin planar graphs' by Alexander Schrijver, and 'Sequencecomparison and statistical significance in molecularbiology' by Michael S. Waterman.

Bestandsnummer des Verkäufers 9783540572732

Bibliografische Details

• Titel: Algorithms - ESA '93 : First Annual European Symposium, Bad Honnef, Germany, September 30-October 2, 1993, Proceedings
• Verlag: Springer, Berlin, Springer Berlin Heidelberg, Springer
• Erscheinungsjahr: 1993
• Sprache: Englisch
• ISBN-10: 3540572732
• ISBN-13: 9783540572732
• Einband: Taschenbuch
• Zustand: Neu

Über diesen Titel

Inhaltsangabe

Symposium on Algorithms (ESA '93), 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.