Sotabase

Career

· Jeffrey L. and Brenda Bleustein Professor of Engineering, Columbia University2021–
· Bell Canada Chair in Information Systems, University of Toronto2001–2021
· PhD in Computer Science, University of Toronto1992–
· Bachelor's Degree in Computer Science and Chemistry, Pennsylvania State University1985–
· Master's Degree in Computer Science, Pennsylvania State University
· Faculty Position, University of Arizona
· Postdoctoral Studies, University of California, San Diego
· Faculty Position, University of Pittsburgh

Publications (220)

Fairness through awareness
Information Technology Convergence and Services · 2011
4,264
cited
Learning Fair Representations
International Conference on Machine Learning · 2013
1,972
cited
Differential privacy under continual observation
Symposium on the Theory of Computing · 2010
811
cited
Learning Adversarially Fair and Transferable Representations
International Conference on Machine Learning · 2018
745
cited
Preserving Statistical Validity in Adaptive Data Analysis
Symposium on the Theory of Computing · 2014
394
cited
Flexibly Fair Representation Learning by Disentanglement
International Conference on Machine Learning · 2019
362
cited
The reusable holdout: Preserving validity in adaptive data analysis
Science · 2015
340
cited
Combining Component Caching and Clause Learning for Effective Model Counting
International Conference on Theory and Applications of Satisfiability Testing · 2004
262
cited
Predict Responsibly: Improving Fairness and Accuracy by Learning to Defer
Neural Information Processing Systems · 2017
262
cited
Generalization in Adaptive Data Analysis and Holdout Reuse
Neural Information Processing Systems · 2015
243
cited
Lower bounds on Hilbert's Nullstellensatz and propositional proofs
Proceedings 35th Annual Symposium on Foundations of Computer Science · 1994
234
cited
Simplified and improved resolution lower bounds
Proceedings of 37th Conference on Foundations of Computer Science · 1996
208
cited
Exponential lower bounds for the pigeonhole principle
Computational Complexity · 1993
196
cited
Lower bounds for cutting planes proofs with small coefficients
Symposium on the Theory of Computing · 1995
192
cited
The Limits of Two-Party Differential Privacy
IEEE Annual Symposium on Foundations of Computer Science · 2010
191
cited
Propositional Proof Complexity: Past, Present and Future
Bull. EATCS · 2001
189
cited
The relative complexity of NP search problems
Symposium on the Theory of Computing · 1995
188
cited
Pan-Private Streaming Algorithms
International Conference on Supercomputing · 2010
185
cited
An Exponential Separation Between the Parity Principle and the Pigeonhole Principle
Annals of Pure and Applied Logic · 1996
180
cited
Stochastic Boolean Satisfiability
Journal of automated reasoning · 2001
170
cited
Sotabase