Parameterized complexity of machine scheduling: 15 open problems

Machine scheduling problems are a long-time key domain of algorithms and complexity research. A novel approach to machine scheduling problems are fixed-parameter algorithms. To stimulate this thriving research direction, we propose 15 open questions in this area whose resolution we expect to lead to the discovery of new approaches and techniques both in scheduling and parameterized complexity theory.Comment: Version accepted to Computers & Operations Researc

Computability and analysis: the legacy of Alan Turing

We discuss the legacy of Alan Turing and his impact on computability and analysis.Comment: 49 page

Logics of Finite Hankel Rank

We discuss the Feferman-Vaught Theorem in the setting of abstract model theory for finite structures. We look at sum-like and product-like binary operations on finite structures and their Hankel matrices. We show the connection between Hankel matrices and the Feferman-Vaught Theorem. The largest logic known to satisfy a Feferman-Vaught Theorem for product-like operations is CFOL, first order logic with modular counting quantifiers. For sum-like operations it is CMSOL, the corresponding monadic second order logic. We discuss whether there are maximal logics satisfying Feferman-Vaught Theorems for finite structures.Comment: Appeared in YuriFest 2015, held in honor of Yuri Gurevich's 75th birthday. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-23534-9_1

"Rotterdam econometrics": publications of the econometric institute 1956-2005

This paper contains a list of all publications over the period 1956-2005, as reported in the Rotterdam Econometric Institute Reprint series during 1957-2005.