Abstract. This paper presents simulation-based relations for probabilistic game structures. The first relation is called probabilistic alternating simulation, and the second called...
We consider cubic graphs formed with k 2 disjoint claws Ci K1,3 (0 i k-1) such that for every integer i modulo k the three vertices of degree 1 of Ci are joined to the three v...
Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanh...
We consider the problem of finding a lowest cost dominating set in a given disk graph containing n disks. The problem has been extensively studied on subclasses of disk graphs, ye...
Abstract--We present two new algorithms for the reconstruction of turbo codes from a noisy intercepted bitstream. With these algorithms, we were able to reconstruct various turbo c...
Suppose we would like to know all answers to a set of statistical queries C on a data set up to small error, but we can only access the data itself using statistical queries. A tr...
Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan U...