On High-Quality Synthesis ....................................... 1
Orna Kupferman
Sensitivity Versus Certificate Complexity of Boolean
Functions ...................................................... 16
Andris Ambainis, Krišjānis Prūsis, and Jevgēnijs Vihrovs
Algorithmic Decidability of Engel's Property for Automaton
Groups ......................................................... 29
Laurent Bartholdi
The Next Whisky Bar ............................................ 41
Mike Behrisch, Miki Hermann, Stefan Mengel, and Gernot
Salzer
Parameterizing Edge Modification Problems Above Lower Bounds ... 57
René van Bevern, Vincent Froese, and Christian Komusiewicz
Completing Partial Schedules for Open Shop with Unit
Processing Times and Routing ................................... 73
Renй van Bevern and Artem V. Pyatkin
Max-Closed Semilinear Constraint Satisfaction .................. 88
Manuel Bodirsky and Marcello Mamino
Computing and Listing st-Paths in Public Transportation
Networks ...................................................... 102
Kateřina Böhmová, Matúš Mihalák, Tobias Pröger, Gustavo
Sacomoto, and Marie-France Sagot
Compositional Design of Stochastic Timed Automata ............. 117
Patricia Bouyer, Thomas Brihaye, Pierre Carlier, and
Quentin Menet
Online Bounded Analysis ....................................... 131
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S.
Larsen, and Asaf Levin
Affine Computation and Affine Automaton ....................... 146
Alejandro Díaz-Саrо and Abuzer Yakaryilmaz
On Approximating (Connected) 2-Edge Dominating Set by a Tree .. 161
Toshihiro Fujito and Tomoaki Shimoda
Graph Editing to a Given Degree Sequence ...................... 177
Petr A. Golovach and George B. Mertzios
Subclasses of Baxter Permutations Based on Pattern Avoidance .. 192
Shankar Balachandran and Sajin Koroth
On Slcpian-Wolf Theorem with Interaction ...................... 207
Alexander Kozachinskiy
Level Two of the Quantifier Alternation Hierarchy over
Infinite Words ................................................ 223
Manfred Kufleitner and Tobias Walter
The Word Problem for Omega-Terms over the Trotter-Weil
Hierarchy: (Extended Abstract) ................................ 237
Manfred Kufleitner and Jan Philipp Wächter
Some Complete and Intermediate Polynomials in Algebraic
Complexity Theory ............................................. 251
Meena Mahajan and Nitin Saurabh
Sums of Read-Once Formulas: How Many Summands Suffice? ........ 266
Meena Mahajan and Anuj Tawari
Algorithmic Statistics: Normal Objects and Universal Models ... 280
Alexey Milovanov
Subquadratic Algorithms for Succinct Stable Matching .......... 294
Daniel Moeller, Ramamohan Paturi, and Stefan Schneider
Depth-4 Identity Testing and Noether's Normalization Lemma .... 309
Partita Mukhopadhyay
Improved Approximation Algorithms for Min-Cosl Connectivity
Augmentation Problems ......................................... 324
Zeev Nutov
The Hardest Language for Conjunctive Grammars ................. 340
Alexander Okhotin
Low-Rank Approximation of a Matrix: Novel Insights, New
Progress, and Extensions ...................................... 352
Victor Y. Pan and Liang Zhao
Representations of Analytic Functions and Weihrauch Degrees ... 367
Arno Pauly and Florian Steinberg
On Expressive Power of Regular Expressions over Infinite
Orders ........................................................ 382
Alexander Rabinovich
Prediction of Infinite Words with Automata .................... 394
Tim Smith
Fourier Sparsity of GF(2) Polynomials ......................... 409
Hing Yin Tsang, Ning Xie, and Shengyu Zhang
Author Index .................................................. 425
|
