# Toniann Pitassi

Professor

Sign in to view more

## Papers206 papers

Fairness through Causal Awareness - Learning Causal Latent-Variable Models for Biased Data.

The Surprising Power of Constant Depth Algebraic Proofs.

Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity.

Correction to: Query-to-Communication Lifting for PNP

Flexibly Fair Representation Learning by Disentanglement.

Query-to-Communication Lifting Using Low-Discrepancy Gadgets.

Semialgebraic Proofs and Efficient Algorithm Design.

Semialgebraic Proofs and Efficient Algorithm Design.

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity.

The Landscape of Communication Complexity Classes.

Randomized Communication vs. Partition Number.

Lifting Nullstellensatz to Monotone Span Programs over Any Field.

Learning Adversarially Fair and Transferable Representations.

Hardness of Function Composition for Semantic Read once Branching Programs.

Fairness Through Causal Awareness: Learning Latent-Variable Models for Biased Data.

Predict Responsibly - Improving Fairness and Accuracy by Learning to Defer.

Randomized Communication versus Partition Number

Hardness of Function Composition for Semantic Read once Branching Programs.

**1**|Bibtex

Predict Responsibly: Increasing Fairness by Learning to Defer

Strongly Exponential Lower Bounds for Monotone Computation.

Query-to-Communication Lifting for BPP.

Random CNFs are Hard for Cutting Planes.

Query-to-Communication Lifting for P^NP.

Random Θ(log n)-CNFs Are Hard for Cutting Planes.

Algebraic Proof Complexity: Progress, Frontiers and Challenges.

Exponential Lower Bounds for Monotone Span Programs.

Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs.

Poly-logarithmic Frege depth lower bounds via an expander switching lemma.

Upper and Lower Bounds on the Power of Advice.

Exponential Lower Bounds for Monotone Span Programs.

Zero-Information Protocols and Unambiguity in Arthur–Merlin Communication

Preserving Statistical Validity in Adaptive Data Analysis.

Inapproximability of Treewidth and Related Problems (Extended Abstract).

Preserving Statistical Validity in Adaptive Data Analysis.

Deterministic Communication vs. Partition Number.

Generalization in Adaptive Data Analysis and Holdout Reuse

Communication lower bounds via critical block sensitivity

Circuit Complexity, Proof Complexity, and Polynomial Identity Testing

Inapproximability of Treewidth and Related Problems.

Lifting lower bounds for tree-like proofs.

Learning Fair Representations.

Average Case Lower Bounds for Monotone Switching Networks

On the Expressive Power of Restricted Boltzmann Machines.

A Tight Bound for Set Disjointness in the Message-Passing Model

On the Representational Efficiency of Restricted Boltzmann Machines

Madison, WI, USA March 31–April 3, 2012

Average Case Lower Bounds for Monotone Switching Networks

A little advice can be very helpful

Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems

Proceedings of the forty-fourth annual ACM symposium on Theory of computing

**4**|EI|Bibtex

Communication Complexity and Information Complexity: Foundations and New Directions

Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures

**1**|Bibtex

Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent Results

The Limits of Two-Party Differential Privacy

Toward a Model for Backtracking and Dynamic Programming

Toward a Model for Backtracking and Dynamic Programming

Automatizability and simple stochastic games

Special Issue In Memory of Misha Alekhnovich. Foreword

Exponential lower bounds for AC 0 -Frege imply superpolynomial frege lower bounds

Effectively Polynomial Simulations

Pan-Private Streaming Algorithms

Separating Deterministic from Randomized Multiparty Communication Complexity

Hardness amplification in proof complexity

Differential privacy under continual observation

The PSPACE-Completeness of Black-White Pebbling

Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures

Improved Separations between Nondeterministic and Randomized Multiparty Communication

Solving #SAT and Bayesian inference with backtracking search

Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures

Minimizing Disjunctive Normal Form Formulas and AC0 Circuits Given a Truth Table

Clause learning can effectively P-simulate general propositional resolution

Improved Separations between Nondeterministic and Randomized Multiparty Communication

Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table