| 687 | -- | 696 | Robert Crowston, Michael R. Fellows, Gregory Gutin, Mark Jones, E.-J. Kim, Fran Rosamond, Imre Z. Ruzsa, Stéphan Thomassé, Anders Yeo. Satisfying more than half of a system of linear equations over GF(2): A multivariate approach |
| 697 | -- | 710 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe. The complexity of online manipulation of sequential elections |
| 711 | -- | 719 | Gabriele Fici. On the structure of bispecial Sturmian words |
| 720 | -- | 743 | Stanislav Böhm, Stefan Göller, Petr Jancar. Bisimulation equivalence and regularity for real-time one-counter automata |
| 744 | -- | 765 | Richard Královic. Infinite vs. finite size-bounded randomized computations |
| 766 | -- | 776 | Sam Buss, Michael Soltys. Unshuffling a square is NP-hard |
| 777 | -- | 795 | Sanjay Jain, Eric Martin 0002, Frank Stephan. Robust learning of automatic classes of languages |
| 796 | -- | 805 | Carlos Gómez-Rodríguez. Finding the smallest binarization of a CFG is NP-hard |
| 806 | -- | 820 | John Case, Sanjay Jain, Yuh Shin Ong, Pavel Semukhin, Frank Stephan. Automatic learners with feedback queries |
| 821 | -- | 836 | Stefania Tosi, Sara Casolari, Michele Colajanni. Detecting correlation between server resources for system management |
| 837 | -- | 848 | Qi Duan, Jinhui Xu. On the connectivity preserving minimum cut problem |
| 849 | -- | 859 | Ali Çivril. Column Subset Selection Problem is UG-hard |
| 860 | -- | 900 | Danny Dolev, Matthias Függer, Markus Posch, Ulrich Schmid, Andreas Steininger, Christoph Lenzen. Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip |