A Fast Suffix-Sorting Algorithm

Ahlswede R, Balkenhol B, Deppe C, Fröhlich M (2006)
In: General Theory of Information Transfer and Combinatorics. Ahlswede R, Bäumer L, Cai N, Aydinian H, Blinovsky V, Deppe C, Mashurian H (Eds); Lecture Notes in Computer Science, 4123. 719-734.

Book Chapter | Published | English

No fulltext has been uploaded

Book Editor
Ahlswede, Rudolf ; Bäumer, Lars ; Cai, Ning ; Aydinian, Harout ; Blinovsky, Vladimir ; Deppe, Christian ; Mashurian, Haik
Publishing Year
PUB-ID

Cite this

Ahlswede R, Balkenhol B, Deppe C, Fröhlich M. A Fast Suffix-Sorting Algorithm. In: Ahlswede R, Bäumer L, Cai N, et al., eds. General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science. Vol 4123. 2006: 719-734.
Ahlswede, R., Balkenhol, B., Deppe, C., & Fröhlich, M. (2006). A Fast Suffix-Sorting Algorithm. In R. Ahlswede, L. Bäumer, N. Cai, H. Aydinian, V. Blinovsky, C. Deppe, & H. Mashurian (Eds.), Lecture Notes in Computer Science: Vol. 4123. General Theory of Information Transfer and Combinatorics (pp. 719-734).
Ahlswede, R., Balkenhol, B., Deppe, C., and Fröhlich, M. (2006). “A Fast Suffix-Sorting Algorithm” in General Theory of Information Transfer and Combinatorics, ed. R. Ahlswede, L. Bäumer, N. Cai, H. Aydinian, V. Blinovsky, C. Deppe, and H. Mashurian Lecture Notes in Computer Science, vol. 4123, 719-734.
Ahlswede, R., et al., 2006. A Fast Suffix-Sorting Algorithm. In R. Ahlswede, et al., eds. General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science. no.4123 pp. 719-734.
R. Ahlswede, et al., “A Fast Suffix-Sorting Algorithm”, General Theory of Information Transfer and Combinatorics, R. Ahlswede, et al., eds., Lecture Notes in Computer Science, vol. 4123, 2006, pp.719-734.
Ahlswede, R., Balkenhol, B., Deppe, C., Fröhlich, M.: A Fast Suffix-Sorting Algorithm. In: Ahlswede, R., Bäumer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., and Mashurian, H. (eds.) General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science. 4123, p. 719-734. (2006).
Ahlswede, Rudolf, Balkenhol, Bernhard, Deppe, Christian, and Fröhlich, Martin. “A Fast Suffix-Sorting Algorithm”. General Theory of Information Transfer and Combinatorics. Ed. Rudolf Ahlswede, Lars Bäumer, Ning Cai, Harout Aydinian, Vladimir Blinovsky, Christian Deppe, and Haik Mashurian. 2006.Vol. 4123. Lecture Notes in Computer Science. 719-734.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar
ISBN Search