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

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 resear...

Ful tanımlama

Kaydedildi:
Detaylı Bibliyografya
Müşterek Yazar: European symposium on algorithms :Bad Honnef, Allemagne
Diğer Yazarlar: Lengauer, Thomas, 1952- (Yayın yönetmeni)
Materyal Türü: Livre numérique
Dil:Anglais
Baskı/Yayın Bilgisi: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Seri Bilgileri:Lecture notes in computer science 726
Konular:
Online Erişim:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Not: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Algorithms - ESA '93, proceedings, First Annual European symposium, Bad Honnef, Germany, September 30-October 2, 1993, Berlin, Springer-Verlag, 1993, 1 vol. (IX-418 p.), Lecture notes in computer science, 3-540-57273-2
• Algorithms - ESA '93, Texte imprimé, 9783662171202
LEADER 05823nam a22004337a 4500
001 943835
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155165372
020 |a 9783540480327 (PDF) 
041 0 |a eng 
082 |a 004 
082 |a 511.8 
082 |a 310 
111 2 |a European symposium on algorithms  |n (01  |d  :1993  |c  :Bad Honnef, Allemagne). 
245 1 0 |a Algorithms - ESA '93 :  |b First Annual European Symposium Bad Honnef, Germany September 30 October 2, 1993 : proceedings   |c [edited by] Thomas Lengauer. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 726  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a 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 distributed sorting -- Three-clustering of points in the plane -- Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs -- Fully dynamic planarity testing in planar embedded graphs -- Fully dynamic algorithms for bin packing: Being (mostly) myopic helps -- Increasing the vertex-connectivity in directed graphs -- On the recognition of permuted bottleneck monge matrices -- Computing treewidth and minimum fill-in: All you need are the minimal separators -- Block gossiping on grids and tori: Deterministic sorting and routing match the bisection bound -- The complexity of scheduling trees with communication delays -- Optimal tree contraction on the hypercube and related networks -- Evolution of an algorithm -- Mesh connected computers with fixed and reconfigurable buses: Packet routing, sorting, and selection -- An efficient parallel algorithm for the layered planar monotone circuit value problem -- Randomized routing on meshes with buses -- On the distribution of the transitive closure in a random acyclic digraph -- Complexity of disjoint paths problems in planar graphs -- Integer multicommodity flows with reduced demands -- A fully dynamic data structure for reachability in planar digraphs -- A linear-time algorithm for edge-disjoint paths in planar graphs -- Sequence comparison and statistical significance in molecular biology -- Surface reconstruction between simple polygons via angle criteria -- A linear algorithm for edge-coloring partial k-trees. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
520 |a 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. 
650 |a Informatique 
650 |a Algorithmes 
650 |a Analyse numérique 
650 |a Probabilités 
650 |a Analyse combinatoire 
650 |a Actes de congrès 
700 1 |a Lengauer, Thomas,  |d 1952-  |4 pbd 
776 0 |0 017492289  |t Algorithms - ESA '93  |o proceedings  |f First Annual European symposium, Bad Honnef, Germany, September 30-October 2, 1993  |c Berlin  |n Springer-Verlag  |d 1993  |p 1 vol. (IX-418 p.)  |s Lecture notes in computer science  |z 3-540-57273-2 
776 0 |t Algorithms - ESA '93  |b Texte imprimé  |z 9783662171202 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-57273-2  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-JXQP2XD1-S  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747925240  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-57273-2  |z Accès Université d'Orléans 
856 4 |5 180339901:750937378  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-57273-2  |z Accès INSA CVL 
997 |0 943835  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/