Automata, Languages and Programming
Editat de Luis Caires, Guiseppe F. Italiano, Luis Monteiro, Catuscia Palamidessi, Moti Yungen Limba Engleză Paperback – 24 iun 2005
Preț: 777.38 lei
Preț vechi: 971.72 lei
-20% Nou
Puncte Express: 1166
Preț estimativ în valută:
137.56€ • 160.42$ • 120.78£
137.56€ • 160.42$ • 120.78£
Carte tipărită la comandă
Livrare economică 12-17 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540275800
ISBN-10: 3540275800
Pagini: 1536
Ilustrații: L, 1482 p. In 2 volumes, not available separately.
Dimensiuni: 155 x 235 x 82 mm
Greutate: 2.28 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540275800
Pagini: 1536
Ilustrații: L, 1482 p. In 2 volumes, not available separately.
Dimensiuni: 155 x 235 x 82 mm
Greutate: 2.28 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.