H-Index & Metrics Best Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science D-index 40 Citations 7,237 114 World Ranking 4450 National Ranking 196

Research.com Recognitions

Awards & Achievements

2018 - ACM Fellow For contributions to research and education in the fields of computational and proof complexity

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Algebra
  • Combinatorics

The scientist’s investigation covers issues in Discrete mathematics, Combinatorics, Mathematical proof, Proof complexity and Pigeonhole principle. He has researched Discrete mathematics in several fields, including Search problem and Propositional proof system. His research integrates issues of Decision problem and Field in his study of Combinatorics.

His Mathematical proof research includes elements of Propositional calculus and Polynomial. His Pigeonhole principle research includes themes of Resolution and Exponential function. His work in Degree addresses subjects such as Polynomial, which are connected to disciplines such as Function and Communication complexity.

His most cited work include:

  • Fairness through awareness (1211 citations)
  • Differential privacy under continual observation (423 citations)
  • The reusable holdout: Preserving validity in adaptive data analysis (199 citations)

What are the main themes of his work throughout his whole career to date?

The scientist’s investigation covers issues in Discrete mathematics, Combinatorics, Mathematical proof, Proof complexity and Communication complexity. His Discrete mathematics study integrates concerns from other disciplines, such as Function, Computational complexity theory and Exponential function. His work deals with themes such as Nondeterministic algorithm, Rank and Constant, which intersect with Combinatorics.

The various areas that he examines in his Mathematical proof study include Resolution and Pigeonhole principle. The concepts of his Proof complexity study are interwoven with issues in Algorithm, Polynomial and Algebraic number. His Communication complexity research is multidisciplinary, incorporating elements of Worst-case complexity and Partition.

He most often published in these fields:

  • Discrete mathematics (55.51%)
  • Combinatorics (37.29%)
  • Mathematical proof (25.00%)

What were the highlights of his more recent work (between 2017-2021)?

  • Discrete mathematics (55.51%)
  • Mathematical proof (25.00%)
  • Communication complexity (20.76%)

In recent papers he was focusing on the following fields of study:

His main research concerns Discrete mathematics, Mathematical proof, Communication complexity, Theoretical computer science and Proof complexity. Toniann Pitassi performs integrative study on Discrete mathematics and Bounded function in his works. His Mathematical proof study frequently involves adjacent topics like Calculus.

His work focuses on many connections between Communication complexity and other disciplines, such as Partition, that overlap with his field of interest in Independent set. The Theoretical computer science study combines topics in areas such as Efficient algorithm and Directed acyclic graph. His Proof complexity research focuses on Field and how it connects with Rank, Prime and Open problem.

Between 2017 and 2021, his most popular works were:

  • Learning Adversarially Fair and Transferable Representations (119 citations)
  • Learning Adversarially Fair and Transferable Representations (81 citations)
  • Flexibly Fair Representation Learning by Disentanglement (79 citations)

In his most recent research, the most cited papers focused on:

  • Algebra
  • Algorithm
  • Combinatorics

Toniann Pitassi focuses on Discrete mathematics, Communication complexity, Feature learning, Proof complexity and Artificial intelligence. His study in Discrete mathematics is interdisciplinary in nature, drawing from both Field, Degree and Rank. His Communication complexity research incorporates elements of PSPACE, State and Partition, Combinatorics.

His Feature learning research is multidisciplinary, relying on both Transfer of learning, Theoretical computer science and Key. His Proof complexity study contributes to a more complete understanding of Mathematical proof. Toniann Pitassi has included themes like Complexity class, Algebraic number and Conjecture in his Mathematical proof study.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Fairness through awareness

Cynthia Dwork;Moritz Hardt;Toniann Pitassi;Omer Reingold.
conference on innovations in theoretical computer science (2012)

1041 Citations

Differential privacy under continual observation

Cynthia Dwork;Moni Naor;Toniann Pitassi;Guy N. Rothblum.
symposium on the theory of computing (2010)

485 Citations

The reusable holdout: Preserving validity in adaptive data analysis

Cynthia Dwork;Vitaly Feldman;Moritz Hardt;Toniann Pitassi.
Science (2015)

280 Citations

Preserving Statistical Validity in Adaptive Data Analysis

Cynthia Dwork;Vitaly Feldman;Moritz Hardt;Toniann Pitassi.
symposium on the theory of computing (2015)

257 Citations

Combining Component Caching and Clause Learning for Effective Model Counting.

Tian Sang;Fahiem Bacchus;Paul Beame;Henry A. Kautz.
theory and applications of satisfiability testing (2004)

255 Citations

Simplified and improved resolution lower bounds

P. Beame;T. Pitassi.
foundations of computer science (1996)

246 Citations

Exponential lower bounds for the pigeonhole principle

Toniann Pitassi;Paul Beame;Russell Impagliazzo.
Computational Complexity (1993)

193 Citations

The Limits of Two-Party Differential Privacy

Andrew McGregor;Ilya Mironov;Toniann Pitassi;Omer Reingold.
foundations of computer science (2010)

184 Citations

Stochastic Boolean Satisfiability

Michael L. Littman;Stephen M. Majercik;Toniann Pitassi.
Journal of Automated Reasoning (2001)

179 Citations

Lower bounds for cutting planes proofs with small coefficients

Maria Luisa Bonet;Toniann Pitassi;Ran Raz.
symposium on the theory of computing (1995)

179 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Toniann Pitassi

Aaron Roth

Aaron Roth

University of Pennsylvania

Publications: 44

Samuel R. Buss

Samuel R. Buss

University of California, San Diego

Publications: 40

Alexander A. Razborov

Alexander A. Razborov

University of Chicago

Publications: 33

Stefan Szeider

Stefan Szeider

TU Wien

Publications: 29

Krishna P. Gummadi

Krishna P. Gummadi

Saarland University

Publications: 28

Pavel Pudlák

Pavel Pudlák

Czech Academy of Sciences

Publications: 26

Eli Ben-Sasson

Eli Ben-Sasson

Technion – Israel Institute of Technology

Publications: 25

Vitaly Feldman

Vitaly Feldman

Apple (United States)

Publications: 24

Moshe Y. Vardi

Moshe Y. Vardi

Rice University

Publications: 22

Paul Beame

Paul Beame

University of Washington

Publications: 21

Avi Wigderson

Avi Wigderson

Institute for Advanced Study

Publications: 21

Russell Impagliazzo

Russell Impagliazzo

University of California, San Diego

Publications: 21

Adam Smith

Adam Smith

Boston University

Publications: 19

Bart Selman

Bart Selman

Cornell University

Publications: 19

Cynthia Dwork

Cynthia Dwork

Harvard University

Publications: 18

Ashish Sabharwal

Ashish Sabharwal

Allen Institute for Artificial Intelligence

Publications: 18

Something went wrong. Please try again later.