bokomslag Algorithms - ESA '93
Data & IT

Algorithms - ESA '93

Thomas Lengauer

Pocket

759:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 10-16 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

  • 418 sidor
  • 1993
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.
  • Författare: Thomas Lengauer
  • Format: Pocket/Paperback
  • ISBN: 9783540572732
  • Språk: Engelska
  • Antal sidor: 418
  • Utgivningsdatum: 1993-09-01
  • Förlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. K