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

Stacs 2004 21st Annual Symposium On Theoretical Aspects Of Computer Science Montpellier France March 2527 2004 Proceedings 1st Edition Claire Kenyon Auth

  • SKU: BELL-4604086
Stacs 2004 21st Annual Symposium On Theoretical Aspects Of Computer Science Montpellier France March 2527 2004 Proceedings 1st Edition Claire Kenyon Auth
$ 31.00 $ 45.00 (-31%)

4.3

48 reviews

Stacs 2004 21st Annual Symposium On Theoretical Aspects Of Computer Science Montpellier France March 2527 2004 Proceedings 1st Edition Claire Kenyon Auth instant download after payment.

Publisher: Springer-Verlag Berlin Heidelberg
File Extension: PDF
File size: 6.32 MB
Pages: 660
Author: Claire Kenyon (auth.), Volker Diekert, Michel Habib (eds.)
ISBN: 9783540212362, 9783540247494, 3540212361, 3540247491
Language: English
Year: 2004
Edition: 1

Product desciption

Stacs 2004 21st Annual Symposium On Theoretical Aspects Of Computer Science Montpellier France March 2527 2004 Proceedings 1st Edition Claire Kenyon Auth by Claire Kenyon (auth.), Volker Diekert, Michel Habib (eds.) 9783540212362, 9783540247494, 3540212361, 3540247491 instant download after payment.

This book constitutes the refereed proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS 2004, held in Montpellier, France, in March 2004.

The 54 revised full papers presented together with two invited contributions were carefully reviewed and selected from more than 200 submissions. The papers are organized in topical sections on structural complexity, graph algorithms, quantum computing, satisfiability - constraint satisfaction problems, scheduling, algorithms, networks, automata theory and words, path algorithms, cryptography, logic and formal languages, game theory and complexity, and algorithmic information.

Related Products