Lane A. Hemachandra

University of Rochester — United States

Computer Science · Physical Sciences

23h-index2.1kcitations81works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(48), Computability, Logic, AI Algorithms(45), Machine Learning and Algorithms(20), semigroups and automata theory(19), Cryptography and Data Security(10)

Publications81 total

On the power of parity polynomial time
Lecture notes in computer science·2005· 39 citedOpen Access
Using inductive counting to simulate nondeterministic computation
Lecture notes in computer science·2005· 7 cited
On checking versus evaluation of multiple queries
Lecture notes in computer science·2005· 2 cited
Structure of complexity classes: Separations, collapses, and completeness
Lecture notes in computer science·2005· 13 citedOpen Access
Banishing robust Turing completeness
Lecture notes in computer science·2005· 3 cited
On the power of probabilistic polynomial time: P/sup NP(log)/ contained in PP
2003· 17 cited
How hard are sparse sets?
2003· 52 cited
Selectivity
2002· 10 cited
A complexity theory for feasible closure properties
2002· 18 cited
Relating equivalence and reducibility to sparse sets
2002· 9 cited
A note on relativizing complexity classes with tally
2002· 1 cited
On sets with efficient implicit membership tests
2002· 3 cited
Promises and fault-tolerant database access
UR Research (University of Rochester)·1993· 15 cited
On Checking versus Evaluation of Multiple Queries
Information and Computation·1993· 1 cited
A complexity theory for feasible closure properties
Journal of Computer and System Sciences·1993· 80 cited
Is #P Closed Under Subtraction?
WORLD SCIENTIFIC eBooks·1993· 8 cited
Collapsing degrees via strong computation
Journal of Computer and System Sciences·1993· 8 cited
Fault-Tolerance and Complexity
1993· 6 cited
Fault-tolerance and complexity (Extended abstract)
Lecture notes in computer science·1993· 3 cited
Using Inductive Counting to Simulate Nondeterministic Computation
Information and Computation·1993· 12 cited
page 1 of 5Next →

Frequent Co-authors

Jin‐Yi Cai(9), Mitsunori Ogiwara(8), Gerd Wechsung(6), Juris Hartmanis(4), Eric Allender(4), Osamu Watanabe(3), Thomas Thierauf(3), Albrecht Hoene(3), Thomas Gundermann(2), Vivian Sewelson(2), Klaus W. Wagner(2), Juris Hartmanis(2), Yenjo Han(2), Johannes Köbler(2), Antoni Lozano(2), M. Mundhenk(2), Uwe Schöning(2), Riccardo Silvestri(2), Richard Beigel(2), Judy Goldsmith(2)