|
|
Accepted papersSTACS 2018 Accepted PapersRelations Between Greedy and Bit-Optimal LZ77 Encodings
Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid
Improving the upper bound on the length of the shortest reset words
Computing the longest common prefix of a context-free language in polynomial time
Succinct Oblivious RAM
The Intersection Problem for Finite Monoids
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns
Recursion Schemes and the WMSO+U Logic
Closure of resource-bounded randomness notions under polynomial time permutations
Sums of Palindromes: an Approach via Automata
On low for speed oracles
Pumping lemmas for weighted automata
Parameterized (Approximate) Defective Coloring
Lower Bounds on Black-Box Reductions of Hitting to Density Estimation
Solving the Rubik's Cube Optimally is NP-complete
Power of Uninitialized Qubits in Shallow Quantum Circuits
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
Efficient Oracles and Routing Schemes for Replacement Paths
All Classical Adversary Methods are Equivalent for Total Functions
Space-Efficient Algorithms for Longest Increasing Subsequence
Upper and lower bounds for dynamic data structures on strings
Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling
Computing Hitting Set Kernels By AC$^0$-Circuits
Small Resolution Proofs for QBF using Dependency Treewidth
The Firing Squad Problem Revisited
Knapsack problems for wreath products
Surjective H-Colouring over Reflexive Digraphs
A unified polynomial-time algorithm for Feedback Vertex Set on graphs of bounded mim-width
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Automata theory on sliding windows
Finding list homomorphisms from bounded-treewidth graphs to reflexive graphs: a complete complexity characterization
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications
On approximating the stationary distribution of time-reversible Markov chains
String Periods in the Order-Preserving Model
Width of Non-deterministic Automata
Approximating Airports and Railways
Genuine Lower Bounds for QBF Expansion
On the Containment Problem for Linear Sets
Large Flocks of Small Birds: On the Minimal Size of Population Protocols
Optimal dislocation with persistent errors in subquadratic time
Communicating Finite-State Machines and Two-Variable Logic
Beyond JWP: A tractable class of binary VCSPs via M-convex intersection
Nonuniform Reductions and NP-Completeness
On the Power of Tree-Depth for Fully Polynomial FPT Algorithms
Lossy Kernels for Connected Dominating Set
Approximation Algorithms for Scheduling with Resource and Precedence Constraints
Colouring Square-Free Graphs without Long Induced Paths
An Improved Bound for Random Binary Search Trees with Concurrent Insertions
Erdős–Pósa Property of Obstructions to Interval Graphs
Property Testing for Bounded Degree Databases
On the Tree Conjecture for the Network Creation Game
Dependences in Strategy Logic
Lower bounds for Combinatorial Algorithms for Boolean Matrix Multiplication
The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs |
Online user: 1 | RSS Feed |