next up previous
Next: About this document ... Up: This is a Test Previous: Downward Collapses

Bibliography

1
This is a list of selected journal (except when the work has not yet appeared in journal/book form) papers, from or related to this project, by University of Rochester authors. Essentially all the papers listed below can be found, in their full technical report versions, in the UR-CS Technical Report Archive's theory section. Here is Lane's complete publication list and links to essentially all his conference and journal papers (and also his arXiv.org technical reports) can be found via the ``EE'' (electronic edition) links at Lane's entry at the DBLP project.

2
R. Beigel, R. Chang, and M. Ogiwara.
A relationship between difference hierarchies and relativized polynomial hierarchies.
Mathematical Systems Theory, 26(3):293-310, 1993.

3
L. Hemaspaandra and S. Jha.
Defying upward and downward separation.
Information and Computation, 121(1):1-13, 1995.

4
E. Hemaspaandra, L. Hemaspaandra, and H. Hempel.
An introduction to query order.
Bulletin of the EATCS, 63:93-107, 1997.

5
E. Hemaspaandra, L. Hemaspaandra, and H. Hempel.
Query order in the polynomial hierarchy.
Journal of Universal Computer Science, 4(6):574-588, 1998.

6
E. Hemaspaandra, L. Hemaspaandra, and H. Hempel.
R ${}^{{\cal S}{\cal N}}_{1\hbox{-}tt}$(NP) distinguishes robust many-one and Turing completeness.
Theory of Computing Systems, 31(3):307-325, 1998.

7
E. Hemaspaandra, L. Hemaspaandra, and H. Hempel.
What's up with downward collapse: Using the easy-hard technique to link boolean and polynomial hierarchy collapses.
SIGACT News, 29(3):10-22, 1998.

8
E. Hemaspaandra, L. Hemaspaandra, and H. Hempel.
A downward collapse within the polynomial hierarchy.
SIAM Journal on Computing, 28(2):383-393, 1999.

9
L. Hemaspaandra, H. Hempel, and G. Wechsung.
Query order.
SIAM Journal on Computing, 28(2):637-651, 1999.

10
E. Hemaspaandra, L. Hemaspaandra, and H. Hempel.
Using the no-search easy-hard technique for downward collapse.
Technical Report TR-752, Department of Computer Science, University of Rochester, Rochester, NY, June 2001.

11
E. Hemaspaandra, L. Hemaspaandra, and H. Hempel.
Extending downward collapse from 1-versus-2 queries to $m$-versus-$m+1$ queries.
SIAM Journal on Computing, 34(6):1352-1369, 2005.
$\begin{tabular}{l}
{}                                                                   \\
\hline
\end{tabular}$

(Last modified: March 11, 2011.)



Lane A. Hemaspaandra 2011-03-11