Gilmer, Justin; Koucký, Michal; Saks, Michael A communication game related to the sensitivity conjecture. (English) Zbl 1379.68151 Theory Comput. 13, Paper No. 7, 18 p. (2017). MSC: 68Q17 68Q25 91A80 94C10 PDFBibTeX XMLCite \textit{J. Gilmer} et al., Theory Comput. 13, Paper No. 7, 18 p. (2017; Zbl 1379.68151) Full Text: DOI
Kopparty, Swastik; Kumar, Mrinal; Saks, Michael Efficient indexing of necklaces and irreducible polynomials over finite fields. (English) Zbl 1373.11080 Theory Comput. 12, Paper No. 7, 27 p. (2016). MSC: 11T06 68Q25 68R15 68W40 94A60 PDFBibTeX XMLCite \textit{S. Kopparty} et al., Theory Comput. 12, Paper No. 7, 27 p. (2016; Zbl 1373.11080) Full Text: DOI Backlinks: MO
Goyal, Navin; Saks, Michael Rounds vs. queries tradeoff in noisy computation. (English) Zbl 1213.68310 Theory Comput. 6, Paper No. 6, 113-134 (2010). MSC: 68Q17 68Q15 PDFBibTeX XMLCite \textit{N. Goyal} and \textit{M. Saks}, Theory Comput. 6, Paper No. 6, 113--134 (2010; Zbl 1213.68310) Full Text: DOI