LATIN 2000 : theoretical informatics : 4th Latin American symposium, Punta del Esk, Uruguay, April 10-14, 2000 : proceedings
Đã lưu trong:
| Tác giả của công ty: | |
|---|---|
| Tác giả khác: | , , |
| Định dạng: | Livre numérique |
| Ngôn ngữ: | Anglais |
| Được phát hành: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Loạt: | Lecture notes in computer science
1776 |
| Những chủ đề: | |
| Truy cập trực tuyến: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Chú thích: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • LATIN 2000, theoretical informatics, 4th Latin American symposium, Punta del Este, Uruguay, April 10-14, 2000, proceedings, Gastón H. Gonnet, Daniel Panario, Alfredo Viola (eds.), 2000, New York, Springer, 1 vol. (XIV-484 p.), Lecture notes in computer science, 3-540-67306-7 • LATIN 2000: Theoretical Informatics, Texte imprimé, 9783662199237 |
| LEADER | 05792nam a22004097a 4500 | ||
|---|---|---|---|
| 001 | 971056 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155200836 | ||
| 020 | |a 9783540464150 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a Latin American Symposium on Theoretical Informatics |n (04 |d :2000 |c :Punta del Este, Uruguay). | |
| 245 | 1 | 0 | |a LATIN 2000 : |b theoretical informatics : 4th Latin American symposium, Punta del Esk, Uruguay, April 10-14, 2000 : proceedings |c [edited by] Gaston H. Gonnet, Alfredo Viola. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 1776 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Random Structures and Algorithms -- Algorithmic Aspects of Regularity -- Small Maximal Matchings in Random Graphs -- Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs -- Analysis of Edge Deletion Processes on Faulty Random Regular Graphs -- Equivalent Conditions for Regularity (Extended Abstract) -- Algorithms I -- Cube Packing -- Approximation Algorithms for Flexible Job Shop Problems -- Emerging Behavior as Binary Search Trees Are Symmetrically Updated -- The LCA Problem Revisited -- Combinatorial Designs -- Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays -- Rank Inequalities for Packing Designs and Sparse Triple Systems -- The Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Graphs -- Web Graph, Graph Theory I -- Graph Structure of the Web: A Survey -- Polynomial Time Recognition of Clique-Width ? 3 Graphs -- On Dart-Free Perfectly Contractile Graphs Extended Abstract -- Graph Theory II -- Edge Colouring Reduced Indifference Graphs -- Two Conjectures on the Chromatic Polynomial -- Finding Skew Partitions Efficiently -- Competitive Analysis, Complexity -- On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract) -- Almost k-Wise Independence and Hard Boolean Functions -- Improved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function -- Algorithms II -- Multi-parameter Minimum Spanning Trees -- Linear Time Recognition of Optimal L-Restricted Prefix Codes -- Uniform Multi-hop All-to-All Optical Routings in Rings -- A Fully Dynamic Algorithm for Distributed Shortest Paths -- Computational Number Theory, Cryptography -- Integer Factorization and Discrete Logarithms -- Communication Complexity and Fourier Coefficients of the Diffie Hellman Key -- Quintic Reciprocity and Primality Test for Numbers of the Form -- Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography -- Analysis of Algorithms I -- Average-Case Analysis of Rectangle Packings -- Heights in Generalized Tries and PATRICIA Tries -- On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths Extended Abstract -- Algebraic Algorithms -- Subresultants Revisited -- A Unifying Framework for the Analysis of a Class of Euclidean Algorithms -- Worst-Case Complexity of the Optimal LLL Algorithm -- Computability -- Iteration Algebras Are Not Finitely Axiomatizable -- Undecidable Problems in Unreliable Computations -- Automata, Formal Languages -- Equations in Free Semigroups with Anti-involution and Their Relation to Equations in Free Groups -- Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers -- Unambiguous Büchi Automata -- Linear Time Language Recognition on Cellular Automata with Restricted Communication -- Logic, Programming Theory -- From Semantics to Spatial Distribution -- On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics -- A Theory of Operational Equivalence for Interaction Nets -- Analysis of Algorithms II -- Run Statistics for Geometrically Distributed Random Variables -- Generalized Covariances of Multi-dimensional Brownian Excursion Local Times -- Combinatorics of Geometrically Distributed Random Variables: Length of Ascending Runs. | |
| 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 combinatoire | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Gonnet, Gaston H., |d 1948- |4 pbd | |
| 700 | 1 | |a Panario, Daniel, |d 1959- |4 pbd | |
| 700 | 1 | |a Viola, Alfredo, |d 1960- |4 pbd | |
| 776 | 0 | |0 051580020 |t LATIN 2000 |o theoretical informatics |o 4th Latin American symposium, Punta del Este, Uruguay, April 10-14, 2000 |o proceedings |f Gastón H. Gonnet, Daniel Panario, Alfredo Viola (eds.) |d 2000 |c New York |n Springer |p 1 vol. (XIV-484 p.) |s Lecture notes in computer science |z 3-540-67306-7 | |
| 776 | 0 | |t LATIN 2000: Theoretical Informatics |b Texte imprimé |z 9783662199237 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/10719839 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-BDNVDJKN-9 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750656735 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/10719839 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754006611 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/10719839 |z Accès INSA CVL | |
| 997 | |0 971056 |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/ | ||