Algorithms and Complexity 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Heggernes, Pinar (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2019.
• Έκδοση: 1st ed. 2019.
• Σειρά: Theoretical Computer Science and General Issues ; 11485
• Θέματα: Algorithms.; Computer science-Mathematics.; Data structures (Computer science).; Arithmetic and logic units, Computer.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Data Structures.; Arithmetic and Logic Structures.
• Φυσική περιγραφή: XIII, 378 p. 274 illus., 33 illus. in color. online resource.
• ISBN: 9783030174026
• DOI: 10.1007/978-3-030-17402-6

This book constitutes the refereed conference proceedings of the 11th International Conference on Algorithms and Complexity, CIAC 2019, held in Rome, Italy, in May 2019. The 30 full papers were carefully reviewed and selected from 95 submissions. The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. The papers present original research in the theory and applications of algorithms and computational complexity.