Search results for "CSR"

Hits ?▲	Authors	Title	Venue	Year	Link
35	Prateek Karandikar, Philippe Schnoebelen	Cutting through Regular Post Embedding Problems.	CSR	2012	DBLP DOI BibTeX RDF
35	Hans Ulrich Simon	Boolean Composition of Visual Secret Sharing Schemes.	CSR	2012	DBLP DOI BibTeX RDF
35	Sebastian S. Bauer, Uli Fahrenberg, Axel Legay, Claus R. Thrane	General Quantitative Specification Theories with Modalities.	CSR	2012	DBLP DOI BibTeX RDF
35	Daniil Musatov	Space-Bounded Kolmogorov Extractors.	CSR	2012	DBLP DOI BibTeX RDF
35	Volker Diekert, Manfred Kufleitner	Bounded Synchronization Delay in Omega-Rational Expressions.	CSR	2012	DBLP DOI BibTeX RDF
35	Vijay V. Vazirani	Can the Theory of Algorithms Ratify the "Invisible Hand of the Market"?	CSR	2012	DBLP DOI BibTeX RDF
35	Nachshon Cohen, Zeev Nutov	Approximating Minimum Power Edge-Multi-Covers.	CSR	2012	DBLP DOI BibTeX RDF
35	Dennis Komm, Richard Královic, Tobias Mömke	On the Advice Complexity of the Set Cover Problem.	CSR	2012	DBLP DOI BibTeX RDF
35	Svetlana N. Selezneva	Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time.	CSR	2012	DBLP DOI BibTeX RDF
35	Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma	Finding Vertex-Surjective Graph Homomorphisms.	CSR	2012	DBLP DOI BibTeX RDF
35	Florent R. Madelaine, Barnaby Martin, Juraj Stacho	Constraint Satisfaction with Counting Quantifiers.	CSR	2012	DBLP DOI BibTeX RDF
35	Galina Jirásková	Descriptional Complexity of Operations on Alternating and Boolean Automata.	CSR	2012	DBLP DOI BibTeX RDF
35	Bartlomiej Bosek, Stefan Felsner, Kolja B. Knauer, Grzegorz Matecki	News about Semiantichains and Unichain Coverings.	CSR	2012	DBLP DOI BibTeX RDF
35	Pinar Heggernes, Sigve Hortemo Sæther	Broadcast Domination on Block Graphs in Linear Time.	CSR	2012	DBLP DOI BibTeX RDF
35	Romeo Rizzi, Florian Sikora	Some Results on more Flexible Versions of Graph Motif.	CSR	2012	DBLP DOI BibTeX RDF
35	Alexander S. Kulikov, Nikolay K. Vereshchagin (eds.)	Computer Science - Theory and Applications - 6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011. Proceedings	CSR	2011	DBLP DOI BibTeX RDF
35	Arnon Avron, Ori Lahav 0001	A Multiple-Conclusion Calculus for First-Order Gödel Logic.	CSR	2011	DBLP DOI BibTeX RDF
35	László Babai	Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas.	CSR	2011	DBLP DOI BibTeX RDF
35	Scott Aaronson	The Equivalence of Sampling and Searching.	CSR	2011	DBLP DOI BibTeX RDF
35	Jarkko Kari	Snakes and Cellular Automata: Reductions and Inseparability Results.	CSR	2011	DBLP DOI BibTeX RDF
35	Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien	Learning Read-Constant Polynomials of Constant Degree Modulo Composites.	CSR	2011	DBLP DOI BibTeX RDF
35	Kim Thang Nguyen	Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs.	CSR	2011	DBLP DOI BibTeX RDF
35	Tamar Aizikowitz, Michael Kaminski	LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata.	CSR	2011	DBLP DOI BibTeX RDF
35	Christos A. Kapoutsis	Two-Way Automata versus Logarithmic Space.	CSR	2011	DBLP DOI BibTeX RDF
35	Rémi Morin	Shared-Memory Systems and Charts.	CSR	2011	DBLP DOI BibTeX RDF
35	Alex Davydow, Sergey I. Nikolenko	Gate Elimination for Linear Functions and New Feebly Secure Constructions.	CSR	2011	DBLP DOI BibTeX RDF
35	Alexey Pospelov 0001	Faster Polynomial Multiplication via Discrete Fourier Transforms.	CSR	2011	DBLP DOI BibTeX RDF
35	Alexander Tiskin	Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition.	CSR	2011	DBLP DOI BibTeX RDF
35	Matthijs Bomhoff	Recognizing Sparse Perfect Elimination Bipartite Graphs.	CSR	2011	DBLP DOI BibTeX RDF
35	Daniil Musatov	Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization.	CSR	2011	DBLP DOI BibTeX RDF
35	Fabian Wagner	Graphs of Bounded Treewidth Can Be Canonized in AC1.	CSR	2011	DBLP DOI BibTeX RDF
35	Alexander Shen	Kolmogorov Complexity as a Language.	CSR	2011	DBLP DOI BibTeX RDF
35	Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen	The Complexity of Solving Reachability Games Using Value and Strategy Iteration.	CSR	2011	DBLP DOI BibTeX RDF
35	Jirí Síma, Stanislav Zák	Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs.	CSR	2011	DBLP DOI BibTeX RDF
35	Manindra Agrawal	On the Arithmetic Complexity of Euler Function.	CSR	2011	DBLP DOI BibTeX RDF
35	Catarina Carvalho, László Egri, Marcel Jackson, Todd Niven	On Maltsev Digraphs.	CSR	2011	DBLP DOI BibTeX RDF
35	Guillaume Blin, Romeo Rizzi, Stéphane Vialette	A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row.	CSR	2011	DBLP DOI BibTeX RDF
35	Klaus Meer	An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents.	CSR	2011	DBLP DOI BibTeX RDF
35	Konstantin M. Likhomanov, Arseny M. Shur	Two Combinatorial Criteria for BWT Images.	CSR	2011	DBLP DOI BibTeX RDF
35	Benjamin Doerr, Carola Winzen	Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity.	CSR	2011	DBLP DOI BibTeX RDF
35	Sergey P. Tarasov, Mikhail N. Vyalyi	Orbits of Linear Maps and Regular Languages.	CSR	2011	DBLP DOI BibTeX RDF
35	Dmitry Itsykson, Dmitry Sokolov 0001	The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms.	CSR	2011	DBLP DOI BibTeX RDF
35	Sergey Yekhanin	Locally Decodable Codes.	CSR	2011	DBLP DOI BibTeX RDF
35	Andrei E. Romashchenko	Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error.	CSR	2011	DBLP DOI BibTeX RDF
35	Pinar Heggernes, Daniel Meister 0001, Udi Rotics	Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width.	CSR	2011	DBLP DOI BibTeX RDF
35	Petr A. Golovach, Daniël Paulusma, Jian Song 0005	Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees.	CSR	2011	DBLP DOI BibTeX RDF
35	Amir Shpilka	Recent Results on Polynomial Identity Testing.	CSR	2011	DBLP DOI BibTeX RDF
35	Markus Lohrey, Christian Mathissen	Compressed Membership in Automata with Compressed Labels.	CSR	2011	DBLP DOI BibTeX RDF
35	Andrei A. Bulatov	On the CSP Dichotomy Conjecture.	CSR	2011	DBLP DOI BibTeX RDF
35	Violetta Lonati, Dino Mandrioli, Matteo Pradella	Precedence Automata and Languages.	CSR	2011	DBLP DOI BibTeX RDF
35	Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios	Join-Reachability Problems in Directed Graphs.	CSR	2011	DBLP DOI BibTeX RDF
35	Eric Rémila	The Optimal Strategy for the Average Long-Lived Consensus.	CSR	2011	DBLP DOI BibTeX RDF
35	Farid M. 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	CSR	2010	DBLP DOI BibTeX RDF
35	R. A. Gimadeev, Mikhail N. Vyalyi	Identical Relations in Symmetric Groups and Separating Words with Reversible Automata.	CSR	2010	DBLP DOI BibTeX RDF
35	Anahí Gajardo, Pierre Guillon 0001	Zigzags in Turing Machines.	CSR	2010	DBLP DOI BibTeX RDF
35	Fedor V. Fomin	Kernelization.	CSR	2010	DBLP DOI BibTeX RDF
35	Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou	Quotient Complexity of Closed Languages.	CSR	2010	DBLP DOI BibTeX RDF
35	Pavel V. Martyugin	Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA.	CSR	2010	DBLP DOI BibTeX RDF
35	Matthew Johnson 0002, Viresh Patel, Daniël Paulusma, Théophile Trunck	Obtaining Online Ecological Colourings by Generalizing First-Fit.	CSR	2010	DBLP DOI BibTeX RDF
35	Uwe Schöning	Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems.	CSR	2010	DBLP DOI BibTeX RDF
35	Alexander A. Razborov	Complexity of Propositional Proofs.	CSR	2010	DBLP DOI BibTeX RDF
35	Juraj Hromkovic	Algorithmics - Is There Hope for a Unified Theory?	CSR	2010	DBLP DOI BibTeX RDF
35	Arseny M. Shur	Growth of Power-Free Languages over Large Alphabets.	CSR	2010	DBLP DOI BibTeX RDF
35	Richard Jozsa	Classical Simulation and Complexity of Quantum Computations.	CSR	2010	DBLP DOI BibTeX RDF
35	Vladimir N. Krupski	Symbolic Models for Single-Conclusion Proof Logics.	CSR	2010	DBLP DOI BibTeX RDF
35	Nick Gravin	Time Optimal d-List Colouring of a Graph.	CSR	2010	DBLP DOI BibTeX RDF
35	Junhua Yu	Prehistoric Phenomena and Self-referentiality.	CSR	2010	DBLP DOI BibTeX RDF
35	Maurice J. Jansen, Jayalal Sarma	Balancing Bounded Treewidth Circuits.	CSR	2010	DBLP DOI BibTeX RDF
35	Miklos Santha	Quantization of Random Walks: Search Algorithms and Hitting Time.	CSR	2010	DBLP DOI BibTeX RDF
35	Pavel Karpovich	Monotone Complexity of a Pair.	CSR	2010	DBLP DOI BibTeX RDF
35	Daniel Binkele-Raible, Henning Fernau	A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem.	CSR	2010	DBLP DOI BibTeX RDF
35	Pawel Gawrychowski, Artur Jez, Lukasz Jez	Validating the Knuth-Morris-Pratt Failure Function, Fast and Online.	CSR	2010	DBLP DOI BibTeX RDF
35	Valery Plisko	Transfinite Sequences of Constructive Predicate Logics.	CSR	2010	DBLP DOI BibTeX RDF
35	Ling-Ju Hung, Ton Kloks	Classifying Rankwidth k-DH-Graphs.	CSR	2010	DBLP DOI BibTeX RDF
35	Dmitry Itsykson	Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms.	CSR	2010	DBLP DOI BibTeX RDF
35	Gerold Jäger, Weixiong Zhang	A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem.	CSR	2010	DBLP DOI BibTeX RDF
35	Nathalie Aubrun, Marie-Pierre Béal	Sofic and Almost of Finite Type Tree-Shifts.	CSR	2010	DBLP DOI BibTeX RDF
35	Elena Kalinina	Prefix-Free and Prefix-Correct Complexities with Compound Conditions.	CSR	2010	DBLP DOI BibTeX RDF
35	Prabhakar Raghavan	The Quantitative Analysis of User Behavior Online - Data, Models and Algorithms.	CSR	2010	DBLP DOI BibTeX RDF
35	Benedikt Bollig, Loïc Hélouët	Realizability of Dynamic MSC Languages.	CSR	2010	DBLP DOI BibTeX RDF
35	Olivier Carton	Right-Sequential Functions on Infinite Words.	CSR	2010	DBLP DOI BibTeX RDF
35	Nazim Benaïssa, Dominique Méry	Proof-Based Design of Security Protocols.	CSR	2010	DBLP DOI BibTeX RDF
35	Avraham Trakhtman	A Partially Synchronizing Coloring.	CSR	2010	DBLP DOI BibTeX RDF
35	Mikhail V. Berlinkov	Approximating the Minimum Length of Synchronizing Words Is Hard.	CSR	2010	DBLP DOI BibTeX RDF
35	Nikolay K. Vereshchagin	An Encoding Invariant Version of Polynomial Time Computable Distributions.	CSR	2010	DBLP DOI BibTeX RDF
35	Victor Y. Pan, Guoliang Qian, Ailong Zheng	Advancing Matrix Computations with Randomized Preprocessing.	CSR	2010	DBLP DOI BibTeX RDF
35	Bernhard Heinemann	The Cantor Space as a Generic Model of Topologically Presented Knowledge.	CSR	2010	DBLP DOI BibTeX RDF
35	Susanne Albers	Algorithms for Energy Management.	CSR	2010	DBLP DOI BibTeX RDF
35	Thomas Brihaye, Véronique Bruyère, Julie De Pril	Equilibria in Quantitative Reachability Games.	CSR	2010	DBLP DOI BibTeX RDF
35	Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié	The max quasi-independent set Problem.	CSR	2010	DBLP DOI BibTeX RDF
35	James Gate, Iain A. Stewart	Frameworks for Logically Classifying Polynomial-Time Optimisation Problems.	CSR	2010	DBLP DOI BibTeX RDF
35	Anna E. Frid, Andrey Morozov 0002, Andrey Rybalchenko, Klaus W. Wagner (eds.)	Computer Science - Theory and Applications, Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009. Proceedings	CSR	2009	DBLP DOI BibTeX RDF
35	Magnus Wahlström	New Plain-Exponential Time Classes for Graph Homomorphism.	CSR	2009	DBLP DOI BibTeX RDF
35	Arnon Avron, Agata Ciabattoni, Anna Zamansky	Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism.	CSR	2009	DBLP DOI BibTeX RDF
35	Kristoffer Arnsfelt Hansen	Depth Reduction for Circuits with a Single Layer of Modular Counting Gates.	CSR	2009	DBLP DOI BibTeX RDF
35	Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko	Complete Complexity Classification of Short Shop Scheduling.	CSR	2009	DBLP DOI BibTeX RDF
35	Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko	Integrality Property in Preemptive Parallel Machine Scheduling.	CSR	2009	DBLP DOI BibTeX RDF
35	Olaf Beyersdorff, Zenon Sadowski	Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes.	CSR	2009	DBLP DOI BibTeX RDF
35	Wolfgang Thomas	The Reachability Problem over Infinite Graphs.	CSR	2009	DBLP DOI BibTeX RDF
35	Yuri Pritykin, Julya Ulyashkina	Aperiodicity Measure for Infinite Sequences.	CSR	2009	DBLP DOI BibTeX RDF