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. Berlin, Heidelberg: Springer Berlin Heidelberg: 719-734.
Sammelwerksbeitrag
| Veröffentlicht | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Herausgeber*in
Ahlswede, Rudolf;
Bäumer, Lars;
Cai, Ning;
Aydinian, Harout;
Blinovsky, Vladimir;
Deppe, Christian;
Mashurian, Haik
Einrichtung
Erscheinungsjahr
2006
Buchtitel
General Theory of Information Transfer and Combinatorics
Serientitel
Lecture Notes in Computer Science
Band
4123
Seite(n)
719-734
ISBN
978-3-540-46244-6
ISSN
0302-9743
Page URI
https://pub.uni-bielefeld.de/record/2656503
Zitieren
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. Berlin, Heidelberg: Springer Berlin Heidelberg; 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). Berlin, Heidelberg: Springer Berlin Heidelberg. doi:10.1007/11889342_46
Ahlswede, Rudolf, Balkenhol, Bernhard, Deppe, Christian, and Fröhlich, Martin. 2006. “A Fast Suffix-Sorting Algorithm”. In General Theory of Information Transfer and Combinatorics, ed. Rudolf Ahlswede, Lars Bäumer, Ning Cai, Harout Aydinian, Vladimir Blinovsky, Christian Deppe, and Haik Mashurian, 4123:719-734. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg.
Ahlswede, R., Balkenhol, B., Deppe, C., and Fröhlich, M. (2006). “A Fast Suffix-Sorting Algorithm” in General Theory of Information Transfer and Combinatorics, Ahlswede, R., Bäumer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., and Mashurian, H. eds. Lecture Notes in Computer Science, vol. 4123, (Berlin, Heidelberg: Springer Berlin Heidelberg), 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 Berlin, Heidelberg: Springer Berlin Heidelberg, 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, Berlin, Heidelberg: Springer Berlin Heidelberg, 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. Springer Berlin Heidelberg, Berlin, Heidelberg (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. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.Vol. 4123. Lecture Notes in Computer Science. 719-734.
Google Scholar
ISBN Suche