Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Algorithms and Complexity - 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24,

Algorithms and Complexity

8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings

Spirakis, Paul G., Serna, Maria (Eds.)

2013, XIV, 384 p. 75 illus.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-3-642-38233-8

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase

learn more about Springer eBooks

add to marked items


Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-3-642-38232-1

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

  • Fast track conference proceedings
  • State-of-the-art research
  • Up to date results
This book constitutes the refereed conference proceedings of the 8th International Conference on Algorithms and Complexity, CIAC 2013, held in Barcelona, Spain, during May 22-24, 2013. The 31 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers present current research in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.

Content Level » Research

Keywords » algorithmic game theory - decision tree complexity - plane graphs - read-once formulae - string matching

Related subjects » Communication Networks - Image Processing - Theoretical Computer Science

Table of contents 

Computational complexity and the use.- Design, analysis and experimentation.- Efficient algorithms.- Data structures.

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Algorithm Analysis and Problem Complexity.