LEADER 04456nam 2200601 a 450 001 9910484429503321 005 20200520144314.0 024 7 $a10.1007/11523468 035 $a(CKB)1000000000213125 035 $a(SSID)ssj0000316392 035 $a(PQKBManifestationID)11224853 035 $a(PQKBTitleCode)TC0000316392 035 $a(PQKBWorkID)10275882 035 $a(PQKB)11619801 035 $a(DE-He213)978-3-540-31691-6 035 $a(MiAaPQ)EBC3067966 035 $a(PPN)12309612X 035 $a(EXLCZ)991000000000213125 100 $a20120206d2005 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, languages and programming $e32nd International Colloquium, ICALP 2005 : Lisbon, Portugal, July 11-15, 2005 : proceedings /$fLuis Caires ... [et al.] (eds.) 205 $a1st ed. 2005. 210 $aBerlin $cSpringer$d2005 215 $a1 online resource (L, 1482 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v3580 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-31691-4 311 $a3-540-27580-0 320 $aIncludes bibliographical references and index. 327 $aInvited Lectures -- Data Structures I -- Cryptography and Complexity -- Data Structures II -- Cryptography and Distributed Systems -- Graph Algorithms I -- Security Mechanisms -- Graph Algorithms II -- Automata and Formal Languages I -- Signature and Message Authentication -- Algorithmic Game Theory -- Automata and Logic -- Computational Algebra -- Cache-Oblivious Algorithms and Algorithmic Engineering -- On-line Algorithms -- Security Protocols Logic -- Random Graphs -- Concurrency I -- Encryption and related Primitives -- Approximation Algorithms I -- Games -- Approximation Algorithms II -- Lower Bounds -- Probability -- Approximation Algorithms III -- Automata and Formal Languages II -- Approximation Algorithms IV -- Algebraic Computation and Communication Complexity -- Concurrency II -- String Matching and Computational Biology -- Quantum Complexity -- Analysis and Verification -- Geometry and Load Balancing -- Concrete Complexity and Codes -- Model Theory and Model Checking. 330 $aThe 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005) was held in Lisbon, Portugal from July 11 to July 15, 2005. These proceedings contain all contributed papers presented at ICALP 2005, - getherwiththepapersbytheinvitedspeakersGiuseppeCastagna(ENS),Leonid Libkin (Toronto), John C. Mitchell (Stanford), Burkhard Monien (Paderborn), and Leslie Valiant (Harvard). The program had an additional invited lecture by Adi Shamir (Weizmann Institute) which does not appear in these proceedings. ICALP is a series of annual conferences of the European Association for Theoretical Computer Science (EATCS). The ?rst ICALP took place in 1972. This year, the ICALP program consisted of the established track A (focusing on algorithms, automata, complexity and games) and track B (focusing on logic, semantics and theory of programming), and innovated on the structure of its traditional scienti?c program with the inauguration of a new track C (focusing on security and cryptography foundation). In response to a call for papers, the Program Committee received 407 s- missions, 258 for track A, 75 for track B and 74 for track C. This is the highest number of submitted papers in the history of the ICALP conferences. The P- gram Committees selected 113 papers for inclusion in the scienti?c program. In particular, the Program Committee for track A selected 65 papers, the P- gram Committee for track B selected 24 papers, and the Program Committee for track C selected 24 papers. All the work of the Program Committees was done electronically. 410 0$aLecture notes in computer science ;$v3580. 606 $aMachine theory$vCongresses 606 $aFormal languages$vCongresses 606 $aComputer programming$vCongresses 606 $aComputer algorithms$vCongresses 615 0$aMachine theory 615 0$aFormal languages 615 0$aComputer programming 615 0$aComputer algorithms 676 $a004 701 $aCaires$b Luis$01351241 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484429503321 996 $aAutomata, languages and programming$94204232 997 $aUNINA