Go back

Algorithms And Complexity 13th International Conference CIAC 2023 Larnaca Cyprus LNCS 13898(1st Edition)

Authors:

Marios Mavronicolas

Free algorithms and complexity 13th international conference ciac 2023 larnaca cyprus lncs 13898 1st edition
12 ratings
Cover Type:Hardcover
Condition:Used

In Stock

Shipment time

Expected shipping within 2 Days
Access to 30 Million+ solutions Free
Ask 50 Questions from expert AI-Powered Answers
7 days-trial

Total Price:

$0

List Price: $50.86 Savings: $50.86(100%)
Access to 30 Million+ solutions
Ask 50 Questions from expert AI-Powered Answers 24/7 Tutor Help Detailed solutions for Algorithms And Complexity 13th International Conference CIAC 2023 Larnaca Cyprus LNCS 13898

Price:

$9.99

/month

Book details

ISBN: 3031304470, 978-3031304477

Book publisher: Springer

Get your hands on the best-selling book Algorithms And Complexity 13th International Conference CIAC 2023 Larnaca Cyprus LNCS 13898 1st Edition for free. Feed your curiosity and let your imagination soar with the best stories coming out to you without hefty price tags. Browse SolutionInn to discover a treasure trove of fiction and non-fiction books where every page leads the reader to an undiscovered world. Start your literary adventure right away and also enjoy free shipping of these complimentary books to your door.

Book Summary: 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.