The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

URL (DBLP): http://dblp.uni-trier.de/db/conf/csr

Publication years (Num. hits)
2006 (68) 2007 (42) 2008 (40) 2009 (34) 2010 (39) 2011 (37) 2012 (30) 2013 (38) 2014 (30) 2015 (28) 2016 (30) 2017 (29) 2018 (28) 2019 (32)
Publication types (Num. hits)
inproceedings(491) proceedings(14)
Venues (Conferences, Journals, ...)
CSR(505)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 98 occurrences of 80 keywords

Results
Found 505 publication records. Showing 505 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Elena Arseneva, Prosenjit Bose, Jean-Lou De Carufel, Sander Verdonschot Reconstructing a Convex Polygon from Its \omega ω -cloud. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Shmuel Tomi Klein, Shoham Saadia, Dana Shapira Forward Looking Huffman Coding. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Denis K. Ponomaryov A Polynomial Time Delta-Decomposition Algorithm for Positive DNFs. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1René van Bevern, Gregory Kucherov (eds.) Computer Science - Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sergey M. Dudakov, Boris Karlov On Decidability of Regular Languages Theories. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Vladimir Braverman Approximations of Schatten Norms via Taylor Expansions. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Suthee Ruangwises, Toshiya Itoh AND Protocols Using only Uniform Shuffles. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ivan Koswara, Svetlana Selivanova, Martin Ziegler 0001 Computational Complexity of Real Powering and Improved Solving Linear Differential Equations. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Václav Blazej, Pavel Dvorák, Tomás Valla On Induced Online Ramsey Number of Paths, Cycles, and Trees. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pierre Guillon 0001, Emmanuel Jeandel, Jarkko Kari, Pascal Vanier Undecidable Word Problem in Subshift Automorphism Groups. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh 0001 On the Complexity of Mixed Dominating Set. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman Belga B-Trees. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ruhollah Majdoddin Uniform CSP Parameterized by Solution Size is in W[1]. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, Fahad Panolan, Saket Saurabh 0001 On the Parameterized Complexity of Edge-Linked Paths. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Kshitij Gajjar, Jaikumar Radhakrishnan Minimizing Branching Vertices in Distance-Preserving Subgraphs. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yousef M. Alhamdan, Alexander Kononov Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Francesco Dolce, Dominique Perrin Eventually Dendric Shifts. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ludmila Glinskih, Dmitry Itsykson On Tseitin Formulas, Read-Once Branching Programs and Treewidth. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman 0001 Parameterized Complexity of Conflict-Free Set Cover. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Moses Ganardi, Danny Hucke, Markus Lohrey Derandomization for Sliding Window Algorithms with Strict Correctness. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eric Allender, Rahul Ilango, Neekon Vafa The Non-hardness of Approximating Circuit Size. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ouri Poupko, Gal Shahaf, Ehud Shapiro, Nimrod Talmon Sybil-Resilient Conductance-Based Community Growth. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Svyatoslav Gryaznov Notes on Resolution over Linear Equations. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, Piyush Rathi The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Suthee Ruangwises, Toshiya Itoh Unpopularity Factor in the Marriage and Roommates Problems. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Bireswar Das, Shivdutt Sharma Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Elena A. Petrova, Arseny M. Shur Transition Property for Cube-Free Words. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Aleksandrs Belovs Quantum Algorithm for Distribution-Free Junta Testing. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Andreas Goerdt Matched Instances of Quantum Satisfiability (QSat) - Product State Solutions of Restrictions. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dmitry Kravchenko, Kamil Khadiev, Danil Serov On the Quantum and Classical Complexity of Solving Subtraction Games. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jan-Hendrik Lorenz On the Complexity of Restarting. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mahdi Belbasi, Martin Fürer A Space-Efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraization. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Artur Riazanov On the Decision Trees with Symmetries. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou Periodicity in Data Streams with Wildcards. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Giuseppe F. Italiano, Yannis Manoussakis, Nguyen Kim Thang, Hong Phong Pham Maximum Colorful Cycles in Vertex-Colored Graphs. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Genkin, Michael Kaminski, Liat Peterfreund Closure Under Reversal of Languages over Infinite Alphabets. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alexander A. Rubtsov, Mikhail N. Vyalyi On Emptiness and Membership Problems for Set Automata. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Niranka Banerjee, Venkatesh Raman 0001, Srinivasa Rao Satti Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dominik Wojtczak On Strong NP-Completeness of Rational Problems. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ning Xie, Shuai Xu, Yekun Xu A New Algorithm for Finding Closest Pair of Vectors (Extended Abstract). Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rahul Jain 0001, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs Quadratically Tight Relations for Randomized Query Complexity. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alexander S. Kulikov Lower Bounds for Unrestricted Boolean Circuits: Open Problems. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Etienne Moutot, Pascal Vanier Slopes of 3-Dimensional Subshifts of Finite Type. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sören Henning, Klaus Jansen, Malin Rau, Lars Schmarje Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman 0001 Structural Parameterizations of Dominating Set Variants. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber Grammar-Based Compression of Unranked Trees. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette The Clever Shopper Problem. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rajesh Chitnis, Nimrod Talmon Can We Create Large k-Cores by Adding Few Edges? Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pallavi Jain 0001, Lawqueen Kanesh, Pranabendu Misra Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michal Karpinski, Krzysztof Piecuch On Vertex Coloring Without Monochromatic Triangles. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1N. S. Narayanaswamy, Meghana Nasre, R. Vijayaragunathan Facility Location on Planar Graphs with Unreliable Links. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Viliam Geffert Complement for Two-Way Alternating Automata. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor 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 Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rajesh Chitnis, Andreas Emil Feldmann A Tight Lower Bound for Steiner Orientation. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michal Hospodár, Galina Jirásková, Ivana Krajnáková Operations on Boolean and Alternating Finite Automata. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alexander Kozachinskiy Recognizing Read-Once Functions from Depth-Three Formulas. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jayakrishnan Madathil, Saket Saurabh 0001, Meirav Zehavi Max-Cut Above Spanning Tree is Fixed-Parameter Tractable. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael E. Saks Online Labeling: Algorithms, Lower Bounds and Open Questions. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Vladimir Gurvich Complexity of Generation. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Leonid Barenboim, Victor Khazanov Distributed Symmetry-Breaking Algorithms for Congested Cliques. Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alexandru Gheorghiu, Theodoros Kapourniotis, Elham Kashefi Verification of Quantum Computation and the Price of Trust. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Thomas Place, Marc Zeitoun Concatenation Hierarchies: New Bottle, Old Wine. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Aida Gainutdinova, Abuzer Yakaryilmaz Nondeterministic Unitary OBDDs. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Elena Khramtcova, Maarten Löffler Dynamic Stabbing Queries with Sub-logarithmic Local Updates for Overlapping Intervals. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Mozhgan Pourmoradnasseri, Dirk Oliver Theis The (Minimum) Rank of Typical Fooling-Set Matrices. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Gilad Kutiel Approximation Algorithms for the Maximum Carpool Matching Problem. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Kamil Khadiev, Aliya Khadieva Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ronitt Rubinfeld Can We Locally Compute Sparse Connected Subgraphs? Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Marie-Pierre Béal, Pavel Heller Generalized Dyck Shifts. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Viliam Geffert Unary Coded PSPACE-Complete Languages in ASPACE(loglog n). Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michael Hochman, Pascal Vanier Turing Degree Spectra of Minimal Subshifts. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Alexei 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$$. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pascal Weil (eds.) Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Alexey Milovanov On Algorithmic Statistics for Space-Bounded Algorithms. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Piotr J. Wojciechowski, Ramaswamy Chandrasekaran, K. Subramani On a Generalization of Horn Constraint Systems. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Maxim A. Babenko, Ignat I. Kolesnichenko, Ivan Smirnov Cascade Heap: Towards Time-Optimal Extractions. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Cornelius Brand, Marc Roth Parameterized Counting of Trees, Forests and Matroid Bases. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Meghana Nasre, Amit Rawat Popularity in the Generalized Hospital Residents Setting. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski Palindromic Decompositions with Gaps and Errors. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dmitry Sokolov 0001 Dag-Like Communication and Its Applications. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Chris Köcher, Dietrich Kuske The Transformation Monoid of a Partially Lossy Queue. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Thierry Coquand Type Theory and Formalisation of Mathematics. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Oleg Verbitsky, Maksim Zhukovskii The Descriptive Complexity of Subgraph Isomorphism Without Numerics. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Alexander V. Seliverstov On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition Problem. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Alexander Okhotin, Kai Salomaa Edit Distance Neighbourhoods of Input-Driven Pushdown Automata. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Javier Esparza Advances in Parameterized Verification of Population Protocols. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Andrew McGregor 0001 Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Lukas Fleischer, Manfred Kufleitner Green's Relations in Finite Transformation Semigroups. Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin Online Bounded Analysis. Search on Bibsonomy CSR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer The Next Whisky Bar. Search on Bibsonomy CSR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Alexander Kozachinskiy On Slepian-Wolf Theorem with Interaction. Search on Bibsonomy CSR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Krisjanis Prusis, Jevgenijs Vihrovs Sensitivity Versus Certificate Complexity of Boolean Functions. Search on Bibsonomy CSR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Manfred Kufleitner, Jan Philipp Wächter The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy - (Extended Abstract). Search on Bibsonomy CSR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1René van Bevern, Vincent Froese, Christian Komusiewicz Parameterizing Edge Modification Problems Above Lower Bounds. Search on Bibsonomy CSR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Manuel Bodirsky, Marcello Mamino Max-Closed Semilinear Constraint Satisfaction. Search on Bibsonomy CSR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Alexey Milovanov Algorithmic Statistics: Normal Objects and Universal Models. Search on Bibsonomy CSR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Hing Yin Tsang, Ning Xie 0002, Shengyu Zhang Fourier Sparsity of GF(2) Polynomials. Search on Bibsonomy CSR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Alejandro Díaz-Caro, Abuzer Yakaryilmaz Affine Computation and Affine Automaton. Search on Bibsonomy CSR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Patricia Bouyer, Thomas Brihaye, Pierre Carlier, Quentin Menet Compositional Design of Stochastic Timed Automata. Search on Bibsonomy CSR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 505 (100 per page; Change: )
Pages: [1][2][3][4][5][6][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license