ACM Home Page
Please provide us with feedback. Feedback
Upper Bounds for Speedup in Parallel Parsing
Full text PdfPdf (913 KB)
Source Journal of the ACM (JACM) archive
Volume 29 ,  Issue 2  (April 1982) table of contents
Pages: 408 - 428  
Year of Publication: 1982
ISSN:0004-5411
Authors
Jacques Cohen  Computer Science Program, Brandeis University, Waltham, MA
Timothy Hickey  Mathematics Department, University of Chicago, Chicago, IL
Joel Katcoff  Kaye, Scholer, Fierman, Hays and Handler, 425 Park Avenue, New York, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 26,   Citation Count: 9
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/322307.322316
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
BRENT, R.P., KUCK, D.J., AND MARUYAMA, K M The parallel evaluaUon of arithmetic expressions without diviston. 1E~F, Trans. Comput. C-22 (May 1973), 532-534.
4
5
 
6
F~scr~a~, C.N. On parsing context-free languages in parallel environments Ph D. Dissertation, Dep. of Computer Science, Corner Univ., Ithaca, N.Y., April 1975.
7
8
9
10
 
11
PAUL, W.J., AND TAIOAN, R.E.Time space trade-offs in a pebble game. ,~cta Inf. 10 (1978), 111-115.
 
12
Scmcmm/R, V A system for designing fast programming language translators. Proe. AFIPS 1969 SJCC, AFIPS Press, Arlington, Va., pp. 777-792

CITED BY  9
 
 

Collaborative Colleagues:
Jacques Cohen: colleagues
Timothy Hickey: colleagues
Joel Katcoff: colleagues

Peer to Peer - Readers of this Article have also read: