Recognizing union-find trees is NP-complete (Q1685019): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963334127
@@ Property / OpenAlex ID: W2963334127 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.07462
@@ Property / arXiv ID: 1510.07462 / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2003
@@ Property / cites work: Mathematical Foundations of Computer Science 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+The recognition of union trees
@@ Property / cites work: The recognition of union trees / rank @@
+Normal rank
@@ Property / cites work @@
+REVERSE ENGINEERING PREFIX TABLES
@@ Property / cites work: REVERSE ENGINEERING PREFIX TABLES / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Cover Array String Reconstruction
@@ Property / cites work: Cover Array String Reconstruction / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient validation and construction of border arrays and validation of string matching automata
+Normal rank
@@ Property / cites work @@
+Words over an ordered alphabet and suffix permutations
+Normal rank
@@ Property / cites work @@
+Q3370008
@@ Property / cites work: Q3370008 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved equivalence algorithm
@@ Property / cites work: An improved equivalence algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Validating the Knuth-Morris-Pratt failure function, fast and online
+Normal rank
@@ Property / cites work @@
+Recognizing union-find trees built up using union-by-rank strategy is NP-complete
+Normal rank
@@ Property / cites work @@
+Counting Parameterized Border Arrays for a Binary Alphabet
+Normal rank
@@ Property / cites work @@
+Verifying and enumerating parameterized border arrays
+Normal rank
@@ Property / cites work @@
+Inferring strings from suffix trees and links on a binary alphabet
+Normal rank
@@ Property / cites work @@
+Unification: a multidisciplinary survey
@@ Property / cites work: Unification: a multidisciplinary survey / rank @@
+Normal rank
@@ Property / cites work @@
+On the combinatorics of suffix arrays
@@ Property / cites work: On the combinatorics of suffix arrays / rank @@
+Normal rank
@@ Property / cites work @@
+Q4795855
@@ Property / cites work: Q4795855 / rank @@
+Normal rank
@@ Property / cites work @@
+Certifying algorithms
@@ Property / cites work: Certifying algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A suffix tree or not a suffix tree?
@@ Property / cites work: A suffix tree or not a suffix tree? / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank
@@ Property / cites work @@
+Q4417681
@@ Property / cites work: Q4417681 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1685019