default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCSR 2014: Moscow, Russia
- Edward A. Hirsch, Sergei O. Kuznetsov, Jean-Éric Pin, Nikolay K. Vereshchagin:
Computer Science - Theory and Applications - 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings. Lecture Notes in Computer Science 8476, Springer 2014, ISBN 978-3-319-06685-1 - Volker Diekert, Artur Jez
, Wojciech Plandowski:
Finding All Solutions of Equations in Free Groups and Monoids with Involution. 1-15 - Martin Grohe:
Algorithmic Meta Theorems for Sparse Graph Classes. 16-22 - Alexei L. Semenov, Sergey Soprunov, Vladimir A. Uspensky:
The Lattice of Definability. Origins, Recent Developments, and Further Directions. 23-38 - Rupam Acharyya, Sourav Chakraborty, Nitesh Jha:
Counting Popular Matchings in House Allocation Problems. 39-51 - Saeed Akhoondian Amiri, Ali Golshani, Stephan Kreutzer, Sebastian Siebertz:
Vertex Disjoint Paths in Upward Planar Graphs. 52-64 - Vikraman Arvind, S. Raja, A. V. Sreejith:
On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains. 65-76 - Martijn Baartse, Klaus Meer:
Testing Low Degree Trigonometric Polynomials. 77-96 - Abhishek Bhrushundi, Sourav Chakraborty, Raghav Kulkarni:
Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees. 97-110 - Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk:
A Fast Branching Algorithm for Cluster Vertex Deletion. 111-124 - Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry:
Separation Logic with One Quantified Variable. 125-138 - Stefan Edelkamp, Armin Weiß:
QuickXsort: Efficient Sorting with n logn - 1.399n + o(n) Comparisons on Average. 139-152 - Henning Fernau, Juan Alberto Rodríguez-Velázquez:
Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results. 153-166 - Magnus Gausdal Find:
On the Complexity of Computing Two Nonlinearity Measures. 167-175 - Lukas Fleischer, Manfred Kufleitner, Alexander Lauser:
Block Products and Nesting Negations in FO2. 176-189 - Milka Hutagalung, Martin Lange:
Model Checking for String Problems. 190-203 - Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan, Dan Teng, Siyuan Zou:
Semiautomatic Structures. 204-217 - Akinori Kawachi, Benjamin Rossman, Osamu Watanabe:
The Query Complexity of Witness Finding. 218-231 - Vladimir N. Krupski:
Primal Implication as Encryption. 232-244 - Markus Lohrey, Manfred Schmidt-Schauß:
Processing Succinct Matrices and Vectors. 245-258 - Barnaby Martin, Juraj Stacho:
Constraint Satisfaction with Counting Quantifiers 2. 259-272 - Jenish C. Mehta:
Dynamic Complexity of Planar 3-Connected Graph Isomorphism. 273-286 - Victor Y. Pan:
Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions. 287-299 - Pawel Parys:
First-Order Logic on CPDA Graphs. 300-313 - Max Rabkin:
Recognizing Two-Sided Contexts in Cubic Time. 314-324 - Jazmín Romero, Alejandro López-Ortiz:
A Parameterized Algorithm for Packing Overlapping Subgraphs. 325-336 - Julia Schüler, Andreas Spillner:
Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles. 337-350 - Konrad W. Schwerdtfeger:
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits. 351-364 - Nikolay K. Vereshchagin:
Randomized Communication Complexity of Approximating Kolmogorov Complexity. 365-374 - Martin Fürer, Huiwen Yu:
Space Saving by Dynamic Algebraization. 375-388
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 01:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
