Algorithms--ESA '93 : first annual European symposium, Bad Honnef, Germany, September 30-October 2, 1993 : proceedings /

Saved in:
Bibliographic Details
Meeting name:ESA (Symposium) (1st : 1993 : Bad Honnef, Germany)
Imprint:Berlin : Springer-Verlag, ©1993.
Description:1 online resource (IX, 418 pages).
Language:English
Series:Lecture notes in computer science, 0302-9743 ; 726
Lecture notes in computer science ; 726.
Lecture notes in computer science ; 726.
Subject:
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/11065794
Hidden Bibliographic Details
Varying Form of Title:ESA '93
Algorithms
Other authors / contributors:Lengauer, T. (Thomas)
Gesellschaft für Informatik.
Annual European Symposium on Algorithms, ESA (1 : 30-09-1993 - 02-10-1993 : Bad Honnef, Germany)
ISBN:9783540480327
3540480323
9780387572734
3540572732
9783540572732
0387572732
Notes:Includes bibliographical references and index.
Restrictions unspecified
Electronic reproduction. [S.l.] : HathiTrust Digital Library, 2011.
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212
digitized 2011 HathiTrust Digital Library committed to preserve
Online resource; title from PDF title page (SpringerLink, viewed Oct. 14, 2013).
Summary: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.
Other form:Print version: Algorithms-ESA '93