Algorithms complexity 13th international (15 résultats)

Etat : New. In English.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : New.

Etat : New. In English.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : New.

Paperback. Etat : Brand New. 411 pages. 9.25x6.10x0.85 inches. In Stock.

Taschenbuch. Etat : Neu. Algorithms and Complexity | 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings | Marios Mavronicolas | Taschenbuch | Lecture Notes in Computer Science | xi | Englisch | 2023 | Springer | EAN 9783031304477 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Etat : Gut. Zustand: Gut | Seiten: 412 | Sprache: Englisch | Produktart: Bücher | 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.…

Etat : Hervorragend. Zustand: Hervorragend | Seiten: 412 | Sprache: Englisch | Produktart: Bücher | 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.…

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book constitutes the refereed proceedings of the13th 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 anddistributed algorithms; data structures; computational and structural complexity;lower bounds and limitations of algorithms; randomized and approximationalgorithms; 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 competitiveanalysis, streaming algorithms, quantum algorithms and complexity, algorithmsin algebra, geometry, number theory and combinatorics, computational geometry,algorithmic game theory and mechanism design, algorithmic economics (includingauctions and contests), computational learning theory, computationalbiology and bioinformatics, algorithmic issues in communication networks, algorithmsfor discrete optimization (including convex optimization) and algorithmengineering.…

Etat : New. Print on Demand.

Etat : New. PRINT ON DEMAND.