Automata, Languages and Programming 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Caires, Luís (Επιμελητής έκδοσης), Italiano, Giuseppe F. (Επιμελητής έκδοσης), Monteiro, Luís (Επιμελητής έκδοσης), Palamidessi, Catuscia (Επιμελητής έκδοσης), Yung, Moti (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
• Σειρά: Lecture Notes in Computer Science, 3580
• Θέματα: Computer science.; Software engineering.; Data structures (Computer science).; Computers.; Mathematical logic.; Computer Science.; Computer Science, general.; Mathematical Logic and Foundations.; Theory of Computation.; Software Engineering/Programming and Operating Systems.; Data Structures, Cryptology and Information Theory.; Data Structures.

The 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 (To...

Πίνακας περιεχομένων:

• Invited 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.