Search results for "CSR"

Hits ?▲	Authors	Title	Venue	Year	Link
35	Simone Bova, Friedrich Slivovsky	On Compiling Structured CNFs to OBDDs.	CSR	2015	DBLP DOI BibTeX RDF
35	Manfred Droste, Vitaly Perevoshchikov	A Logical Characterization of Timed Pushdown Languages.	CSR	2015	DBLP DOI BibTeX RDF
35	Violetta Lonati, Dino Mandrioli, Federica Panella, Matteo Pradella	First-Order Logic Definability of Free Languages.	CSR	2015	DBLP DOI BibTeX RDF
35	Fairouz Kamareddine, Joe B. Wells, Daniel Lima Ventura	Automath Type Inclusion in Barendregt's Cube.	CSR	2015	DBLP DOI BibTeX RDF
35	Marina I. Maslennikova, Emanuele Rodaro	Representation of (Left) Ideal Regular Languages by Synchronizing Automata.	CSR	2015	DBLP DOI BibTeX RDF
35	Alexey Milovanov	Some Properties of Antistochastic Strings.	CSR	2015	DBLP DOI BibTeX RDF
35	Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen	An In-Place Priority Queue with O(1) Time for Push and lg n + O ( 1 ) Comparisons for Pop.	CSR	2015	DBLP DOI BibTeX RDF
35	Nathann Cohen, Daniel Gonçalves 0001, Eunjung Kim 0002, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller	A Polynomial-Time Algorithm for Outerplanar Diameter Improvement.	CSR	2015	DBLP DOI BibTeX RDF
35	Mateus de Oliveira Oliveira	On the Satisfiability of Quantum Circuits of Small Treewidth.	CSR	2015	DBLP DOI BibTeX RDF
35	Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela	On Growth and Fluctuation of k-Abelian Complexity.	CSR	2015	DBLP DOI BibTeX RDF
35	Maxim A. Babenko, Alexander V. Karzanov	A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes.	CSR	2015	DBLP DOI BibTeX RDF
35	Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey	Satisfiability of ECTL* with Tree Constraints.	CSR	2015	DBLP DOI BibTeX RDF
35	Dmitry Itsykson, Mikhail Slabodkin, Dmitry Sokolov 0001	Resolution Complexity of Perfect Matching Principles for Sparse Graphs.	CSR	2015	DBLP DOI BibTeX RDF
35	Alexander Kozachinskiy	Making Randomness Public in Unbounded-Round Information Complexity.	CSR	2015	DBLP DOI BibTeX RDF
35	N. S. Narayanaswamy, C. S. Rahul 0001	Approximation and Exact Algorithms for Special Cases of Connected f-Factors.	CSR	2015	DBLP DOI BibTeX RDF
35	Sam Buss	Propositional Proofs in Frege and Extended Frege Systems (Abstract).	CSR	2015	DBLP DOI BibTeX RDF
35	Mikhail Barash, Alexander Okhotin	Generalized LR Parsing for Grammars with Contexts.	CSR	2015	DBLP DOI BibTeX RDF
35	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	CSR	2014	DBLP DOI BibTeX RDF
35	Lukas Fleischer, Manfred Kufleitner, Alexander Lauser	Block Products and Nesting Negations in FO2.	CSR	2014	DBLP DOI BibTeX RDF
35	Konrad W. Schwerdtfeger	The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits.	CSR	2014	DBLP DOI BibTeX RDF
35	Martin Fürer, Huiwen Yu	Space Saving by Dynamic Algebraization.	CSR	2014	DBLP DOI BibTeX RDF
35	Stefan Edelkamp, Armin Weiß	QuickXsort: Efficient Sorting with n logn - 1.399n + o(n) Comparisons on Average.	CSR	2014	DBLP DOI BibTeX RDF
35	Alexei L. Semenov, Sergey Soprunov, Vladimir A. Uspensky	The Lattice of Definability. Origins, Recent Developments, and Further Directions.	CSR	2014	DBLP DOI BibTeX RDF
35	Jazmín Romero, Alejandro López-Ortiz	A Parameterized Algorithm for Packing Overlapping Subgraphs.	CSR	2014	DBLP DOI BibTeX RDF
35	Julia Schüler, Andreas Spillner 0001	Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles.	CSR	2014	DBLP DOI BibTeX RDF
35	Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry	Separation Logic with One Quantified Variable.	CSR	2014	DBLP DOI BibTeX RDF
35	Jenish C. Mehta	Dynamic Complexity of Planar 3-Connected Graph Isomorphism.	CSR	2014	DBLP DOI BibTeX RDF
35	Max Rabkin	Recognizing Two-Sided Contexts in Cubic Time.	CSR	2014	DBLP DOI BibTeX RDF
35	Rupam Acharyya, Sourav Chakraborty 0001, Nitesh Jha	Counting Popular Matchings in House Allocation Problems.	CSR	2014	DBLP DOI BibTeX RDF
35	Markus Lohrey, Manfred Schmidt-Schauß	Processing Succinct Matrices and Vectors.	CSR	2014	DBLP DOI BibTeX RDF
35	Martin Grohe	Algorithmic Meta Theorems for Sparse Graph Classes.	CSR	2014	DBLP DOI BibTeX RDF
35	Akinori Kawachi, Benjamin Rossman, Osamu Watanabe 0001	The Query Complexity of Witness Finding.	CSR	2014	DBLP DOI BibTeX RDF
35	Pawel Parys	First-Order Logic on CPDA Graphs.	CSR	2014	DBLP DOI BibTeX RDF
35	Sanjay Jain 0001, Bakhadyr Khoussainov, Frank Stephan 0001, Dan Teng, Siyuan Zou	Semiautomatic Structures.	CSR	2014	DBLP DOI BibTeX RDF
35	Vladimir N. Krupski	Primal Implication as Encryption.	CSR	2014	DBLP DOI BibTeX RDF
35	Victor Y. Pan	Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions.	CSR	2014	DBLP DOI BibTeX RDF
35	Barnaby Martin, Juraj Stacho	Constraint Satisfaction with Counting Quantifiers 2.	CSR	2014	DBLP DOI BibTeX RDF
35	Magnus Gausdal Find	On the Complexity of Computing Two Nonlinearity Measures.	CSR	2014	DBLP DOI BibTeX RDF
35	Saeed Akhoondian Amiri, Ali Golshani, Stephan Kreutzer, Sebastian Siebertz	Vertex Disjoint Paths in Upward Planar Graphs.	CSR	2014	DBLP DOI BibTeX RDF
35	Abhishek Bhrushundi, Sourav Chakraborty 0001, Raghav Kulkarni	Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees.	CSR	2014	DBLP DOI BibTeX RDF
35	Milka Hutagalung, Martin Lange	Model Checking for String Problems.	CSR	2014	DBLP DOI BibTeX RDF
35	Martijn Baartse, Klaus Meer	Testing Low Degree Trigonometric Polynomials.	CSR	2014	DBLP DOI BibTeX RDF
35	Nikolay K. Vereshchagin	Randomized Communication Complexity of Approximating Kolmogorov Complexity.	CSR	2014	DBLP DOI BibTeX RDF
35	Volker Diekert, Artur Jez, Wojciech Plandowski	Finding All Solutions of Equations in Free Groups and Monoids with Involution.	CSR	2014	DBLP DOI BibTeX RDF
35	Henning Fernau, Juan Alberto Rodríguez-Velázquez	Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results.	CSR	2014	DBLP DOI BibTeX RDF
35	Vikraman Arvind, S. Raja 0001, A. V. Sreejith	On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains.	CSR	2014	DBLP DOI BibTeX RDF
35	Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk	A Fast Branching Algorithm for Cluster Vertex Deletion.	CSR	2014	DBLP DOI BibTeX RDF
35	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	CSR	2013	DBLP DOI BibTeX RDF
35	Nikolay K. Vereshchagin	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".	CSR	2013	DBLP DOI BibTeX RDF
35	David Janin	Overlapping Tile Automata.	CSR	2013	DBLP DOI BibTeX RDF
35	Andreas Fröhlich, Gergely Kovásznai, Armin Biere	More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding.	CSR	2013	DBLP DOI BibTeX RDF
35	Vladimir Nikishkin	Amortized Communication Complexity of an Equality Predicate.	CSR	2013	DBLP DOI BibTeX RDF
35	Gilles Dowek	Real Numbers, Chaos, and the Principle of a Bounded Density of Information.	CSR	2013	DBLP DOI BibTeX RDF
35	Florent R. Madelaine, Barnaby Martin	QCSP on Partially Reflexive Cycles - The Wavy Line of Tractability.	CSR	2013	DBLP DOI BibTeX RDF
35	Mikhail N. Vyalyi	Universality of Regular Realizability Problems.	CSR	2013	DBLP DOI BibTeX RDF
35	Nicolas Boria, Cécile Murat, Vangelis Th. Paschos	The Probabilistic Min Dominating Set Problem.	CSR	2013	DBLP DOI BibTeX RDF
35	Kshitij Bansal, Stéphane Demri	Model-Checking Bounded Multi-Pushdown Systems.	CSR	2013	DBLP DOI BibTeX RDF
35	Luke Friedman, Yixin Xu	Exponential Lower Bounds for Refuting Random Formulas Using Ordered Binary Decision Diagrams.	CSR	2013	DBLP DOI BibTeX RDF
35	Jozef Jirásek 0001, Galina Jirásková	Cyclic Shift on Prefix-Free Languages.	CSR	2013	DBLP DOI BibTeX RDF
35	Ryan Williams 0001	Towards NEXP versus BPP?	CSR	2013	DBLP DOI BibTeX RDF
35	Alexey Sorokin	Lower and Upper Bounds for the Length of Joins in the Lambek Calculus.	CSR	2013	DBLP DOI BibTeX RDF
35	Paul G. Spirakis, Panagiota N. Panagopoulou	Potential Functions in Strategic Games.	CSR	2013	DBLP DOI BibTeX RDF
35	Viliam Geffert, Zuzana Bednárová, Carlo Mereghetti, Beatrice Palano	Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height.	CSR	2013	DBLP DOI BibTeX RDF
35	Alexandr V. Kostochka, Matthew P. Yancey	On Coloring of Sparse Graphs.	CSR	2013	DBLP DOI BibTeX RDF
35	Pawel Gawrychowski	Alphabetic Minimax Trees in Linear Time.	CSR	2013	DBLP DOI BibTeX RDF
35	Abuzer Yakaryilmaz	Quantum Alternation.	CSR	2013	DBLP DOI BibTeX RDF
35	Pavel V. Martyugin	Careful Synchronization of Partial Automata with Restricted Alphabets.	CSR	2013	DBLP DOI BibTeX RDF
35	Sergey V. Avgustinovich, Svetlana Puzynina	Weak Abelian Periodicity of Infinite Words.	CSR	2013	DBLP DOI BibTeX RDF
35	Anton Makhlin	On the Encoding Invariance of Polynomial Time Computable Distribution Ensembles.	CSR	2013	DBLP DOI BibTeX RDF
35	Mario Szegedy	The Lovász Local Lemma - A Survey.	CSR	2013	DBLP DOI BibTeX RDF
35	Volker Diekert, Armin Weiß	QuickHeapsort: Modifications and Improved Analysis.	CSR	2013	DBLP DOI BibTeX RDF
35	Amaldev Manuel, Anca Muscholl, Gabriele Puppis	Walking on Data Words.	CSR	2013	DBLP DOI BibTeX RDF
35	Dmitry Itsykson, Vsevolod Oparin	Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP.	CSR	2013	DBLP DOI BibTeX RDF
35	Jeffrey O. Shallit	Decidability and Enumeration for Automatic Sequences: A Survey.	CSR	2013	DBLP DOI BibTeX RDF
35	Thomas Colcombet	Composition with Algebra at the Background - On a Question by Gurevich and Rabinovich on the Monadic Theory of Linear Orderings.	CSR	2013	DBLP DOI BibTeX RDF
35	Nicole Schweikardt	A Short Tutorial on Order-Invariant First-Order Logic.	CSR	2013	DBLP DOI BibTeX RDF
35	Abuzer Yakaryilmaz	One-Counter Verifiers for Decidable Languages.	CSR	2013	DBLP DOI BibTeX RDF
35	Timofey Stepanov	Random Selection in Few Rounds.	CSR	2013	DBLP DOI BibTeX RDF
35	Stefan S. Dantchev, Barnaby Martin	Parameterized Resolution with Bounded Conjunction.	CSR	2013	DBLP DOI BibTeX RDF
35	Romeo Rizzi, Stéphane Vialette	On Recognizing Words That Are Squares for the Shuffle Product.	CSR	2013	DBLP DOI BibTeX RDF
35	Sven De Felice, Cyril Nicaud	Random Generation of Deterministic Acyclic Automata Using the Recursive Method.	CSR	2013	DBLP DOI BibTeX RDF
35	Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein	Information Lower Bounds via Self-reducibility.	CSR	2013	DBLP DOI BibTeX RDF
35	Jirí Fiala 0001, Marek Tesar 0001	Dichotomy of the H-Quasi-Cover Problem.	CSR	2013	DBLP DOI BibTeX RDF
35	Klaus Jansen, Stefan Erich Julius Kraft	An Improved Knapsack Solver for Column Generation.	CSR	2013	DBLP DOI BibTeX RDF
35	Manfred Droste, Vitaly Perevoshchikov	Multi-weighted Automata and MSO Logic.	CSR	2013	DBLP DOI BibTeX RDF
35	Edward A. Hirsch, Juhani Karhumäki, Arto Lepistö, Michail Kh. Prilutskii (eds.)	Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings	CSR	2012	DBLP DOI BibTeX RDF
35	Maxim A. Babenko, Ivan Pouzyrevsky	Resilient Quicksort and Selection.	CSR	2012	DBLP DOI BibTeX RDF
35	Timo Jolivet, Jarkko Kari	Consistency of Multidimensional Combinatorial Substitutions.	CSR	2012	DBLP DOI BibTeX RDF
35	Stefan Dobrev, Evangelos Kranakis, Oscar Morales-Ponce, Milan Plzík	Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs.	CSR	2012	DBLP DOI BibTeX RDF
35	Christos A. Kapoutsis, Giovanni Pighizzini	Two-Way Automata Characterizations of L/poly versus NL.	CSR	2012	DBLP DOI BibTeX RDF
35	Michael Blondin, Pierre McKenzie	The Complexity of Intersecting Finite Automata Having Few Final States.	CSR	2012	DBLP DOI BibTeX RDF
35	Bernhard Heinemann	Characterizing Certain Topological Specifications.	CSR	2012	DBLP DOI BibTeX RDF
35	Ville Salo	A Characterization of Cellular Automata Generated by Idempotents on the Full Shift.	CSR	2012	DBLP DOI BibTeX RDF
35	Dmitry V. Chistikov	Checking Tests for Read-Once Functions over Arbitrary Bases.	CSR	2012	DBLP DOI BibTeX RDF
35	Eli Fox-Epstein, Danny Krizanc	The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs.	CSR	2012	DBLP DOI BibTeX RDF
35	Martin Dietzfelbinger, Michael Rink 0001	Towards Optimal Degree-Distributions for Left-Perfect Matchings in Random Bipartite Graphs.	CSR	2012	DBLP DOI BibTeX RDF
35	Evgeny Demenkov, Alexander S. Kulikov, Ivan Mihajlin, Hiroki Morizumi	Computing All MOD-Functions Simultaneously.	CSR	2012	DBLP DOI BibTeX RDF
35	Evgeny Demenkov	A Lower Bound on Circuit Complexity of Vector Function in U 2.	CSR	2012	DBLP DOI BibTeX RDF
35	Andreas Goerdt, Lutz Falke	Satisfiability Thresholds beyond k -XORSAT.	CSR	2012	DBLP DOI BibTeX RDF
35	Amr Elmasry, Jyrki Katajainen	Worst-Case Optimal Priority Queues via Extended Regular Counters.	CSR	2012	DBLP DOI BibTeX RDF