Toniann Pitassi (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Toniann Pitassi" in English language version.

refsWebsite

Global rank English rank

4ams.org

451^st place

277^th place

3doi.org

2^nd place

2semanticscholar.org

11^th place

8^th place

2columbia.edu

488^th place

374^th place

1toronto.edu

low place

8,821^st place

1mathgenealogy.org

4,501^st place

3,002^nd place

1mathunion.org

9,965^th place

7,919^th place

1elibm.org

low place

1nyu.edu

1,174^th place

773^rd place

1ias.edu

7,948^th place

5,350^th place

1jstor.org

26^th place

20^th place

1psu.edu

207^th place

136^th place

1acm.org

1,185^th place

840^th place

1eatcs.org

low place

1nasonline.org

3,325^th place

2,396^th place

acm.org

2018 ACM Fellows Honored for Pivotal Achievements that Underpin the Digital Age, Association for Computing Machinery, December 5, 2018

ams.org

mathscinet.ams.org

Bonet, Pitassi & Raz (1997). Bonet, Maria; Pitassi, Toniann; Raz, Ran (1997), "Lower bounds for cutting planes proofs with small coefficients", Journal of Symbolic Logic, 62 (3): 708–728, doi:10.2307/2275569, JSTOR 2275569, MR 1472120.
Beame & Pitassi (1996); Beame et al. (2002). Beame, Paul; Pitassi, Toniann (1996), "Simplified and improved resolution lower bounds", Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 274–282, doi:10.1109/SFCS.1996.548486, MR 1450625, S2CID 14341656. Beame, Paul; Karp, Richard; Pitassi, Toniann; Saks, Michael (2002), "The efficiency of resolution and Davis-Putnam procedures", SIAM Journal on Computing, 31 (4): 1048–1075, doi:10.1137/S0097539700369156, MR 1919956.
Beame et al. (1998); Beame et al. (2002). Beame, Paul; Karp, Richard; Pitassi, Toniann; Saks, Michael (1998), "On the complexity of unsatisfiability proofs for random k-CNF formulas", Proceedings of the 30th ACM Symposium on Theory of Computing, pp. 561–571, CiteSeerX 10.1.1.39.213, doi:10.1145/276698.276870, MR 1715604, S2CID 10262912. Beame, Paul; Karp, Richard; Pitassi, Toniann; Saks, Michael (2002), "The efficiency of resolution and Davis-Putnam procedures", SIAM Journal on Computing, 31 (4): 1048–1075, doi:10.1137/S0097539700369156, MR 1919956.
Beame & Pitassi (1998). Beame, Paul; Pitassi, Toniann (1998), "Propositional proof complexity: past, present, and future", Bulletin of the European Association for Theoretical Computer Science (65): 66–89, MR 1650939. Reprinted in Current Trends in Theoretical Computer Science, World Scientific, 2001, MR 1886033.

columbia.edu

cs.columbia.edu

"toniann pitassi | Department of Computer Science, Columbia University". www.cs.columbia.edu. Retrieved May 4, 2022.

news.columbia.edu

"Four Columbians Elected to the National Academy of Sciences". Columbia News. Retrieved May 4, 2022.

doi.org

Bonet, Pitassi & Raz (1997). Bonet, Maria; Pitassi, Toniann; Raz, Ran (1997), "Lower bounds for cutting planes proofs with small coefficients", Journal of Symbolic Logic, 62 (3): 708–728, doi:10.2307/2275569, JSTOR 2275569, MR 1472120.
Beame & Pitassi (1996); Beame et al. (2002). Beame, Paul; Pitassi, Toniann (1996), "Simplified and improved resolution lower bounds", Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 274–282, doi:10.1109/SFCS.1996.548486, MR 1450625, S2CID 14341656. Beame, Paul; Karp, Richard; Pitassi, Toniann; Saks, Michael (2002), "The efficiency of resolution and Davis-Putnam procedures", SIAM Journal on Computing, 31 (4): 1048–1075, doi:10.1137/S0097539700369156, MR 1919956.
Beame et al. (1998); Beame et al. (2002). Beame, Paul; Karp, Richard; Pitassi, Toniann; Saks, Michael (1998), "On the complexity of unsatisfiability proofs for random k-CNF formulas", Proceedings of the 30th ACM Symposium on Theory of Computing, pp. 561–571, CiteSeerX 10.1.1.39.213, doi:10.1145/276698.276870, MR 1715604, S2CID 10262912. Beame, Paul; Karp, Richard; Pitassi, Toniann; Saks, Michael (2002), "The efficiency of resolution and Davis-Putnam procedures", SIAM Journal on Computing, 31 (4): 1048–1075, doi:10.1137/S0097539700369156, MR 1919956.

eatcs.org

The EATCS Award 2021 - Laudatio for Toniann (Toni) Pitassi, European Association for Theoretical Computer Science, June 4, 2021

elibm.org

Pitassi, Toniann (1998). "Unsolvable systems of equations and proof complexity". Doc. Math. (Bielefeld) Extra Vol. ICM Berlin, 1998, vol. III. pp. 451–458.

ias.edu

"Toniann Pitassi". Institute for Advanced Study. Retrieved December 31, 2017.

jstor.org

Bonet, Pitassi & Raz (1997). Bonet, Maria; Pitassi, Toniann; Raz, Ran (1997), "Lower bounds for cutting planes proofs with small coefficients", Journal of Symbolic Logic, 62 (3): 708–728, doi:10.2307/2275569, JSTOR 2275569, MR 1472120.

mathgenealogy.org

Toniann Pitassi at the Mathematics Genealogy Project

mathunion.org

"ICM Plenary and Invited Speakers". International Mathematical Union. Retrieved December 31, 2017.

nasonline.org

"2022 NAS Election". nasonline.org. Retrieved May 4, 2022.

nyu.edu

cs.nyu.edu

"STOC 2012 - 44th ACM Symposium on Theory of Computing". New York University, Computer Science Department. Retrieved December 31, 2017.

psu.edu

citeseerx.ist.psu.edu

Beame et al. (1998); Beame et al. (2002). Beame, Paul; Karp, Richard; Pitassi, Toniann; Saks, Michael (1998), "On the complexity of unsatisfiability proofs for random k-CNF formulas", Proceedings of the 30th ACM Symposium on Theory of Computing, pp. 561–571, CiteSeerX 10.1.1.39.213, doi:10.1145/276698.276870, MR 1715604, S2CID 10262912. Beame, Paul; Karp, Richard; Pitassi, Toniann; Saks, Michael (2002), "The efficiency of resolution and Davis-Putnam procedures", SIAM Journal on Computing, 31 (4): 1048–1075, doi:10.1137/S0097539700369156, MR 1919956.

semanticscholar.org

api.semanticscholar.org

Beame & Pitassi (1996); Beame et al. (2002). Beame, Paul; Pitassi, Toniann (1996), "Simplified and improved resolution lower bounds", Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 274–282, doi:10.1109/SFCS.1996.548486, MR 1450625, S2CID 14341656. Beame, Paul; Karp, Richard; Pitassi, Toniann; Saks, Michael (2002), "The efficiency of resolution and Davis-Putnam procedures", SIAM Journal on Computing, 31 (4): 1048–1075, doi:10.1137/S0097539700369156, MR 1919956.
Beame et al. (1998); Beame et al. (2002). Beame, Paul; Karp, Richard; Pitassi, Toniann; Saks, Michael (1998), "On the complexity of unsatisfiability proofs for random k-CNF formulas", Proceedings of the 30th ACM Symposium on Theory of Computing, pp. 561–571, CiteSeerX 10.1.1.39.213, doi:10.1145/276698.276870, MR 1715604, S2CID 10262912. Beame, Paul; Karp, Richard; Pitassi, Toniann; Saks, Michael (2002), "The efficiency of resolution and Davis-Putnam procedures", SIAM Journal on Computing, 31 (4): 1048–1075, doi:10.1137/S0097539700369156, MR 1919956.

toronto.edu

cs.toronto.edu

"Toniann Pitassi". University of Toronto. Retrieved December 31, 2017.