Eric Allender

	2011
147		Eric Allender, Luke Friedman, William I. Gasarch: Limits on the Computational Power of Random Strings. ICALP (1) 2011: 293-304
146		Eric Allender, Fengming Wang: On the Power of Algebraic Branching Programs of Width Two. ICALP (1) 2011: 736-747
145		Eric Allender, Fengming Wang: On the power of algebraic branching programs of width two. Electronic Colloquium on Computational Complexity (ECCC) 18: 83 (2011)
144		Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy: The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory. J. Comput. Syst. Sci. 77(1): 14-40 (2011)
	2010
143		Eric Allender, Vikraman Arvind, Fengming Wang: Uniform Derandomization from Pathetic Lower Bounds. APPROX-RANDOM 2010: 380-393
142		Eric Allender: Avoiding Simplicity Is Complex. CiE 2010: 1-10
141		Eric Allender, Klaus-Jörn Lange: Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. IEEE Conference on Computational Complexity 2010: 172-180
140		Eric Allender, Luke Friedman, William I. Gasarch: Exposition of the Muchnik-Positselsky Construction of a Prefix Free Entropy Function that is not Complete under Truth-Table Reductions. Electronic Colloquium on Computational Complexity (ECCC) 17: 138 (2010)
139		Eric Allender, Luke Friedman, William I. Gasarch: Limits on the Computational Power of Random Strings. Electronic Colloquium on Computational Complexity (ECCC) 17: 139 (2010)
138		Eric Allender: Avoiding Simplicity is Complex. Electronic Colloquium on Computational Complexity (ECCC) 17: 55 (2010)
137		Eric Allender, Vikraman Arvind, Fengming Wang: Uniform Derandomization from Pathetic Lower Bounds. Electronic Colloquium on Computational Complexity (ECCC) 17: 69 (2010)
136		Eric Allender, Klaus-Jörn Lange: Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. Electronic Colloquium on Computational Complexity (ECCC) 17: 70 (2010)
135		Eric Allender, Michal Koucký: Amplifying lower bounds by means of self-reducibility. J. ACM 57(3): (2010)
	2009
134		Eric Allender: A Status Report on the P Versus NP Question. Advances in Computers 77: 117-147 (2009)
133		Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy: The Pervasive Reach of Resource-Bounded Kolmogorov Complexity in Computational Complexity Theory. Electronic Colloquium on Computational Complexity (ECCC) 16: 51 (2009)
132		Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer: The complexity of satisfiability problems: Refining Schaefer's theorem. J. Comput. Syst. Sci. 75(4): 245-254 (2009)
131		Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen: On the Complexity of Numerical Analysis. SIAM J. Comput. 38(5): 1987-2006 (2009)
130		Eric Allender, Vladlen Koltun, Maxim Sviridenko: Special Section On The Thirty-Ninth Annual ACM Symposium On Theory Of Computing (STOC 2007). SIAM J. Comput. 39(3): 978 (2009)
129		Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy: Planar and Grid Graph Reachability Problems. Theory Comput. Syst. 45(4): 675-723 (2009)
	2008
128		Eric Allender: Chipping Away at P vs NP: How Far Are We from Proving Circuit Size Lower Bounds? CATS 2008: 3
127		Eric Allender: Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds. CSR 2008: 3-10
126		Eric Allender: Circuit Complexity, Kolmogorov Complexity, and Prospects for Lower Bounds. DCFS 2008: 7-13
125		Eric Allender, Michal Koucký: Amplifying Lower Bounds by Means of Self-Reducibility. IEEE Conference on Computational Complexity 2008: 31-40
124		Eric Allender: Computational Complexity Theory. Wiley Encyclopedia of Computer Science and Engineering 2008
123		Eric Allender, Michal Koucký: Amplifying Lower Bounds by Means of Self-Reducibility. Electronic Colloquium on Computational Complexity (ECCC) 15(038): (2008)
122		Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks: Minimizing Disjunctive Normal Form Formulas and AC0 Circuits Given a Truth Table. SIAM J. Comput. 38(1): 63-84 (2008)
	2007
121		Eric Allender: Reachability Problems: An Update. CiE 2007: 25-27
	2006
