|
|
|
Accepted PapersSTACS 2014 Accepted PapersIrreversible computable functions
Differentiability of polynomial time computable functions
Faster Compact On-Line Lempel-Ziv Factorization
A Solution to Wiehagen's Thesis
Coloring 3-colorable graphs with o(n^{1/5}) colors
The Complexity of Deciding Statistical Properties of Samplable Distributions
Complexity classes on spatially periodic Cellular Automata
Computability of the entropy of one-tape Turing Machines
Non-autoreducible sets for NEXP
Stochastic Scheduling on Unrelated Machines
Generalized Reordering Buffer Management
Partition Expanders
Depth-4 Lower Bounds, Determinantal Complexity : A Unified Approach
Palindrome Recognition In The Streaming Model
Counting Homomorphisms to Cactus Graphs Modulo 2
Faster Sparse Suffix Sorting
Shapley Meets Shapley
Explicit Linear Kernels via Dynamic Programming
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules
Two-Page Book Embeddings of 4-Planar Graphs
Balls into bins via local search: cover time and maximum load
Constant Factor Approximation for Capacitated k-Center with Outliers
Testing Generalised Freeness of Words
Online Bin Packing with Advice
Approximation of smallest linear tree grammar
On Symmetric Circuits and Fixed-Point Logics
Read-Once Branching Programs for Tree Evaluation Problems
Generalized Wong sequences and their applications to Edmonds' problems
Packing a Knapsack of Unknown Capacity
Weighted Coloring in Trees
Synchronizing Relations on Words
Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask)
Exploring Subexponential Parameterized Complexity of Completion Problems
Higher randomness and forcing with closed sets
Communication Lower Bounds for Distributed-Memory Computations
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
From Small Space to Small Width in Resolution
Throughput Maximization in the Speed-Scaling Setting
Online Dynamic Power Management with Hard Real-Time Guarantees
An optimal quantum algorithm for the oracle identification problem
Randomized Online Algorithms with High Probability Guarantees
Near-Optimal Generalisations of a Theorem of Macbeath
Computational Complexity of the Minimum Cost Homomorphism Problem on Three-Element Domains
Chordal Editing is Fixed-Parameter Tractable
Bounds on the Cover Time of Parallel Rotor Walks
Ehrenfeucht-Fraisse Games on Omega-Terms
Submodular Stochastic Probing on Matroids
Space-Efficient String Indexing for Wildcard Pattern Matching
Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players
Asymmetry of the Kolmogorov complexity of online predicting odd and even bits
On Boolean closed full trios and rational Kripke frames
2-Stack Sorting is polynomial
Data-Oblivious Data Structures |
| Online user: 1 |
|
