Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Victor Y. Pan |
Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions. |
CSR |
2014 |
DBLP DOI BibTeX RDF |
|
1 | 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 |
|
1 | Barnaby Martin, Juraj Stacho |
Constraint Satisfaction with Counting Quantifiers 2. |
CSR |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Magnus Gausdal Find |
On the Complexity of Computing Two Nonlinearity Measures. |
CSR |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Saeed Akhoondian Amiri, Ali Golshani, Stephan Kreutzer, Sebastian Siebertz |
Vertex Disjoint Paths in Upward Planar Graphs. |
CSR |
2014 |
DBLP DOI BibTeX RDF |
|
1 | 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 |
|
1 | Milka Hutagalung, Martin Lange |
Model Checking for String Problems. |
CSR |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Martijn Baartse, Klaus Meer |
Testing Low Degree Trigonometric Polynomials. |
CSR |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Nikolay K. Vereshchagin |
Randomized Communication Complexity of Approximating Kolmogorov Complexity. |
CSR |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Volker Diekert, Artur Jez, Wojciech Plandowski |
Finding All Solutions of Equations in Free Groups and Monoids with Involution. |
CSR |
2014 |
DBLP DOI BibTeX RDF |
|
1 | 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 |
|
1 | 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 |
|
1 | Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk |
A Fast Branching Algorithm for Cluster Vertex Deletion. |
CSR |
2014 |
DBLP DOI BibTeX RDF |
|
1 | 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 |
|
1 | David Janin |
Overlapping Tile Automata. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | 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 |
|
1 | Vladimir Nikishkin |
Amortized Communication Complexity of an Equality Predicate. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Gilles Dowek |
Real Numbers, Chaos, and the Principle of a Bounded Density of Information. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Florent R. Madelaine, Barnaby Martin |
QCSP on Partially Reflexive Cycles - The Wavy Line of Tractability. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Mikhail N. Vyalyi |
Universality of Regular Realizability Problems. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Nicolas Boria, Cécile Murat, Vangelis Th. Paschos |
The Probabilistic Min Dominating Set Problem. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Kshitij Bansal, Stéphane Demri |
Model-Checking Bounded Multi-Pushdown Systems. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Luke Friedman, Yixin Xu |
Exponential Lower Bounds for Refuting Random Formulas Using Ordered Binary Decision Diagrams. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Jozef Jirásek 0001, Galina Jirásková |
Cyclic Shift on Prefix-Free Languages. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Ryan Williams 0001 |
Towards NEXP versus BPP? |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Alexey Sorokin |
Lower and Upper Bounds for the Length of Joins in the Lambek Calculus. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Paul G. Spirakis, Panagiota N. Panagopoulou |
Potential Functions in Strategic Games. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | 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 |
|
1 | Alexandr V. Kostochka, Matthew P. Yancey |
On Coloring of Sparse Graphs. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Pawel Gawrychowski |
Alphabetic Minimax Trees in Linear Time. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Abuzer Yakaryilmaz |
Quantum Alternation. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Pavel V. Martyugin |
Careful Synchronization of Partial Automata with Restricted Alphabets. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Sergey V. Avgustinovich, Svetlana Puzynina |
Weak Abelian Periodicity of Infinite Words. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | 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 |
|
1 | Anton Makhlin |
On the Encoding Invariance of Polynomial Time Computable Distribution Ensembles. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Mario Szegedy |
The Lovász Local Lemma - A Survey. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Volker Diekert, Armin Weiß |
QuickHeapsort: Modifications and Improved Analysis. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Amaldev Manuel, Anca Muscholl, Gabriele Puppis |
Walking on Data Words. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Dmitry Itsykson, Vsevolod Oparin |
Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Jeffrey O. Shallit |
Decidability and Enumeration for Automatic Sequences: A Survey. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | 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 |
|
1 | Nicole Schweikardt |
A Short Tutorial on Order-Invariant First-Order Logic. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Abuzer Yakaryilmaz |
One-Counter Verifiers for Decidable Languages. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Timofey Stepanov |
Random Selection in Few Rounds. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Stefan S. Dantchev, Barnaby Martin |
Parameterized Resolution with Bounded Conjunction. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Romeo Rizzi, Stéphane Vialette |
On Recognizing Words That Are Squares for the Shuffle Product. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Sven De Felice, Cyril Nicaud |
Random Generation of Deterministic Acyclic Automata Using the Recursive Method. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein |
Information Lower Bounds via Self-reducibility. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Jirí Fiala 0001, Marek Tesar 0001 |
Dichotomy of the H-Quasi-Cover Problem. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Klaus Jansen, Stefan Erich Julius Kraft |
An Improved Knapsack Solver for Column Generation. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Manfred Droste, Vitaly Perevoshchikov |
Multi-weighted Automata and MSO Logic. |
CSR |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Maxim A. Babenko, Ivan Pouzyrevsky |
Resilient Quicksort and Selection. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Timo Jolivet, Jarkko Kari |
Consistency of Multidimensional Combinatorial Substitutions. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | 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 |
|
1 | Christos A. Kapoutsis, Giovanni Pighizzini |
Two-Way Automata Characterizations of L/poly versus NL. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Michael Blondin, Pierre McKenzie |
The Complexity of Intersecting Finite Automata Having Few Final States. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Bernhard Heinemann |
Characterizing Certain Topological Specifications. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Ville Salo |
A Characterization of Cellular Automata Generated by Idempotents on the Full Shift. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Dmitry V. Chistikov |
Checking Tests for Read-Once Functions over Arbitrary Bases. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Eli Fox-Epstein, Danny Krizanc |
The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Martin Dietzfelbinger, Michael Rink 0001 |
Towards Optimal Degree-Distributions for Left-Perfect Matchings in Random Bipartite Graphs. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Evgeny Demenkov, Alexander S. Kulikov, Ivan Mihajlin, Hiroki Morizumi |
Computing All MOD-Functions Simultaneously. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Evgeny Demenkov |
A Lower Bound on Circuit Complexity of Vector Function in U 2. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Goerdt, Lutz Falke |
Satisfiability Thresholds beyond k -XORSAT. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Amr Elmasry, Jyrki Katajainen |
Worst-Case Optimal Priority Queues via Extended Regular Counters. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Prateek Karandikar, Philippe Schnoebelen |
Cutting through Regular Post Embedding Problems. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Hans Ulrich Simon |
Boolean Composition of Visual Secret Sharing Schemes. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Sebastian S. Bauer, Uli Fahrenberg, Axel Legay, Claus R. Thrane |
General Quantitative Specification Theories with Modalities. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Daniil Musatov |
Space-Bounded Kolmogorov Extractors. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Volker Diekert, Manfred Kufleitner |
Bounded Synchronization Delay in Omega-Rational Expressions. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Vijay V. Vazirani |
Can the Theory of Algorithms Ratify the "Invisible Hand of the Market"? |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Nachshon Cohen, Zeev Nutov |
Approximating Minimum Power Edge-Multi-Covers. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Dennis Komm, Richard Královic, Tobias Mömke |
On the Advice Complexity of the Set Cover Problem. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Svetlana N. Selezneva |
Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma |
Finding Vertex-Surjective Graph Homomorphisms. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Florent R. Madelaine, Barnaby Martin, Juraj Stacho |
Constraint Satisfaction with Counting Quantifiers. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Galina Jirásková |
Descriptional Complexity of Operations on Alternating and Boolean Automata. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | 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 |
|
1 | Bartlomiej Bosek, Stefan Felsner, Kolja B. Knauer, Grzegorz Matecki |
News about Semiantichains and Unichain Coverings. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Pinar Heggernes, Sigve Hortemo Sæther |
Broadcast Domination on Block Graphs in Linear Time. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Romeo Rizzi, Florian Sikora |
Some Results on more Flexible Versions of Graph Motif. |
CSR |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Arnon Avron, Ori Lahav 0001 |
A Multiple-Conclusion Calculus for First-Order Gödel Logic. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
1 | László Babai |
Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Scott Aaronson |
The Equivalence of Sampling and Searching. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Jarkko Kari |
Snakes and Cellular Automata: Reductions and Inseparability Results. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien |
Learning Read-Constant Polynomials of Constant Degree Modulo Composites. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Alexander S. Kulikov, Nikolay K. Vereshchagin (eds.) |
Computer Science - Theory and Applications - 6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011. Proceedings |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Kim Thang Nguyen |
Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Tamar Aizikowitz, Michael Kaminski |
LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Christos A. Kapoutsis |
Two-Way Automata versus Logarithmic Space. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Rémi Morin |
Shared-Memory Systems and Charts. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Alex Davydow, Sergey I. Nikolenko |
Gate Elimination for Linear Functions and New Feebly Secure Constructions. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Alexey Pospelov 0001 |
Faster Polynomial Multiplication via Discrete Fourier Transforms. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Tiskin |
Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Matthijs Bomhoff |
Recognizing Sparse Perfect Elimination Bipartite Graphs. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Daniil Musatov |
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Fabian Wagner |
Graphs of Bounded Treewidth Can Be Canonized in AC1. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Shen |
Kolmogorov Complexity as a Language. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen |
The Complexity of Solving Reachability Games Using Value and Strategy Iteration. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Jirí Síma, Stanislav Zák |
Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|