The 4th International Computer Science Symposium in Russia (CSR 2009) was held August 18-23,2009 in Novosibirsk,Russia, hosted by the Sobolev Institute of Mathematics and Novosibirsk State University. It was the fourth event in the series of regular international meetings, following CSR 2006 in St. Petersburg, CSR 2007 in Ekaterinburg, and CSR 2008 in Moscow. The opening lecture was given by Andrei Voronkov, and four other invited plenary lectures were given by Sergei Odintsov, Wolfgang Thomas, Nikolai Vereshchagin, and Hongseok Yang. This volume contains all the accepted papers and some of the abstracts of the invited speakers. The scope of the proposed topics for the symposium was quite broad and covered basically all areas of computer science. We received 66 papers in total, and the Program Committee selected 29. Yandex provided the Best Student Paper Awards; the recepients of these awards were selected by the Program Committee: - Dmitry Itsykson, "Structural complexity of AvgBPP" - Yuri Pritykin and Julya Ulyashkina, "Aperiodicity measure for in?nite sequences." The reviewing processwasorganizedusing the EasyChairconferencesystem, created by Andrei Voronkov. We are grateful to our sponsors: - Russian Foundation for Basic Research - Yandex (the largest Russian Internet portal providing key Web services). We also thank the group of local organizers and in particular Pavel Salimov.
"Sinopsis" puede pertenecer a otra edición de este libro.
The 4th International Computer Science Symposium in Russia (CSR 2009) was held August 18-23,2009 in Novosibirsk,Russia, hosted by the Sobolev Institute of Mathematics and Novosibirsk State University. It was the fourth event in the series of regular international meetings, following CSR 2006 in St. Petersburg, CSR 2007 in Ekaterinburg, and CSR 2008 in Moscow. The opening lecture was given by Andrei Voronkov, and four other invited plenary lectures were given by Sergei Odintsov, Wolfgang Thomas, Nikolai Vereshchagin, and Hongseok Yang. This volume contains all the accepted papers and some of the abstracts of the invited speakers. The scope of the proposed topics for the symposium was quite broad and covered basically all areas of computer science. We received 66 papers in total, and the Program Committee selected 29. Yandex provided the Best Student Paper Awards; the recepients of these awards were selected by the Program Committee: - Dmitry Itsykson, "Structural complexity of AvgBPP" - Yuri Pritykin and Julya Ulyashkina, "Aperiodicity measure for in?nite sequences." The reviewing processwasorganizedusing the EasyChairconferencesystem, created by Andrei Voronkov. We are grateful to our sponsors: - Russian Foundation for Basic Research - Yandex (the largest Russian Internet portal providing key Web services). We also thank the group of local organizers and in particular Pavel Salimov.
This book constitutes the refereed proceedings of the Fourth International Computer Science Symposium in Russia, CSR 2009, held in Novosibirsk, Russia, August 18-23, 2009. The 29 revised papers presented together with 4 invited papers were carefully reviewed and selected from 66 submissions. All major areas in computer science are addressed. The theory track deals with algorithms, protocols, and data structures; complexity and cryptography; formal languages, automata and their applications to computer science; computational models and concepts; proof theory and applications of logic to computer science.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9783642033506_new
Cantidad disponible: Más de 20 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The 4th International Computer Science Symposium in Russia (CSR 2009) was held August 18 23,2009 in Novosibirsk,Russia, hosted by the Sobolev Institute of Mathematics and Novosibirsk State University. It was the fourth event in the series of regular international meetings, following CSR 2006 in St. Petersburg, CSR 2007 in Ekaterinburg, and CSR 2008 in Moscow. The opening lecture was given by Andrei Voronkov, and four other invited plenary lectures were given by Sergei Odintsov, Wolfgang Thomas, Nikolai Vereshchagin, and Hongseok Yang. This volume contains all the accepted papers and some of the abstracts of the invited speakers. The scope of the proposed topics for the symposium was quite broad and covered basically all areas of computer science. We received 66 papers in total, and the Program Committee selected 29. Yandex provided the Best Student Paper Awards; the recepients of these awards were selected by the Program Committee: Dmitry Itsykson, Structural complexity of AvgBPP Yuri Pritykin and Julya Ulyashkina, Aperiodicity measure for in nite sequences. The reviewing processwasorganizedusing the EasyChairconferencesystem, created by Andrei Voronkov. We are grateful to our sponsors: Russian Foundation for Basic Research Yandex (the largest Russian Internet portal providing key Web services). We also thank the group of local organizers and in particular Pavel Salimov. 384 pp. Englisch. Nº de ref. del artículo: 9783642033506
Cantidad disponible: 2 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. pp. 384. Nº de ref. del artículo: 261373325
Cantidad disponible: 4 disponibles
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Condición: New. PRINT ON DEMAND pp. 384. Nº de ref. del artículo: 181373319
Cantidad disponible: 4 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. Print on Demand pp. 384 Illus. Nº de ref. del artículo: 6507346
Cantidad disponible: 4 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 2009 edition. 369 pages. 9.10x6.00x0.40 inches. In Stock. Nº de ref. del artículo: x-3642033504
Cantidad disponible: 2 disponibles
Librería: moluna, Greven, Alemania
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Invited Papers.- Well-Founded and Partial Stable Semantics Logical Aspects.- The Reachability Problem over Infinite Graphs.- Kolmogorov Complexity and Model Selection.- Automatic Verification of Heap-Manipulating Programs Using Separation Logic.- Accepted P. Nº de ref. del artículo: 5043969
Cantidad disponible: Más de 20 disponibles
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Invited Papers.- Well-Founded and Partial Stable Semantics Logical Aspects.- The Reachability Problem over Infinite Graphs.- Kolmogorov Complexity and Model Selection.- Automatic Verification of Heap-Manipulating Programs Using Separation Logic.- Accepted Papers.- Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism.- Integrality Property in Preemptive Parallel Machine Scheduling.- Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes.- k-SAT Is No Harder Than Decision-Unique-k-SAT.- Unique Decipherability in the Monoid of Languages: An Application of Rational Relations.- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model.- Approximability Distance in the Space of H-Colourability Problems.- On Random Ordering Constraints.- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates.- A Feebly Secure Trapdoor Function.- Partitioning Graphs into Connected Parts.- Structural Complexity of AvgBPP.- Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials.- Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity.- One-Nonterminal Conjunctive Grammars over a Unary Alphabet.- Concatenation of Regular Languages and Descriptional Complexity.- Approximability of the Maximum Solution Problem for Certain Families of Algebras.- Complete Complexity Classification of Short Shop Scheduling.- Compressed Word Problems in HNN-Extensions and Amalgamated Products.- Variations on Muchnik's Conditional Complexity Theorem.- An Optimal Bloom Filter Replacement Based on Matrix Solving.- Aperiodicity Measure for Infinite Sequences.- On the Complexity of Matroid Isomorphism Problems.- Breaking Anonymity byLearning a Unique Minimum Hitting Set.- The Budgeted Unique Coverage Problem and Color-Coding.- Formal Verification of Gate-Level Computer Systems.- On Models of a Nondeterministic Computation.- New Plain-Exponential Time Classes for Graph Homomorphism.- Languages Recognized with Unbounded Error by Quantum Finite Automata.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 384 pp. Englisch. Nº de ref. del artículo: 9783642033506
Cantidad disponible: 1 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The 4th International Computer Science Symposium in Russia (CSR 2009) was held August 18 23,2009 in Novosibirsk,Russia, hosted by the Sobolev Institute of Mathematics and Novosibirsk State University. It was the fourth event in the series of regular international meetings, following CSR 2006 in St. Petersburg, CSR 2007 in Ekaterinburg, and CSR 2008 in Moscow. The opening lecture was given by Andrei Voronkov, and four other invited plenary lectures were given by Sergei Odintsov, Wolfgang Thomas, Nikolai Vereshchagin, and Hongseok Yang. This volume contains all the accepted papers and some of the abstracts of the invited speakers. The scope of the proposed topics for the symposium was quite broad and covered basically all areas of computer science. We received 66 papers in total, and the Program Committee selected 29. Yandex provided the Best Student Paper Awards; the recepients of these awards were selected by the Program Committee: Dmitry Itsykson, Structural complexity of AvgBPP Yuri Pritykin and Julya Ulyashkina, Aperiodicity measure for in nite sequences. The reviewing processwasorganizedusing the EasyChairconferencesystem, created by Andrei Voronkov. We are grateful to our sponsors: Russian Foundation for Basic Research Yandex (the largest Russian Internet portal providing key Web services). We also thank the group of local organizers and in particular Pavel Salimov. Nº de ref. del artículo: 9783642033506
Cantidad disponible: 1 disponibles
Librería: preigu, Osnabrück, Alemania
Taschenbuch. Condición: Neu. Computer Science - Theory and Applications | Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009, Proceedings | Anna Frid (u. a.) | Taschenbuch | xiii | Englisch | 2009 | Springer | EAN 9783642033506 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Nº de ref. del artículo: 101506996
Cantidad disponible: 5 disponibles