Algorithms and Complexity - 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13–16, 2023, Proceedings (1st ed. 2023)


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.

R1,915

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles19150
Mobicred@R179pm x 12* Mobicred Info
Free Delivery
Delivery AdviceShips in 12 - 17 working days



Product 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.

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

Springer International Publishing AG

Country of origin

Switzerland

Series

Lecture Notes in Computer Science, 13898

Release date

April 2023

Availability

Expected to ship within 12 - 17 working days

First published

2023

Editors

Dimensions

235 x 155mm (L x W)

Pages

400

Edition

1st ed. 2023

ISBN-13

978-3-03-130447-7

Barcode

9783031304477

Categories

LSN

3-03-130447-0



Trending On Loot