Reischuk, Rüdiger Improved bounds on the problem of time-space trade-off in the pebble game. (English) Zbl 0468.68068 J. Assoc. Comput. Mach. 27, 839-849 (1980). MSC: 68R10 68Q05 68Q25 PDFBibTeX XMLCite \textit{R. Reischuk}, J. Assoc. Comput. Mach. 27, 839--849 (1980; Zbl 0468.68068) Full Text: DOI
Reischuk, Rüdiger Improved bounds on the problem of time-space trade-off in the pebble game. (English) Zbl 0468.05030 J. Assoc. Comput. Mach. 27, 839-849 (1980). MSC: 05C20 05C35 68R10 PDFBibTeX XMLCite \textit{R. Reischuk}, J. Assoc. Comput. Mach. 27, 839--849 (1980; Zbl 0468.05030) Full Text: DOI
Ntafos, S. C. On the complexity of some minimum path cover problems. (English) Zbl 0453.68031 Combinatorics, graph theory and computing, Proc. 11th southeast. Conf., Boca Raton/Florida 1980, Vol. II, Congr. Numerantium 29, 699 (1980). MSC: 68R10 05C38 05C70 05C20 68Q25 PDFBibTeX XML
Loui, Michael C. A note on the pebble game. (English) Zbl 0448.90098 Inf. Process. Lett. 11, 24-26 (1980). MSC: 91A24 05C20 68Q25 PDFBibTeX XMLCite \textit{M. C. Loui}, Inf. Process. Lett. 11, 24--26 (1980; Zbl 0448.90098) Full Text: DOI
Blum, Manuel; Chandra, Ashok K.; Wegman, Mark N. Equivalence of free Boolean graphs can be decided probabilistically in polynomial time. (English) Zbl 0444.68059 Inf. Process. Lett. 10, 80-82 (1980). MSC: 68R10 68Q25 68Q60 PDFBibTeX XMLCite \textit{M. Blum} et al., Inf. Process. Lett. 10, 80--82 (1980; Zbl 0444.68059) Full Text: DOI
Berztiss, A. T. Depth-first K-trees and critical path analysis. (English) Zbl 0431.68064 Acta Inf. 13, 325-346 (1980). MSC: 68R10 05C20 05C05 90B35 PDFBibTeX XMLCite \textit{A. T. Berztiss}, Acta Inf. 13, 325--346 (1980; Zbl 0431.68064) Full Text: DOI