Job Honig

Fixing paper assignments

  1. Please select all papers that belong to the same person.
  2. Indicate below which author they should be assigned to.
Provide a valid ORCID iD here. This will be used to match future papers to this author.
Provide the name of the school or the university where the author has received or will receive their highest degree (e.g., Ph.D. institution for researchers, or current affiliation for students). This will be used to form the new author page ID, if needed.

TODO: "submit" and "cancel" buttons here

1991

pdf bib
Slow and Fast Parallel Recognition
Hans de Vreught | Job Honig
Proceedings of the Second International Workshop on Parsing Technologies

In the first part of this paper a slow parallel recognizer is described for general CFG’s. The recognizer runs in 𝛩(n3/p(n)) time with p(n) = O(n2) processors. It generalizes the items of the Earley algorithm to double dotted items, which are more suited to parallel parsing. In the second part a fast parallel recognizer is given for general CFG’s. The recognizer runs in O(log n) time using O(n6) processors. It is a generalisation of the Gibbons and Rytter algorithm for grammars in CNF.
Search
Co-authors
Venues
Fix data