Search results for "CSR"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Mozhgan Pourmoradnasseri, Dirk Oliver Theis	The (Minimum) Rank of Typical Fooling-Set Matrices.	CSR	2017	DBLP DOI BibTeX RDF
1	Gilad Kutiel	Approximation Algorithms for the Maximum Carpool Matching Problem.	CSR	2017	DBLP DOI BibTeX RDF
1	Kamil Khadiev, Aliya Khadieva	Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams.	CSR	2017	DBLP DOI BibTeX RDF
1	Ronitt Rubinfeld	Can We Locally Compute Sparse Connected Subgraphs?	CSR	2017	DBLP DOI BibTeX RDF
1	Marie-Pierre Béal, Pavel Heller	Generalized Dyck Shifts.	CSR	2017	DBLP DOI BibTeX RDF
1	Viliam Geffert	Unary Coded PSPACE-Complete Languages in ASPACE(loglog n).	CSR	2017	DBLP DOI BibTeX RDF
1	Michael Hochman, Pascal Vanier	Turing Degree Spectra of Minimal Subshifts.	CSR	2017	DBLP DOI BibTeX RDF
1	Alexei Miasnikov, Svetla Vassileva, Armin Weiß	The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in $${{\mathsf {T}}}{{\mathsf {C}}}^0$$.	CSR	2017	DBLP DOI BibTeX RDF
1	Pascal Weil (eds.)	Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings	CSR	2017	DBLP DOI BibTeX RDF
1	Alexey Milovanov	On Algorithmic Statistics for Space-Bounded Algorithms.	CSR	2017	DBLP DOI BibTeX RDF
1	Piotr Wojciechowski 0002, Ramaswamy Chandrasekaran, K. Subramani 0001	On a Generalization of Horn Constraint Systems.	CSR	2017	DBLP DOI BibTeX RDF
1	Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski	Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets.	CSR	2017	DBLP DOI BibTeX RDF
1	Maxim A. Babenko, Ignat I. Kolesnichenko, Ivan Smirnov	Cascade Heap: Towards Time-Optimal Extractions.	CSR	2017	DBLP DOI BibTeX RDF
1	Cornelius Brand, Marc Roth	Parameterized Counting of Trees, Forests and Matroid Bases.	CSR	2017	DBLP DOI BibTeX RDF
1	Meghana Nasre, Amit Rawat	Popularity in the Generalized Hospital Residents Setting.	CSR	2017	DBLP DOI BibTeX RDF
1	Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski	Palindromic Decompositions with Gaps and Errors.	CSR	2017	DBLP DOI BibTeX RDF
1	Dmitry Sokolov 0001	Dag-Like Communication and Its Applications.	CSR	2017	DBLP DOI BibTeX RDF
1	Chris Köcher, Dietrich Kuske	The Transformation Monoid of a Partially Lossy Queue.	CSR	2017	DBLP DOI BibTeX RDF
1	Thierry Coquand	Type Theory and Formalisation of Mathematics.	CSR	2017	DBLP DOI BibTeX RDF
1	Oleg Verbitsky 0001, Maksim Zhukovskii	The Descriptive Complexity of Subgraph Isomorphism Without Numerics.	CSR	2017	DBLP DOI BibTeX RDF
1	Alexander V. Seliverstov	On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition Problem.	CSR	2017	DBLP DOI BibTeX RDF
1	Alexander Okhotin, Kai Salomaa	Edit Distance Neighbourhoods of Input-Driven Pushdown Automata.	CSR	2017	DBLP DOI BibTeX RDF
1	Javier Esparza	Advances in Parameterized Verification of Population Protocols.	CSR	2017	DBLP DOI BibTeX RDF
1	Andrew McGregor 0001	Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs.	CSR	2017	DBLP DOI BibTeX RDF
1	Lukas Fleischer, Manfred Kufleitner	Green's Relations in Finite Transformation Semigroups.	CSR	2017	DBLP DOI BibTeX RDF
1	Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin	Online Bounded Analysis.	CSR	2016	DBLP DOI BibTeX RDF
1	Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer	The Next Whisky Bar.	CSR	2016	DBLP DOI BibTeX RDF
1	Alexander Kozachinskiy	On Slepian-Wolf Theorem with Interaction.	CSR	2016	DBLP DOI BibTeX RDF
1	Andris Ambainis, Krisjanis Prusis, Jevgenijs Vihrovs	Sensitivity Versus Certificate Complexity of Boolean Functions.	CSR	2016	DBLP DOI BibTeX RDF
1	Manfred Kufleitner, Jan Philipp Wächter	The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy - (Extended Abstract).	CSR	2016	DBLP DOI BibTeX RDF
1	René van Bevern, Vincent Froese, Christian Komusiewicz	Parameterizing Edge Modification Problems Above Lower Bounds.	CSR	2016	DBLP DOI BibTeX RDF
1	Manuel Bodirsky, Marcello Mamino	Max-Closed Semilinear Constraint Satisfaction.	CSR	2016	DBLP DOI BibTeX RDF
1	Alexey Milovanov	Algorithmic Statistics: Normal Objects and Universal Models.	CSR	2016	DBLP DOI BibTeX RDF
1	Hing Yin Tsang, Ning Xie 0002, Shengyu Zhang 0002	Fourier Sparsity of GF(2) Polynomials.	CSR	2016	DBLP DOI BibTeX RDF
1	Alejandro Díaz-Caro, Abuzer Yakaryilmaz	Affine Computation and Affine Automaton.	CSR	2016	DBLP DOI BibTeX RDF
1	Patricia Bouyer, Thomas Brihaye, Pierre Carlier, Quentin Menet	Compositional Design of Stochastic Timed Automata.	CSR	2016	DBLP DOI BibTeX RDF
1	René van Bevern, Artem V. Pyatkin	Completing Partial Schedules for Open Shop with Unit Processing Times and Routing.	CSR	2016	DBLP DOI BibTeX RDF
1	Toshihiro Fujito, Tomoaki Shimoda	On Approximating (Connected) 2-Edge Dominating Set by a Tree.	CSR	2016	DBLP DOI BibTeX RDF
1	Alexander Okhotin	The Hardest Language for Conjunctive Grammars.	CSR	2016	DBLP DOI BibTeX RDF
1	Katerina Böhmová, Matús Mihalák, Tobias Pröger, Gustavo Sacomoto, Marie-France Sagot	Computing and Listing st-Paths in Public Transportation Networks.	CSR	2016	DBLP DOI BibTeX RDF
1	Meena Mahajan, Anuj Tawari	Sums of Read-Once Formulas: How Many Summands Suffice?	CSR	2016	DBLP DOI BibTeX RDF
1	Orna Kupferman	On High-Quality Synthesis.	CSR	2016	DBLP DOI BibTeX RDF
1	Shankar Balachandran, Sajin Koroth	Subclasses of Baxter Permutations Based on Pattern Avoidance.	CSR	2016	DBLP DOI BibTeX RDF
1	Petr A. Golovach, George B. Mertzios	Graph Editing to a Given Degree Sequence.	CSR	2016	DBLP DOI BibTeX RDF
1	Partha Mukhopadhyay	Depth-4 Identity Testing and Noether's Normalization Lemma.	CSR	2016	DBLP DOI BibTeX RDF
1	Alexander Rabinovich	On Expressive Power of Regular Expressions over Infinite Orders.	CSR	2016	DBLP DOI BibTeX RDF
1	Laurent Bartholdi	Algorithmic Decidability of Engel's Property for Automaton Groups.	CSR	2016	DBLP DOI BibTeX RDF
1	Zeev Nutov	Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems.	CSR	2016	DBLP DOI BibTeX RDF
1	Daniel Moeller, Ramamohan Paturi, Stefan Schneider 0003	Subquadratic Algorithms for Succinct Stable Matching.	CSR	2016	DBLP DOI BibTeX RDF
1	Meena Mahajan, Nitin Saurabh	Some Complete and Intermediate Polynomials in Algebraic Complexity Theory.	CSR	2016	DBLP DOI BibTeX RDF
1	Manfred Kufleitner, Tobias Walter	Level Two of the Quantifier Alternation Hierarchy over Infinite Words.	CSR	2016	DBLP DOI BibTeX RDF
1	Tim Smith	Prediction of Infinite Words with Automata.	CSR	2016	DBLP DOI BibTeX RDF
1	Victor Y. Pan, Liang Zhao	Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions.	CSR	2016	DBLP DOI BibTeX RDF
1	Arno Pauly, Florian Steinberg 0001	Representations of Analytic Functions and Weihrauch Degrees.	CSR	2016	DBLP DOI BibTeX RDF
1	Alexander S. Kulikov, Gerhard J. Woeginger (eds.)	Computer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings	CSR	2016	DBLP DOI BibTeX RDF
1	Jozef Stefan Jirásek, Galina Jirásková, Alexander Szabari	Operations on Self-Verifying Finite Automata.	CSR	2015	DBLP DOI BibTeX RDF
1	Vincent Penelle	Rewriting Higher-Order Stack Trees.	CSR	2015	DBLP DOI BibTeX RDF
1	Florian Zuleger	Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems.	CSR	2015	DBLP DOI BibTeX RDF
1	Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva	Equations over Free Inverse Monoids with Idempotent Variables.	CSR	2015	DBLP DOI BibTeX RDF
1	Alexander Knop	Circuit Lower Bounds for Average-Case MA.	CSR	2015	DBLP DOI BibTeX RDF
1	Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos	Editing to a Planar Graph of Given Degrees.	CSR	2015	DBLP DOI BibTeX RDF
1	Martin Zimmermann 0002	Delay Games with WMSO+U Winning Conditions.	CSR	2015	DBLP DOI BibTeX RDF
1	Vladimir V. Podolskii	Circuit Complexity Meets Ontology-Based Data Access.	CSR	2015	DBLP DOI BibTeX RDF
1	Antonis Achilleos	NEXP-Completeness and Universal Hardness Results for Justification Logic.	CSR	2015	DBLP DOI BibTeX RDF
1	Christoph Benzmüller, Bruno Woltzenlogel Paleo	Interacting with Modal Logics in the Coq Proof Assistant.	CSR	2015	DBLP DOI BibTeX RDF
1	Simone Bova, Friedrich Slivovsky	On Compiling Structured CNFs to OBDDs.	CSR	2015	DBLP DOI BibTeX RDF
1	Manfred Droste, Vitaly Perevoshchikov	A Logical Characterization of Timed Pushdown Languages.	CSR	2015	DBLP DOI BibTeX RDF
1	Violetta Lonati, Dino Mandrioli, Federica Panella, Matteo Pradella	First-Order Logic Definability of Free Languages.	CSR	2015	DBLP DOI BibTeX RDF
1	Fairouz Kamareddine, Joe B. Wells, Daniel Lima Ventura	Automath Type Inclusion in Barendregt's Cube.	CSR	2015	DBLP DOI BibTeX RDF
1	Marina I. Maslennikova, Emanuele Rodaro	Representation of (Left) Ideal Regular Languages by Synchronizing Automata.	CSR	2015	DBLP DOI BibTeX RDF
1	Alexey Milovanov	Some Properties of Antistochastic Strings.	CSR	2015	DBLP DOI BibTeX RDF
1	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
1	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
1	Mateus de Oliveira Oliveira	On the Satisfiability of Quantum Circuits of Small Treewidth.	CSR	2015	DBLP DOI BibTeX RDF
1	Lev D. Beklemishev, Daniil V. Musatov (eds.)	Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings	CSR	2015	DBLP DOI BibTeX RDF
1	Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela	On Growth and Fluctuation of k-Abelian Complexity.	CSR	2015	DBLP DOI BibTeX RDF
1	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
1	Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey	Satisfiability of ECTL* with Tree Constraints.	CSR	2015	DBLP DOI BibTeX RDF
1	Dmitry Itsykson, Mikhail Slabodkin, Dmitry Sokolov 0001	Resolution Complexity of Perfect Matching Principles for Sparse Graphs.	CSR	2015	DBLP DOI BibTeX RDF
1	Alexander Kozachinskiy	Making Randomness Public in Unbounded-Round Information Complexity.	CSR	2015	DBLP DOI BibTeX RDF
1	N. S. Narayanaswamy, C. S. Rahul 0001	Approximation and Exact Algorithms for Special Cases of Connected f-Factors.	CSR	2015	DBLP DOI BibTeX RDF
1	Sam Buss	Propositional Proofs in Frege and Extended Frege Systems (Abstract).	CSR	2015	DBLP DOI BibTeX RDF
1	Mikhail Barash, Alexander Okhotin	Generalized LR Parsing for Grammars with Contexts.	CSR	2015	DBLP DOI BibTeX RDF
1	Lukas Fleischer, Manfred Kufleitner, Alexander Lauser	Block Products and Nesting Negations in FO2.	CSR	2014	DBLP DOI BibTeX RDF
1	Konrad W. Schwerdtfeger	The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits.	CSR	2014	DBLP DOI BibTeX RDF
1	Martin Fürer, Huiwen Yu	Space Saving by Dynamic Algebraization.	CSR	2014	DBLP DOI BibTeX RDF
1	Stefan Edelkamp, Armin Weiß	QuickXsort: Efficient Sorting with n logn - 1.399n + o(n) Comparisons on Average.	CSR	2014	DBLP DOI BibTeX RDF
1	Alexei L. Semenov, Sergey Soprunov, Vladimir A. Uspensky	The Lattice of Definability. Origins, Recent Developments, and Further Directions.	CSR	2014	DBLP DOI BibTeX RDF
1	Jazmín Romero, Alejandro López-Ortiz	A Parameterized Algorithm for Packing Overlapping Subgraphs.	CSR	2014	DBLP DOI BibTeX RDF
1	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
1	Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry	Separation Logic with One Quantified Variable.	CSR	2014	DBLP DOI BibTeX RDF
1	Jenish C. Mehta	Dynamic Complexity of Planar 3-Connected Graph Isomorphism.	CSR	2014	DBLP DOI BibTeX RDF
1	Max Rabkin	Recognizing Two-Sided Contexts in Cubic Time.	CSR	2014	DBLP DOI BibTeX RDF
1	Rupam Acharyya, Sourav Chakraborty 0001, Nitesh Jha	Counting Popular Matchings in House Allocation Problems.	CSR	2014	DBLP DOI BibTeX RDF
1	Markus Lohrey, Manfred Schmidt-Schauß	Processing Succinct Matrices and Vectors.	CSR	2014	DBLP DOI BibTeX RDF
1	Martin Grohe	Algorithmic Meta Theorems for Sparse Graph Classes.	CSR	2014	DBLP DOI BibTeX RDF
1	Akinori Kawachi, Benjamin Rossman, Osamu Watanabe 0001	The Query Complexity of Witness Finding.	CSR	2014	DBLP DOI BibTeX RDF
1	Pawel Parys	First-Order Logic on CPDA Graphs.	CSR	2014	DBLP DOI BibTeX RDF
1	Sanjay Jain 0001, Bakhadyr Khoussainov, Frank Stephan 0001, Dan Teng, Siyuan Zou	Semiautomatic Structures.	CSR	2014	DBLP DOI BibTeX RDF
1	Vladimir N. Krupski	Primal Implication as Encryption.	CSR	2014	DBLP DOI BibTeX RDF

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