dblp.uni-trier.dewww.uni-trier.de

Russell Impagliazzo Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
124EERussell Impagliazzo, Valentine Kabanets, Avi Wigderson: New direct-product testers and 2-query PCPs. STOC 2009: 131-140
123EERussell Impagliazzo, Valentine Kabanets, Antonina Kolokolova: An axiomatic approach to algebrization. STOC 2009: 695-704
122EEYevgeniy Dodis, Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets: Security Amplification for InteractiveCryptographic Primitives. TCC 2009: 128-145
121EESashka Davis, Russell Impagliazzo: Models of Greedy Algorithms for Graph Problems. Algorithmica 54(3): 269-317 (2009)
120EERussell Impagliazzo, Philippe Moser: A zero-one law for RP and derandomization of AM if NP is not small. Inf. Comput. 207(7): 787-792 (2009)
119EERussell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets: Chernoff-Type Direct Product Theorems. J. Cryptology 22(1): 75-92 (2009)
2008
118EERussell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson: Uniform direct product theorems: simplified, optimized, and derandomized. STOC 2008: 579-588
117EELance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans: On the Complexity of Succinct Zero-Sum Games. Computational Complexity 17(3): 353-376 (2008)
116EERussell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson: Uniform Direct-Product Theorems: Simplified, Optimized, and Derandomized. Electronic Colloquium on Computational Complexity (ECCC) 15(079): (2008)
115EEChris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi: The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. J. Comput. Syst. Sci. 74(3): 386-393 (2008)
2007
114EERussell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets: Chernoff-Type Direct Product Theorems. CRYPTO 2007: 500-516
113EEPaul Beame, Russell Impagliazzo, Ashish Sabharwal: The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs. Computational Complexity 16(3): 245-297 (2007)
2006
112EESashka Davis, Jeff Edmonds, Russell Impagliazzo: Online Algorithms to Minimize Resource Reallocations and Network Communication. APPROX-RANDOM 2006: 104-115
111EERussell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets: Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification. FOCS 2006: 187-196
110EEChris Calabro, Russell Impagliazzo, Ramamohan Paturi: A Duality between Clause Width and Clause Density for SAT. IEEE Conference on Computational Complexity 2006: 252-260
109EERussell Impagliazzo: Can every randomized algorithm be derandomized? STOC 2006: 373-374
108EERussell Impagliazzo, Nathan Segerlind: Constant-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations. ACM Trans. Comput. Log. 7(2): 199-218 (2006)
107EERussell Impagliazzo, Ronen Shaltiel, Avi Wigderson: Reducing The Seed Length In The Nisan-Wigderson Generator. Combinatorica 26(6): 647-681 (2006)
106EEAlan Nash, Russell Impagliazzo, Jeffrey B. Remmel: Infinitely-Often Universal Languages and Diagonalization. Electronic Colloquium on Computational Complexity (ECCC) 13(051): (2006)
105EEPaul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind: Formula Caching in DPLL. Electronic Colloquium on Computational Complexity (ECCC) 13(140): (2006)
104EERussell Impagliazzo, Bruce M. Kapron: Logics for reasoning about cryptographic constructions. J. Comput. Syst. Sci. 72(2): 286-320 (2006)
103EEBoaz Barak, Russell Impagliazzo, Avi Wigderson: Extracting Randomness Using Few Independent Sources. SIAM J. Comput. 36(4): 1095-1118 (2006)
2005
102EERussell Impagliazzo: Computational Complexity Since 1980. FSTTCS 2005: 19-47
101EEMichael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi: Toward a Model for Backtracking and Dynamic Programming. IEEE Conference on Computational Complexity 2005: 308-322
100EELance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans: On the Complexity of Succinct Zero-Sum Games. IEEE Conference on Computational Complexity 2005: 323-332
99EESashka Davis, Russell Impagliazzo: Models of Greedy Algorithms for Graph Problems Electronic Colloquium on Computational Complexity (ECCC)(120): (2005)
2004
98EEBoaz Barak, Russell Impagliazzo, Avi Wigderson: Extracting Randomness Using Few Independent Sources. FOCS 2004: 384-393
97EESashka Davis, Russell Impagliazzo: Models of greedy algorithms for graph problems. SODA 2004: 381-390
96EEEli Ben-Sasson, Russell Impagliazzo, Avi Wigderson: Near Optimal Separation Of Tree-Like And General Resolution. Combinatorica 24(4): 585-603 (2004)
95EEValentine Kabanets, Russell Impagliazzo: Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. Computational Complexity 13(1-2): 1-46 (2004)
94EELance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans: On the complexity of succinct zero-sum games Electronic Colloquium on Computational Complexity (ECCC)(001): (2004)
93EENathan Segerlind, Samuel R. Buss, Russell Impagliazzo: A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution. SIAM J. Comput. 33(5): 1171-1200 (2004)
2003
92EERussell Impagliazzo, Bruce M. Kapron: Logics for Reasoning about Cryptographic Constructions. FOCS 2003: 372-383
91EEChris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi: The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. IEEE Conference on Computational Complexity 2003: 135-
90EEPaul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind: Memoization and DPLL: Formula Caching Proof Systems. IEEE Conference on Computational Complexity 2003: 248-
89EEAlan Nash, Russell Impagliazzo, Jeffrey B. Remmel: Universal Languages and the Power of Diagonalization. IEEE Conference on Computational Complexity 2003: 337-346
88EERussell Impagliazzo, Philippe Moser: A zero one law for RP. IEEE Conference on Computational Complexity 2003: 48-52
87EEValentine Kabanets, Russell Impagliazzo: Derandomizing polynomial identity tests means proving circuit lower bounds. STOC 2003: 355-364
86EERussell Impagliazzo, Sara Miner More: Anonymous credentials with biometrically-enforced non-transferability. WPES 2003: 60-71
85EERussell Impagliazzo: Hardness as randomness: a survey of universal derandomization CoRR cs.CC/0304040: (2003)
84EERussell Impagliazzo, Nathan Segerlind: Constant-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations CoRR cs.CC/0308012: (2003)
2002
83EENathan Segerlind, Samuel R. Buss, Russell Impagliazzo: A Switching Lemma for Small Restrictions and Lower Bounds for k - DNF Resolution. FOCS 2002: 604-
82EERussell Impagliazzo, Nathan Segerlind: Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations. ICALP 2002: 208-219
81EEJosh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi: Homogenization and the polynomial calculus. Computational Complexity 11(3-4): 91-108 (2002)
80EEValentine Kabanets, Russell Impagliazzo: Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds Electronic Colloquium on Computational Complexity (ECCC)(055): (2002)
79EERussell Impagliazzo, Valentine Kabanets, Avi Wigderson: In search of an easy witness: exponential time vs. probabilistic polynomial time. J. Comput. Syst. Sci. 65(4): 672-694 (2002)
78EERussell Impagliazzo, Jan Krajícek: A Note on Conservativity Relations among Bounded Arithmetic Theories. Math. Log. Q. 48(3): 375-377 (2002)
2001
77EEBoaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang: On the (Im)possibility of Obfuscating Programs. CRYPTO 2001: 1-18
76 Russell Impagliazzo, Nathan Segerlind: Counting Axioms Do Not Polynomially Simulate Counting Gates. FOCS 2001: 200-209
75EERussell Impagliazzo, Valentine Kabanets, Avi Wigderson: In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time. IEEE Conference on Computational Complexity 2001: 2-12
74EEPaul Beame, Russell Impagliazzo, Ashish Sabharwal: Resolution Complexity of Independent Sets in Random Graphs. IEEE Conference on Computational Complexity 2001: 52-68
73EERussell Impagliazzo: Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems. RANDOM-APPROX 2001: 2-5
72EETed Carson, Russell Impagliazzo: Hill-climbing finds random planted bisections. SODA 2001: 903-909
71EEManindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich: Reducing the complexity of reductions. Computational Complexity 10(2): 117-138 (2001)
70EEJeff Edmonds, Russell Impagliazzo, Steven Rudich, Jiri Sgall: Communication complexity towards lower bounds on circuit depth. Computational Complexity 10(3): 210-246 (2001)
69EEBoaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang: On the (Im)possibility of Obfuscating Programs Electronic Colloquium on Computational Complexity (ECCC) 8(057): (2001)
68 Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi: Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes. J. Comput. Syst. Sci. 62(2): 267-289 (2001)
67 Russell Impagliazzo, Ramamohan Paturi: On the Complexity of k-SAT. J. Comput. Syst. Sci. 62(2): 367-375 (2001)
66EERussell Impagliazzo, Ramamohan Paturi, Francis Zane: Which Problems Have Strongly Exponential Complexity? J. Comput. Syst. Sci. 63(4): 512-530 (2001)
65EERussell Impagliazzo, Avi Wigderson: Randomness vs Time: Derandomization under a Uniform Assumption. J. Comput. Syst. Sci. 63(4): 672-688 (2001)
2000
64EEJosh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi: Homogenization and the Polynominal Calculus. ICALP 2000: 926-937
63EEPavel Pudlák, Russell Impagliazzo: A lower bound for DLL algorithms for k-SAT (preliminary version). SODA 2000: 128-136
62EERussell Impagliazzo, Ronen Shaltiel, Avi Wigderson: Extractors and pseudo-random generators with optimal seed length. STOC 2000: 1-10
61EEEli Ben-Sasson, Russell Impagliazzo, Avi Wigderson: Near-Optimal Separation of Treelike and General Resolution Electronic Colloquium on Computational Complexity (ECCC) 7(5): (2000)
60EERussell Impagliazzo, Ronen Shaltiel, Avi Wigderson: Extractors and pseudo-random generators with optimal seed length Electronic Colloquium on Computational Complexity (ECCC) 7(9): (2000)
1999
59EERussell Impagliazzo, Ronen Shaltiel, Avi Wigderson: Near-Optimal Conversion of Hardness into Pseudo-Randomness. FOCS 1999: 181-190
58EEEli Ben-Sasson, Russell Impagliazzo: Random CNF's are Hard for the Polynomial Calculus. FOCS 1999: 415-421
57EERussell Impagliazzo, Ramamohan Paturi: Complexity of k-SAT. IEEE Conference on Computational Complexity 1999: 237-240
56EESamuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi: Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract). IEEE Conference on Computational Complexity 1999: 5
55EEGiovanni Di Crescenzo, Niels Ferguson, Russell Impagliazzo, Markus Jakobsson: How to Forget a Secret. STACS 1999: 500-509
54EEGiovanni Di Crescenzo, Russell Impagliazzo: Security-Preserving Hardness-Amplification for Any Regular One-Way Function. STOC 1999: 169-178
53EESamuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi: Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes. STOC 1999: 547-556
52 Russell Impagliazzo, Pavel Pudlák, Jiri Sgall: Lower Bounds for the Polynomial Calculus and the Gröbner Basis Algorithm. Computational Complexity 8(2): 127-144 (1999)
51 Johan Håstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby: A Pseudorandom Generator from any One-way Function. SIAM J. Comput. 28(4): 1364-1396 (1999)
1998
50EERussell Impagliazzo, Ramamohan Paturi, Francis Zane: Which Problems Have Strongly Exponential Complexity? FOCS 1998: 653-663
49EERussell Impagliazzo, Avi Wigderson: Randomness vs. Time: De-Randomization under a Uniform Assumption. FOCS 1998: 734-743
48EEGiovanni Di Crescenzo, Russell Impagliazzo: Proofs of Membership vs. Proofs of Knowledge. IEEE Conference on Computational Complexity 1998: 34-45
47 Tassos Dimitriou, Russell Impagliazzo: Go with the Winners for Graph Bisection. SODA 1998: 510-520
46EEPaul Beame, Russell Impagliazzo, Toniann Pitassi: Improved Depth Lower Bounds for Small Distance Connectivity. Computational Complexity 7(4): 325-345 (1998)
45 Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi: The Relative Complexity of NP Search Problems. J. Comput. Syst. Sci. 57(1): 3-19 (1998)
1997
44EEMihir Bellare, Russell Impagliazzo, Moni Naor: Does Parallel Repetition Lower the Error in Computationally Sound Protocols? FOCS 1997: 374-383
43 Russell Impagliazzo: Using Hard Problems to Derandomize Algorithms: An Incomplete Survey. RANDOM 1997: 165-173
42EERussell Impagliazzo, Avi Wigderson: P = BPP if E Requires Exponential Circuits: Derandomizing the XOR Lemma. STOC 1997: 220-229
41EEManindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich: Reducing the Complexity of Reductions. STOC 1997: 730-738
40 Samuel R. Buss, Russell Impagliazzo, Jan Krajícek, Pavel Pudlák, Alexander A. Razborov, Jiri Sgall: Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems with Modular Counting. Computational Complexity 6(3): 256-298 (1997)
39EERussell Impagliazzo, Pavel Pudlák, Jiri Sgall: Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm Electronic Colloquium on Computational Complexity (ECCC) 4(42): (1997)
38 Stephen A. Cook, Russell Impagliazzo, Tomoyuki Yamakami: A Tight Relationship Between Generic Oracles and Type-2 Complexity Theory. Inf. Comput. 137(2): 159-170 (1997)
37 Russell Impagliazzo, Ramamohan Paturi, Michael E. Saks: Size-Depth Tradeoffs for Threshold Circuits. SIAM J. Comput. 26(3): 693-707 (1997)
36EEArvind Gupta, Russell Impagliazzo: Bounding the Size of Planar Intertwines. SIAM J. Discrete Math. 10(3): 337-358 (1997)
1996
35EEMarkus Jakobsson, Kazue Sako, Russell Impagliazzo: Designated Verifier Proofs and Their Applications. EUROCRYPT 1996: 143-154
34EEMatthew Clegg, Jeff Edmonds, Russell Impagliazzo: Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability. STOC 1996: 174-183
33EETassos Dimitriou, Russell Impagliazzo: Towards an Analysis of Local Optimization Algorithms. STOC 1996: 304-313
32 Faith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski: Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. J. Comput. Syst. Sci. 53(1): 104-111 (1996)
31 Russell Impagliazzo, Moni Naor: Efficient Cryptographic Schemes Provably as Secure as Subset Sum. J. Cryptology 9(4): 199-216 (1996)
1995
30 Russell Impagliazzo: Hard-Core Distributions for Somewhat Hard Problems. FOCS 1995: 538-545
29 Paul Beame, Russell Impagliazzo, Toniann Pitassi: Improved Depth Lower Vounds for Small Distance Connectivity. FOCS 1995: 692-701
28EEPaul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi: The relative complexity of NP search problems. STOC 1995: 303-314
27 Russell Impagliazzo: A Personal View of Average-Case Complexity. Structure in Complexity Theory Conference 1995: 134-147
26EEAndrea E. F. Clementi, Russell Impagliazzo: The Reachability Problem for Finite Cellular Automata. Inf. Process. Lett. 53(1): 27-31 (1995)
1994
25EEAndrea E. F. Clementi, Russell Impagliazzo: Graph Theory and Interactive Protocols for Reachability Problems on Finite Cellular Automata. CIAC 1994: 73-90
24 Paul Beame, Russell Impagliazzo, Jan Krajícek, Toniann Pitassi, Pavel Pudlák: Lower Bound on Hilbert's Nullstellensatz and propositional proofs FOCS 1994: 794-806
23 Russell Impagliazzo, Toniann Pitassi, Alasdair Urquhart: Upper and Lower Bounds for Tree-Like Cutting Planes Proofs LICS 1994: 220-228
22EERussell Impagliazzo, Noam Nisan, Avi Wigderson: Pseudorandomness for network algorithms. STOC 1994: 356-364
21 Russell Impagliazzo, Ran Raz, Avi Wigderson: A Direct Product Theorem. Structure in Complexity Theory Conference 1994: 88-96
1993
20EEFaith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski: Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. STACS 1993: 386-397
19EERussell Impagliazzo, Ramamohan Paturi, Michael E. Saks: Size-depth trade-offs for threshold circuits. STOC 1993: 541-550
18 Toniann Pitassi, Paul Beame, Russell Impagliazzo: Exponential Lower Bounds for the Pigeonhole Principle. Computational Complexity 3: 97-140 (1993)
17 David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir: On Dice and Coins: Models of Computation for Random Generation Inf. Comput. 104(2): 159-174 (1993)
16 Russell Impagliazzo, Noam Nisan: The Effect of Random Restrictions on Formula Size. Random Struct. Algorithms 4(2): 121-134 (1993)
1992
15 Paul Beame, Russell Impagliazzo, Jan Krajícek, Toniann Pitassi, Pavel Pudlák, Alan R. Woods: Exponential Lower Bounds for the Pigeonhole Principle STOC 1992: 200-220
1991
14 Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jiri Sgall: Communication Complexity Towards Lower Bounds on Circuit Depth FOCS 1991: 249-257
13 Arvind Gupta, Russell Impagliazzo: Computing Planar Intertwines FOCS 1991: 802-811
1990
12 Oded Goldreich, Russell Impagliazzo, Leonid A. Levin, Ramarathnam Venkatesan, David Zuckerman: Security Preserving Amplification of Hardness FOCS 1990: 318-326
11 Russell Impagliazzo, Leonid A. Levin: No Better Ways to Generate Hard NP Instances than Picking Uniformly at Random FOCS 1990: 812-821
1989
10 Russell Impagliazzo, Gábor Tardos: Decision Versus Search Problems in Super-Polynomial Time FOCS 1989: 222-227
9 Russell Impagliazzo, Michael Luby: One-way Functions are Essential for Complexity Based Cryptography (Extended Abstract) FOCS 1989: 230-235
8 Russell Impagliazzo, Moni Naor: Efficient Cryptographic Schemes Provably as Secure as Subset Sum FOCS 1989: 236-241
7 Russell Impagliazzo, David Zuckerman: How to Recycle Random Bits FOCS 1989: 248-253
6EEDavid Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir: On Dice and Coins: Models of Computation for Random Generation. ICALP 1989: 319-340
5 Russell Impagliazzo, Leonid A. Levin, Michael Luby: Pseudo-random Generation from one-way functions (Extended Abstracts) STOC 1989: 12-24
4 Russell Impagliazzo, Steven Rudich: Limits on the Provable Consequences of One-Way Permutations STOC 1989: 44-61
1988
3EERussell Impagliazzo, Steven Rudich: Limits on the Provable Consequences of One-way Permutations. CRYPTO 1988: 8-26
1987
2EERussell Impagliazzo, Moti Yung: Direct Minimum-Knowledge Computations. CRYPTO 1987: 40-51
1 Manuel Blum, Russell Impagliazzo: Generic Oracles and Oracle Classes (Extended Abstract) FOCS 1987: 118-126

Coauthor Index

1Manindra Agrawal [41] [71]
2Michael Alekhnovich [101]
3Eric Allender [41] [71]
4Boaz Barak [69] [77] [98] [103]
5Paul Beame [15] [18] [24] [28] [29] [45] [46] [74] [90] [105] [113]
6Mihir Bellare [44]
7Eli Ben-Sasson [58] [61] [96]
8Manuel Blum [1]
9Allan Borodin [101]
10Joshua Buresh-Oppenheim (Josh Buresh-Oppenheim) [64] [81] [101]
11Samuel R. Buss [40] [53] [56] [68] [83] [93]
12Chris Calabro [91] [110] [115]
13Ted Carson [72]
14Matthew Clegg [34] [64] [81]
15Andrea E. F. Clementi [25] [26]
16Stephen A. Cook [28] [38] [45]
17Giovanni Di Crescenzo [48] [54] [55]
18Sashka Davis [97] [99] [112] [121]
19Tassos Dimitriou [33] [47]
20Yevgeniy Dodis [122]
21Jeff Edmonds [14] [28] [34] [45] [70] [112]
22Faith Ellen (Faith Ellen Fich, Faith E. Fich) [20] [32]
23David Feldman [6] [17]
24Niels Ferguson [55]
25Lance Fortnow [94] [100] [117]
26Oded Goldreich [12] [69] [77]
27Dima Grigoriev [53] [56] [68]
28Arvind Gupta [13] [36]
29Johan Håstad [51]
30Ragesh Jaiswal [111] [114] [116] [118] [119] [122]
31Markus Jakobsson [35] [55]
32Valentine Kabanets [75] [79] [80] [87] [91] [94] [95] [100] [111] [114] [115] [116] [117] [118] [119] [122] [123] [124]
33Bruce M. Kapron [20] [32] [92] [104]
34Valerie King [20] [32]
35Antonina Kolokolova [123]
36Jan Krajícek [15] [24] [40] [78]
37Miroslaw Kutylowski [20] [32]
38Leonid A. Levin [5] [11] [12] [51]
39Michael Luby [5] [9] [51]
40Avner Magen [101]
41Sara Miner More [86]
42Philippe Moser [88] [120]
43Moni Naor [6] [8] [17] [31] [44]
44Alan Nash [89] [106]
45Noam Nisan [6] [16] [17] [22]
46Ramamohan Paturi [19] [37] [50] [57] [66] [67] [91] [110] [115]
47Toniann Pitassi [15] [18] [23] [24] [28] [29] [41] [45] [46] [53] [56] [64] [68] [71] [81] [90] [101] [105]
48Pavel Pudlák [15] [24] [39] [40] [52] [63]
49Ran Raz [21]
50Alexander A. Razborov [40]
51Jeffrey B. Remmel [89] [106]
52Steven Rudich [3] [4] [6] [14] [17] [41] [69] [70] [71] [77]
53Ashish Sabharwal [74] [113]
54Amit Sahai [69] [77]
55Kazue Sako [35]
56Michael E. Saks [19] [37]
57Nathan Segerlind [76] [82] [83] [84] [90] [93] [105] [108]
58Jiri Sgall [14] [39] [40] [52] [70]
59Ronen Shaltiel [59] [60] [62] [107]
60Adi Shamir [6] [17]
61Gábor Tardos [10]
62Christopher Umans [94] [100] [117]
63Alasdair Urquhart [23]
64Salil P. Vadhan [69] [77]
65Ramarathnam Venkatesan [12]
66Avi Wigderson [21] [22] [42] [49] [59] [60] [61] [62] [65] [75] [79] [96] [98] [103] [107] [116] [118] [124]
67Alan R. Woods [15]
68Tomoyuki Yamakami [38]
69Ke Yang [69] [77]
70Moti Yung (Mordechai M. Yung) [2]
71Francis Zane [50] [66]
72David Zuckerman [7] [12]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)