33 citations · 38 across the 4 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2022
Lower bounds for uniform read-once threshold formulae in the randomized decision tree model
Nikos Leonardos
We investigate the randomized decision tree complexity of a specific class of read-once threshold functions. A read-once threshold formula can be defined by a rooted tree, every in…
cs.CC2014
Hellinger volume and number-on-the-forehead communication complexity
Troy Lee, Nikos Leonardos, Michael Saks +1
Information-theoretic methods have proven to be a very powerful tool in communication complexity, in particular giving an elegant proof of the linear lower bound for the two-party…