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

種類:

電子ブック

責任表示:

edited by Thomas Lengauer

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1993

著者名:

• Lengauer, Thomas.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 726

ISBN:

9783540480327 [3540480323]    

注記:

The influence of lookahead in competitive paging algorithms -- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications -- Efficient self simulation algorithms for reconfigurable arrays -- Optimal upward planarity testing of single-source digraphs -- On bufferless routing of variable-length messages in leveled networks -- Saving comparisons in the Crochemore-Perrin string matching algorithm -- Unambiguity of extended regular expressions in SGML document grammars -- On the direct sum conjecture in the straight line model -- Combine and conquer: A general technique for dynamic algorithms -- Optimal CREW-PRAM algorithms for direct dominance problems -- Trekking in the Alps without freezing or getting tired -- Dog bites postman: Point location in the moving Voronoi diagram and related problems -- Parallel approximation schemes for problems on planar graphs -- DNA physical mapping: Three ways difficult -- A calculus of random generation -- The bit complexity of distri
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.

ローカル注記:

学内専用E-BOOKS (local access only)