9783031304477-3031304470-Algorithms and Complexity: 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13–16, 2023, Proceedings (Lecture Notes in Computer Science)

Algorithms and Complexity: 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13–16, 2023, Proceedings (Lecture Notes in Computer Science)

ISBN-13: 9783031304477
ISBN-10: 3031304470
Edition: 1st ed. 2023
Author: Marios Mavronicolas
Publication date: 2023
Publisher: Springer
Format: Paperback 412 pages
FREE US shipping
Buy

From $25.50

Book details

ISBN-13: 9783031304477
ISBN-10: 3031304470
Edition: 1st ed. 2023
Author: Marios Mavronicolas
Publication date: 2023
Publisher: Springer
Format: Paperback 412 pages

Summary

Algorithms and Complexity: 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13–16, 2023, Proceedings (Lecture Notes in Computer Science) (ISBN-13: 9783031304477 and ISBN-10: 3031304470), written by authors Marios Mavronicolas, was published by Springer in 2023. With an overall rating of 4.1 stars, it's a notable title among other books. You can easily purchase or rent Algorithms and Complexity: 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13–16, 2023, Proceedings (Lecture Notes in Computer Science) (Paperback) from BooksRun, along with many other new and used books and textbooks. And, if you're looking to sell your copy, our current buyback offer is $0.53.

Description

This book constitutes the refereed proceedings of the 13th International Conference on Algorithms and Complexity, CIAC 2023, which took place in Larnaca, Cyprus, during June 13-16, 2023. 
The 25 full papers included in this book were carefully reviewed and selected from 49 submissions. They cover all important areas of research on algorithms and complexity such as algorithm design and analysis; sequential, parallel and distributed algorithms; data structures; computational and structural complexity; lower bounds and limitations of algorithms; randomized and approximation algorithms; parameterized algorithms and parameterized complexity classes; smoothed analysis of algorithms; alternatives to the worst-case analysis of algorithms (e.g., algorithms with predictions), on-line computation and competitive analysis, streaming algorithms, quantum algorithms and complexity, algorithms in algebra, geometry, number theory and combinatorics, computational geometry, algorithmic game theory and mechanism design, algorithmic economics (including auctions and contests), computational learning theory, computational biology and bioinformatics, algorithmic issues in communication networks, algorithms for discrete optimization (including convex optimization) and algorithm engineering.

Rate this book Rate this book

We would LOVE it if you could help us and other readers by reviewing the book