Skip to main content

Algorithms and Complexity

12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings

  • Conference proceedings
  • © 2021

Overview

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 12701)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: CIAC 2021.

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (28 papers)

  1. Invited Lecture

  2. Contributed Papers

Other volumes

  1. Algorithms and Complexity

Keywords

About this book

This book constitutes the refereed conference proceedings of the 12th International Conference on Algorithms and Complexity, CIAC 2019, held as a virtual event, in May 2021.

The 28 full papers presented together with one invited lecture and 2 two abstracts of invited lectures were carefully reviewed and selected from 78 submissions. The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. The papers present original research in the theory and applications of algorithms and computational complexity.

Due to the Corona pandemic the conference was held virtually.



Editors and Affiliations

  • Sapienza University of Rome, Rome, Italy

    Tiziana Calamoneri, Federico Corò

Bibliographic Information

Publish with us