📄 http:^^www.cs.rochester.edu^u^lane^resume-book-journal.html
字号:
Date: Wednesday, 15-Jan-97 00:23:28 GMTServer: NCSA/1.3MIME-version: 1.0Content-type: text/htmlLast-modified: Monday, 11-Nov-96 01:51:25 GMTContent-length: 13878<!DOCTYPE HTML PUBLIC "-//IETF//DTD HTML 2.0//EN"><!--Converted with LaTeX2HTML 96.1 (Feb 5, 1996) by Nikos Drakos (nikos@cbl.leeds.ac.uk), CBLU, University of Leeds --><HTML><HEAD><TITLE>No Title</TITLE><META NAME="description" CONTENT="No Title"><META NAME="keywords" CONTENT="resume-book-journal"><META NAME="resource-type" CONTENT="document"><META NAME="distribution" CONTENT="global"><LINK REL=STYLESHEET HREF="resume-book-journal.css"></HEAD><BODY LANG="EN"> <!WA0><A NAME="tex2html1" HREF="http://www.cs.rochester.edu/u/lane/node1.html"><!WA1><IMG WIDTH=37 HEIGHT=24 ALIGN=BOTTOM ALT="next" SRC="http://www.cs.rochester.edu/u/jag/icons/next_motif.gif"></A> <!WA2><IMG WIDTH=26 HEIGHT=24 ALIGN=BOTTOM ALT="up" SRC="http://www.cs.rochester.edu/u/jag/icons/up_motif_gr.gif"> <!WA3><IMG WIDTH=63 HEIGHT=24 ALIGN=BOTTOM ALT="previous" SRC="http://www.cs.rochester.edu/u/jag/icons/previous_motif_gr.gif"> <BR><B> Next:</B> <!WA4><A NAME="tex2html2" HREF="http://www.cs.rochester.edu/u/lane/node1.html"> About this document </A><BR> <P><H2><!WA5><A HREF="http://www.cs.rochester.edu/u/lane/home.html">Go back to Lane's home page</A></H2><P><EM>Most of the recent papers from this list can be found, in theirtechnical report versions, in the UR CS technical report on-linearchive, which can be reached via my home page.</EM><P><B>JOURNAL AND BOOK PUBLICATIONS (Last Updated: 11/96) <BR> Lane A. Hemaspaandra (born Lane A. Hemachandra) </B> <BR> <P><P><OL><B>BOOKS IN PREPARATION OR TO APPEAR</B><LI> <A NAME="binprepccc"> </A><B>The Complexity Theory Companion</B>,L. Hemaspaandra and M. Ogihara,in preparation.<LI> <A NAME="binprepsfc"> </A><B>Semi-Feasible Computation</B>,L. Hemaspaandra and L. Torenvliet,in preparation.<LI> <A NAME="binprepctrII"> </A><B>Complexity Theory Retrospective II</B>,L. Hemaspaandra and A. Selman, editors, Springer-Verlag,to appear.<P><P><P><P><P><B>BOOK CHAPTERS</B><P><LI><B>Witness-Isomorphic Reductions and Local Search</B>,S. Fischer, L. Hemaspaandra, and L. Torenvliet, in Complexity, Logic and Recursion Theory,ed. A. Sorbi, Marcel Dekker, Inc.,to appear.<LI> <A NAME="hemdiscmathhandbook"> </A><B>Complexity Classes</B>, L. Hemaspaandra,section in Handbook of Discrete and Combinatorial Mathematics,ed. K. Rosen,CRC Press, to appear.<LI><A NAME="chvbook"> </A><B>Promises and Fault-Tolerant Database Access</B>,J. Cai, L. Hemachandra, and J. Vyskoc,in Complexity Theory: Current Research,eds. K. Ambos-Spies, S. Homer, and U. Schöning,Cambridge University Press, pp. 101-146, 1993.<LI> <A NAME="tenauthorbookchapter"> </A><B>Reductions to Sets of Low InformationContent</B>,V. Arvind, Y. Han, L. Hemachandra, J. Köbler,A. Lozano, M. Mundhenk, M. Ogiwara, U. Schöning,R. Silvestri, and T. Thierauf, in Complexity Theory: Current Research,eds. K. Ambos-Spies, S. Homer, and U. Schöning,Cambridge University Press, pp. 1-45, 1993.<LI> <A NAME="hosubtractionbook"> </A><B>Is #P Closed Under Subtraction?</B>,L. Hemachandra and M. Ogiwara,in Current Trends in Theoretical Computer Science: Essays and Tutorials,eds. G. Rozenberg and A. Salomaa,World Scientific Press, pp. 523-536, 1993.<P><P><P><P><P><B>REFEREED JOURNAL PUBLICATIONS</B><P><LI><B>Easy Sets and Hard Certificate Schemes</B>,L. Hemaspaandra, J. Rothe, and G. Wechsung,Acta Informatica,accepted subject to minor revision.<LI> <B>Logspace Reducibility: Modelsand Equivalences</B>, L. Hemaspaandra and Z. Jiang, International Journal of Foundations of Computer Science,accepted subject to minor revision.<LI> <A NAME="jhemhemwecquery"> </A><B>Query Order</B>,L. Hemaspaandra, H. Hempel, and G. Wechsung,to appear inSIAM Journal on Computing.<LI> <A NAME="jourhanhemthibpp"> </A><B>Threshold Computation and Cryptographic Security</B>,Y. Han, L. Hemaspaandra, and T. Thierauf,to appear in SIAM Journal on Computing.<LI><A NAME="jourhemrotupbh"> </A><B>Unambiguous Computation: Boolean Hierarchies and SparseTuring-Complete Sets</B>, L. Hemaspaandra and J. Rothe,to appear inSIAM Journal on Computing.<LI><A NAME="jourhanhemjourpseudo"> </A><B>Pseudorandom Generators and the Frequency of Simplicity</B>,Y. Han and L. Hemaspaandra,Journal of Cryptology,V. 9, #4, pp. 251-262, Autumn 1996.<LI><A NAME="jouhemzim"> </A><B>Strong Self-Reducibility Precludes Strong Immunity</B>,L. Hemaspaandra and M. Zimand,Mathematical Systems Theory,V. 29, #5, pp. 535-548,September/October 1996.<LI> <A NAME="jourhemnaiogisel"> </A><B>Computing Solutions Uniquely Collapses the Polynomial Hierarchy</B>,L. Hemaspaandra, A. Naik, M. Ogihara, and A. Selman,SIAM Journal on Computing, V. 25, #4, pp. 697-708, August 1996.<LI> <A NAME="jourhemhoeogipsel"> </A><B>Reducibility Classes of P-Selective Sets</B>,L. Hemaspaandra, A. Hoene, and M. Ogihara,Theoretical Computer Science, V. 155, #2, pp. 447-457,March 1996.<LI><A NAME="themtorjouroptimaladvice"> </A><B>Optimal Advice</B>,L. Hemaspaandra and L. Torenvliet, Theoretical Computer Science, V. 154, #2, pp. 367-377,February 1996.<LI> <A NAME="jourhemhoeogiselthiwanicci"> </A><B>Nondeterministically Selective Sets</B>,L. Hemaspaandra, A. Hoene, A. Naik, M. Ogihara, A. Selman, T. Thierauf, and J. Wang, International Journal of Foundations of Computer Science,V. 6, #4, pp. 403-416, December 1995.<LI><A NAME="jourhemjhadefying"> </A><B>Defying Upward and Downward Separation</B>,L. Hemaspaandra and S. Jha,Information and Computation, V. 121, #1, pp. 1-13, August 1995.<LI> <A NAME="jourhemsileasily"> </A><B>Easily Checked Generalized Self-Reducibility</B>,L. Hemaspaandra and R. Silvestri,SIAM Journal on Computing, V. 24, #4, pp. 840-858, August1995.<LI> <A NAME="jourhemjiapsel"> </A><B>P-Selectivity: Intersections and Indices</B>,L. Hemaspaandra and Z. Jiang,Theoretical Computer Science, V. 145, #1-2, pp. 371-380, 1995.<P><LI><A NAME="jourhot"> </A> <B>Space-Efficient Recognitionof Sparse Self-Reducible Languages</B>,L. Hemaspaandra, M. Ogihara, and S. Toda,Computational Complexity, V. 4, #3, pp. 262-296, 1994.<LI> <A NAME="krahemmstgraph"> </A><B>On the Complexity of Graph Reconstruction</B>, D. Kratsch and L. Hemaspaandra,Mathematical Systems Theory, V. 27, #3, pp. 257-273, May/June 1994.<LI> <A NAME="hemspatcsquasi"> </A><B>Quasi-Injective Reductions</B>,E. Hemaspaandra and L. Hemaspaandra,Theoretical Computer Science, V. 123, #2, pp. 407-413, January 1994.<LI> <A NAME="jourhjv"> </A> <B>Banishing Robust Turing Completeness</B>,L. Hemaspaandra, S. Jain, and N. Vereshchagin,International Journal of Foundations of Computer Science, V. 4, #3, pp. 245-265, 1993.<LI> <A NAME="gashemhoeinfcompterseness"> </A><B>On Checking Versus Evaluation of Multiple Queries</B>, W. Gasarch, L. Hemachandra,and A. Hoene, Information and Computation,V. 105, #1, pp. 72-93, July 1993.<LI> <A NAME="hemogiclosure1"> </A> <B>A Complexity Theory for Feasible Closure Properties</B>,M. Ogiwara and L. Hemachandra,Journal of Computer and System Sciences,V. 46, #3, pp. 295-325, June 1993.<LI> <A NAME="hemhoejcss1"> </A><B>Collapsing Degrees Via Strong Computation</B>, L. Hemachandra and A. Hoene,Journal of Computer and System Sciences,V. 46, #3, pp. 363-380, June 1993.<LI> <A NAME="bhsic1"> </A><B>Using Inductive Counting to Simulate NondeterministicComputation</B>, G. Buntrock, L. Hemachandra,and D. Siefkes, Information and Computation,V. 102, #1, pp. 102-117, 1993.<LI> <A NAME="golhemkencompcompaddress"> </A> <B>Polynomial-Time Compression</B>,J. Goldsmith, L. Hemachandra, and K. Kunen,Computational Complexity,V. 2, #1, pp. 18-39, 1992.<LI> <A NAME="allhemogiwatsicomp1"> </A><B>Relating Equivalence and Reducibility toSparse Sets</B>, E. Allender,L. Hemachandra, M. Ogiwara, and O. Watanabe, SIAM Journal on Computing,V. 21, #3, pp. 521-539,June 1992.<LI> <A NAME="allhemjacm1"> </A> <B>Lower Bounds for the Low Hierarchy</B>,E. Allender and L. Hemachandra, Journal of the ACM, V. 39, #1, pp. 234-250,January 1992.<LI> <A NAME="hemrubtcs1"> </A> <B>Separating ComplexityClasses with Tally Oracles</B>, L. Hemachandra andR. Rubinstein,Theoretical Computer Science, V. 92, #2, pp. 309-318,January 1992.<LI> <A NAME="epphemtisyenmst1"> </A> <B>Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity Classes</B>, D. Eppstein, L. Hemachandra,J. Tisdall, and B. Yener,Mathematical Systems Theory, V. 25, #1, pp. 23-36, 1992.<LI> <A NAME="hemhoesicomp1"> </A><B>On Sets With Efficient Implicit Membership Tests</B>, L. Hemachandraand A. Hoene, SIAM Journal on Computing, V. 20, #6, pp. 1148-1156,December 1991.<LI> <A NAME="hemjaiijfcspos"> </A><B>On the Limitations of Locally Robust Positive Reductions</B>, L. Hemachandra and S. Jain, International Journal of Foundations of Computer Science,V. 2, #3, pp. 237-255, September 1991.<LI><B>Near-Testable Sets</B>,J. Goldsmith, L. Hemachandra, D. Joseph, and P. Young,SIAM Journal on Computing, V. 20, #3, pp. 506-523, June 1991.<LI> <A NAME="hemwectcs1"> </A><B>Kolmogorov Characterizations of Complexity Classes</B>, L. Hemachandra and G. Wechsung,Theoretical Computer Science, V. 83, #2,pp. 313-322,June 1991.<LI> <B>A Note on Enumerative Counting</B>, J. Cai and L. Hemachandra,Information Processing Letters, V. 38, #4,pp. 215-219, May 1991.<LI> <A NAME="harhemtcs3"> </A><B>One-Way Functions and the Non-Isomorphism of NP-Complete Sets</B>,J. Hartmanis and L. Hemachandra,Theoretical Computer Science, V. 81, #1, pp. 155-163, April 1991.<LI> <A NAME="hemhoesieyoutcs1"> </A><B>On Sets Polynomially Enumerable By Iteration</B>,L. Hemachandra, A. Hoene, D. Siefkes, and P. Young,Theoretical Computer Science, V. 80, #2,pp. 203-225, March 1991.<LI> <A NAME="beihemwecipl1"> </A><B>ProbabilisticPolynomial Time is Closed UnderParity Reductions</B>,R. Beigel, L. Hemachandra, and G. Wechsung, Information Processing Letters, V. 37, #2, pp. 91-94, January 1991.<LI> <A NAME="hemrudjcss1"> </A><B>On the Complexity of Ranking</B>, L. Hemachandra and S. Rudich,Journal of Computer and System Sciences, V. 41,#2, pp. 251-271, October 1990.<LI> <A NAME="harhemtcs2"> </A><B>Robust Machines Accept Easy Sets</B>,J. Hartmanis and L. Hemachandra, Theoretical Computer Science, V. 74, #2, pp. 217-226, August 1990.<LI><A NAME="caihemmst1"> </A><B>On the Power of Parity Polynomial Time</B>,J. Cai and L. Hemachandra,Mathematical Systems Theory, V. 23, #2, pp. 95-106, 1990.<LI> <A NAME="hemjcss1"> </A><B>The Strong Exponential Hierarchy Collapses</B>, L. Hemachandra,Journal of Computer and System Sciences, V. 39, #3, pp. 299-322, December 1989.<LI> <A NAME="caiheminfcomp1"> </A><B>Enumerative Counting is Hard</B>,J. Cai and L. Hemachandra,Information and Computation,V. 92, #1, pp. 34-44, July 1989.<LI> <A NAME="caigunharhemsewwagwecsicomp2"> </A><B>The Boolean Hierarchy II: Applications,</B>J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner,and G. Wechsung, SIAM Journal on Computing, V. 18, #1, pp. 95-111, February 1989.<LI> <A NAME="caigunharhemsewwagwecsicomp1"> </A><B>The Boolean Hierarchy I: Structural Properties,</B>J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner,and G. Wechsung, SIAM Journal on Computing, V. 17, #6, pp. 1232-1252, December 1988.<LI> <A NAME="harhemipl1"> </A><B>On Sparse Oracles Separating Feasible Complexity Classes</B>,J. Hartmanis and L. Hemachandra, Information Processing Letters, V. 28, pp. 291-295,August 1988.<LI> <A NAME="harhemtcs1"> </A><B>Complexity Classes Without Machines: On Complete Languages for UP</B>, J. Hartmanis and L. Hemachandra,Theoretical Computer Science, V. 58, pp. 129-142, 1988.<LI> <A NAME="gamhemshpweiieeeit1"> </A><B>Using Simulated Annealing to Design Good Codes</B>, A. El Gamel, L. Hemachandra, I. Shperling, and V. Wei,IEEE Transactions on Information Theory,V. IT-33, #1, pp. 116-123, January 1987.<P></OL><BR> <HR><UL> <LI> <!WA6><A NAME="tex2html3" HREF="http://www.cs.rochester.edu/u/lane/node1.html#SECTION00010000000000000000"> About this document ... </A></UL><HR><!WA7><A NAME="tex2html1" HREF="http://www.cs.rochester.edu/u/lane/node1.html"><!WA8><IMG WIDTH=37 HEIGHT=24 ALIGN=BOTTOM ALT="next" SRC="http://www.cs.rochester.edu/u/jag/icons/next_motif.gif"></A> <!WA9><IMG WIDTH=26 HEIGHT=24 ALIGN=BOTTOM ALT="up" SRC="http://www.cs.rochester.edu/u/jag/icons/up_motif_gr.gif"> <!WA10><IMG WIDTH=63 HEIGHT=24 ALIGN=BOTTOM ALT="previous" SRC="http://www.cs.rochester.edu/u/jag/icons/previous_motif_gr.gif"> <BR><B> Next:</B> <!WA11><A NAME="tex2html2" HREF="http://www.cs.rochester.edu/u/lane/node1.html"> About this document </A><P><ADDRESS><I>Lane A. Hemaspaandra <BR>Sun Nov 10 19:37:18 EST 1996</I></ADDRESS></BODY></HTML>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -