9783642033506 - computer science - theory and applications: fourth international computer science symposium in russia, csr 2009, novosibirsk, russia, august 18-23, proceedings: 5675 (11 risultati)
- Brossura
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 60,95
EUR 13,96 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
- Brossura
Da: Books Puddle, New York, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 81,51
EUR 3,43 spedizioneSpedito in U.S.A.Quantità: 4 disponibili
Condizione: New. pp. 384.
Computer Science - Theory and Applications: Fourth International Computer Science Symposium in Russia, Csr 2009, Novosibirsk, Russia, August 18-23, 2009, Proceedings: Vol 5675
Frid, Anna (Editor)/ Morozov, Andrey S. (Editor)/ Rybalchenko, Andrey (Editor)
- Brossura
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 80,65
EUR 14,56 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Paperback. Condizione: Brand New. 2009 edition. 369 pages. 9.10x6.00x0.40 inches. In Stock.
- Brossura
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 62,91 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: 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 regul…ar 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.
Altre immagini- Brossura
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 50,45
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: 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: Spring…er Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
- Brossura
Da: Buchpark, Trebbin, GermaniaBuchpark
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Ottimo
EUR 41,07
EUR 105,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Condizione: Sehr gut. Zustand: Sehr gut | Seiten: 384 | Sprache: Englisch | Produktart: Bücher | 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 s…eries 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.
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: 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.
- Brossura
- Print on Demand
Da: Majestic Books, Hounslow, Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 79,11
EUR 7,57 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Condizione: New. Print on Demand pp. 384 Illus.
- Brossura
- Print on Demand
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 81,09
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: New. PRINT ON DEMAND pp. 384.
Computer Science - Theory and Applications
Frid, Anna|Morozov, Andrey S.|Rybalchenko, Andrey|Wagner, Klaus W.
- Brossura
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 48,37
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: 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 Pro…grams Using Separation Logic.- Accepted P.
- Brossura
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: 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 Separat…ion 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.
