Algorithms and computation : 10th International Symposium, ISAAC 99, Chennai, India, December 16 18, 1999 : proceedings
Gorde:
| Erakunde egilea: | |
|---|---|
| Beste egile batzuk: | , |
| Formatua: | Livre numérique |
| Hizkuntza: | Anglais |
| Argitaratua: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Saila: | Lecture notes in computer science
1741 |
| Gaiak: | |
| Sarrera elektronikoa: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Oharra: |
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, 10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999, Alok Aggarwal, C. Pandu Rangan (eds.), Berlin, Springer, 1999, 1 vol. (XIII-448 p.), Lecture notes in computer science, 3-540-66916-7 • Algorithms and Computations, Texte imprimé, 9783662200919 |
| LEADER | 06074nam a22003977a 4500 | ||
|---|---|---|---|
| 001 | 972184 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155219758 | ||
| 020 | |a 9783540466321 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a International Symposium on Algorithms and Computation |n (10 |d :1999 |c :Chennai). | |
| 245 | 1 | 0 | |a Algorithms and computation : |b 10th International Symposium, ISAAC 99, Chennai, India, December 16 18, 1999 : proceedings |c [edited by] Alok Aggarwal, C. Pandu Rangan. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 1741 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Invited Talk -- The Engineering of Some Bipartite Matching Programs -- Session 1(a) - Data Structure I -- General Splay: A Basic Theory and Calculus -- Static Dictionaries Supporting Rank -- Session 1(b) - Parallel & Distributed Computing I -- Multiple Spin-Block Decisions -- Asynchronous Random Polling Dynamic Load Balancing -- Session 2(a) - Approximate Algorithm I -- Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colarability -- Hardness of Approximating Independent Domination in Circle Graphs -- Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs -- Session 2(b) - Computational Intelligence -- Ordered Binary Decision Diagrams as Knowledge-Bases -- Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots -- Session 3(a) - Online Algorithm -- On-Line Load Balancing of Temporary Tasks Revisited -- Online Routing in Triangulations -- Session 3(b) - Complexity Theory I -- The Query Complexity of Program Checking by Constant-Depth Circuits -- Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle -- Session 4(a) - Approximate Algorithm II -- Efficient Approximation Algorithms for Multi-label Map Labeling -- Approximation Algorithms in Batch Processing -- Session 4(b) - Graph Algorithm I -- LexBFS-Ordering in Asteroidal Triple-Free Graphs -- Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs -- Invited Talk -- Approximation Algorithms for Some Clustering and Classification Problems -- Session 5(a) - Computational Geometry I -- How Many People Can Hide in a Terrain? -- Carrying Umbrellas: An Online Relocation Problem on Graphs -- Session 5(b) - Parallel & Distributed Computing II -- Survivable Networks with Bounded Delay: The Edge FailureCase -- Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks -- Session 6(a) - Data Structure II -- Constructing the Suffix Tree of a Tree with a Large Alphabet -- An O(1) Time Algorithm for Generating Multiset Permutations -- Session 6(b) - Complexity Theory II -- Upper Bounds for MaxSat: Further Improved -- A Linear Time Algorithm for Recognizing Regular Boolean Functions -- Session 7(a) - Computational Geometry II -- Station Layouts in the Presence of Location Constraints -- Reverse Center Location Problem -- Session 7(b) - Algorithms in Practice -- Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields -- External Memory Algorithms for Outerplanar Graphs -- Session 8(a) - Approximate Algorithm III -- A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree -- Approximation Algorithms for Channel Assignment with Constraints -- Session 8(b) - Graph Algorithm II -- Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs -- A Linear Algorithm for Finding Total Colorings of Partial k-Trees -- Invited Talk -- Topology-Oriented Approach to Robust Geometric Computation -- Session 9(a) - Approximate Algorithm IV -- Approximating Multicast Congestion -- Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts -- Session 9(b) - Parallel & Distributed Computing III -- Online Scheduling of Parallel Communications with Individual Deadlines -- A Faster Algorithm for Finding Disjoint Paths in Grids -- Session 10(a) - Computational Geometry III -- Output-Sensitive Algorithms for Uniform Partitions of Points -- Convexifying Monotone Polygons -- Session 10(b) - Graph Algorithm III -- Bisecting Two Subsets in 3-Connected Graphs -- Generalized Maximum Independent Sets for Trees in Subquadratic Time. | |
| 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 Complexité de calcul (informatique) | ||
| 650 | |a Réseaux d'ordinateurs | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Aggarwal, Alok, |d 19..- |4 pbd | |
| 700 | 1 | |a Pandu Rangan, C., |d 19..- |4 pbd | |
| 776 | 0 | |0 049151657 |t Algorithms and computation |o 10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999 |f Alok Aggarwal, C. Pandu Rangan (eds.) |c Berlin |n Springer |d 1999 |p 1 vol. (XIII-448 p.) |s Lecture notes in computer science |z 3-540-66916-7 | |
| 776 | 0 | |t Algorithms and Computations |b Texte imprimé |z 9783662200919 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-46632-0 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-WRGFGHR1-X |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750644389 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-46632-0 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:753995433 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-46632-0 |z Accès INSA CVL | |
| 997 | |0 972184 |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/ | ||