Algorithms - ESA 98 : 6th Annual European Symposium, Venice, Italy, August 24 26, 1998 : proceedings

Sábháilte in:
Sonraí bibleagrafaíochta
Údar corparáideach: European symposium on algorithms :Venise, Italie
Rannpháirtithe: Bilardi, Gianfranco (Stiúrthóir foilseacháin), Italiano, Giuseppe F. (Stiúrthóir foilseacháin), Pietracaprina, Andrea, 1963- (Stiúrthóir foilseacháin)
Formáid: Livre numérique
Teanga:Anglais
Foilsithe / Cruthaithe: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Sraith:Lecture notes in computer science 1461
Ábhair:
Rochtain ar líne:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Nóta: 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 '98, 6th annual European symposium, Venice, Italy, August 1998, proceedings, Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina ... [et. al.], (eds.), 1998, New York, Springer, 1 vol. (XII-513 p.), Lecture notes in computer science, 3-540-64848-8
• Algorithms - ESA '98, Texte imprimé, 9783662187746
LEADER 05608nam a22004457a 4500
001 971656
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155210653
020 |a 9783540685302 (PDF) 
041 0 |a eng 
082 |a 004 
082 |a 004.015118 
111 2 |a European symposium on algorithms  |n (06  |d  :1998  |c  :Venise, Italie). 
245 1 0 |a Algorithms - ESA 98 :  |b 6th Annual European Symposium, Venice, Italy, August 24 26, 1998 : proceedings   |c [edited by] Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina... [et al.]. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 1461  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a Invited Lectures -- External Memory Algorithms -- Design and Analysis of Dynamic Processes: A Stochastic Approach (Invited Paper) -- Data Structures -- Car-Pooling as a Data Structuring Device: The Soft Heap -- Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property -- Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures -- Strings and Biology -- Augmenting Suffix Trees, with Applications -- Longest Common Subsequence from Fragments via Sparse Dynamic Programming -- Computing the Edit-Distance Between Unrooted Ordered Trees -- Analogs and Duals of the MAST Problem for Sequences and Trees -- Numerical Algorithms -- Complexity Estimates Depending on Condition and Round-Off Error -- Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting -- Fast Algorithms for Linear Algebra Modulo N -- A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers -- Geometry -- Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time -- A Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract) -- Positioning Guards at Fixed Height Above a Terrain An Optimum Inapproximability Result -- Two-Center Problems for a Convex Polygon (Extended Abstract) -- Constructing Binary Space Partitions for Orthogonal Rectangles in Practice -- Randomized and On-Line Algorithms -- A Fast Random Greedy Algorithm for the Component Commonality Problem -- Maximizing Job Completions Online -- A Randomized Algorithm for Two Servers on the Line (Extended Abstract) -- Parallel and Distributed Algorithms I -- On Nonblocking Properties of the Beneš Network -- Adaptability and the Usefulness of Hints (Extended Abstract) -- Fault-Tolerant Broadcasting in Radio Networks (ExtendedAbstract) -- New Bounds for Oblivious Mesh Routing -- Evaluating Server-Assisted Cache Replacement in the Web -- Graph Algorithms -- Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights -- A Functional Approach to External Graph Algorithms -- Minimal Triangulations for Graphs with Few Minimal Separators -- Finding an Optimal Path without Growing the Tree -- An Experimental Study of Dynamic Algorithms for Directed Graphs -- Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-known Theme -- Parallel and Distributed Algorithms II -- ?-Stepping : A Parallel Single Source Shortest Path Algorithm -- Improved Deterministic Parallel Padded Sorting -- Analyzing an Infinite Parallel Job Allocation Process -- Nearest Neighbor Load Balancing on Graphs -- Optimization -- 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves -- Moving-Target TSP and Related Problems -- Fitting Points on the Real Line and Its Application to RH Mapping -- Approximate Coloring of Uniform Hypergraphs (Extended Abstract) -- Techniques for Scheduling with Rejection -- Computer-Aided Way to Prove Theorems in Scheduling. 
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 
650 |a Informatique 
650 |a Algorithmes 
650 |a Réseaux d'ordinateurs 
650 |a Analyse numérique 
650 |a Probabilités 
650 |a Structures de données (informatique) 
650 |a Actes de congrès 
700 1 |a Bilardi, Gianfranco.  |4 pbd 
700 1 |a Italiano, Giuseppe F.  |4 pbd 
700 1 |a Pietracaprina, Andrea,  |d 1963-  |4 pbd 
776 0 |0 035983949  |t Algorithms--ESA '98  |o 6th annual European symposium, Venice, Italy, August 1998  |o proceedings  |f Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina ... [et. al.], (eds.)  |d 1998  |c New York  |n Springer  |p 1 vol. (XII-513 p.)  |s Lecture notes in computer science  |z 3-540-64848-8 
776 0 |t Algorithms - ESA '98  |b Texte imprimé  |z 9783662187746 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-68530-8  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-S7KL72VT-0  |z Accès sur la plateforme Istex 
856 4 |5 452349901:750650176  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-68530-8  |z Accès Université d'Orléans 
856 4 |5 180339901:754000672  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-68530-8  |z Accès INSA CVL 
997 |0 971656  |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/