Chaudhuri, Pranay Fast parallel algorithms for a class of graph problems. (English) Zbl 0654.68080 J. Comb. Inf. Syst. Sci. 12, No. 1-2, 51-65 (1987). MSC: 68R10 05-04 68P10 68Q25 PDFBibTeX XMLCite \textit{P. Chaudhuri}, J. Comb. Inf. Syst. Sci. 12, No. 1--2, 51--65 (1987; Zbl 0654.68080)
Pitt, Leonard A note on extending Knuth’s tree estimator to directed acyclic graphs. (English) Zbl 0653.68059 Inf. Process. Lett. 24, 203-206 (1987). MSC: 68P10 68R10 68T20 68P05 PDFBibTeX XMLCite \textit{L. Pitt}, Inf. Process. Lett. 24, 203--206 (1987; Zbl 0653.68059) 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
Miller, D. M. Graph algorithms for the manipulation of Boolean functions and their spectra. (English) Zbl 0642.94051 Numerical mathematics and computing, Proc. 16th Conf., Winnipeg/Manit. 1986, Congr. Numerantium 57, 177-199 (1987). MSC: 94C10 94C15 68R10 PDFBibTeX XML
Blumer, Janet A. How much is that DAWG in the window ? A moving window algorithm for the directed acyclic word graph. (English) Zbl 0636.68109 J. Algorithms 8, 451-469 (1987). MSC: 68Q45 68Q25 68P05 PDFBibTeX XMLCite \textit{J. A. Blumer}, J. Algorithms 8, 451--469 (1987; Zbl 0636.68109) Full Text: DOI
Bordat, J. P. Complexité de problèmes liés aux graphes sans circuit. (Complexity of problems connected with acyclic graphs). (French) Zbl 0634.68031 RAIRO, Inf. Théor. Appl. 21, 181-197 (1987). MSC: 68Q25 68R10 05C20 PDFBibTeX XMLCite \textit{J. P. Bordat}, RAIRO, Inform. Théor. Appl. 21, 181--197 (1987; Zbl 0634.68031) Full Text: DOI EuDML