( en | de | ru )

 

Disambiguation of "Pitassi, Toniann"

Author of the publication

copydeleteadd this publication to your clipboard
An Improved Protocol for ExactlyN with More Than 3 Players.

, , , , and . ITCS, volume 287 of LIPIcs, page 58:1-58:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Pitassi, Toniann
add a person with the name Pitassi, Toniann
 

Other publications of authors with the same name

The complexity of resolution refinements., and . J. Symb. Log., 72 (4): 1336-1352 (2007)Communication Lower Bounds via Critical Block Sensitivity., and . CoRR, (2013)Learning Fair Representations., , , , and . ICML (3), volume 28 of JMLR Workshop and Conference Proceedings, page 325-333. JMLR.org, (2013)Communication lower bounds via critical block sensitivity., and . STOC, page 847-856. ACM, (2014)Effectively Polynomial Simulations., and . ICS, page 370-382. Tsinghua University Press, (2010)Predict Responsibly: Increasing Fairness by Learning to Defer., , and . ICLR (Workshop), OpenReview.net, (2018)On the Communication Complexity of High-Dimensional Permutations., , and . ITCS, volume 124 of LIPIcs, page 54:1-54:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness., , , and . Comput. Complex., 15 (4): 391-432 (2006)Lower bounds for Polynomial Calculus with extension variables over finite fields., , and . Electron. Colloquium Comput. Complex., (2022)Algebraic Proof Complexity: Progress, Frontiers and Challenges., and . Electron. Colloquium Comput. Complex., (2016)