top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Computer science -- Theory and applications : 11th International Computer Science Symposium in Russia, CSR 2016, Saint Petersburg, Russia, June 9-13, 2016. Proceedings / Alexander S. Kulikov, Gerhard J. Woeginger (eds.).
Computer science -- Theory and applications : 11th International Computer Science Symposium in Russia, CSR 2016, Saint Petersburg, Russia, June 9-13, 2016. Proceedings / Alexander S. Kulikov, Gerhard J. Woeginger (eds.).
Creatore [International Computer Science Symposium in Russia (11th : 2016 : Saint Petersburg, Russia)]
Estensione 1 online resource (xxi, 425 pages) : illustrations.
Accesso persona Kulikov, Alexander S., editor.
Woeginger, Gerhard, editor
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783319341712
3319341715
9783319341705
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algorithms and data structures -- Combinatorial optimization -- Constraint solving -- Computational complexity -- Cryptography -- Combinatorics in computer science -- Formal languages and automata -- Computational models and concepts -- Algorithms for concurrent and distributed systems, networks -- Proof theory and applications of logic to computer science -- Model checking -- Automated reasoning -- Deductive methods.
Record Nr. UCHICAGO-11263520
[International Computer Science Symposium in Russia (11th : 2016 : Saint Petersburg, Russia)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Computer science - theory and applications [electronic resource] : Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007: Proceedings / edited by Volker Diekert, Mikhail V. Volkov, Andrei Voronkov
Computer science - theory and applications [electronic resource] : Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007: Proceedings / edited by Volker Diekert, Mikhail V. Volkov, Andrei Voronkov
Creatore [International Computer Science Symposium in Russia (2nd : 2007 : Ekaterinburg, Russia)]
Estensione 1 online resource (xiii, 420 p.) : ill.
Accesso persona Diekert, Volker
Volkov, Mikhail V.
Voronkov, Andrei
ISBN 9783540745099 (paper)
9783540745105 (electronic bk.)
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UALBERTA-7948858
[International Computer Science Symposium in Russia (2nd : 2007 : Ekaterinburg, Russia)]  
Materiale a stampa
Lo trovi qui: University of Alberta / NEOS Library Consortium
Computer science--theory and applications : 4th International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009 : proceedings / Anna Frid [and others] (eds.).
Computer science--theory and applications : 4th International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009 : proceedings / Anna Frid [and others] (eds.).
Creatore [International Computer Science Symposium in Russia (4th : 2009 : Novosibirsk, Russia)]
Estensione 1 online resource (xiii, 367 pages) : illustrations.
Disciplina 004
Accesso persona Frid, Anna
Genere/Forma Congresses
ISBN 9783642033513
3642033512
9783642033506
3642033504
Classificazione TP3-532
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UALBERTA-7956633
[International Computer Science Symposium in Russia (4th : 2009 : Novosibirsk, Russia)]  
Materiale a stampa
Lo trovi qui: University of Alberta / NEOS Library Consortium
Computer science -- theory and applications : 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings / René van Bevern, Gregory Kucherov (eds.).
Computer science -- theory and applications : 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings / René van Bevern, Gregory Kucherov (eds.).
Creatore [International Computer Science Symposium in Russia (14th : 2019 : Novosibirsk, Russia)]
Estensione 1 online resource (xxv, 373 pages) : illustrations (some color)
Disciplina 004
Accesso persona Bevern, René van, editor
Kucherov, Gregory, editor
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783030199555
303019955X
9783030199548
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem.- The Non-Hardness of Approximating Circuit Size.- Reconstructing a convex polygon from its omega-cloud.- A Space-efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraization.- Quantum Algorithm for Distribution-Free Junta Testing.- On Induced Online Ramsey Number of Paths, Cycles, and Trees.- Approximations of Schatten Norms via Taylor Expansions.- Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes.- Belga B-trees.- Eventually dendric shifts.- On Decidability of Regular Languages Theories.- Minimizing Branching Vertices in Distance-preserving Subgraphs.- On Tseitin formulas, read-once branching programs and treewidth.- Matched instances of Quantum Sat (QSat) -- Product state solutions of Restrictions.- Notes on resolution over linear equations.- Undecidable word problem in subshift automorphism groups.- Parameterized Complexity of Conflict-Free Set Cover.- Forward Looking Huffman Coding.- Computational Complexity of Real Powering and Improved Solving Linear Differential Equations.- On the Quantum and Classical Complexity of Solving Subtraction Games.- Derandomization for sliding window algorithms with strict correctness.- On the Complexity of Restarting.- On the Complexity of Mixed Dominating Set.- Uniform CSP Parameterized by Solution Size is in W[1].- On the Parameterized Complexity of Edge-Linked Paths.- The Parameterized Complexity of Dominating Set and Friends Revisited.- Transition property for cube-free words.- A Polynomial Time Delta-Decomposition Algorithm for Positive DNFs.- Unpopularity Factor in the Marriage and Roommates Problems.- AND Protocols Using Only Uniform Shuffles.- Sybil-Resilient Conductance-Based Community Expansion.
Record Nr. NYU-006921576
[International Computer Science Symposium in Russia (14th : 2019 : Novosibirsk, Russia)]  
Materiale a stampa
Lo trovi qui: New York University
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.).
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.).
Creatore [International Computer Science Symposium in Russia (5th : 2010 : Kazan, Russia)]
Estensione 1 online resource (xi, 396 p.) : ill.
Accesso persona Ablayev, Farid
Mayr, Ernst
Genere/Forma Electronic books
ISBN 3642131816
9783642131813
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. DUKE-004855956
[International Computer Science Symposium in Russia (5th : 2010 : Kazan, Russia)]  
Materiale a stampa
Lo trovi qui: Duke University
Computer science - theory and applications : Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008 : proceedings / Edward A. Hirsch [and others] (eds.).
Computer science - theory and applications : Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008 : proceedings / Edward A. Hirsch [and others] (eds.).
Creatore [International Computer Science Symposium in Russia (3rd : 2008 : Moscow, Russia)]
Estensione 1 online resource (xiii, 409 pages) : illustrations.
Accesso persona Hirsch, Edward A.
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783540797098
3540797092
9783540797081
3540797084
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UCHICAGO-11069530
[International Computer Science Symposium in Russia (3rd : 2008 : Moscow, Russia)]  
Materiale a stampa
Lo trovi qui: University of Chicago
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.).
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.).
Creatore [International Computer Science Symposium in Russia (5th : 2010 : Kazan, Russia)]
Estensione 1 online resource (xi, 396 pages) : illustrations.
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783642131820
3642131824
9783642131813
3642131816
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algorithms for energy management (invited talk) / Susanne Albers -- Sofic and almost of finite type tree-shifts / Nathalie Aubrun and Marie-Pierre Béal -- Proof-based design of security protocols / Nazim Benaissa and Dominique Méry -- Approximating the minimum length of synchronizing words is hard / Mikhail V. Berlinkov -- Realizability of dynamic MSC languages / Benedikt Bollig and Loïc Hélouët -- The max quasi-independent set problem / N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, V. Th. Paschos, and O. Pottié -- Equilibria in quantitative reachability games / Thomas Brihaye, Véronique Bruyère, and Julie De Pril -- Quotient complexity of closed languages / Janusz Brzozowski, Galina Jirásková, and Chenglong Zou -- Right-sequential functions on infinite words / Olivier Carton -- Kernelization (invited talk) / Fedor V. Fomin -- Zigzags in turing machines / Anahí 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 Jeż, and Lukasz Jeż -- 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 Hromkovič -- 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 Jäger 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, Daniël Paulusma, and Théophile 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 Schöning -- 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.
Record Nr. UCHICAGO-11074400
[International Computer Science Symposium in Russia (5th : 2010 : Kazan, Russia)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Computer science--theory and applications : 4th International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009 : proceedings / Anna Frid [and others] (eds.).
Computer science--theory and applications : 4th International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009 : proceedings / Anna Frid [and others] (eds.).
Creatore [International Computer Science Symposium in Russia (4th : 2009 : Novosibirsk, Russia)]
Estensione 1 online resource (xiii, 367 pages) : illustrations.
Disciplina 004
Accesso persona Frid, Anna
Genere/Forma Electronic books
Conference papers and proceedings
Congresses
ISBN 9783642033513
3642033512
9783642033506
3642033504
Classificazione TP3-532
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. NYU-004619997
[International Computer Science Symposium in Russia (4th : 2009 : Novosibirsk, Russia)]  
Materiale a stampa
Lo trovi qui: New York University
Computer science--theory and applications : 8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013 : proceedings / Andrei A. Bulatov, Arseny M. Shur (eds.).
Computer science--theory and applications : 8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013 : proceedings / Andrei A. Bulatov, Arseny M. Shur (eds.).
Creatore [International Computer Science Symposium in Russia (8th : 2013 : Ekaterinburg, Russia)]
Estensione 1 online resource (xii, 443 pages) : illustrations.
Disciplina 004
Accesso persona Bulatov, Andrei A.
Shur, A. M. (Arseniĭ Mikhaĭlovich)
Genere/Forma Electronic books
Conference papers and proceedings
Ebook
Congresses
ISBN 9783642385360
3642385362
3642385354
9783642385353
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Opening Lecture. The Lovász Local Lemma -- A Survey / Mario Szegedy -- Session 1: Algorithms. An Improved Knapsack Solver for Column Generation / Klaus Jansen, Stefan Kraft -- QuickHeapsort: Modifications and Improved Analysis / Volker Diekert, Armin Weiß -- Alphabetic Minimax Trees in Linear Time / Paweł Gawrychowski -- Invited Lecture 1. Decidability and Enumeration for Automatic Sequences: A Survey / Jeffrey Shallit -- Session 2: Automata. Walking on Data Words / Amaldev Manuel, Anca Muscholl, Gabriele Puppis -- Careful Synchronization of Partial Automata with Restricted Alphabets / Pavel V. Martyugin -- Random Generation of Deterministic Acyclic Automata Using the Recursive Method / Sven De Felice, Cyril Nicaud -- Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height / Viliam Geffert, Zuzana Bednárová, Carlo Mereghetti, Beatrice Palano.
Invited Lecture 2. A Short Tutorial on Order-Invariant First-Order Logic / Nicole Schweikardt -- Session 3: Logic, Proof Complexity. Exponential Lower Bounds for Refuting Random Formulas Using Ordered Binary Decision Diagrams / Luke Friedman, Yixin Xu -- Parameterized Resolution with Bounded Conjunction / Stefan Dantchev, Barnaby Martin -- Lower and Upper Bounds for the Length of Joins in the Lambek Calculus / Alexey Sorokin -- Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP / Dmitry Itsykson, Vsevolod Oparin -- Invited Lecture 3. Towards NEXP versus BPP? / Ryan Williams -- Session 4: Complexity 1. Information Lower Bounds via Self-reducibility / Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein -- On the Encoding Invariance of Polynomial Time Computable Distribution Ensembles / Anton Makhlin.
Improving on Gutfreund, Shaltiel, and Ta-Shma's Paper "If NP Languages Are Hard on the Worst-Case, Then It Is Easy to Find Their Hard Instances" / Nikolay Vereshchagin -- Amortized Communication Complexity of an Equality Predicate / Vladimir Nikishkin -- Invited Lecture 4. On Coloring of Sparse Graphs / Alexandr Kostochka, Matthew Yancey -- Session 5: Words and Languages. On Recognizing Words That Are Squares for the Shuffle Product / Romeo Rizzi, Stéphane Vialette -- Cyclic Shift on Prefix-Free Languages / Jozef Jirásek, Galina Jirásková -- Weak Abelian Periodicity of Infinite Words / Sergey Avgustinovich, Svetlana Puzynina -- Universality of Regular Realizability Problems / Mikhail N. Vyalyi -- Invited Lecture 5. Potential Functions in Strategic Games / Paul G. Spirakis, Panagiota N. Panagopoulou -- Session 6: Algorithms 2. The Probabilistic Min Dominating Set Problem / Nicolas Boria, Cécile Murat, Vangelis Th. Paschos.
Dichotomy of the H-Quasi-Cover Problem / Jiří. Fiala, Marek Tesař -- QCSP on Partially Reflexive Cycles -- The Wavy Line of Tractability / Florent Madelaine, Barnaby Martin -- Quantum Alternation / Abuzer Yakaryılmaz -- Invited Lecture 6. Real Numbers, Chaos, and the Principle of a Bounded Density of Information / Gilles Dowek -- Session 7: Complexity 2. Random Selection in Few Rounds / Timofey Stepanov -- One-Counter Verifiers for Decidable Languages / Abuzer Yakaryılmaz -- More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding / Andreas Fröhlich, Gergely Kovásznai, Armin Biere -- Invited Lecture 7. Composition with Algebra at the Background / Thomas Colcombet -- Session 8: Logic, Automata. Model-Checking Bounded Multi-Pushdown Systems / Kshitij Bansal, Stéphane Demri -- Multi-weighted Automata and MSO Logic / Manfred Droste, Vitaly Perevoshchikov -- Overlapping Tile Automata / David Janin.
Record Nr. NYU-004638871
[International Computer Science Symposium in Russia (8th : 2013 : Ekaterinburg, Russia)]  
Materiale a stampa
Lo trovi qui: New York University
Computer science -- theory and applications : 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings / Pascal Weil (ed.).
Computer science -- theory and applications : 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings / Pascal Weil (ed.).
Creatore [International Computer Science Symposium in Russia (12th : 2017 : Kazan, Russia)]
Estensione 1 online resource (x, 337 pages) : illustrations.
Disciplina 004
Accesso persona Weil, Pascal, editor
ISBN 9783319587479
3319587471
9783319587462
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UALBERTA-7892915
[International Computer Science Symposium in Russia (12th : 2017 : Kazan, Russia)]  
Materiale a stampa
Lo trovi qui: University of Alberta / NEOS Library Consortium