120		Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen: On the Complexity of Numerical Analysis. Complexity of Boolean Functions 2006
119		Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks: Minimizing DNF Formulas and AC0d Circuits Given a Truth Table. IEEE Conference on Computational Complexity 2006: 237-251
118		Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy: Grid Graph Reachability Problems. IEEE Conference on Computational Complexity 2006: 299-313
117		Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen: On the Complexity of Numerical Analysis. IEEE Conference on Computational Complexity 2006: 331-339
116		Eric Allender, Harry Buhrman, Michal Koucký: What can be efficiently reduced to the Kolmogorov-random strings? Ann. Pure Appl. Logic 138(1-3): 2-19 (2006)
115		Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger: Power from Random Strings. SIAM J. Comput. 35(6): 1467-1493 (2006)
114		Eric Allender: NL-printable sets and nondeterministic Kolmogorov complexity. Theor. Comput. Sci. 355(2): 127-138 (2006)
	2005
113		Eric Allender, Samir Datta, Sambuddha Roy: The Directed Planar Reachability Problem. FSTTCS 2005: 238-249
112		Eric Allender, Samir Datta, Sambuddha Roy: Topology Inside NC¹. IEEE Conference on Computational Complexity 2005: 298-307
111		Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer: The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. MFCS 2005: 71-82
110		Eric Allender: Special issue "Conference on Computational Complexity 2004" Guest Editor's foreword. Computational Complexity 14(2): 89 (2005)
109		Eric Allender: Special issue, final part "Conference on Computational Complexity 2004 " Guest Editor's foreword. Computational Complexity 14(3): 185 (2005)
108		Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen: On the Complexity of Numerical Analysis Electronic Colloquium on Computational Complexity (ECCC)(037): (2005)
107		Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks: Minimizing DNF Formulas and AC0 Circuits Given a Truth Table Electronic Colloquium on Computational Complexity (ECCC)(126): (2005)
106		Eric Allender, Samir Datta, Sambuddha Roy: The Directed Planar Reachability Problem Electronic Colloquium on Computational Complexity (ECCC)(148): (2005)
105		Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy: Grid Graph Reachability Problems Electronic Colloquium on Computational Complexity (ECCC)(149): (2005)
	2004
104		Eric Allender, Harry Buhrman, Michal Koucký: What Can be Efficiently Reduced to the K-Random Strings? STACS 2004: 584-595
103		Eric Allender, Harry Buhrman, Michal Koucký: What Can be Efficiently Reduced to the Kolmogorov-Random Strings? Electronic Colloquium on Computational Complexity (ECCC)(044): (2004)
102		Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer: The Complexity of Satisfiability Problems: Refining Schaefer's Theorem Electronic Colloquium on Computational Complexity (ECCC)(100): (2004)
101		Eric Allender, Samir Datta, Sambuddha Roy: Topology inside NC1 Electronic Colloquium on Computational Complexity (ECCC)(108): (2004)
100		Eric Allender, Meena Mahajan: The complexity of planarity testing. Inf. Comput. 189(1): 117-134 (2004)
	2003
99		Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy: Derandomization and Distinguishing Complexity. IEEE Conference on Computational Complexity 2003: 209-220
98		Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor Shparlinski: Complexity of some arithmetic problems for binary polynomials. Computational Complexity 12(1-2): 23-47 (2003)
97		Eric Allender: NL-printable sets and Nondeterministic Kolmogorov Complexity. Electr. Notes Theor. Comput. Sci. 84: 1-15 (2003)
96		Eric Allender, Vikraman Arvind, Meena Mahajan: Arithmetic Complexity, Kleene Closure, and Formal Power Series. Theory Comput. Syst. 36(4): 303-328 (2003)
	2002
95		Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger: Power from Random Strings. FOCS 2002: 669-678
94		Eric Allender, Sanjeev Arora, Michael Kearns, Cristopher Moore, Alexander Russell: A Note on the Representational Incompatibility of Function Approximation and Factored Dynamics. NIPS 2002: 431-437
93		Eric Allender, Harry Buhrman, Michal Koucký, Detlef Ronneburger, Dieter van Melkebeek: Power from Random Strings Electronic Colloquium on Computational Complexity (ECCC)(028): (2002)
92		William Hesse, Eric Allender, David A. Mix Barrington: Uniform constant-depth threshold circuits for division and iterated multiplication. J. Comput. Syst. Sci. 65(4): 695-716 (2002)
	2001
