Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Eric
Last name:	Allender
DBLP:	a/EAllender
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 25 of 132  

Select a publication
Show	Title	Venue	Rating	Date
	Eric Allender. A Status Report on the P Versus NP Question.	Advances in Computers 2009, Volume 77	(0)	2009
	Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer. The complexity of satisfiability problems: Refining Schaefer's theorem.	J. Comput. Syst. Sci. 2009, Volume 75	(0)	2009
	Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy. Planar and Grid Graph Reachability Problems.	Theory Comput. Syst. 2009, Volume 45	(0)	2009
	Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen. On the Complexity of Numerical Analysis.	SIAM J. Comput. 2008, Volume 38	(0)	2009
	Eric Allender, Vladlen Koltun, Maxim Sviridenko. Special Section On The Thirty-Ninth Annual ACM Symposium On Theory Of Computing (STOC 2007).	SIAM J. Comput. 2009, Volume 39	(0)	2009
	Eric Allender. Chipping Away at P vs NP: How Far Are We from Proving Circuit Size Lower Bounds?	Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), Wollongong, NSW, Australia, January 22-25, 2008. Proceedings 2008	(0)	2008
	Eric Allender, Michal Koucký. Amplifying Lower Bounds by Means of Self-Reducibility.	Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA 2008	(0)	2008
	Eric Allender. Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds.	Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings 2008	(0)	2008
	Eric Allender, Michal Koucký. Amplifying Lower Bounds by Means of Self-Reducibility.	Electronic Colloquium on Computational Complexity (ECCC) 2008, Volume 15	(0)	2008
	Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks. Minimizing Disjunctive Normal Form Formulas and AC	SIAM J. Comput. 2008, Volume 38	(0)	2008
	Eric Allender. Computational Complexity Theory.	Wiley Encyclopedia of Computer Science and Engineering 2008	(0)	2008
	Eric Allender. Reachability Problems: An Update.	Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings 2007	(0)	2007
	Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy. Grid Graph Reachability Problems.	21st Annual IEEE Conference on Computational Complexity (CCC 2006), 16-20 July 2006, Prague, Czech Republic 2006	(0)	2006
	Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen. On the Complexity of Numerical Analysis.	21st Annual IEEE Conference on Computational Complexity (CCC 2006), 16-20 July 2006, Prague, Czech Republic 2006	(0)	2006
	Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks. Minimizing DNF Formulas and AC	21st Annual IEEE Conference on Computational Complexity (CCC 2006), 16-20 July 2006, Prague, Czech Republic 2006	(0)	2006
	Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen. On the Complexity of Numerical Analysis.	Complexity of Boolean Functions, 12.03. - 17.03.2006 2006	(0)	2006
	Eric Allender, Harry Buhrman, Michal Koucký. What can be efficiently reduced to the Kolmogorov-random strings?	Ann. Pure Appl. Logic 2006, Volume 138	(0)	2006
	Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger. Power from Random Strings.	SIAM J. Comput. 2006, Volume 35	(0)	2006
	Eric Allender. NL-printable sets and nondeterministic Kolmogorov complexity.	Theor. Comput. Sci. 2006, Volume 355	(0)	2006
	Eric Allender, Samir Datta, Sambuddha Roy. Topology Inside NC¹	20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA 2005	(0)	2005
	Eric Allender, Samir Datta, Sambuddha Roy. The Directed Planar Reachability Problem.	FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings 2005	(0)	2005
	Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer. The Complexity of Satisfiability Problems: Refining Schaefer's Theorem.	Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings 2005	(0)	2005
	Eric Allender. Special issue "Conference on Computational Complexity 2004" Guest Editor's foreword.	Computational Complexity 2005, Volume 14	(0)	2005
	Eric Allender. Special issue, final part "Conference on	Computational Complexity 2005, Volume 14	(0)	2005
	Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen. On the Complexity of Numerical Analysis	Electronic Colloquium on Computational Complexity (ECCC) 2005, Volume null	(0)	2005

Your query returned 132 matches in the database.