BibSLEIGH — Toniann

Travelled to:

1 × Denmark
1 × France
1 × Germany
1 × Greece
1 × Poland
1 × Portugal
10 × USA
2 × Switzerland
5 × Canada

Collaborated with:

P.Beame R.Impagliazzo A.Maciel A.Urquhart R.Raz J.Buresh-Oppenheim S.R.Buss C.Dwork M.Göös L.Huang ∅ A.R.Woods Y.Filmus R.Santhanam T.Huynh N.Segerlind N.H.Arai M.L.Bonet R.K.Shyamasundar K.T.Narayana M.Naor G.N.Rothblum M.David P.Woelfel M.Alekhnovich J.Johannsen M.Clegg D.Grigoriev R.M.Karp M.E.Saks R.S.Zemel Y.Wu K.Swersky T.Sang F.Bacchus H.A.Kautz M.Agrawal E.Allender S.Rudich S.A.Cook J.Edmonds V.Feldman M.Hardt O.Reingold A.L.Roth J.Krajícek P.Pudlák

Talks about:

complex (9) lower (9) bound (9) proof (8) pigeonhol (4) principl (4) resolut (4) exponenti (3) communic (3) frege (3)

Person: Toniann Pitassi

DBLP: Pitassi:Toniann

Facilitated 1 volumes:

Contributed to:

2015

2014

2013

2011

2010

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

1995

1994

1992

1987

Wrote 28 papers:

STOC-2015-DworkFHPRR #adaptation #data analysis #statistics: Preserving Statistical Validity in Adaptive Data Analysis (CD, VF, MH, TP, OR, ALR), pp. 117–126.
STOC-2014-GoosP #bound #communication: Communication lower bounds via critical block sensitivity (MG, TP), pp. 847–856.
ICML-c3-2013-ZemelWSPD #learning: Learning Fair Representations (RSZ, YW, KS, TP, CD), pp. 325–333.
ICALP-v1-2011-FilmusPS #bound #exponential: Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds (YF, TP, RS), pp. 618–629.
ICALP-v1-2011-HuangP #game studies #probability: Automatizability and Simple Stochastic Games (LH, TP), pp. 605–617.
LICS-2011-Pitassi #complexity #overview #proving #state of the art: Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent Results (TP), p. 119.
STOC-2010-BeameHP #complexity #proving: Hardness amplification in proof complexity (PB, TH, TP), pp. 87–96.
STOC-2010-DworkNPR #difference #privacy: Differential privacy under continual observation (CD, MN, TP, GNR), pp. 715–724.
ICALP-2007-BeameDPW #communication #complexity #multi #nondeterminism: Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity (PB, MD, TP, PW), pp. 134–145.
LICS-2006-MacielP #bound #composition #proving: Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives (AM, TP), pp. 189–200.
ICALP-2005-BeamePS #bound #communication #complexity #multi: Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity (PB, TP, NS), pp. 1176–1188.
SAT-2004-SangBBKP #component #effectiveness #learning: Combining Component Caching and Clause Learning for Effective Model Counting (TS, FB, PB, HAK, TP), pp. 20–28.
LICS-2003-Buresh-OppenheimP #complexity: The Complexity of Resolution Refinements (JBO, TP), p. 138–?.
STOC-2002-AlekhnovichJPU #exponential: An exponential separation between regular and general resolution (MA, JJ, TP, AU), pp. 448–456.
STOC-2001-AraiPU #complexity: The complexity of analytic tableaux (NHA, TP, AU), pp. 356–363.
STOC-2001-PitassiR #bound #principle: Regular resolution lower bounds for the weak pigeonhole principle (TP, RR), pp. 347–355.
ICALP-2000-Buresh-OppenheimCIP #calculus: Homogenization and the Polynominal Calculus (JBO, MC, RI, TP), pp. 926–937.
STOC-2000-MacielPW #principle #proving: A new proof of the weak pigeonhole principle (AM, TP, ARW), pp. 368–377.
STOC-1999-BussGIP #calculus #linear #polynomial: Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (SRB, DG, RI, TP), pp. 547–556.
STOC-1998-BeameKPS #complexity #on the #proving #random #satisfiability: On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas (PB, RMK, TP, MES), pp. 561–571.
CSL-1997-BussP #principle: Resolution and the Weak Pigeonhole Principle (SRB, TP), pp. 149–156.
STOC-1997-AgrawalAIPR #complexity #reduction: Reducing the Complexity of Reductions (MA, EA, RI, TP, SR), pp. 730–738.
STOC-1997-MacielP #on the #proving: On ACC0[pk] Frege Proofs (AM, TP), pp. 720–729.
STOC-1995-BeameCEIP #complexity #problem: The relative complexity of NP search problems (PB, SAC, JE, RI, TP), pp. 303–314.
STOC-1995-BonetPR #bound #proving: Lower bounds for cutting planes proofs with small coefficients (MLB, TP, RR), pp. 575–584.
LICS-1994-ImpagliazzoPU #bound #proving: Upper and Lower Bounds for Tree-Like Cutting Planes Proofs (RI, TP, AU), pp. 220–228.
STOC-1992-BeameIKPPW #bound #exponential #principle: Exponential Lower Bounds for the Pigeonhole Principle (PB, RI, JK, TP, PP, ARW), pp. 200–220.
ICALP-1987-ShyamasundarNP #network #nondeterminism #semantics: Semantics for Nondeterministic Asynchronous Broadcast Networks (RKS, KTN, TP), pp. 72–83.