Primary technical report STAN-CS-71-190, January1971: www.cs.cmu.edu/~cdm/resources/Hopcroft1971.pdf
Locators: Introduction, Formal description of the algorithm, Correctness of algorithm and Analysis of the running time. The constant in O(n log n) depends linearly on alphabet size.

Ancestors (3)

  1. Computer science bibliography
  2. Computer science
  3. Home

Incoming links (1)

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version