| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428571 | Information Processing Letters | 2012 | 5 Pages |
Abstract
The paper describes a simple and fast randomized test for equality of grammar-compressed strings. The thorough running time analysis is done by applying a logarithmic cost measure.
► The paper describes a simple and fast randomized test for equality of grammar-compressed strings. ► A thorough running time analysis is done by applying a logarithmic cost measure. ► The randomized test permits to select any numbers instead of primes.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Manfred Schmidt-Schauß, Georg Schnitger,