Algorithms and data structures : 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003 : proceedings
保存先:
| 団体著者: | |
|---|---|
| その他の著者: | , , |
| フォーマット: | Livre numérique |
| 言語: | Anglais |
| 出版事項: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| シリーズ: | Lecture notes in computer science
2748 |
| 主題: | |
| オンライン･アクセス: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 注記: |
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 data structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30-August 1, 2003, proceedings, Frank Dehne, Jörg Rüdiger Sack, Michiel Smid (eds.), Berlin, Springer, 2003, 1 vol. (XII-522 p.), Lecture notes in computer science, 3-540-40545-3 • Algorithms and Data Structures, Texte imprimé, 9783662212875 |
| LEADER | 05117nam a22004337a 4500 | ||
|---|---|---|---|
| 001 | 972230 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155220640 | ||
| 020 | |a 9783540450788 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 082 | |a 005.1 | ||
| 111 | 2 | |a WADS 2003 |n (8th |c :Ottawa, Ontario, Canada). | |
| 245 | 1 | 0 | |a Algorithms and data structures : |b 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003 : proceedings |c [edited by] Frank Dehne, Jörg-Rüdiger Sack, Michiel Smid. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2748 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Multi-party Pseudo-Telepathy -- Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips -- Shape Segmentation and Matching with Flow Discretization -- Phylogenetic Reconstruction from Gene-Rearrangement Data with Unequal Gene Content -- Toward Optimal Motif Enumeration -- Common-Deadline Lazy Bureaucrat Scheduling Problems -- Bandwidth-Constrained Allocation in Grid Computing -- Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection -- Fast Algorithms for a Class of Temporal Range Queries -- Distribution-Sensitive Binomial Queues -- Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees -- Extremal Configurations and Levels in Pseudoline Arrangements -- Fast Relative Approximation of Potential Fields -- The One-Round Voronoi Game Replayed -- Integrated Prefetching and Caching with Read and Write Requests -- Online Seat Reservations via Offline Seating Arrangements -- Routing and Call Control Algorithms for Ring Networks -- Algorithms and Models for Railway Optimization -- Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles -- Multi-way Space Partitioning Trees -- Cropping-Resilient Segmented Multiple Watermarking -- On Simultaneous Planar Graph Embeddings -- Smoothed Analysis -- Approximation Algorithm for Hotlink Assignments in Web Directories -- Drawing Graphs with Large Vertices and Thick Edges -- Semi-matchings for Bipartite Graphs and Load Balancing -- The Traveling Salesman Problem for Cubic Graphs -- Sorting Circular Permutations by Reversal -- An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data -- Dynamic Text and Static Pattern Matching -- Real Two Dimensional Scaled Matching -- Proximity Structures for Geometric Graphs -- The Zigzag Path of a Pseudo-Triangulation -- Alternating Paths along Orthogonal Segments -- Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem -- Chips on Wafers -- A Model for Analyzing Black-Box Optimization -- On the Hausdorff Voronoi Diagram of Point Clusters in the Plane -- Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries -- Significant-Presence Range Queries in Categorical Data -- Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms the Case of k-Internal Spanning Tree -- Parameterized Complexity of Directed Feedback Set Problems in Tournaments -- Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs -- New Directions and New Challenges in Algorithm Design and Complexity, Parameterized. | |
| 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 Analyse numérique | ||
| 650 | |a Structures de données (informatique) | ||
| 650 | |a Actes de congrès | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Dehne, Frank, |d 1960- |4 pbd | |
| 700 | 1 | |a Sack, Jörg-Rüdiger, |d 1954- |4 pbd | |
| 700 | 1 | |a Smid, Michiel. |4 pbd | |
| 776 | 0 | |0 07399409X |t Algorithms and data structures |o 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30-August 1, 2003 |o proceedings |f Frank Dehne, Jörg Rüdiger Sack, Michiel Smid (eds.) |c Berlin |n Springer |d 2003 |p 1 vol. (XII-522 p.) |s Lecture notes in computer science |z 3-540-40545-3 | |
| 776 | 0 | |t Algorithms and Data Structures |b Texte imprimé |z 9783662212875 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/b11837 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-90SPN8XZ-H |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750643846 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/b11837 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:75399495X |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/b11837 |z Accès INSA CVL | |
| 997 | |0 972230 |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/ | ||