Ullman, Jeffrey D.; Yannakakis, Mihalis High-probability parallel transitive-closure algorithms. (English) Zbl 0716.68041 SIAM J. Comput. 20, No. 1, 100-125 (1991). MSC: 68W15 68Q25 68R10 PDFBibTeX XMLCite \textit{J. D. Ullman} and \textit{M. Yannakakis}, SIAM J. Comput. 20, No. 1, 100--125 (1991; Zbl 0716.68041) Full Text: DOI
Peleg, David; Ullman, Jeffrey D. An optimal synchronizer for the hypercube. (English) Zbl 0681.68091 SIAM J. Comput. 18, No. 4, 740-747 (1989). Reviewer: A.Kozlowski MSC: 68R10 68N99 PDFBibTeX XMLCite \textit{D. Peleg} and \textit{J. D. Ullman}, SIAM J. Comput. 18, No. 4, 740--747 (1989; Zbl 0681.68091) Full Text: DOI
Papadimitriou, Christos H.; Ullman, Jeffrey D. A communication-time tradeoff. (English) Zbl 0649.68048 SIAM J. Comput. 16, 639-646 (1987). MSC: 68Q25 68R10 68N25 PDFBibTeX XMLCite \textit{C. H. Papadimitriou} and \textit{J. D. Ullman}, SIAM J. Comput. 16, 639--646 (1987; Zbl 0649.68048) Full Text: DOI
Fagin, Ronald; Maier, David; Ullman, Jeffrey D.; Yannakakis, Mihalis Tools for template dependencies. (English) Zbl 0509.68107 SIAM J. Comput. 12, 36-59 (1983). MSC: 68P20 68P05 03C30 03C50 PDFBibTeX XMLCite \textit{R. Fagin} et al., SIAM J. Comput. 12, 36--59 (1983; Zbl 0509.68107) Full Text: DOI Link
Beeri, Catriel; Mendelzon, Alberto O.; Sagiv, Yehoshua; Ullman, Jeffrey D. Equivalence of relational database schemes. (English) Zbl 0472.68056 SIAM J. Comput. 10, 352-370 (1981). MSC: 68P20 68P05 PDFBibTeX XMLCite \textit{C. Beeri} et al., SIAM J. Comput. 10, 352--370 (1981; Zbl 0472.68056) Full Text: DOI
Aho, A. V.; Sagiv, Y.; Szymanski, T. G.; Ullman, J. D. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. (English) Zbl 0462.68086 SIAM J. Comput. 10, 405-421 (1981). MSC: 68P20 68N25 PDFBibTeX XMLCite \textit{A. V. Aho} et al., SIAM J. Comput. 10, 405--421 (1981; Zbl 0462.68086) Full Text: DOI Link
Toueg, Sam; Ullman, Jeffrey D. Deadlock-free packet switching networks. (English) Zbl 0461.68038 SIAM J. Comput. 10, 594-611 (1981). MSC: 68M20 94C15 90B10 68N99 PDFBibTeX XMLCite \textit{S. Toueg} and \textit{J. D. Ullman}, SIAM J. Comput. 10, 594--611 (1981; Zbl 0461.68038) Full Text: DOI
Aho, A. V.; Sagiv, Y.; Ullman, J. D. Equivalences among relational expressions. (English) Zbl 0412.68041 SIAM J. Comput. 8, 218-246 (1979). MSC: 68Q99 03G25 03E20 68P20 68P05 PDFBibTeX XMLCite \textit{A. V. Aho} et al., SIAM J. Comput. 8, 218--246 (1979; Zbl 0412.68041) Full Text: DOI Link
Szymanski, T. G.; Ullman, J. D. Evaluating relational expressions with dense and sparse arguments. (English) Zbl 0352.68069 SIAM J. Comput. 6, 109-122 (1977). MSC: 68Q25 68W99 68N01 PDFBibTeX XMLCite \textit{T. G. Szymanski} and \textit{J. D. Ullman}, SIAM J. Comput. 6, 109--122 (1977; Zbl 0352.68069) Full Text: DOI
Aho, A. V.; Hopcroft, J. E.; Ullman, J. D. On finding lowest common ancestors in trees. (English) Zbl 0325.68018 SIAM J. Comput. 5, 115-132 (1976). MSC: 68W99 68N01 68Q25 05C20 PDFBibTeX XMLCite \textit{A. V. Aho} et al., SIAM J. Comput. 5, 115--132 (1976; Zbl 0325.68018) Full Text: DOI
Hecht, Matthew S.; Ullman, Jeffrey D. A simple algorithm for global data flow analysis problems. (English) Zbl 0329.68039 SIAM J. Comput. 4, 519-532 (1975). MSC: 68W99 68N01 68Q25 PDFBibTeX XMLCite \textit{M. S. Hecht} and \textit{J. D. Ullman}, SIAM J. Comput. 4, 519--532 (1975; Zbl 0329.68039) Full Text: DOI
Aho, A. V.; Steiglitz, K.; Ullman, J. D. Evaluating polynomials at fixed sets of points. (English) Zbl 0326.65027 SIAM J. Comput. 4, 533-539 (1975). MSC: 65H05 68Q25 PDFBibTeX XMLCite \textit{A. V. Aho} et al., SIAM J. Comput. 4, 533--539 (1975; Zbl 0326.65027) Full Text: DOI
Johnson, D. S.; Demers, A.; Ullman, J. D.; Garey, M. R.; Graham, R. L. Worst-case performance bounds for simple one-dimensional packing algorithms. (English) Zbl 0297.68028 SIAM J. Comput. 3, 299-325 (1974). MSC: 68W99 68Q25 05-04 PDFBibTeX XMLCite \textit{D. S. Johnson} et al., SIAM J. Comput. 3, 299--325 (1975; Zbl 0297.68028) Full Text: DOI Link
Aho, A. V.; Ullman, J. D. A technique for speeding up LR(k) parsers. (English) Zbl 0271.68013 SIAM J. Comput. 2, 106-127 (1973). MSC: 68N01 68Q45 PDFBibTeX XMLCite \textit{A. V. Aho} and \textit{J. D. Ullman}, SIAM J. Comput. 2, 106--127 (1973; Zbl 0271.68013) Full Text: DOI
Hopcroft, J. E.; Ullman, J. D. Set merging algorithms. (English) Zbl 0253.68003 SIAM J. Comput. 2, 294-303 (1973). MSC: 68N01 68W99 PDFBibTeX XMLCite \textit{J. E. Hopcroft} and \textit{J. D. Ullman}, SIAM J. Comput. 2, 294--303 (1973; Zbl 0253.68003) Full Text: DOI Link
Hecht, Matthew S.; Ullman, Jeffrey D. Flow graph reducibility. (English) Zbl 0265.68031 SIAM J. Comput. 1, 188-202 (1972). MSC: 68N01 68Q45 68Q25 PDFBibTeX XMLCite \textit{M. S. Hecht} and \textit{J. D. Ullman}, SIAM J. Comput. 1, 188--202 (1972; Zbl 0265.68031) Full Text: DOI
Aho, Alfred V.; Ullman, Jeffrey D. Optimization of straight line programs. (English) Zbl 0248.68009 SIAM J. Comput. 1, 1-19 (1972). MSC: 68N01 PDFBibTeX XMLCite \textit{A. V. Aho} and \textit{J. D. Ullman}, SIAM J. Comput. 1, 1--19 (1972; Zbl 0248.68009) Full Text: DOI
Aho, A. V.; Garey, M. R.; Ullman, J. D. The transitive reduction of a directed graph. (English) Zbl 0247.05128 SIAM J. Comput. 1, 131-137 (1972). MSC: 05C20 05-04 PDFBibTeX XMLCite \textit{A. V. Aho} et al., SIAM J. Comput. 1, 131--137 (1972; Zbl 0247.05128) Full Text: DOI Link