Linear Time Suffix Array Construction Using D-Critical Substrings (Q3637104): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-02441-2_6
+Normal rank
@@ Property / OpenAlex ID @@
+W195190007
@@ Property / OpenAlex ID: W195190007 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138909
@@ Property / cites work: Q3138909 / rank @@
+Normal rank
@@ Property / cites work @@
+Engineering a lightweight suffix array construction algorithm
+Normal rank
@@ Property / cites work @@
+Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
+Normal rank
@@ Property / cites work @@
+Linear-Time Construction of Suffix Arrays
@@ Property / cites work: Linear-Time Construction of Suffix Arrays / rank @@
+Normal rank
@@ Property / cites work @@
+Q4449231
@@ Property / cites work: Q4449231 / rank @@
+Normal rank
@@ Property / cites work @@
+Space Efficient Linear Time Construction of Suffix Arrays
+Normal rank
@@ Property / cites work @@
+Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3637104