1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.CR2021
Making the Most of Parallel Composition in Differential Privacy
Josh Smith, Hassan Jameel Asghar, Gianpaolo Gioiosa +3
We show that the `optimal' use of the parallel composition theorem corresponds to finding the size of the largest subset of queries that `overlap' on the data domain, a quantity we…
cs.FL2010★ 1 cited
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages
Janusz Brzozowski, Galina Jirásková, Baiyu Li +1
A language L is prefix-free if, whenever words u and v are in L and u is a prefix of v, then u=v. Suffix-, factor-, and subword-free languages are defined similarly, where "subword…