Algorithms and complexity : 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003 : proceedings
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
2653 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
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 complexity, 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003, proceedings, Rossella Petreschi, Giuseppe Persiano, Riccardo Silvestri (eds.), Berlin, Springer, 2003, 1 vol. (XI-288 p.), Lecture notes in computer science, 3-540-40176-8 • Algorithms and Complexity, Texte imprimé, 9783662196328 |
| LEADER | 04355nam a22004097a 4500 | ||
|---|---|---|---|
| 001 | 971396 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155206397 | ||
| 020 | |a 9783540448495 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a CIAC 2003 |n (5th |c :Rome, IT). | |
| 245 | 1 | 0 | |a Algorithms and complexity : |b 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003 : proceedings |c [edited by] Rossella Petreschi, Giuseppe Persiano, Riccardo Silvestri. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2653 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Tutorials -- Localized Network Representations -- Optimal Binary Search Trees with Costs Depending on the Access Paths -- On the Generation of Extensions of a Partially Ordered Set -- Error-Correcting Codes in Complexity Theory -- Invited Talks -- Cache-Oblivious Algorithms -- Spanning Trees with Low Maximum/Average Stretch -- Hyper Encryption and Everlasting Secrets -- Computing with Electronic Nanotechnologies -- Regular Contribution -- Efficient Update Strategies for Geometric Computing with Uncertainty -- Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete -- An Improved Algorithm for Point Set Pattern Matching under Rigid Motion -- Unlocking the Advantages of Dynamic Service Selection and Pricing -- The Relative Worst Order Ratio for On-Line Algorithms -- On-Line Stream Merging, Max Span, and Min Coverage -- Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs -- Additive Spanners for k-Chordal Graphs -- Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation -- Reconciling Gene Trees to a Species Tree -- Generating All Forest Extensions of a Partially Ordered Set -- Indexing Structures for Approximate String Matching -- Approximation Hardness for Small Occurrence Instances of NP-Hard Problems -- Fast Approximation of Minimum Multicast Congestion Implementation versus Theory -- Approximation of a Retrieval Problem for Parallel Disks -- On k-Edge-Connectivity Problems with Sharpened Triangle Inequality -- The Complexity of Detecting Fixed-Density Clusters -- Nearly Bounded Error Probabilistic Sets -- Some Properties of MODm Circuits Computing Simple Functions -- XOR-Based Schemes for Fast Parallel IP Lookups -- The Impact of Network Structure on the Stability of Greedy Protocols -- Improving Customer Proximity toRailway Stations -- Differential Approximation for Some Routing Problems. | |
| 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 Structures de données (informatique) | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Petreschi, Rossella, |d 1950- |4 pbd | |
| 700 | 1 | |a Persiano, Giuseppe, |d 19..- |4 pbd | |
| 700 | 1 | |a Silvestri, Riccardo. |4 pbd | |
| 776 | 0 | |0 072643889 |t Algorithms and complexity |o 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003 |o proceedings |f Rossella Petreschi, Giuseppe Persiano, Riccardo Silvestri (eds.) |c Berlin |n Springer |d 2003 |p 1 vol. (XI-288 p.) |s Lecture notes in computer science |z 3-540-40176-8 | |
| 776 | 0 | |t Algorithms and Complexity |b Texte imprimé |z 9783662196328 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-44849-7 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-1V3TNCH1-M |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750653019 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-44849-7 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754003221 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-44849-7 |z Accès INSA CVL | |
| 997 | |0 971396 |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/ | ||