Editorial Board
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach
The complexity of online manipulation of sequential elections
On the structure of bispecial Sturmian words
Bisimulation equivalence and regularity for real-time one-counter automata
Infinite vs. finite size-bounded randomized computations
Unshuffling a square is NP-hard
Robust learning of automatic classes of languages
Finding the smallest binarization of a CFG is NP-hard
Automatic learners with feedback queries
Detecting correlation between server resources for system management
On the connectivity preserving minimum cut problem
Column Subset Selection Problem is UG-hard
Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip
Contents