Gurari, Eitan M. Decidable problems for powerful programs. (English) Zbl 0629.68010 J. Assoc. Comput. Mach. 32, 466-483 (1985). MSC: 68Q60 68Q25 PDFBibTeX XMLCite \textit{E. M. Gurari}, J. Assoc. Comput. Mach. 32, 466--483 (1985; Zbl 0629.68010) Full Text: DOI
Gurari, Eitan M.; Ibarra, Oscar H. Two-way counter machines and diophantine equations. (English) Zbl 0496.03020 J. Assoc. Comput. Mach. 29, 863-873 (1982). MSC: 03D10 03B25 11U05 PDFBibTeX XMLCite \textit{E. M. Gurari} and \textit{O. H. Ibarra}, J. Assoc. Comput. Mach. 29, 863--873 (1982; Zbl 0496.03020) Full Text: DOI
Gurari, Eitan M.; Ibarra, Oscar H. The complexity of the equivalence problem for simple programs. (English) Zbl 0462.68023 J. Assoc. Comput. Mach. 28, 535-560 (1981). MSC: 68Q25 68Q65 68Q60 68Q05 PDFBibTeX XMLCite \textit{E. M. Gurari} and \textit{O. H. Ibarra}, J. Assoc. Comput. Mach. 28, 535--560 (1981; Zbl 0462.68023) Full Text: DOI
Gurari, Eitan M.; Ibarra, Oscar H. An NP-complete number-theoretic problem. (English) Zbl 0407.68053 J. Assoc. Comput. Mach. 26, 567-581 (1979). MSC: 68Q25 03D80 03D25 03B25 11U05 11D41 11D99 90C30 68Q05 90C10 PDFBibTeX XMLCite \textit{E. M. Gurari} and \textit{O. H. Ibarra}, J. Assoc. Comput. Mach. 26, 567--581 (1979; Zbl 0407.68053) Full Text: DOI