📄 http:^^www-cse.ucsd.edu^users^russell^
字号:
Date: Thu, 21 Nov 1996 20:09:39 GMTServer: NCSA/1.4.2Content-type: text/htmlLast-modified: Wed, 25 Sep 1996 20:15:30 GMTContent-length: 3698<HTML><TITLE>Russell Impagliazzo's </TITLE><H1>Russell Impagliazzo </H1> <!WA0><A HREF="http://www-cse.ucsd.edu/"> Department of Computer Science and Engineering</A><br> University of California, San Diego<br> La Jolla, CA 92093-0114<br> </H2> <P> <B>Office:</B> 4111 Applied Physics and Mathematics Building (APM)<br> <B>Phone:</B> (619) 534-1332;<tt> </tt> <B>Fax:</B> (619) 534-7029;<tt> </tt> <BR> <B>Email: </B> russell@cs.ucsd.edu<br> <P> I am an assistant professor specializing in complexity theory. My research is in circuit lower bounds, theory of cryptography and computational randomness. <HR> <P>Courses for Fall 96<br><!WA1><A HREF="http://www-cse.ucsd.edu/classes/fa96/cse101" >CSE 101- Algorithms</A><br><br><!WA2><A HREF="http://www-cse.ucsd.edu/classes/fa96/cse202" >CSE 202- Algorithms</A><br>OFFICE HOURS: M -F:1:00-2:00101 Students have priority Mondays and Wednesdays, 202Students have priority Tuesdays and Thursdays.<HR><P><BR>Research papers<P>P. Beame , S. Cook, <!WA3><A HREF="http://www.icsi.berkeley.edu/~edmonds/"> J. Edmonds </A> R. Impagliazzo, and T. Pitassi,<!WA4><A HREF= "http://www-cse.ucsd.edu/users/russell/search.ps"> The Relative Complexity of NP Search Problems </A><P><!WA5><A HREF= "http://www-cse.ucsd.edu/users/russell/conn.ps"> P. Beame, R. Impagliazzo, and T. Pitassi, Improved depth lower bounds for small distance connectivity </A><P><!WA6><A HREF= "http://www-cse.ucsd.edu/users/russell/nsatz.ps"> P. Beame, R. Impagliazzo, J. Krajcek, T. Pitassi, andP.Pudlak, Lower bounds on Hilbert's Nullstellensatz and propositionalproofs.</A><P><!WA7><A HREF= "http://www-cse.ucsd.edu/users/russell/andrea.ps"> A. Clementi and R. Impagliazzo, The reachability problem forfinite cellular automata </A> <P><!WA8><A HREF="http://www.icsi.berkeley.edu/~edmonds/"> J. Edmonds </A> R. Impagliazzo, <!WA9><A HREF="http://www.cs.cmu.edu/afs/cs.cmu.edu/user/rudich/www"> S. Rudich </A> and J. Sgall, <!WA10><A HREF= "http://www-cse.ucsd.edu/users/russell/eirs.ps"> Communication complexity towards lower bounds on circuitdepth</A> <P><!WA11><A HREF= "http://www-cse.ucsd.edu/users/russell/arvind.ps"> A. Gupta and R. Impagliazzo, Computing Planar Intertwines</A> <P>J. Hastad, R. Impagliazzo, <!WA12><A HREF="http://cs-www.bu.edu/faculty/lnd/main_menu.html"> L.Levin, </A>and M. Luby, <br> <!WA13><A HREF= "http://www-cse.ucsd.edu/users/russell/sicomp.ps"> Construction of a pseudo-random generator from any one-wayfunction.</A> <P><!WA14><A HREF= "http://www-cse.ucsd.edu/users/russell/average.ps"> R. Impagliazzo, A Personal View of Average-Case Complexity</A><P><!WA15><A HREF= "http://www-cse.ucsd.edu/users/russell/hardcore.ps"> R. Impagliazzo, Hardcore Distributions for Somewhat HardProblems </A><P>R. Impagliazzo and <!WA16><AHREF="http://www.wisdom.weizmann.ac.il/people/homepages/naor/naor.html">M. Naor </A>,<!WA17><A HREF= "http://www-cse.ucsd.edu/users/russell/moni.ps"> Efficient cryptographic schemesprovably as secure as subset sum.</A><P>R. Impagliazzo and <!WA18><A HREF="http://www.cs.huji.ac.il/people/staff/noam/index.html"> N. Nisan </A> <br><!WA19><A HREF= "http://www-cse.ucsd.edu/users/russell/noam.ps"> The effects of random restictionon Boolean formulas.</A><P><!WA20><A HREF= "http://www-cse.ucsd.edu/users/russell/ips.ps"> R. Impagliazzo, R. Paturi and M. Saks. Size-depth trade-offs for threshold Circuits.</A><P><!WA21><A HREF= "http://www-cse.ucsd.edu/users/russell/ips.ps"> R. Impagliazzo, T. Pitassi and A. Urqhart. Upper and lower bounds on tree-like cutting planes proofs.</A><P>R. Impagliazzo, <!WA22><A HREF="http://www.cs.huji.ac.il/people/staff/noam/index.html"> N. Nisan </A> and <!WA23><A HREF="http://www.cs.huji.ac.il/people/staff/avi/index.html"> A. Wigderson <br> </A> <!WA24><A HREF= "http://www-cse.ucsd.edu/users/russell/avi.ps"> Pseudorandomness for network algorithms</A><P>R. Impagliazzo and<!WA25><A HREF="http://www.cs.cmu.edu/afs/cs.cmu.edu/user/rudich"> S. Rudich</A> ,<br><!WA26><A HREF= "http://www-cse.ucsd.edu/users/russell/secret.ps"> Limits on the ProvableConsequences of One-Way Permutations</A><P><P><!WA27><A HREF= "http://www-cse.ucsd.edu/users/russell/toni.ps"> T. Pitassi, P. Beame, and R. Impagliazzo, Exponential lower bounds for constant depth Fregeproofs of the pigeonhole principle.</A>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -