A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
We observe that every rst-order logic formula over the untyped version of some many-sorted vocabulary is equivalent to a union of manysorted formulas over that vocabulary. This re...
We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel (DMC) to its quantum counterpart. The key observation that...
Abstract. We formally study two privacy-type properties in online auction protocols, bidding-price-secrecy and receipt-freeness. These properties are formalised as observational eq...
This paper deals with the detection of a continuous random process described by an Ornstein-Uhlenbeck (O-U) stochastic differential equation. Randomly spaced sensors or equivalent...
Walid Hachem, Eric Moulines, Jamal Najim, Fran&cce...