91		Eric Allender: When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity. FSTTCS 2001: 1-15
90		Eric Allender, David A. Mix Barrington, William Hesse: Uniform Circuits for Division: Consequences and Problems. IEEE Conference on Computational Complexity 2001: 150-159
89		Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay: Time-Space Tradeoffs in the Counting Hierarchy. IEEE Conference on Computational Complexity 2001: 295-302
88		Eric Allender: Some Pointed Questions Concerning Asymptotic Lower Bounds, and News from the Isomorphism Front. Current Trends in Theoretical Computer Science 2001: 25-41
87		Eric Allender: The Division Breakthroughs. Bulletin of the EATCS 74: 61-77 (2001)
86		Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich: Reducing the complexity of reductions. Computational Complexity 10(2): 117-138 (2001)
85		Eric Allender, David A. Mix Barrington, William Hesse: Uniform Circuits for Division: Consequences and Problems Electronic Colloquium on Computational Complexity (ECCC) 8(33): (2001)
84		Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay: Time-Space Tradeoffs in the Counting Hierarchy Electronic Colloquium on Computational Complexity (ECCC) 8(41): (2001)
83		Eric Allender, Michael E. Saks, Igor Shparlinski: A Lower Bound for Primality. J. Comput. Syst. Sci. 62(2): 356-366 (2001)
	2000
82		Eric Allender, Meena Mahajan: The Complexity of Planarity Testing. STACS 2000: 87-98
81		Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner: Characterizing Small Depth and Small Space Classes by Operators of Higher Type. Chicago J. Theor. Comput. Sci. 2000: (2000)
80		Eric Allender, David A. Mix Barrington: Uniform Circuits for Division: Consequences and Problems Electronic Colloquium on Computational Complexity (ECCC) 7(65): (2000)
79		Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender: Complexity of finite-horizon Markov decision process problems. J. ACM 47(4): 681-720 (2000)
78		Manindra Agrawal, Eric Allender, Samir Datta: On TC0, AC0, and Arithmetic Circuits. J. Comput. Syst. Sci. 60(2): 395-421 (2000)
77		Klaus Reinhardt, Eric Allender: Making Nondeterminism Unambiguous. SIAM J. Comput. 29(4): 1118-1131 (2000)
76		Eric Allender: Report on the annual summer meeting of the New Zealand mathematics research institute. SIGACT News 31(2): 60-61 (2000)
	1999
75		Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh: Bounded Depth Arithmetic Circuits: Counting and Closure. ICALP 1999: 149-158
74		Eric Allender, Michael E. Saks, Igor Shparlinski: A Lower Bound for Primality. IEEE Conference on Computational Complexity 1999: 10-14
73		Eric Allender: The Permanent Requires Large Uniform Threshold Circuits. Chicago J. Theor. Comput. Sci. 1999: (1999)
72		Eric Allender, Robert Beals, Mitsunori Ogihara: The Complexity of Matrix Rank and Feasible Systems of Linear Equations. Computational Complexity 8(2): 99-126 (1999)
71		Eric Allender, Igor Shparlinski, Michael E. Saks: A Lower Bound for Primality Electronic Colloquium on Computational Complexity (ECCC) 6(10): (1999)
70		Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh: Bounded Depth Arithmetic Circuits: Counting and Closure Electronic Colloquium on Computational Complexity (ECCC) 6(12): (1999)
69		Eric Allender, Vikraman Arvind, Meena Mahajan: Arithmetic Complexity, Kleene Closure, and Formal Power Series Electronic Colloquium on Computational Complexity (ECCC) 6(8): (1999)
68		Eric Allender, Klaus Reinhardt, Shiyu Zhou: Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds. J. Comput. Syst. Sci. 59(2): 164-181 (1999)
67		Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender: Complexity of Finite-Horizon Markov Decision process Problems. Universität Trier, Mathematik/Informatik, Forschungsbericht 99-25: (1999)
	1998
66		Eric Allender, Klaus Reinhardt: Isolation, Matching, and Counting. IEEE Conference on Computational Complexity 1998: 92-100
65		Eric Allender: News from the Isomorphism Front. Bulletin of the EATCS 66: 73 (1998)
64		Eric Allender, Klaus Reinhardt: Isolation, Matching, and Counting Electronic Colloquium on Computational Complexity (ECCC) 5(19): (1998)
63		Eric Allender, Shiyu Zhou: Uniform Inclusions in Nondeterministic Logspace Electronic Colloquium on Computational Complexity (ECCC) 5(23): (1998)
62		Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner: Characterizing Small Depth and Small Space Classes by Operators of Higher Types Electronic Colloquium on Computational Complexity (ECCC) 5(57): (1998)
61		Manindra Agrawal, Eric Allender, Steven Rudich: Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem. J. Comput. Syst. Sci. 57(2): 127-143 (1998)
60		Eric Allender, Jia Jiao, Meena Mahajan, V. Vinay: Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds. Theor. Comput. Sci. 209(1-2): 47-86 (1998)
59		Eric Allender, Klaus-Jörn Lange: RUSPACE(log n) $\subseteq$ DSPACE (log2 n / log log n). Theory Comput. Syst. 31(5): 539-550 (1998)
	1997
58		Klaus Reinhardt, Eric Allender: Making Nondeterminism Unambiguous. FOCS 1997: 244-253
57		Manindra Agrawal, Eric Allender, Samir Datta: On TC0, AC0, and Arithmetic Circuits. IEEE Conference on Computational Complexity 1997: 134-148
56		Martin Mundhenk, Judy Goldsmith, Eric Allender: The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes. MFCS 1997: 129-138
55		Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich: Reducing the Complexity of Reductions. STOC 1997: 730-738
54		Klaus Reinhardt, Eric Allender: Making Nondeterminism Unambiguous Electronic Colloquium on Computational Complexity (ECCC) 4(14): (1997)
53		Manindra Agrawal, Eric Allender, Samir Datta: On TC0, AC0, and Arithmetic Circuits Electronic Colloquium on Computational Complexity (ECCC) 4(16): (1997)
52		Eric Allender, José L. Balcázar, Neil Immerman: A First-Order Isomorphism Theorem. SIAM J. Comput. 26(2): 557-567 (1997)
51		Eric Allender: Making computation count: arithmetic circuits in the nineties. SIGACT News 28(4): 2-15 (1997)
	1996
50		Eric Allender: A Note on Uniform Circuit Lower Bounds for the Counting Hierarchy (Extended Abstract). COCOON 1996: 127-135
49		Eric Allender: Circuit Complexity before the Dawn of the New Millennium. FSTTCS 1996: 1-18
48		Manindra Agrawal, Eric Allender: An Isomorphism Theorem for Circuit Complexity. IEEE Conference on Computational Complexity 1996: 2-11
47		Eric Allender, Klaus-Jörn Lange: StUSPACE(log n) <= DSPACE(log²n / log log n). ISAAC 1996: 193-202
46		Eric Allender, Robert Beals, Mitsunori Ogihara: The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract). STOC 1996: 161-167
45		Manindra Agrawal, Eric Allender: An Isomorphism Theorem for Circuit Complexity Electronic Colloquium on Computational Complexity (ECCC) 3(2): (1996)
44		Eric Allender: A Note on Uniform Circuit Lower Bounds for the Counting Hierarchy Electronic Colloquium on Computational Complexity (ECCC) 3(23): (1996)
43		Eric Allender, Robert Beals, Mitsunori Ogihara: The complexity of matrix rank and feasible systems of linear equations Electronic Colloquium on Computational Complexity (ECCC) 3(24): (1996)
42		Eric Allender, Klaus-Jörn Lange: StUSPACE(log n) is Contained in DSPACE((log2n)/loglog n) Electronic Colloquium on Computational Complexity (ECCC) 3(48): (1996)
41		Eric Allender, Mitsunori Ogihara: Relationships Among PL, #L, and the Determinant. ITA 30(1): 1-21 (1996)
40		Eric Allender, Joan Feigenbaum, Judy Goldsmith, Toniann Pitassi, Steven Rudich: The future of computational complexity theory: part II. SIGACT News 27(4): 3-7 (1996)
	1995
39		Eric Allender, Martin Strauss: Measure on P: Robustness of the Notion. MFCS 1995: 129-138
38		Eric Allender, Martin Strauss: Measure on P: Robustness of the Notion Electronic Colloquium on Computational Complexity (ECCC) 2(28): (1995)
37		Eric Allender, Jia Jiao, Meena Mahajan, V. Vinay: Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds Electronic Colloquium on Computational Complexity (ECCC) 2(43): (1995)
	1994
36		Eric Allender, Martin Strauss: Measure on Small Complexity Classes, with Applications for BPP FOCS 1994: 807-818
35		Eric Allender, Mitsunori Ogihara: Relationships Among PL, #L, and the Determinant. Structure in Complexity Theory Conference 1994: 267-278
34		Eric Allender, Martin Strauss: Measure on Small Complexity Classes, with Applications for BPP Electronic Colloquium on Computational Complexity (ECCC) 1(4): (1994)
33		Eric Allender, Ulrich Hertrampf: Depth Reduction for Circuits of Unbounded Fan-In Inf. Comput. 112(2): 217-238 (1994)
32		Eric Allender, Vivek Gore: A Uniform Circuit Lower Bound for the Permanent. SIAM J. Comput. 23(5): 1026-1049 (1994)
	1993
31		Eric Allender, José L. Balcázar, Neil Immerman: A First-Order Isomorphism Theorem. STACS 1993: 163-174
30		Eric Allender, Jia Jiao: Depth reduction for noncommutative arithmetic circuits. STOC 1993: 515-522
29		Eric Allender, Danilo Bruschi, Giovanni Pighizzini: The Complexity of Computing Maximal Word Functions. Computational Complexity 3: 368-391 (1993)
28		Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer: Almost-Everywhere Complexity Hierarchies for Nondeterministic Time. Theor. Comput. Sci. 115(2): 225-241 (1993)
	1992
27		Eric Allender, Lane A. Hemachandra: Lower Bounds for the Low Hierarchy. J. ACM 39(1): 234-251 (1992)
26		Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe: Relating Equivalence and Reducibility to Sparse Sets. SIAM J. Comput. 21(3): 521-539 (1992)
	1991
25		Eric Allender, Vivek Gore: On Strong Separations from AC0 (Extended Abstract). FCT 1991: 1-15
24		Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe: Relating Equivalence and Reducibility to Sparse Sets. Structure in Complexity Theory Conference 1991: 220-229
23		Eric Allender, Vivek Gore: Rudimentary Reductions Revisited. Inf. Process. Lett. 40(2): 89-95 (1991)
22		Eric Allender: Limitations of the Upward Separation Technique. Mathematical Systems Theory 24(1): 53-67 (1991)
	1990
21		Eric Allender, Ulrich Hertrampf: On the Power of Uniform Families of Constant Depth Treshold Circuits. MFCS 1990: 158-164
20		Eric Allender: Oracles versus Proof Techniques that Do Not Relativize. SIGAL International Symposium on Algorithms 1990: 39-52
19		Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer: A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time. STACS 1990: 1-11
18		Eric Allender, Christopher B. Wilson: Width-Bounded Reducibility and Binary Search over Complexity Classes. Structure in Complexity Theory Conference 1990: 122-129
17		Eric Allender, Klaus W. Wagner: Counting Hierarchies: Polynomial Time and Constant. Bulletin of the EATCS 40: 182-194 (1990)
16		Eric Allender, Osamu Watanabe: Kolmogorov Complexity and Degrees of Tally Sets Inf. Comput. 86(2): 160-178 (1990)
15		Eric Allender, Christopher B. Wilson: Downward Translations of Equality. Theor. Comput. Sci. 75(3): 335-346 (1990)
	1989
14		Eric Allender: A Note on the Power of Threshold Circuits FOCS 1989: 580-584
13		Eric Allender: Limitations of the Upward Separation Technique (Preliminary Version). ICALP 1989: 18-30
12		Eric Allender, Lane A. Hemachandra: Lower Bounds for the Low Hierarchy (Extended Abstract). ICALP 1989: 31-45
11		Eric Allender: The Generalized Kolmogorov Complexity of Sets. Structure in Complexity Theory Conference 1989: 186-194
10		Eric Allender: P-uniform circuit complexity. J. ACM 36(4): 912-928 (1989)
9		Eric Allender: Some Consequences of the Existence of Pseudorandom Generators. J. Comput. Syst. Sci. 39(1): 101-124 (1989)
	1988
8		Martín Abadi, Eric Allender, Andrei Z. Broder, Joan Feigenbaum, Lane A. Hemachandra: On Generating Solved Instances of Computational Problems. CRYPTO 1988: 297-310
7		Eric Allender: Isomorphisms and 1-L Reductions. J. Comput. Syst. Sci. 36(3): 336-350 (1988)
6		Eric Allender, Roy S. Rubinstein: P-Printable Sets. SIAM J. Comput. 17(6): 1193-1202 (1988)
	1987
5		Eric Allender: Some Consequences of the Existence of Pseudorandom Generators STOC 1987: 151-159
	1986
4		Eric Allender: Characterizations on PUNC and Precomputation (Extended Abstract). ICALP 1986: 1-10
3		Eric Allender: The Complexity of Sparse Sets in P. Structure in Complexity Theory Conference 1986: 1-11
2		Eric Allender: Isomorphisms and 1-L Reductions. Structure in Complexity Theory Conference 1986: 12-22
	1985
