Vai al contenuto principale della pagina

Computer science-- Theory and applications : 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings / Edward A. Hirsch [and others] (eds.).



(Visualizza formato Marc21)    (visualizza in BIBRAME 2.0)

Creatore: International Computer Science Symposium in Russia (7th : 2012 : Nizhniĭ Novgorod, Russia)
Titolo: Computer science-- Theory and applications : 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings / Edward A. Hirsch [and others] (eds.).
Link to work: Computer science -- theory and applications Visualizza cluster
Pubblicazione: Berlin ; New York : Springer, ©2012
Estensione: 1 online resource (xxiii, 325 pages) : illustrations.
Tipo formato: computer
Tipo contenuto: text
Tipo supporto: online resource
Disciplina: 004
Titolo uniforme di collana: Lecture notes in computer science ; 7353. 1611-3349
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Genere/Forma: Electronic books
Conference papers and proceedings
Index term-Uncontrolled: Computer science
Computer software
Logic design
Computational complexity
Algorithm Analysis and Problem Complexity
Mathematical Logic and Formal Languages
Discrete Mathematics in Computer Science
Computation by Abstract Devices
Mathematics of Computing
Soggetto non controllato: Computer science
Computer software
Logic design
Computational complexity
Algorithm Analysis and Problem Complexity
Mathematical Logic and Formal Languages
Discrete Mathematics in Computer Science
Computation by Abstract Devices
Mathematics of Computing
Termine d'indicizzazione-Occupazione: Computer science
Computer software
Logic design
Computational complexity
Algorithm Analysis and Problem Complexity
Mathematical Logic and Formal Languages
Discrete Mathematics in Computer Science
Computation by Abstract Devices
Mathematics of Computing
Classificazione LOC: QA75.5 .I58 2012
Creatori/Collaboratori: Hirsch, Edward A.
Contenuto supplementare: Includes bibliographical references and author index.
Nota di contenuto: Can the Theory of Algorithms Ratify the "Invisible Hand of the Market"? / Vijay V. Vazirani -- Resilient Quicksort and Selection / Maxim Babenko and Ivan Pouzyrevsky -- General Quantitative Specification Theories with Modalities / Sebastian S. Bauer, Uli Fahrenberg, Axel Legay and Claus Thrane -- The Complexity of Intersecting Finite Automata Having Few Final States / Michael Blondin and Pierre McKenzie -- News about Semiantichains and Unichain Coverings / Bartłomiej Bosek, Stefan Felsner, Kolja Knauer and Grzegorz Matecki -- Checking Tests for Read-Once Functions over Arbitrary Bases / Dmitry V. Chistikov -- Approximating Minimum Power Edge-Multi-Covers / Nachshon Cohen and Zeev Nutov -- A Lower Bound on Circuit Complexity of Vector Function in U2 / Evgeny Demenkov -- Computing All MOD-Functions Simultaneously / Evgeny Demenkov, Alexander S. Kulikov, Ivan Mihajlin and Hiroki Morizumi -- Bounded Synchronization Delay in Omega-Rational Expressions / Volker Diekert and Manfred Kufleitner -- Towards Optimal Degree-Distributions for Left-Perfect Matchings in Random Bipartite Graphs / Martin Dietzfelbinger and Michael Rink -- Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs / Stefan Dobrev, Evangelos Kranakis, Oscar Morales Ponce and Milan Plžík -- Worst-Case Optimal Priority Queues via Extended Regular Counters / Amr Elmasry and Jyrki Katajainen -- The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs / Eli Fox-Epstein and Danny Krizanc -- Satisfiability Thresholds beyond k-XORSAT / Andreas Goerdt and Lutz Falke -- Finding Vertex-Surjective Graph Homomorphisms / Petr A. Golovach, Bernard Lidický, Barnaby Martin and Daniël Paulusma -- Broadcast Domination on Block Graphs in Linear Time / Pinar Heggernes and Sigve H. Sæther -- Characterizing Certain Topological Specifications / Bernhard Heinemann -- Descriptional Complexity of Operations on Alternating and Boolean Automata / Galina Jirásková -- Consistency of Multidimensional Combinatorial Substitutions / Timo Jolivet and Jarkko Kari -- Two-Way Automata Characterizations of L/poly versus NL / Christos A. Kapoutsis and Giovanni Pighizzini -- Cutting through Regular Post Embedding Problems / Prateek Karandikar and Philippe Schnoebelen -- On the Advice Complexity of the Set Cover Problem / Dennis Komm, Richard Královič and Tobias Mömke -- Constraint Satisfaction with Counting Quantifiers / Florent Madelaine, Barnaby Martin and Juraj Stacho -- Space-Bounded Kolmogorov Extractors / Daniil Musatov -- Some Results on more Flexible Versions of Graph Motif / Romeo Rizzi and Florian Sikora -- A Characterization of Cellular Automata Generated by Idempotents on the Full Shift / Ville Salo -- Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time / Svetlana N. Selezneva -- Boolean Composition of Visual Secret Sharing Schemes / Hans Ulrich Simon.
Restrizioni accesso: Access is restricted to users affiliated with licensed institutions.
Sommario/riassunto: This book constitutes the proceedings of the 7th International Computer Science Symposium in Russia, CSR 2012, held in Nizhny Novgorod in July 2012. The 28 full papers presented in this volume were carefully reviewed and selected from 66 submissions. CSR 2012 was one of the events of the Alan Turing Year 2012, the topics dealt with cover substantial parts of theoretical computer science and its appcliations.
Collana: Lecture notes in computer science, 1611-3349 ; 7353
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Varianti del titolo: CSR 2012
ISBN: 9783642306426
364230642X
9783642306419
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 004624138
Localizzazioni e accesso elettronico https://ebookcentral.proquest.com/lib/nyulibrary-ebooks/detail.action?docID=3070101
Collocazione: Electronic access
Lo trovi qui: New York University
Altra ed. diverso supporto: Printed edition: 9783642306419