Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...
Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The impossibility of fault-tolerant set agreement in asynchronous networks is one of the seminal ...
The thesis analyzes the interaction region of the Large Hadron Collider (LHC). It proposes, studies and compares several upgrade options. The interaction region is the part of the LHC that hosts the particle detectors which analyze the collisions. An upgra ...
We present a general theory for semiconductor polarons in the framework of the Frohlich interaction between electrons and phonons. The latter is investigated using noncommuting phonon creation/annihilation operators associated with a natural set of nonorth ...
