Questions of understanding and quantifying the representation and amount of information in organisms have become a central part of biological research, as they potentially hold th...
H. M. Aktulga, I. Kontoyiannis, L. A. Lyznik, Luka...
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
Entropy (i.e. convex integral) functionals and extensions of these functionals are minimized on convex sets. This paper is aimed at reducing as much as possible the assumptions on ...
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic...
We consider the problem of Adverse Selection and optimal derivative design within a Principal-Agent framework. The principal’s income is exposed to non-hedgeable risk factors ar...