logo

EbookBell.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link:  https://ebookbell.com/faq 


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookBell Team

Algorithms And Complexity 13th International Conference Ciac 2023 Larnaca Cyprus June 1316 2023 Proceedings Marios Mavronicolas

  • SKU: BELL-49895658
Algorithms And Complexity 13th International Conference Ciac 2023 Larnaca Cyprus June 1316 2023 Proceedings Marios Mavronicolas
$ 31.00 $ 45.00 (-31%)

5.0

40 reviews

Algorithms And Complexity 13th International Conference Ciac 2023 Larnaca Cyprus June 1316 2023 Proceedings Marios Mavronicolas instant download after payment.

Publisher: Springer
File Extension: PDF
File size: 10.09 MB
Pages: 411
Author: Marios Mavronicolas, (ed.)
ISBN: 9783031304477, 3031304470
Language: English
Year: 2023

Product desciption

Algorithms And Complexity 13th International Conference Ciac 2023 Larnaca Cyprus June 1316 2023 Proceedings Marios Mavronicolas by Marios Mavronicolas, (ed.) 9783031304477, 3031304470 instant download after payment.

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.

Related Products