📄 http:^^www.cs.arizona.edu^people^toni^
字号:
Date: Thu, 21 Nov 1996 19:51:09 GMTServer: NCSA/1.5Content-type: text/htmlLast-modified: Wed, 04 Sep 1996 19:47:42 GMTContent-length: 3220<head><title> UofA, CS, Toniann Pitassi </title></head><center><h1> Toniann Pitassi's Home Page </h1></center><body>Pitassi received bachelors and masters degrees from Pennsylvania State Universityand then received a PhD from the University of Toronto in1992. After that, Toni spent 2 years as a postdoc at UCSD,and then 2 years as an assistant professor (in mathematics witha joint appt in computer science) at the University of Pittsburgh.Since September, 1996, she has been at the Department of ComputerScience at the University of Arizona, as an assistant professor.<a name="contactinfo"><h2> Contact Information: </h2><address>Phone: (+1) 520-621-4526 <br> Fax: (+1) 520-621-4246 <br>E-Mail: <!WA0><a href="mailto:toni@cs.arizona.edu">toni@cs.arizona.edu</a></address><hr><a name="interests"><h2> Research Interests </h2><ul><li> Complexity theory </li><li> Logic, bounded arithmetic<li> propositional theorem proving (both lower bounds as well asautomated theorem proving<li> concrete complexity theory, algorithms</ul><a name="pubs"><h2> Recent Papers </h2><ul><li><!WA1><a href="http://www.cs.arizona.edu/people/toni/papers/bceip-stoc95.ps"> The relative complexity of NP Search Problems</a>, with Paul Beame, Steve Cook, Jeff Edmonds and Russell Impagliazzo. <i> Proceedings from 27th ACM Symposium on Theory of Computing</i>, 1995, pp. 303-314.<li><!WA2><a href="http://www.cs.arizona.edu/people/toni/papers/bonet-pitassi-raz.ps"> Lower bounds for Cutting Planes proofs with Small Coefficients</a>, with Maria Bonet and Ran Raz. <i> Proceedings from 26th ACM Symposium on Theory of Computing</i>, 1995, pp. 575-584. (The full version of this paper will appear in the Journal of Symbolic Logic.) <li><!WA3><a href="http://www.cs.arizona.edu/people/toni/papers/buss-pitassi-induction.ps"> Good degree bounds on Nullstellensatz refutations of the induction principle</a>, with Sam Buss. <i> Proceedings from the Symposium on Computational Complexity, 1996</i>.<li><!WA4><a href="http://www.cs.arizona.edu/people/toni/papers/hajos.ps"> The complexity of the Hajos Calculus</a>, with Alasdair Urquhart. <i>Proceedings from 33rd IEEE Symposium on Foundations of Computer Science</i>, pp. 187-196. (The full version of this paper appeared in SIAM Journal on Discrete Mathematics, Vol 8, Issue 3, August 1995.)<li><!WA5><a href="http://www.cs.arizona.edu/people/toni/papers/nullsatz-focs94.ps"> Lower bounds for Hilbert's Nullstellensatz and propositional proofs</a>, with Paul Beame, Russell Impagliazzo, Jan Krajicek and Pavel Pudlak. <i>Proceedings from 35th IEEE Symposium on Foundations of Computer Science</i>, 1994, pp. 794-806. (Full version to appear in Proceedings of the London Mathematical Society.) <li><!WA6><a href="http://www.cs.arizona.edu/people/toni/papers/resolution-focs96.ps"> Simplified and improved Resolution lower bounds</a>, with Paul Beame. <i>Proceedings from Symposium on Foundations of Computer Science</i>, to appear.<li><!WA7><a href="http://www.cs.arizona.edu/people/toni/papers/stconn-focs.ps"> Improved depth lower bounds for small distance connectivity</a>, with Paul Beame and Russell Impagliazzo. <i>Proceedings from 36th IEEE Symposium on Foundations of Computer Science</i> 1995, pp. 692-703. <br><br>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -