Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all domains
Limit my searches in the following domains
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Co-authors
(114)
Samir Datta
12
Michal Koucky (Michal Koucký)
12
Sambuddha Roy
11
Manindra Agrawal
9
Michael E. Saks
8
Conferences
(18)
CoCo
8
CCC
7
STACS
4
STOC
4
FOCS
4
Journals
(17)
ECCC
25
JCSS
12
SIAMCOMP
9
JACM
7
CC
6
Keywords
(101)
Embed
Subscribe
Academic
Authors
Eric Allender
Edit
Eric Allender
Rutgers, The State University of New Jersey
Publications: 154
|
Citations: 1943
|
G-Index: 35
|
H-Index: 25
The information is calculated based on the tens of millions of scholarly articles currently discoverable within Microsoft Academic Search. As more content gets indexed, the accuracy and completeness will continue to improve.
Interests:
Algorithms & Theory
,
Scientific Computing
,
Mathematics
View FAQ about top research area and research interests
Collaborated with
114 co-authors
from 1985 to 2011
; Cited by
752 authors
Homepage
|
Bing
Cumulative
Annual
Order by:
Publications
(154)
BibTeX
|
RIS
|
RefWorks
Download
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
(
Citations: 4
)
Eric Allender
,
Michal Koucký
,
Detlef Ronneburger
,
Sambuddha Roy
Journal:
Journal of Computer and System Sciences - JCSS
, vol. 77, no. 1, pp. 14-40, 2011
On the power of algebraic branching programs of width two
Eric Allender
,
Fengming Wang
Journal:
Electronic Colloquium on Computational Complexity - ECCC
, vol. 18, 2011
Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata
(
Citations: 2
)
Eric Allender
,
Klaus-Jörn Lange
Conference:
Annual IEEE Conference on Computational Complexity - CCC
, vol. 17, pp. 172-180, 2010
Avoiding Simplicity Is Complex
(
Citations: 2
)
Eric Allender
,
Holger Spakowski
Conference:
Conference on Computability in Europe - CIE
, vol. 17, pp. 1-10, 2010
Uniform Derandomization from Pathetic Lower Bounds
(
Citations: 1
)
Eric Allender
,
Vikraman Arvind
,
Fengming Wang
Conference:
Approximation Algorithms for Combinatorial Optimization - APPROX
, vol. 17, pp. 380-393, 2010
Order by:
Citations
(1943 times by 1005 publications)
Non-uniform ACC Circuit Lower Bounds
(
Citations: 6
)
Ryan Williams
Conference:
Annual IEEE Conference on Computational Complexity - CCC
, pp. 115-125, 2011
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
(
Citations: 4
)
Eric Allender
,
Michal Koucký
,
Detlef Ronneburger
,
Sambuddha Roy
Journal:
Journal of Computer and System Sciences - JCSS
, vol. 77, no. 1, pp. 14-40, 2011
Extensions of MSO and the monadic counting hierarchy
(
Citations: 2
)
Juha Kontinen
,
Hannu Niemistö
Published in 2011.
The Complexity of Verifying Ground Tree Rewrite Systems
(
Citations: 1
)
Stefan Goller
,
Anthony Widjaja Lin
Conference:
Logic in Computer Science - LICS
, pp. 279-288, 2011
The isomorphism conjecture for constant depth reductions
(
Citations: 1
)
Manindra Agrawal
,
IIT Kanpur
Journal:
Journal of Computer and System Sciences - JCSS
, vol. 77, no. 1, pp. 3-13, 2011
Comments