Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition (Q5096776): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-55210-3_178
+Normal rank
@@ Property / OpenAlex ID @@
+W1492683431
@@ Property / OpenAlex ID: W1492683431 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4003168
@@ Property / cites work: Q4003168 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3355240
@@ Property / cites work: Q3355240 / rank @@
+Normal rank
@@ Property / cites work @@
+On the parallel recognition of unambiguous context-free languages
+Normal rank
@@ Property / cites work @@
+Q3992991
@@ Property / cites work: Q3992991 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Speed of Recognition of Context-Free Languages by Array Automata
+Normal rank
@@ Property / cites work @@
+Parallel Time $O(\log n)$ Acceptance of Deterministic CFL<scp>s</scp> on an Exclusive-Write P-RAM
+Normal rank
@@ Property / cites work @@
+On efficient parallel computations of costs of paths on a grid graph
+Normal rank
@@ Property / cites work @@
+Q3700838
@@ Property / cites work: Q3700838 / rank @@
+Normal rank
@@ Property / cites work @@
+Time complexity of unambiguous path systems
@@ Property / cites work: Time complexity of unambiguous path systems / rank @@
+Normal rank