Algorithms and computation : 13th international symposium, ISAAC 2002, Vancouver, BC, Canada, November 21-23, 2002 : proceedings
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | , |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
2518 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algorithms and computation, 13th international symposium, ISAAC 2002, Vancouver, BC, Canada, November 21-23, 2002, proceedings, Prosenjit Bose, Pat Morin (eds.), Berlin, Springer, 2002, 1 vol. (XIII-656 p.), Lecture notes in computer science, 3-540-00142-5 • Algorithms and Computation, Texte imprimé, 9783662207987 |
| LEADER | 06649nam a22004097a 4500 | ||
|---|---|---|---|
| 001 | 969913 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155181491 | ||
| 020 | |a 9783540361367 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a International Symposium on Algorithms and Computation |n (13 |d :2002 |c :Vancouver). | |
| 245 | 1 | 0 | |a Algorithms and computation : |b 13th international symposium, ISAAC 2002, Vancouver, BC, Canada, November 21-23, 2002 : proceedings |c [edited by] Prosenjit Bose, Pat Morin. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2518 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Session 1A -- Biased Skip Lists -- Space-Efficient Data Structures for Flexible Text Retrieval Systems -- Key Independent Optimality -- On the Comparison-Addition Complexity of All-Pairs Shortest Paths -- On the Comparison-Addition Complexity of All-Pairs Shortest Paths -- On the Clique-Width of Graphs in Hereditary Classes -- On the Clique-Width of Graphs in Hereditary Classes -- The Probability of a Rendezvous Is Minimal in Complete Graphs -- The Probability of a Rendezvous Is Minimal in Complete Graphs -- On the Minimum Volume of a Perturbed Unit Cube -- On the Minimum Volume of a Perturbed Unit Cube -- Non-Delaunay-Based Curve Reconstruction -- Non-Delaunay-Based Curve Reconstruction -- Cutting a Country for Smallest Square Fit -- Cutting a Country for Smallest Square Fit -- On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter -- On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter -- Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement -- Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement -- Some Remarks on the L-Conjecture -- Some Remarks on the L-Conjecture -- Session 3A -- A Framework for Network Reliability Problems on Graphs of Bounded Treewidth -- A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation -- Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems -- Session 3B -- An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering -- Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint -- A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage -- Session 4A -- Queaps -- Funnel Heap-A Cache Oblivious Priority Queue -- Characterizing History Independent Data Structures -- Session4B -- Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set -- An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover -- Exponential Speedup of Fixed-Parameter Algorithms on K 3,3-Minor-Free or K 5-Minor-Free Graphs -- Session 5A -- Casting a Polyhedron with Directional Uncertainty -- Hierarchy of Surface Models and Irreducible Triangulation -- Algorithms and Complexity for Tetrahedralization Detections -- Session 5B -- Average-Case Communication-Optimal Parallel Parenthesis Matching -- Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks -- New Results for Energy-Efficient Broadcasting in Wireless Networks -- Session 6A -- An Improved Algorithm for the Minimum Manhattan Network Problem -- Approximate Distance Oracles Revisited -- Flat-State Connectivity of Linkages under Dihedral Motions -- Session 6B -- Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms -- Scheduling of Independent Dedicated Multiprocessor Tasks -- On the Approximability of Multiprocessor Task Scheduling Problems -- Session 7A -- Bounded-Degree Independent Sets in Planar Graphs -- Minimum Edge Ranking Spanning Trees of Threshold Graphs -- File Transfer Tree Problems -- Session 7B -- Approximation Algorithms for Some Parameterized Counting Problems -- Approximating MIN k-SAT -- Average-Case Competitive Analyses for Ski-Rental Problems -- Session 8A -- On the Clique Problem in Intersection Graphs of Ellipses -- A Geometric Approach to Boolean Matrix Multiplication -- The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing -- Session 8B -- Improved Distance Oracles for Avoiding Link-Failure -- Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks -- A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm -- Session 9A -- Crossing Minimization for Symmetries -- Simultaneous Embedding of a Planar Graph and Its Dual on the Grid -- Meaningful Information -- Session 9B -- Optimal Clearing of Supply/Demand Curves -- Partitioning Trees of Supply and Demand -- Maximizing a Voronoi Region: The Convex Case -- Invited Talks -- Random Tries -- Expected Acceptance Counts for Finite Automata with Almost Uniform Input -- Monotone Drawings of Planar Graphs. | |
| 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 Calculs numériques | ||
| 650 | |a Algorithmes | ||
| 650 | |a Réseaux d'ordinateurs | ||
| 650 | |a Structures de données (informatique) | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Bose, Prosenjit, |c informaticien. |4 pbd | |
| 700 | 1 | |a Morin, Pat, |c informaticien. |4 pbd | |
| 776 | 0 | |0 069463247 |t Algorithms and computation |o 13th international symposium, ISAAC 2002, Vancouver, BC, Canada, November 21-23, 2002 |o proceedings |f Prosenjit Bose, Pat Morin (eds.) |c Berlin |n Springer |d 2002 |p 1 vol. (XIII-656 p.) |s Lecture notes in computer science |z 3-540-00142-5 | |
| 776 | 0 | |t Algorithms and Computation |b Texte imprimé |z 9783662207987 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-36136-7 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-BD7PZKJL-S |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750668865 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-36136-7 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754017931 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-36136-7 |z Accès INSA CVL | |
| 997 | |0 969913 |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/ | ||