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 : 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.
Accesso persona Weil, Pascal, editor
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783319587479
3319587471
3319587463
9783319587462
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Type Theory and Formalization of Mathematics -- Advances in Parameterized Verification of Population Protocols -- Verification of Quantum Computation and the Price of Trust -- Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs -- Concatenation Hierarchies: New Bottle, Old Wine -- Can We Locally Compute Sparse Connected Subgraphs -- Palindromic Decompositions with Gaps and Errors -- Cascade Heaps: Towards Time-Optimal Extractions -- Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets -- Parameterized Counting of Trees, Forests and Matroid Bases -- Generalized Dyck Shifts -- Green's Relations in Finite Transformation Semigroups -- Nondeterministic Unitary OBDDs -- Unary Coded PSPACE-Complete Languages in ASPACE(loglog n) -- Turing Degree Spectra of Minimal Subshifts -- Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams -- Dynamic stabbing Queries with Sub-logarithmic Local Updates for Overlapping Intervals -- The Transformation Monoid of a Partially Lossy Queue -- Approximation Algorithms for the Maximum Carpool Matching Problem -- The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC=0 -- On Algorithmic Statistics for Space-bounded Algorithms -- Popularity in the Generalized Hospital Residents Setting -- Edit Distance Neighbourhoods of Input-driven Pushdown Automata -- The (Minimum) Rank of Typical Fooling-set Matrices -- On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition Problem -- Dag-like Communication and Its Applications -- The Descriptive Complexity of Subgraph Isomorphism Without Numerics -- On a Generalization of Horn Constraint Systems.
Record Nr. UCHICAGO-11274039
[International Computer Science Symposium in Russia (12th : 2017 : 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.
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. UCHICAGO-11073027
[International Computer Science Symposium in Russia (4th : 2009 : Novosibirsk, Russia)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Computer science--theory and applications : 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014, proceedings / Edward A. Hirsch, Sergei O. Kuznetsov, Jean-Éric Pin, Nikolay K. Vereshchagin (eds.).
Computer science--theory and applications : 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014, proceedings / Edward A. Hirsch, Sergei O. Kuznetsov, Jean-Éric Pin, Nikolay K. Vereshchagin (eds.).
Creatore [International Computer Science Symposium in Russia (9th : 2014 : Moscow, Russia)]
Estensione 1 online resource (xix, 389 pages).
Disciplina 004
Accesso persona Hirsch, Edward A., editor.
Accesso convegno International Computer Science Symposium in Russia
ISBN 9783319066868 (electronic bk.)
3319066862 (electronic bk.)
9783319066851
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UALBERTA-6641672
[International Computer Science Symposium in Russia (9th : 2014 : Moscow, Russia)]  
Materiale a stampa
Lo trovi qui: University of Alberta / NEOS Library Consortium
Computer science--theory and applications [electronic resource] : 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 [electronic resource] : 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.
Disciplina 004
Accesso persona Ablayev, Farid
Mayr, Ernst
ISBN 9783642131820
3642131824
9783642131813 (pbk.)
3642131816 (pbk.)
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-8866053
[International Computer Science Symposium in Russia (5th : 2010 : Kazanʹ, Russia)]  
Materiale a stampa
Lo trovi qui: University of Chicago
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.).
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.).
Creatore [International Computer Science Symposium in Russia (7th : 2012 : Nizhniĭ Novgorod, Russia)]
Estensione 1 online resource (xxiii, 325 pages) : illustrations.
Disciplina 004
Accesso persona Hirsch, Edward A.
Genere/Forma Electronic books
Conference papers and proceedings
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
ISBN 9783642306426
364230642X
9783642306419
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
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.
Record Nr. NYU-004624138
[International Computer Science Symposium in Russia (7th : 2012 : Nizhniĭ Novgorod, 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.
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. UCHICAGO-11078825
[International Computer Science Symposium in Russia (8th : 2013 : Ekaterinburg, Russia)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Computer science -- theory and applications [electronic resource] : 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29-July 3, 2020, Proceedings / Henning Fernau (ed.).
Computer science -- theory and applications [electronic resource] : 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29-July 3, 2020, Proceedings / Henning Fernau (ed.).
Creatore [International Computer Science Symposium in Russia (15th : 2020 : Yekaterinburg, Russia)]
Estensione 1 online resource (444 p.).
Disciplina 004
Accesso persona Fernau, Henning, 1965-
ISBN 9783030500269
3030500268
9783030500252
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Organization -- Contents -- Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations -- 1 Introduction -- 2 Preliminaries -- 3 Quantum Fingerprinting -- 3.1 Binary Quantum Fingerprinting Function -- 3.2 q-ary Quantum Fingerprinting -- 3.3 Quantum Fingerprinting for Computations -- 4 Quantum Hashing -- 4.1 One-way -Resistance -- 4.2 Collision -Resistance -- 4.3 Balanced Quantum (, )-Resistance -- 4.4 Quantum (, )-Hash Functions Construction Via Small-Biased Sets -- 5 Quantum Hashing for Finite Abelian Groups -- 6 Pre-image Resistance of Quantum Hashing
3.1 Derived Relations -- 3.2 Network Positions -- 4 Centrality -- 4.1 Neighborhood Inclusion -- 4.2 Positional Dominance -- 4.3 Homogeneity -- 4.4 Application -- 5 Computational Challenges -- 5.1 Transformations -- 5.2 Dominance -- 5.3 Rankings -- 6 Conclusions -- References -- Second-Order Finite Automata -- 1 Introduction -- 2 Preliminaries -- 2.1 Basics -- 2.2 Ordered Decision Diagrams -- 3 Second-Order Finite Automata -- 4 Transductions -- 5 Canonization of ODDs Using Transductions -- 6 Applications -- 7 Conclusion -- References -- Isomorphic Distances Among Elections -- 1 Introduction
1.1 Distances, Election Isomorphism, and Motivation -- 1.2 Organization -- 2 Preliminaries -- 3 Distances Among Elections -- 3.1 Election Isomorphism Problem -- 3.2 Isomorphic Distances -- 3.3 Positionwise and Pairwise Distances -- 4 Research Directions -- 4.1 New Distances -- 4.2 Effective Algorithms -- 4.3 Properties of the Distances -- 4.4 Evaluating Distances in Practice -- 5 Summary -- References -- Tandem Duplications, Segmental Duplications and Deletions, and Their Applications -- 1 Introduction -- 1.1 Tandem Duplications -- 1.2 Copy Number Profiles -- 2 Preliminaries
2.1 Strings and Tandem Duplications -- 2.2 Copy Number Profiles, Segmental Duplications and Deletions -- 3 Results on Tandem Duplications -- 3.1 Exemplar-TD Is NP-hard -- 3.2 Exemplar-TD Is FPT -- 4 Results on Copy Number Profiles -- 4.1 Hardness of Approximation for MCNG -- 4.2 W[1]-Hardness for MCNG -- 4.3 The Copy Number Profile Conforming Problem -- 5 Concluding Remarks and Open Problems -- References -- Faster 2-Disjoint-Shortest-Paths Algorithm -- 1 Introduction -- 2 Definitions and the DP Formululation -- 3 Reducing the Running Time to O(V7) -- 4 Reducing Running Time to O(V6)
Record Nr. STANFORD-a13653891
[International Computer Science Symposium in Russia (15th : 2020 : Yekaterinburg, Russia)]  
Materiale a stampa
Lo trovi qui: Stanford University
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-007073489
[International Computer Science Symposium in Russia (14th : 2019 : Novosibirsk, Russia)]  
Materiale a stampa
Lo trovi qui: New York University
Computer science--theory and applications [electronic resource] : First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006 : proceedings / Dima Grigoriev, John Harrison, Edward A. Hirsch (eds.).
Computer science--theory and applications [electronic resource] : First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006 : proceedings / Dima Grigoriev, John Harrison, Edward A. Hirsch (eds.).
Creatore [International Computer Science Symposium in Russia (1st : 2006 : Saint Petersburg, Russia)]
Estensione xvi, 684 p. : ill.
Disciplina 004
Accesso persona Grigoriev, Dima
Harrison, J. (John), 1966-
Hirsch, Edward A.
Accesso ente ProQuest (Firm)
ISBN 3540341684
3540341668
9783540341666
9783540341680 (e-book)
Formato Risorse elettroniche
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. STANFORD-a12478620
[International Computer Science Symposium in Russia (1st : 2006 : Saint Petersburg, Russia)]  
Risorse elettroniche
Lo trovi qui: Stanford University
Computer science--theory and applications : First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006 : proceedings / Dima Grigoriev, John Harrison, Edward A. Hirsch (eds.).
Computer science--theory and applications : First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006 : proceedings / Dima Grigoriev, John Harrison, Edward A. Hirsch (eds.).
Creatore [International Computer Science Symposium in Russia (1st : 2006 : St. Petersburg, Russia)]
Estensione 1 online resource (xvi, 684 p.) : ill.
Disciplina 004
Accesso persona Grigoriev, Dima
Harrison, J. (John), 1966-
Hirsch, Edward A.
Genere/Forma Electronic books
ISBN 3540341668
9783540341666
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. DUKE-004448766
[International Computer Science Symposium in Russia (1st : 2006 : St. Petersburg, Russia)]  
Materiale a stampa
Lo trovi qui: Duke University