A work-time optimal algorithm for computing all string covers
Costas S. Iliopoulos
and
Kunsoo Park
Theoretical Computer Science
164:299–310, 1996
Cites:
Parallel algorithmic techniques for combinatorial computation
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine