Toniann Pitassi - Concepedia

Author

Toniann Pitassi

University of Toronto ORCID

Also Known As

Persiano, Giuseppe, Pitassi, Toniann, T. Pitassi, Toniann Pitassi, Yu Wu

241

Publications

10.6K

Citations

H-Index

134

Concepts

All Affiliations

University of Toronto University of California San Diego University of Washington University of Arizona Microsoft (United States)

About

Toniann Pitassi is an author at University of Toronto specializing in engineering, computer science, and computational complexity.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	41	76	8.4K
2	Business	4	4	71
3	Arts	3	3	109
4	Education	2	2	83
5	Humanities	1	1	49

Toniann Pitassi

Publications

9.7K

Citations

H-Index

Page 1

	Year	Citations
Fairness through awareness Cynthia Dwork, Moritz Hardt, Toniann Pitassi, EngineeringDiscriminationFairness Through AwarenessSocial StratificationClassification Task	2012	3.3K
Differential privacy under continual observation Cynthia Dwork, Moni Naor, Toniann Pitassi, Privacy ProtectionEngineeringPrivate Data AnalysisInformation SecurityFormal Verification	2010	574
The reusable holdout: Preserving validity in adaptive data analysis Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Science	2015	310
Preserving Statistical Validity in Adaptive Data Analysis Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Discovery TechniqueEngineeringStatistical ValidityData ScienceData Mining	2015	260
Exponential lower bounds for the pigeonhole principle Toniann Pitassi, Paul Beame, Russell Impagliazzo Computational Complexity EngineeringLower BoundExponential Lower BoundsComputational ComplexityExtremal Combinatorics	1993	197
Simplified and improved resolution lower bounds Paul Beame, Toniann Pitassi Mathematical ProgrammingEngineeringAutomated ProofComputational ComplexitySuper-resolution Imaging	2002	195
Learning Adversarially Fair and Transferable Representations David Madras, Elliot Creager, Toniann Pitassi, arXiv (Cornell University) Artificial IntelligenceEngineeringMachine LearningData ScienceTransferable Representations	2018	190
Combining Component Caching and Clause Learning for Effective Model Counting. Tian Sang, Fahiem Bacchus, Paul Beame, EngineeringMachine LearningComputational ComplexityStatistical Relational LearningSimple Caching	2004	181
The Relative Complexity of NP Search Problems Paul Beame, Stephen Cook, Jeff Edmonds, Journal of Computer and System Sciences Computational Complexity TheoryEngineeringRelative ComplexityComputational ComplexityP Versus Np Problem	1998	176
Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs Paul Beame, Russell Impagliazzo, Jan Krajı́ček, Proceedings of the London Mathematical Society Algebraic EquationsEngineeringCommutative AlgebraAutomated ReasoningProof Complexity	1996	164

Page 1