PARALLEL TIME O(log N) ACCEPTANCE OF DETERMINISTIC CFLs.
Publication
, Journal Article
Reif, J
Published in: Annual Symposium on Foundations of Computer Science - Proceedings
January 1, 1982
Duke Scholars
Published In
Annual Symposium on Foundations of Computer Science - Proceedings
DOI
ISSN
0272-5428
Publication Date
January 1, 1982
Start / End Page
290 / 296
Citation
APA
Chicago
ICMJE
MLA
NLM
Reif, J. (1982). PARALLEL TIME O(log N) ACCEPTANCE OF DETERMINISTIC CFLs. Annual Symposium on Foundations of Computer Science - Proceedings, 290–296. https://doi.org/10.1109/sfcs.1982.84
Reif, J. “PARALLEL TIME O(log N) ACCEPTANCE OF DETERMINISTIC CFLs.” Annual Symposium on Foundations of Computer Science - Proceedings, January 1, 1982, 290–96. https://doi.org/10.1109/sfcs.1982.84.
Reif J. PARALLEL TIME O(log N) ACCEPTANCE OF DETERMINISTIC CFLs. Annual Symposium on Foundations of Computer Science - Proceedings. 1982 Jan 1;290–6.
Reif, J. “PARALLEL TIME O(log N) ACCEPTANCE OF DETERMINISTIC CFLs.” Annual Symposium on Foundations of Computer Science - Proceedings, Jan. 1982, pp. 290–96. Scopus, doi:10.1109/sfcs.1982.84.
Reif J. PARALLEL TIME O(log N) ACCEPTANCE OF DETERMINISTIC CFLs. Annual Symposium on Foundations of Computer Science - Proceedings. 1982 Jan 1;290–296.
Published In
Annual Symposium on Foundations of Computer Science - Proceedings
DOI
ISSN
0272-5428
Publication Date
January 1, 1982
Start / End Page
290 / 296