1		Eric Allender, Maria M. Klawe: Improved Lower Bounds for the Cycle Detection Problem. Theor. Comput. Sci. 36: 231-237 (1985)

Coauthor Index

1	Martín Abadi	[8]
2	Manindra Agrawal	[45] [48] [53] [55] [57] [61] [62] [78] [81] [86]
3	Andris Ambainis	[70] [75]
4	Sanjeev Arora	[94]
5	Vikraman Arvind	[69] [96] [137] [143]
6	José L. Balcázar	[31] [52]
7	David A. Mix Barrington	[70] [75] [80] [85] [90] [92] [105] [118] [129]
8	Michael Bauland	[102] [111] [132]
9	Robert Beals	[43] [46] [72]
10	Richard Beigel	[19] [28]
11	Anna Bernasconi	[98]
12	Andrei Z. Broder	[8]
13	Danilo Bruschi	[29]
14	Harry Buhrman	[93] [95] [103] [104] [115] [116]
15	Peter Bürgisser (Peter Buergisser)	[108] [117] [120] [131]
16	Tanmoy Chakraborty	[105] [118] [129]
17	Carsten Damm	[98]
18	Samir Datta	[53] [57] [62] [70] [75] [78] [81] [101] [105] [106] [112] [113] [118] [129]
19	Joan Feigenbaum	[8] [40]
20	Luke Friedman	[139] [140] [147]
21	William I. Gasarch	[139] [140] [147]
22	Joachim von zur Gathen	[98]
23	Judy Goldsmith	[40] [56] [67] [79]
24	Vivek Gore	[23] [25] [32]
25	Lisa Hellerstein	[107] [119] [122]
26	Lane A. Hemaspaandra (Lane A. Hemachandra)	[8] [12] [24] [26] [27]
27	Ulrich Hertrampf	[19] [21] [28] [33]
28	William Hesse	[85] [90] [92]
29	Steven Homer	[19] [28]
30	Neil Immerman	[31] [52] [102] [111] [132]
31	Russell Impagliazzo	[55] [86]
32	Jia Jiao	[30] [37] [60]
33	Michael Kearns (Michael J. Kearns, Michael S. Kearns)	[94]
34	Johan Kjeldgaard-Pedersen	[108] [117] [120] [131]
35	Maria M. Klawe	[1]
36	Vladlen Koltun	[130]
37	Michal Koucký	[84] [89] [93] [95] [99] [103] [104] [115] [116] [123] [125] [133] [135] [144]
38	Klaus-Jörn Lange	[42] [47] [59] [136] [141]
39	Huong LeThanh	[70] [75]
40	Christopher Lusena	[67] [79]
41	Meena Mahajan	[37] [60] [69] [82] [96] [100]
42	Paul McCabe	[107] [119] [122]
43	Dieter van Melkebeek	[93] [95] [115]
44	Peter Bro Miltersen	[108] [117] [120] [131]
45	Cristopher Moore	[94]
46	Martin Mundhenk	[56] [67] [79]
47	Mitsunori Ogihara (Mitsunori Ogiwara)	[24] [26] [35] [41] [43] [46] [72]
48	Giovanni Pighizzini	[29]
49	Toniann Pitassi	[40] [55] [86] [107] [119] [122]
50	Klaus Reinhardt	[54] [58] [64] [66] [68] [77]
51	Detlef Ronneburger	[84] [89] [93] [95] [99] [115] [133] [144]
52	Sambuddha Roy	[84] [89] [99] [101] [105] [106] [112] [113] [118] [129] [133] [144]
53	Roy S. Rubinstein	[6]
54	Steven Rudich	[40] [55] [61] [86]
55	Alexander Russell	[94]
56	Michael E. Saks (Michael Saks)	[71] [74] [83] [98] [107] [119] [122]
57	Henning Schnoor	[102] [111] [132]
58	Igor Shparlinski	[71] [74] [83] [98]
59	Martin Strauss (Martin J. Strauss)	[34] [36] [38] [39]
60	Maxim Sviridenko	[130]
61	V. Vinay	[37] [60] [84] [89]
62	Heribert Vollmer	[62] [81] [102] [111] [132]
63	Klaus W. Wagner	[17] [62] [81]
64	Fengming Wang	[137] [143] [145] [146]
65	Osamu Watanabe	[16] [24] [26]
66	Christopher B. Wilson	[15] [18]
67	Shiyu Zhou	[63] [68]

Colors in the list of coauthors

Last update Sun Feb 12 22:50:56 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page