Search results for "CSR"

Hits ?▲	Authors	Title	Venue	Year	Link
35	Jan-Hendrik Lorenz	On the Complexity of Restarting.	CSR	2019	DBLP DOI BibTeX RDF
35	Mahdi Belbasi, Martin Fürer	A Space-Efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraization.	CSR	2019	DBLP DOI BibTeX RDF
35	Fedor V. Fomin, Vladimir V. Podolskii (eds.)	Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6-10, 2018, Proceedings	CSR	2018	DBLP DOI BibTeX RDF
35	Artur Riazanov	On the Decision Trees with Symmetries.	CSR	2018	DBLP DOI BibTeX RDF
35	Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou	Periodicity in Data Streams with Wildcards.	CSR	2018	DBLP DOI BibTeX RDF
35	Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham	Maximum Colorful Cycles in Vertex-Colored Graphs.	CSR	2018	DBLP DOI BibTeX RDF
35	Daniel Genkin, Michael Kaminski, Liat Peterfreund	Closure Under Reversal of Languages over Infinite Alphabets.	CSR	2018	DBLP DOI BibTeX RDF
35	Alexander A. Rubtsov, Mikhail N. Vyalyi	On Emptiness and Membership Problems for Set Automata.	CSR	2018	DBLP DOI BibTeX RDF
35	Niranka Banerjee, Venkatesh Raman 0001, Srinivasa Rao Satti	Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds.	CSR	2018	DBLP DOI BibTeX RDF
35	Dominik Wojtczak	On Strong NP-Completeness of Rational Problems.	CSR	2018	DBLP DOI BibTeX RDF
35	Ning Xie 0002, Shuai Xu, Yekun Xu	A New Algorithm for Finding Closest Pair of Vectors (Extended Abstract).	CSR	2018	DBLP DOI BibTeX RDF
35	Rahul Jain 0001, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs	Quadratically Tight Relations for Randomized Query Complexity.	CSR	2018	DBLP DOI BibTeX RDF
35	Alexander S. Kulikov	Lower Bounds for Unrestricted Boolean Circuits: Open Problems.	CSR	2018	DBLP DOI BibTeX RDF
35	Etienne Moutot, Pascal Vanier	Slopes of 3-Dimensional Subshifts of Finite Type.	CSR	2018	DBLP DOI BibTeX RDF
35	Sören Henning, Klaus Jansen, Malin Rau, Lars Schmarje	Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing.	CSR	2018	DBLP DOI BibTeX RDF
35	Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman 0001	Structural Parameterizations of Dominating Set Variants.	CSR	2018	DBLP DOI BibTeX RDF
35	Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber	Grammar-Based Compression of Unranked Trees.	CSR	2018	DBLP DOI BibTeX RDF
35	Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette	The Clever Shopper Problem.	CSR	2018	DBLP DOI BibTeX RDF
35	Rajesh Chitnis, Nimrod Talmon	Can We Create Large k-Cores by Adding Few Edges?	CSR	2018	DBLP DOI BibTeX RDF
35	Pallavi Jain 0001, Lawqueen Kanesh, Pranabendu Misra	Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized.	CSR	2018	DBLP DOI BibTeX RDF
35	Michal Karpinski, Krzysztof Piecuch	On Vertex Coloring Without Monochromatic Triangles.	CSR	2018	DBLP DOI BibTeX RDF
35	N. S. Narayanaswamy, Meghana Nasre, R. Vijayaragunathan	Facility Location on Planar Graphs with Unreliable Links.	CSR	2018	DBLP DOI BibTeX RDF
35	Viliam Geffert	Complement for Two-Way Alternating Automata.	CSR	2018	DBLP DOI BibTeX RDF
35	Rajesh Chitnis, Andreas Emil Feldmann	A Tight Lower Bound for Steiner Orientation.	CSR	2018	DBLP DOI BibTeX RDF
35	Michal Hospodár, Galina Jirásková, Ivana Krajnáková	Operations on Boolean and Alternating Finite Automata.	CSR	2018	DBLP DOI BibTeX RDF
35	Alexander Kozachinskiy	Recognizing Read-Once Functions from Depth-Three Formulas.	CSR	2018	DBLP DOI BibTeX RDF
35	Jayakrishnan Madathil, Saket Saurabh 0001, Meirav Zehavi	Max-Cut Above Spanning Tree is Fixed-Parameter Tractable.	CSR	2018	DBLP DOI BibTeX RDF
35	Michael E. Saks	Online Labeling: Algorithms, Lower Bounds and Open Questions.	CSR	2018	DBLP DOI BibTeX RDF
35	Vladimir Gurvich	Complexity of Generation.	CSR	2018	DBLP DOI BibTeX RDF
35	Leonid Barenboim, Victor Khazanov	Distributed Symmetry-Breaking Algorithms for Congested Cliques.	CSR	2018	DBLP DOI BibTeX RDF
35	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
35	Alexandru Gheorghiu, Theodoros Kapourniotis, Elham Kashefi	Verification of Quantum Computation and the Price of Trust.	CSR	2017	DBLP DOI BibTeX RDF
35	Thomas Place, Marc Zeitoun	Concatenation Hierarchies: New Bottle, Old Wine.	CSR	2017	DBLP DOI BibTeX RDF
35	Aida Gainutdinova, Abuzer Yakaryilmaz	Nondeterministic Unitary OBDDs.	CSR	2017	DBLP DOI BibTeX RDF
35	Elena Khramtcova, Maarten Löffler	Dynamic Stabbing Queries with Sub-logarithmic Local Updates for Overlapping Intervals.	CSR	2017	DBLP DOI BibTeX RDF
35	Mozhgan Pourmoradnasseri, Dirk Oliver Theis	The (Minimum) Rank of Typical Fooling-Set Matrices.	CSR	2017	DBLP DOI BibTeX RDF
35	Gilad Kutiel	Approximation Algorithms for the Maximum Carpool Matching Problem.	CSR	2017	DBLP DOI BibTeX RDF
35	Kamil Khadiev, Aliya Khadieva	Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams.	CSR	2017	DBLP DOI BibTeX RDF
35	Ronitt Rubinfeld	Can We Locally Compute Sparse Connected Subgraphs?	CSR	2017	DBLP DOI BibTeX RDF
35	Marie-Pierre Béal, Pavel Heller	Generalized Dyck Shifts.	CSR	2017	DBLP DOI BibTeX RDF
35	Viliam Geffert	Unary Coded PSPACE-Complete Languages in ASPACE(loglog n).	CSR	2017	DBLP DOI BibTeX RDF
35	Michael Hochman, Pascal Vanier	Turing Degree Spectra of Minimal Subshifts.	CSR	2017	DBLP DOI BibTeX RDF
35	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
35	Alexey Milovanov	On Algorithmic Statistics for Space-Bounded Algorithms.	CSR	2017	DBLP DOI BibTeX RDF
35	Piotr Wojciechowski 0002, Ramaswamy Chandrasekaran, K. Subramani 0001	On a Generalization of Horn Constraint Systems.	CSR	2017	DBLP DOI BibTeX RDF
35	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
35	Maxim A. Babenko, Ignat I. Kolesnichenko, Ivan Smirnov	Cascade Heap: Towards Time-Optimal Extractions.	CSR	2017	DBLP DOI BibTeX RDF
35	Cornelius Brand, Marc Roth	Parameterized Counting of Trees, Forests and Matroid Bases.	CSR	2017	DBLP DOI BibTeX RDF
35	Meghana Nasre, Amit Rawat	Popularity in the Generalized Hospital Residents Setting.	CSR	2017	DBLP DOI BibTeX RDF
35	Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski	Palindromic Decompositions with Gaps and Errors.	CSR	2017	DBLP DOI BibTeX RDF
35	Dmitry Sokolov 0001	Dag-Like Communication and Its Applications.	CSR	2017	DBLP DOI BibTeX RDF
35	Chris Köcher, Dietrich Kuske	The Transformation Monoid of a Partially Lossy Queue.	CSR	2017	DBLP DOI BibTeX RDF
35	Thierry Coquand	Type Theory and Formalisation of Mathematics.	CSR	2017	DBLP DOI BibTeX RDF
35	Oleg Verbitsky 0001, Maksim Zhukovskii	The Descriptive Complexity of Subgraph Isomorphism Without Numerics.	CSR	2017	DBLP DOI BibTeX RDF
35	Alexander V. Seliverstov	On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition Problem.	CSR	2017	DBLP DOI BibTeX RDF
35	Alexander Okhotin, Kai Salomaa	Edit Distance Neighbourhoods of Input-Driven Pushdown Automata.	CSR	2017	DBLP DOI BibTeX RDF
35	Javier Esparza	Advances in Parameterized Verification of Population Protocols.	CSR	2017	DBLP DOI BibTeX RDF
35	Andrew McGregor 0001	Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs.	CSR	2017	DBLP DOI BibTeX RDF
35	Lukas Fleischer, Manfred Kufleitner	Green's Relations in Finite Transformation Semigroups.	CSR	2017	DBLP DOI BibTeX RDF
35	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
35	Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin	Online Bounded Analysis.	CSR	2016	DBLP DOI BibTeX RDF
35	Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer	The Next Whisky Bar.	CSR	2016	DBLP DOI BibTeX RDF
35	Alexander Kozachinskiy	On Slepian-Wolf Theorem with Interaction.	CSR	2016	DBLP DOI BibTeX RDF
35	Andris Ambainis, Krisjanis Prusis, Jevgenijs Vihrovs	Sensitivity Versus Certificate Complexity of Boolean Functions.	CSR	2016	DBLP DOI BibTeX RDF
35	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
35	René van Bevern, Vincent Froese, Christian Komusiewicz	Parameterizing Edge Modification Problems Above Lower Bounds.	CSR	2016	DBLP DOI BibTeX RDF
35	Manuel Bodirsky, Marcello Mamino	Max-Closed Semilinear Constraint Satisfaction.	CSR	2016	DBLP DOI BibTeX RDF
35	Alexey Milovanov	Algorithmic Statistics: Normal Objects and Universal Models.	CSR	2016	DBLP DOI BibTeX RDF
35	Hing Yin Tsang, Ning Xie 0002, Shengyu Zhang 0002	Fourier Sparsity of GF(2) Polynomials.	CSR	2016	DBLP DOI BibTeX RDF
35	Alejandro Díaz-Caro, Abuzer Yakaryilmaz	Affine Computation and Affine Automaton.	CSR	2016	DBLP DOI BibTeX RDF
35	Patricia Bouyer, Thomas Brihaye, Pierre Carlier, Quentin Menet	Compositional Design of Stochastic Timed Automata.	CSR	2016	DBLP DOI BibTeX RDF
35	René van Bevern, Artem V. Pyatkin	Completing Partial Schedules for Open Shop with Unit Processing Times and Routing.	CSR	2016	DBLP DOI BibTeX RDF
35	Toshihiro Fujito, Tomoaki Shimoda	On Approximating (Connected) 2-Edge Dominating Set by a Tree.	CSR	2016	DBLP DOI BibTeX RDF
35	Alexander Okhotin	The Hardest Language for Conjunctive Grammars.	CSR	2016	DBLP DOI BibTeX RDF
35	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
35	Meena Mahajan, Anuj Tawari	Sums of Read-Once Formulas: How Many Summands Suffice?	CSR	2016	DBLP DOI BibTeX RDF
35	Orna Kupferman	On High-Quality Synthesis.	CSR	2016	DBLP DOI BibTeX RDF
35	Shankar Balachandran, Sajin Koroth	Subclasses of Baxter Permutations Based on Pattern Avoidance.	CSR	2016	DBLP DOI BibTeX RDF
35	Petr A. Golovach, George B. Mertzios	Graph Editing to a Given Degree Sequence.	CSR	2016	DBLP DOI BibTeX RDF
35	Partha Mukhopadhyay	Depth-4 Identity Testing and Noether's Normalization Lemma.	CSR	2016	DBLP DOI BibTeX RDF
35	Alexander Rabinovich	On Expressive Power of Regular Expressions over Infinite Orders.	CSR	2016	DBLP DOI BibTeX RDF
35	Laurent Bartholdi	Algorithmic Decidability of Engel's Property for Automaton Groups.	CSR	2016	DBLP DOI BibTeX RDF
35	Zeev Nutov	Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems.	CSR	2016	DBLP DOI BibTeX RDF
35	Daniel Moeller, Ramamohan Paturi, Stefan Schneider 0003	Subquadratic Algorithms for Succinct Stable Matching.	CSR	2016	DBLP DOI BibTeX RDF
35	Meena Mahajan, Nitin Saurabh	Some Complete and Intermediate Polynomials in Algebraic Complexity Theory.	CSR	2016	DBLP DOI BibTeX RDF
35	Manfred Kufleitner, Tobias Walter	Level Two of the Quantifier Alternation Hierarchy over Infinite Words.	CSR	2016	DBLP DOI BibTeX RDF
35	Tim Smith	Prediction of Infinite Words with Automata.	CSR	2016	DBLP DOI BibTeX RDF
35	Victor Y. Pan, Liang Zhao	Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions.	CSR	2016	DBLP DOI BibTeX RDF
35	Arno Pauly, Florian Steinberg 0001	Representations of Analytic Functions and Weihrauch Degrees.	CSR	2016	DBLP DOI BibTeX RDF
35	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
35	Jozef Stefan Jirásek, Galina Jirásková, Alexander Szabari	Operations on Self-Verifying Finite Automata.	CSR	2015	DBLP DOI BibTeX RDF
35	Vincent Penelle	Rewriting Higher-Order Stack Trees.	CSR	2015	DBLP DOI BibTeX RDF
35	Florian Zuleger	Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems.	CSR	2015	DBLP DOI BibTeX RDF
35	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
35	Alexander Knop	Circuit Lower Bounds for Average-Case MA.	CSR	2015	DBLP DOI BibTeX RDF
35	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
35	Martin Zimmermann 0002	Delay Games with WMSO+U Winning Conditions.	CSR	2015	DBLP DOI BibTeX RDF
35	Vladimir V. Podolskii	Circuit Complexity Meets Ontology-Based Data Access.	CSR	2015	DBLP DOI BibTeX RDF
35	Antonis Achilleos	NEXP-Completeness and Universal Hardness Results for Justification Logic.	CSR	2015	DBLP DOI BibTeX RDF
35	Christoph Benzmüller, Bruno Woltzenlogel Paleo	Interacting with Modal Logics in the Coq Proof Assistant.	CSR	2015	DBLP DOI BibTeX RDF