In this paper we develop a new algorithm for deciding the winner in parity games, and hence
also for the modal μ-calculus model checking. The design and analysis of the algorithm is …

This paper presents a general theory of system composition for" possibilistic" security
properties. We see that these properties fall outside of the Alpern-Schneider safety/liveness …

Recent results on the internal, measure-theoretic structure of the exponential time
complexity classes E= DTIME (2/sup linear/) and E/sub 2/= DTIME (2/sup polynomial/) are …

We survey recent results on resource-bounded measure and randomness in structural
complexity theory. In particular, we discuss applications of these concepts to the exponential …

Inverse optimization is the problem of determining the values of missing input parameters for
an associated forward problem that are closest to given estimates and that will make a given …

Measure-theoretic aspects of the ≦_m^P-reducibility structure of the exponential time
complexity classes E=DTIME(2^linear) and E_2=DTIME(2^polynomial) are investigated …

Disjoint NP-pairs are pairs (A, B) of nonempty, disjoint sets in NP. We prove that all of the
following assertions are equivalent: There is a many-one complete disjoint NP-pair; there is …

Recently, Lutz [14, 15] introduced a polynomial time bounded version of Lebesgue measure.
He and others (see eg [11, 13–18, 20]) used this concept to investigate the quantitative …

A weak completeness phenomenon is investigated in the complexity class
E=DTIME(2^linear). According to standard terminology, a language H is ≦_m^P-hard for E if …

We formulate a conjecture about random n-dimensional lattices with a suitable distribution.
The conjecture says that every polynomial time computable property of a random lattice …