Return to home page
Searching: Muskingum library catalog
Some OPAL libraries remain closed or are operating at reduced service levels. Materials from those libraries may not be requestable; requested items may take longer to arrive. Note that pickup procedures may differ between libraries. Please contact your library for new procedures, specific requests, or other assistance.
  Previous Record Previous Item Next Item Next Record
  Reviews, Summaries, etc...
Conference International Computer Science Symposium in Russia (5th : 2010 : Kazan, Russia)
Title Computer science - theory and applications : 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010 ; proceedings / Farid Ablayev, Ernst W. Mayr (eds.).
Imprint Berlin : Springer, 2010.

View online
View online
Conference International Computer Science Symposium in Russia (5th : 2010 : Kazan, Russia)
Series Lecture notes in computer science, 0302-9743 ; 6072
Lecture notes in computer science ; 6072.
Subject Computer science -- Congresses.
Information theory -- Congresses.
Computing Methodologies.
Add Title CSR 2010
Description 1 online resource (xi, 396 pages) : illustrations.
polychrome rdacc
Bibliography Note Includes bibliographical references.
Contents Algorithms for energy management (invited talk) / Susanne Albers -- Sofic and almost of finite type tree-shifts / Nathalie Aubrun and Marie-Pierre Beal -- Proof-based design of security protocols / Nazim Benaissa and Dominique Mery -- Approximating the minimum length of synchronizing words is hard / Mikhail V. Berlinkov -- Realizability of dynamic MSC languages / Benedikt Bollig and Loic Helouet -- The max quasi-independent set problem / N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, V. Th. Paschos, and O. Pottie -- Equilibria in quantitative reachability games / Thomas Brihaye, Veronique Bruyere, and Julie De Pril -- Quotient complexity of closed languages / Janusz Brzozowski, Galina Jiraskova, and Chenglong Zou -- Right-sequential functions on infinite words / Olivier Carton -- Kernelization (invited talk) / Fedor V. Fomin -- Zigzags in turing machines / Anahi Gajardo and Pierre Guillon -- Frameworks for logically classifying polynomial-time optimisation problems / James Gate and Iain A. Stewart -- Validating the Knuth-Morris-Pratt failure function, fast and online / Pawel Gawrychowski, Artur Jez, and Lukasz Jez -- Identical relations in symmetric groups and separating words with reversible automata / R.A. Gimadeev and M.N. Vyalyi -- Time optimal d-list colouring of a graph / Nick Gravin -- The Cantor space as a generic model of topologically presented knowledge / Bernhard Heinemann -- Algorithmics : is there hope for a unified theory? (invited talk) / Juraj Hromkovic -- Classifying rankwidth k-DH-graphs / Ling-Ju Hung and Ton Kloks -- Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms / Dmitry Itsykson -- A SAT based effective algorithm for the directed Hamiltonian cycle problem / Gerold Jager and Weixiong Zhang -- Balancing bounded treewidth circuits / Maurice Jansen and Jayalal Sarma M.N. -- Obtaining online ecological colourings by generalizing First-Fit / Matthew Johnson, Viresh Patel, Daniel Paulusma, and Theophile Trunck -- Classical simulation and complexity of quantum computations (invited talk) / Richard Jozsa -- Prefix-free and prefix-correct complexities with compound conditions / Elena Kalinina -- Monotone complexity of a pair / Pavel Karpovich -- Symbolic models for single-conclusion proof logics / Vladimir N. Krupski -- Complexity of problems concerning carefully synchronizing words for PFA and directing words for NFA / P.V. Martyugin -- Advancing matrix computations with randomized preprocessing / Victor Y. Pan, Guoliang Qian, and Ai-Long Zheng -- Transfinite sequences of constructive predicate logics / Valery Plisko -- The quantitative analysis of user behavior online : data, models and algorithms (abstract of invited talk) / Prabhakar Raghavan -- A faster exact algorithm for the directed maximum leaf spanning tree problem / Daniel Binkele-Raible and Henning Fernau -- Complexity of propositional proofs (invited talk) / Alexander Razborov -- Quantization of random walks : search algorithms and hitting time (extended abstract of invited talk) / Miklos Santha -- Comparing two stochastic local search algorithms for constraint satisfaction problems (invited talk) / Uwe Schoning -- Growth of power-free languages over large alphabets / Arseny M. Shur -- A partially synchronizing coloring / Avraham N. Trahtman -- An encoding invariant version of polynomial time computable distributions / Nikolay Vereshchagin -- Prehistoric phenomena and self-referentiality / Junhua Yu.
Summary Annotation This book constitutes the proceedings of the 5th International Computer Science Symposium in Russia, CSR 2010, held in Kazan, Russia, in June 2010. The 30 papers presented were carefully reviewed and selected from 62 submissions. The scope of topics of the symposium was quite broad and covered basically all areas of the foundations of theoretical computer science.
Note Print version record.
ISBN 9783642131820
9783642131813 (pbk.)
3642131816 (pbk.)
ISBN/ISSN 10.1007/978-3-642-13182-0
OCLC # 654398696
Additional Format Print version: International Computer Science Symposium in Russia (5th : 2010 : Kazan, Russia). Computer science - theory and applications. Berlin : Springer, 2010 9783642131813 3642131816 (OCoLC)641458841

If you experience difficulty accessing or navigating this content, please contact the OPAL Support Team