We prove a number of general theorems about ZK, the class of problems possessing (computational) zero knowledge proofs. Our results are unconditional, in contrast to most previous...
Abstract. We analyze Roman domination from a parameterized perspective. More specifically, we prove that this problem is W[2]-complete for general graphs. However, parameterized al...
A linear error-block code is a natural generalization of the classical error-correcting code and has applications in experimental design, high-dimensional numerical integration an...
Abstract. We introduce generalized trajectories where the individual symbols are interpreted as operations performed on the operand words. The various previously considered traject...
Michael Domaratzki, Grzegorz Rozenberg, Kai Saloma...
For general law invariant coherent measures of risk, we derive an equivalent representation of a risk-averse newsvendor problem as a meanrisk model. We prove that the higher the w...