Abascal, Jackson; Hemaspaandra, Lane A.; Maimon, Shir; Rubery, Daniel Closure and nonclosure properties of the classes of compressible and rankable sets. (English) Zbl 1515.68146 J. Comput. Syst. Sci. 120, 162-176 (2021). MSC: 68Q15 PDFBibTeX XMLCite \textit{J. Abascal} et al., J. Comput. Syst. Sci. 120, 162--176 (2021; Zbl 1515.68146) Full Text: DOI
Hemaspaandra, Lane A.; Rubery, Daniel Recursion-theoretic ranking and compression. (English) Zbl 1459.03059 J. Comput. Syst. Sci. 101, 31-41 (2019). Reviewer: Marius Zimand (Towson) MSC: 03D20 03D30 03D15 68Q25 PDFBibTeX XMLCite \textit{L. A. Hemaspaandra} and \textit{D. Rubery}, J. Comput. Syst. Sci. 101, 31--41 (2019; Zbl 1459.03059) Full Text: DOI arXiv
Faliszewski, Piotr; Hemaspaandra, Lane The complexity of power-index comparison. (English) Zbl 1155.91013 Theor. Comput. Sci. 410, No. 1, 101-107 (2009). MSC: 91A12 91B12 PDFBibTeX XMLCite \textit{P. Faliszewski} and \textit{L. Hemaspaandra}, Theor. Comput. Sci. 410, No. 1, 101--107 (2009; Zbl 1155.91013) Full Text: DOI
Hemaspaandra, Lane A.; Rothe, Jörg; Saxena, Amitabh Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions. (English) Zbl 1146.68036 Theor. Comput. Sci. 401, No. 1-3, 27-35 (2008). MSC: 68Q15 PDFBibTeX XMLCite \textit{L. A. Hemaspaandra} et al., Theor. Comput. Sci. 401, No. 1--3, 27--35 (2008; Zbl 1146.68036) Full Text: DOI
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Hempel, Harald All superlinear inverse schemes are coNP-hard. (English) Zbl 1079.68041 Theor. Comput. Sci. 345, No. 2-3, 345-358 (2005). MSC: 68Q17 PDFBibTeX XMLCite \textit{E. Hemaspaandra} et al., Theor. Comput. Sci. 345, No. 2--3, 345--358 (2005; Zbl 1079.68041) Full Text: DOI arXiv
Cai, Jin-Yi; Chakaravarthy, Venkatesan T.; Hemaspaandra, Lane A.; Ogihara, Mitsunori Competing provers yield improved Karp-Lipton collapse results. (English) Zbl 1066.68050 Inf. Comput. 198, No. 1, 1-23 (2005). MSC: 68Q15 PDFBibTeX XMLCite \textit{J.-Y. Cai} et al., Inf. Comput. 198, No. 1, 1--23 (2005; Zbl 1066.68050) Full Text: DOI
Hemaspaandra, Lane A.; Hempel, Harald P-immune sets with holes lack self-reducibility properties. (English) Zbl 1044.68068 Theor. Comput. Sci. 302, No. 1-3, 457-466 (2003). MSC: 68Q25 PDFBibTeX XMLCite \textit{L. A. Hemaspaandra} and \textit{H. Hempel}, Theor. Comput. Sci. 302, No. 1--3, 457--466 (2003; Zbl 1044.68068) Full Text: DOI
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Hempel, Harald Query order in the polynomial hierarchy. (English) Zbl 1507.68122 Chlebus, Bogdan S. (ed.) et al., Fundamentals of computation theory. 11th international symposium, FCT ’97, Jagiellonian Univ., Kraków, Poland, September 1–3, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1279, 222-232 (1997). MSC: 68Q15 PDFBibTeX XMLCite \textit{E. Hemaspaandra} et al., Lect. Notes Comput. Sci. 1279, 222--232 (1997; Zbl 1507.68122) Full Text: DOI
Hemaspaandra, L. A.; Zimand, M. Strong self-reducibility precludes strong immunity. (English) Zbl 0857.68046 Math. Syst. Theory 29, No. 5, 535-548 (1996). MSC: 68Q15 PDFBibTeX XMLCite \textit{L. A. Hemaspaandra} and \textit{M. Zimand}, Math. Syst. Theory 29, No. 5, 535--548 (1996; Zbl 0857.68046) Full Text: DOI
Hemaspaandra, Lane A.; Ogihara, Mitsunori; Toda, Seinosuke Space-efficient recognition of sparse self-reducible languages. (English) Zbl 0812.68073 Comput. Complexity 4, No. 3, 262-296 (1994). MSC: 68Q15 03D15 PDFBibTeX XMLCite \textit{L. A. Hemaspaandra} et al., Comput. Complexity 4, No. 3, 262--296 (1994; Zbl 0812.68073) Full Text: DOI
Hemachandra, Lane A. Fault-tolerance and complexity (extended abstract). (English) Zbl 1418.68075 Lingas, Andrzej (ed.) et al., Automata, languages and programming. 20th international colloquium, ICALP 93, Lund, Sweden, July 5–9, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 700, 189-202 (1993). MSC: 68P15 PDFBibTeX XMLCite \textit{L. A. Hemachandra}, Lect. Notes Comput. Sci. 700, 189--202 (1993; Zbl 1418.68075) Full Text: DOI
Eppstein, David; Hemachandra, Lane A.; Tisdall, James; Yener, Bülent Simultaneous strong separations of probabilistic and unambiguous complexity classes. (English) Zbl 0766.68038 Math. Syst. Theory 25, No. 1, 23-36 (1992). MSC: 68Q15 68Q10 68Q05 PDFBibTeX XMLCite \textit{D. Eppstein} et al., Math. Syst. Theory 25, No. 1, 23--36 (1992; Zbl 0766.68038) Full Text: DOI
Hemachandra, Lane A.; Rubinstein, Roy S. Separating complexity classes with tally oracles. (English) Zbl 0745.68048 Theor. Comput. Sci. 92, No. 2, 309-318 (1992). MSC: 68Q15 PDFBibTeX XMLCite \textit{L. A. Hemachandra} and \textit{R. S. Rubinstein}, Theor. Comput. Sci. 92, No. 2, 309--318 (1992; Zbl 0745.68048) Full Text: DOI
Beigel, Richard; Hemachandra, Lane A.; Wechsung, Gerd Probabilistic polynomial time is closed under parity reductions. (English) Zbl 0714.68031 Inf. Process. Lett. 37, No. 2, 91-94 (1991). MSC: 68Q15 PDFBibTeX XMLCite \textit{R. Beigel} et al., Inf. Process. Lett. 37, No. 2, 91--94 (1991; Zbl 0714.68031) Full Text: DOI
Hemachandra, Lane A.; Hoene, Albrecht; Siefkes, Dirk; Young, Paul On sets polynomially enumerable by iteration. (English) Zbl 0745.68047 Theor. Comput. Sci. 80, No. 2, 203-225 (1991). MSC: 68Q15 PDFBibTeX XMLCite \textit{L. A. Hemachandra} et al., Theor. Comput. Sci. 80, No. 2, 203--225 (1991; Zbl 0745.68047) Full Text: DOI
Hemachandra, Lane A.; Rudich, Steven On the complexity of ranking. (English) Zbl 0708.68020 J. Comput. Syst. Sci. 41, No. 2, 251-271 (1990). Reviewer: U.Schöning MSC: 68Q15 68Q30 03D15 PDFBibTeX XMLCite \textit{L. A. Hemachandra} and \textit{S. Rudich}, J. Comput. Syst. Sci. 41, No. 2, 251--271 (1990; Zbl 0708.68020) Full Text: DOI
Hartmanis, Juris; Hemachandra, Lane A. Robust machines accept easy sets. (English) Zbl 0701.68028 Theor. Comput. Sci. 74, No. 2, 217-225 (1990). MSC: 68Q15 68Q05 PDFBibTeX XMLCite \textit{J. Hartmanis} and \textit{L. A. Hemachandra}, Theor. Comput. Sci. 74, No. 2, 217--225 (1990; Zbl 0701.68028) Full Text: DOI