Accepted papers
From CSR 2013
(Difference between revisions)
(Created page with "== CSR 2013 Accepted Papers == # Barnaby Martin and Stefan Dantchev. Parameterized Resolution with bounded conjunction # Nicolas Boria, Cécile Murat and Vangelis Paschos. The...") |
|||
Line 15: | Line 15: | ||
# Klaus Jansen and Stefan Kraft. An Improved Knapsack Solver for Column Generation | # Klaus Jansen and Stefan Kraft. An Improved Knapsack Solver for Column Generation | ||
# Dmitry Itsykson and Vsevolod Oparin. Graph expansion, Tseitin formulas and resolution proofs for CSP | # Dmitry Itsykson and Vsevolod Oparin. Graph expansion, Tseitin formulas and resolution proofs for CSP | ||
− | # Nikolay Vereshchagin. An improving on Gutfreund, Shaltiel, and Ta-Shma's paper | + | # Nikolay Vereshchagin. An 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" |
# Alexey Sorokin. Lower and upper bounds for the length of joins in Lambek calculus | # Alexey Sorokin. Lower and upper bounds for the length of joins in Lambek calculus | ||
# Romeo Rizzi and Stéphane Vialette. On recognizing words that are squares for the shuffle product | # Romeo Rizzi and Stéphane Vialette. On recognizing words that are squares for the shuffle product |
Revision as of 19:12, 16 February 2013
CSR 2013 Accepted Papers
- Barnaby Martin and Stefan Dantchev. Parameterized Resolution with bounded conjunction
- Nicolas Boria, Cécile Murat and Vangelis Paschos. The Probabilistic Dominating Set problem
- Marek Tesař and Jiri Fiala. Dichotomy of the H-Quasi-cover problem
- Mikhail Vyalyi. Universality of regular realizability problems
- Anton Makhlin. On the Encoding Invariance of Polynomial Time Computable Distribution Ensembles
- David Janin. Overlapping tile automata
- Vladimir Alexandrovich Nikishkin. Amortized communication complexity of an equality predicate.
- Viliam Geffert, Zuzana Bednarova, Carlo Mereghetti and Beatrice Palano. Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height
- Andreas Fröhlich, Gergely Kovásznai and Armin Biere. More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding
- Amaldev Manuel, Anca Muscholl and Gabriele Puppis. Walking on Data Words
- Martyugin Pavel. Careful synchronization of partial automata with restricted alphabets
- Timofey Stepanov. Random selection in few rounds
- Kshitij Bansal and Stéphane Demri. Model-Checking Bounded Multi-Pushdown Systems
- Klaus Jansen and Stefan Kraft. An Improved Knapsack Solver for Column Generation
- Dmitry Itsykson and Vsevolod Oparin. Graph expansion, Tseitin formulas and resolution proofs for CSP
- Nikolay Vereshchagin. An 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"
- Alexey Sorokin. Lower and upper bounds for the length of joins in Lambek calculus
- Romeo Rizzi and Stéphane Vialette. On recognizing words that are squares for the shuffle product
- Barnaby Martin and Florent Madelaine. QCSP on partially reflexive cycles - the wavy line of tractability
- Jozef Jirasek and Galina Jiraskova. Cyclic Shift on Prefix-Free Languages
- Abuzer Yakaryilmaz. One-counter verifiers for decidable languages
- Armin Weiss and Volker Diekert. QuickHeapsort: Modifications and improved analysis
- Manfred Droste and Vitaly Perevoshchikov. Multi-weighted Automata and MSO Logic
- Mark Braverman, Ankit Garg, Denis Pankratov and Omri Weinstein. Information lower bounds via self-reducibility
- Sergey Avgustinovich and Svetlana Puzynina. Weak abelian periodicity of infinite words
- Sven De Felice and Cyril Nicaud. Random Generation of Deterministic Acyclic Automata using the Recursive Method
- Abuzer Yakaryilmaz. Quantum alternation
- Luke Friedman and Yixin Xu. Exponential Lower Bounds for Refuting Random Formulas Using Ordered Binary Decision Diagrams
- Pawel Gawrychowski. Alphabetic minimax trees in linear time