Dynamic algorithms for the Dyck languages (Q5057425): 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/3-540-60220-8_54
+Normal rank
@@ Property / OpenAlex ID @@
+W2170921807
@@ Property / OpenAlex ID: W2170921807 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4028873
@@ Property / cites work: Q4028873 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic word problems
@@ Property / cites work: Dynamic word problems / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Maintaining an Array and Computing Its Partial Sums
+Normal rank
@@ Property / cites work @@
+Q4198075
@@ Property / cites work: Q4198075 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient randomized pattern-matching algorithms
@@ Property / cites work: Efficient randomized pattern-matching algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Word Problems Solvable in Logspace
@@ Property / cites work: Word Problems Solvable in Logspace / rank @@
+Normal rank
@@ Property / cites work @@
+Q5513066
@@ Property / cites work: Q5513066 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4335212
@@ Property / cites work: Q4335212 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for union-split-find related problems on random access machines
+Normal rank
@@ Property / cites work @@
+The design of dynamic data structures
@@ Property / cites work: The design of dynamic data structures / rank @@
+Normal rank
@@ Property / cites work @@
+Dyn-FO: A parallel, dynamic complexity class
@@ Property / cites work: Dyn-FO: A parallel, dynamic complexity class / rank @@
+Normal rank
@@ Property / cites work @@
+Language recognition by marking automata
@@ Property / cites work: Language recognition by marking automata / rank @@
+Normal rank