Search results for "CSR"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Manindra Agrawal	On the Arithmetic Complexity of Euler Function.	CSR	2011	DBLP DOI BibTeX RDF
1	Catarina Carvalho, László Egri, Marcel Jackson, Todd Niven	On Maltsev Digraphs.	CSR	2011	DBLP DOI BibTeX RDF
1	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
1	Klaus Meer	An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents.	CSR	2011	DBLP DOI BibTeX RDF
1	Konstantin M. Likhomanov, Arseny M. Shur	Two Combinatorial Criteria for BWT Images.	CSR	2011	DBLP DOI BibTeX RDF
1	Benjamin Doerr, Carola Winzen	Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity.	CSR	2011	DBLP DOI BibTeX RDF
1	Sergey P. Tarasov, Mikhail N. Vyalyi	Orbits of Linear Maps and Regular Languages.	CSR	2011	DBLP DOI BibTeX RDF
1	Dmitry Itsykson, Dmitry Sokolov 0001	The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms.	CSR	2011	DBLP DOI BibTeX RDF
1	Sergey Yekhanin	Locally Decodable Codes.	CSR	2011	DBLP DOI BibTeX RDF
1	Andrei E. Romashchenko	Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error.	CSR	2011	DBLP DOI BibTeX RDF
1	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
1	Petr A. Golovach, Daniël Paulusma, Jian Song 0005	Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees.	CSR	2011	DBLP DOI BibTeX RDF
1	Amir Shpilka	Recent Results on Polynomial Identity Testing.	CSR	2011	DBLP DOI BibTeX RDF
1	Markus Lohrey, Christian Mathissen	Compressed Membership in Automata with Compressed Labels.	CSR	2011	DBLP DOI BibTeX RDF
1	Andrei A. Bulatov	On the CSP Dichotomy Conjecture.	CSR	2011	DBLP DOI BibTeX RDF
1	Violetta Lonati, Dino Mandrioli, Matteo Pradella	Precedence Automata and Languages.	CSR	2011	DBLP DOI BibTeX RDF
1	Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios	Join-Reachability Problems in Directed Graphs.	CSR	2011	DBLP DOI BibTeX RDF
1	Eric Rémila	The Optimal Strategy for the Average Long-Lived Consensus.	CSR	2011	DBLP DOI BibTeX RDF
1	R. A. Gimadeev, Mikhail N. Vyalyi	Identical Relations in Symmetric Groups and Separating Words with Reversible Automata.	CSR	2010	DBLP DOI BibTeX RDF
1	Anahí Gajardo, Pierre Guillon 0001	Zigzags in Turing Machines.	CSR	2010	DBLP DOI BibTeX RDF
1	Fedor V. Fomin	Kernelization.	CSR	2010	DBLP DOI BibTeX RDF
1	Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou	Quotient Complexity of Closed Languages.	CSR	2010	DBLP DOI BibTeX RDF
1	Pavel V. Martyugin	Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA.	CSR	2010	DBLP DOI BibTeX RDF
1	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
1	Uwe Schöning	Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems.	CSR	2010	DBLP DOI BibTeX RDF
1	Alexander A. Razborov	Complexity of Propositional Proofs.	CSR	2010	DBLP DOI BibTeX RDF
1	Juraj Hromkovic	Algorithmics - Is There Hope for a Unified Theory?	CSR	2010	DBLP DOI BibTeX RDF
1	Arseny M. Shur	Growth of Power-Free Languages over Large Alphabets.	CSR	2010	DBLP DOI BibTeX RDF
1	Richard Jozsa	Classical Simulation and Complexity of Quantum Computations.	CSR	2010	DBLP DOI BibTeX RDF
1	Vladimir N. Krupski	Symbolic Models for Single-Conclusion Proof Logics.	CSR	2010	DBLP DOI BibTeX RDF
1	Nick Gravin	Time Optimal d-List Colouring of a Graph.	CSR	2010	DBLP DOI BibTeX RDF
1	Junhua Yu	Prehistoric Phenomena and Self-referentiality.	CSR	2010	DBLP DOI BibTeX RDF
1	Maurice J. Jansen, Jayalal Sarma	Balancing Bounded Treewidth Circuits.	CSR	2010	DBLP DOI BibTeX RDF
1	Miklos Santha	Quantization of Random Walks: Search Algorithms and Hitting Time.	CSR	2010	DBLP DOI BibTeX RDF
1	Pavel Karpovich	Monotone Complexity of a Pair.	CSR	2010	DBLP DOI BibTeX RDF
1	Daniel Binkele-Raible, Henning Fernau	A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem.	CSR	2010	DBLP DOI BibTeX RDF
1	Pawel Gawrychowski, Artur Jez, Lukasz Jez	Validating the Knuth-Morris-Pratt Failure Function, Fast and Online.	CSR	2010	DBLP DOI BibTeX RDF
1	Valery Plisko	Transfinite Sequences of Constructive Predicate Logics.	CSR	2010	DBLP DOI BibTeX RDF
1	Ling-Ju Hung, Ton Kloks	Classifying Rankwidth k-DH-Graphs.	CSR	2010	DBLP DOI BibTeX RDF
1	Dmitry Itsykson	Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms.	CSR	2010	DBLP DOI BibTeX RDF
1	Gerold Jäger, Weixiong Zhang	A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem.	CSR	2010	DBLP DOI BibTeX RDF
1	Nathalie Aubrun, Marie-Pierre Béal	Sofic and Almost of Finite Type Tree-Shifts.	CSR	2010	DBLP DOI BibTeX RDF
1	Elena Kalinina	Prefix-Free and Prefix-Correct Complexities with Compound Conditions.	CSR	2010	DBLP DOI BibTeX RDF
1	Prabhakar Raghavan	The Quantitative Analysis of User Behavior Online - Data, Models and Algorithms.	CSR	2010	DBLP DOI BibTeX RDF
1	Benedikt Bollig, Loïc Hélouët	Realizability of Dynamic MSC Languages.	CSR	2010	DBLP DOI BibTeX RDF
1	Olivier Carton	Right-Sequential Functions on Infinite Words.	CSR	2010	DBLP DOI BibTeX RDF
1	Nazim Benaïssa, Dominique Méry	Proof-Based Design of Security Protocols.	CSR	2010	DBLP DOI BibTeX RDF
1	Avraham Trakhtman	A Partially Synchronizing Coloring.	CSR	2010	DBLP DOI BibTeX RDF
1	Mikhail V. Berlinkov	Approximating the Minimum Length of Synchronizing Words Is Hard.	CSR	2010	DBLP DOI BibTeX RDF
1	Nikolay K. Vereshchagin	An Encoding Invariant Version of Polynomial Time Computable Distributions.	CSR	2010	DBLP DOI BibTeX RDF
1	Victor Y. Pan, Guoliang Qian, Ailong Zheng	Advancing Matrix Computations with Randomized Preprocessing.	CSR	2010	DBLP DOI BibTeX RDF
1	Bernhard Heinemann	The Cantor Space as a Generic Model of Topologically Presented Knowledge.	CSR	2010	DBLP DOI BibTeX RDF
1	Susanne Albers	Algorithms for Energy Management.	CSR	2010	DBLP DOI BibTeX RDF
1	Thomas Brihaye, Véronique Bruyère, Julie De Pril	Equilibria in Quantitative Reachability Games.	CSR	2010	DBLP DOI BibTeX RDF
1	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
1	James Gate, Iain A. Stewart	Frameworks for Logically Classifying Polynomial-Time Optimisation Problems.	CSR	2010	DBLP DOI BibTeX RDF
1	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
1	Magnus Wahlström	New Plain-Exponential Time Classes for Graph Homomorphism.	CSR	2009	DBLP DOI BibTeX RDF
1	Arnon Avron, Agata Ciabattoni, Anna Zamansky	Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism.	CSR	2009	DBLP DOI BibTeX RDF
1	Kristoffer Arnsfelt Hansen	Depth Reduction for Circuits with a Single Layer of Modular Counting Gates.	CSR	2009	DBLP DOI BibTeX RDF
1	Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko	Complete Complexity Classification of Short Shop Scheduling.	CSR	2009	DBLP DOI BibTeX RDF
1	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
1	Olaf Beyersdorff, Zenon Sadowski	Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes.	CSR	2009	DBLP DOI BibTeX RDF
1	Wolfgang Thomas	The Reachability Problem over Infinite Graphs.	CSR	2009	DBLP DOI BibTeX RDF
1	Yuri Pritykin, Julya Ulyashkina	Aperiodicity Measure for Infinite Sequences.	CSR	2009	DBLP DOI BibTeX RDF
1	Chris Calabro, Ramamohan Paturi	k-SAT Is No Harder Than Decision-Unique-k-SAT.	CSR	2009	DBLP DOI BibTeX RDF	unique satisfiability, independent set, quantified Boolean formulas, hitting set, k-SAT, exponential complexity
1	Mark A. Hillebrand, Sergey Tverdyshev	Formal Verification of Gate-Level Computer Systems.	CSR	2009	DBLP DOI BibTeX RDF
1	Abuzer Yakaryilmaz, A. C. Cem Say	Languages Recognized with Unbounded Error by Quantum Finite Automata.	CSR	2009	DBLP DOI BibTeX RDF
1	Neeldhara Misra, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar	The Budgeted Unique Coverage Problem and Color-Coding.	CSR	2009	DBLP DOI BibTeX RDF
1	Maurice J. Jansen	Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials.	CSR	2009	DBLP DOI BibTeX RDF	elementary symmetric polynomial, Computational complexity, determinant, arithmetical circuits, permanent
1	Pedro Cabalar, Sergei P. Odintsov, David Pearce 0001	Well-Founded and Partial Stable Semantics Logical Aspects.	CSR	2009	DBLP DOI BibTeX RDF	partial stable models, equilibrium logic, partial equilibrium logic, well-founded semantics
1	Dogan Kesdogan, Daniel Mölle, Stefan Richter 0001, Peter Rossmanith	Breaking Anonymity by Learning a Unique Minimum Hitting Set.	CSR	2009	DBLP DOI BibTeX RDF
1	Yi Deng 0002, Giovanni Di Crescenzo, Dongdai Lin, Dengguo Feng	Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model.	CSR	2009	DBLP DOI BibTeX RDF
1	B. V. Raghavendra Rao, Jayalal Sarma	On the Complexity of Matroid Isomorphism Problems.	CSR	2009	DBLP DOI BibTeX RDF
1	Dmitry Itsykson	Structural Complexity of AvgBPP.	CSR	2009	DBLP DOI BibTeX RDF
1	Ely Porat	An Optimal Bloom Filter Replacement Based on Matrix Solving.	CSR	2009	DBLP DOI BibTeX RDF
1	Peter Jonsson, Johan Thapper	Approximability of the Maximum Solution Problem for Certain Families of Algebras.	CSR	2009	DBLP DOI BibTeX RDF	computational complexity, approximability, Optimisation, constraint satisfaction, algebra
1	Niko Haubold, Markus Lohrey	Compressed Word Problems in HNN-Extensions and Amalgamated Products.	CSR	2009	DBLP DOI BibTeX RDF
1	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
1	Christian Choffrut, Juhani Karhumäki	Unique Decipherability in the Monoid of Languages: An Application of Rational Relations.	CSR	2009	DBLP DOI BibTeX RDF	Unique decipherability, finite automata, regular languages
1	Edward A. Hirsch, Sergey I. Nikolenko	A Feebly Secure Trapdoor Function.	CSR	2009	DBLP DOI BibTeX RDF
1	Artur Jez, Alexander Okhotin	One-Nonterminal Conjunctive Grammars over a Unary Alphabet.	CSR	2009	DBLP DOI BibTeX RDF
1	Maurice J. Jansen, B. V. Raghavendra Rao	Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity.	CSR	2009	DBLP DOI BibTeX RDF
1	Galina Jirásková	Concatenation of Regular Languages and Descriptional Complexity.	CSR	2009	DBLP DOI BibTeX RDF
1	Tommy Färnqvist, Peter Jonsson, Johan Thapper	Approximability Distance in the Space of H-Colourability Problems.	CSR	2009	DBLP DOI BibTeX RDF	graph H-colouring, computational complexity, approximability, optimisation, graph homomorphism
1	Daniil Musatov, Andrei E. Romashchenko, Alexander Shen	Variations on Muchnik's Conditional Complexity Theorem.	CSR	2009	DBLP DOI BibTeX RDF
1	Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger	Partitioning Graphs into Connected Parts.	CSR	2009	DBLP DOI BibTeX RDF
1	Hongseok Yang	Automatic Verification of Heap-Manipulating Programs Using Separation Logic.	CSR	2009	DBLP DOI BibTeX RDF
1	Nikolay K. Vereshchagin	Kolmogorov Complexity and Model Selection.	CSR	2009	DBLP DOI BibTeX RDF
1	Mikhail N. Vyalyi	On Models of a Nondeterministic Computation.	CSR	2009	DBLP DOI BibTeX RDF	language, nondeterminism, automaton, complexity class
1	Andreas Goerdt	On Random Ordering Constraints.	CSR	2009	DBLP DOI BibTeX RDF	random structures, Algorithms, logic, probabilistic analysis, ordering
1	Zurab Khasidashvili	On Formal Equivalence Verification of Hardware.	CSR	2008	DBLP DOI BibTeX RDF
1	Sergei N. Artëmov, Elena Nogina	Topological Semantics of Justification Logic.	CSR	2008	DBLP DOI BibTeX RDF	Justification Logic, Logic of Proofs, topological semantics, Tarski, modal logic
1	Limsoon Wong	Manifestation and Exploitation of Invariants in Bioinformatics.	CSR	2008	DBLP DOI BibTeX RDF
1	Denis Osin, Vladimir Shpilrain	Public Key Encryption and Encryption Emulation Attacks.	CSR	2008	DBLP DOI BibTeX RDF
1	Vikraman Arvind, Bireswar Das, Johannes Köbler	A Logspace Algorithm for Partial 2-Tree Canonization.	CSR	2008	DBLP DOI BibTeX RDF
1	Maxime Rebout, Louis Féraud, Sergei Soloviev 0001	A Unified Categorical Approach for Attributed Graph Rewriting.	CSR	2008	DBLP DOI BibTeX RDF
1	Uri Zwick	Simple Stochastic Games, Mean Payoff Games, Parity Games.	CSR	2008	DBLP DOI BibTeX RDF
1	Dusko Pavlovic	Network as a Computer: Ranking Paths to Find Flows.	CSR	2008	DBLP DOI BibTeX RDF
1	Jirí Fiala 0001, Daniël Paulusma	Comparing Universal Covers in Polynomial Time.	CSR	2008	DBLP DOI BibTeX RDF

Publications at "CSR"( http://dblp.L3S.de/Venues/CSR )