LEADER 01045oam 2200325z- 450 001 9910491036803321 005 20221202150617.0 010 $a9788860565136 035 $a(CKB)4100000011913063 035 $a(EXLCZ)994100000011913063 100 $a20220209d2017uuuu -u- - 101 0 $aita 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 13$aLa gelosia delle lingue /$fAndria?n N. Bravi 210 1$cEUM - Edizioni Università di Macerata$d2017 215 $a1 Online Ressource 311 $a88-6056-513-8 606 $aSecond language acquisition$xPsychological aspects 606 $aAuthorship$xPsychological aspects 606 $aBilingual authors$xLanguage 615 0$aSecond language acquisition$xPsychological aspects. 615 0$aAuthorship$xPsychological aspects. 615 0$aBilingual authors$xLanguage. 700 $aBravi$b Adria?n N.$f1963-$01248316 906 $aBOOK 912 $a9910491036803321 996 $aGelosia delle lingue$92965453 997 $aUNINA LEADER 07301nam 22008295 450 001 9910144130003321 005 20251117072947.0 010 $a3-540-46415-8 024 7 $a10.1007/10719839 035 $a(CKB)1000000000548846 035 $a(SSID)ssj0000324332 035 $a(PQKBManifestationID)11255481 035 $a(PQKBTitleCode)TC0000324332 035 $a(PQKBWorkID)10304226 035 $a(PQKB)10932154 035 $a(DE-He213)978-3-540-46415-0 035 $a(MiAaPQ)EBC3087669 035 $a(PPN)155200836 035 $a(BIP)13665517 035 $a(BIP)6485127 035 $a(EXLCZ)991000000000548846 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aLATIN 2000: Theoretical Informatics $e4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000 Proceedings /$fedited by Gaston H. Gonnet, Daniel Panario, Alfredo Viola 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (XII, 484 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1776 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-67306-7 320 $aIncudes bibliographical references at the end of each chapters and index. 327 $aRandom 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. 330 $aThis book constitutes the refereed proceedings of the 4th International Conference, Latin American Theoretical Informatics, LATIN 2000, held in Punta del Est, Uruguay, in April 2000. The 42 revised papers presented were carefully reviewed and selected from a total of 87 submissions from 26 countries. Also included are abstracts or full papers of several invited talks. The papers are organized in topical sections on random structures and algorithms, complexity, computational number theory and cryptography, algebraic algorithms, computability, automata and formal languages, and logic and programming theory. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1776 606 $aComputers 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aComputer networks 606 $aCombinatorial analysis 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aComputers. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aComputer networks. 615 0$aCombinatorial analysis. 615 14$aTheory of Computation. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputation by Abstract Devices. 615 24$aComputer Communication Networks. 615 24$aCombinatorics. 676 $a004 702 $aGonnet$b Gaston H$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPanario$b Daniel$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aViola$b Alfredo$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aLatin American Symposium on Theoretical Informatics 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910144130003321 996 $aLATIN 2000: Theoretical Informatics$92158503 997 $aUNINA