The following pages link to (Q3992991):
Displayed 50 items.
- Optimal parallel algorithms on planar graphs (Q582094) (← links)
- Parallel algorithms for a class of graphs generated recursively (Q582922) (← links)
- The language intersection problem for non-recursive context-free grammars (Q596298) (← links)
- Reliable computations on faulty EREW PRAM (Q671425) (← links)
- Parallel tree-contraction and Fibonacci numbers (Q671622) (← links)
- Optimal parallel execution of complete binary trees and grids into most popular interconnection networks (Q672453) (← links)
- Efficient parallel algorithms for doubly convex-bipartite graphs (Q672468) (← links)
- A simple randomized parallel algorithm for maximal f-matchings (Q672735) (← links)
- The maximal \(f\)-dependent set problem for planar graphs is in NC (Q673069) (← links)
- A parallel tree difference algorithm (Q673225) (← links)
- Multilist layering: Complexity and applications (Q673793) (← links)
- Fast recognition of deterministic cfl's with a smaller number of processors (Q685360) (← links)
- A string-matching algorithm for the CREW PRAM (Q688234) (← links)
- On the parallel recognition of unambiguous context-free languages (Q808269) (← links)
- On the complexity of the recognition of parallel 2D-image languages (Q808271) (← links)
- On optimal parallel computations for sequences of brackets (Q808700) (← links)
- The parallel complexity of two problems on concurrency (Q811123) (← links)
- Parallel \(LL\) parsing (Q878376) (← links)
- Sorting roughly sorted sequences in parallel (Q909454) (← links)
- Parallel construction of minimal suffix and factor automata (Q911778) (← links)
- Quasilinear cellular automata (Q992263) (← links)
- Sorting networks of logarithmic depth, further simplified (Q1024784) (← links)
- Boolean circuit programming: A new paradigm to design parallel algorithms (Q1026240) (← links)
- A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation (Q1123611) (← links)
- On XRAM and PRAM models, and on data-movement-intensive problems (Q1127554) (← links)
- Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages (Q1128670) (← links)
- The bulk-synchronous parallel random access machine (Q1128714) (← links)
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays (Q1177175) (← links)
- Efficient parallel algorithms to test square-freeness and factorize strings (Q1178198) (← links)
- Data-movement-intensive problems: Two folk theorems in parallel computation revisited (Q1184985) (← links)
- Optimal parallel 3-coloring algorithm for rooted trees and its applications (Q1186596) (← links)
- Deciding whether graph \(G\) has page number one is in NC (Q1195855) (← links)
- The parallel complexity of coarsest set partition problems (Q1198030) (← links)
- A sublinear parallel algorithm for some dynamic programming problems (Q1202931) (← links)
- An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem (Q1209346) (← links)
- Observations on \(\log(n)\) time parallel recognition of unambiguous cfl's (Q1209354) (← links)
- On the complexity of the k-chain subgraph cover problem (Q1275070) (← links)
- Alphabet-independent optimal parallel search for three-dimensional patterns (Q1275083) (← links)
- The computational complexity of pattern formation (Q1279214) (← links)
- Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms (Q1283779) (← links)
- The computational complexity of the Lorentz lattice gas (Q1284985) (← links)
- An optimal parallel algorithm to convert a regular expression into its Glushkov automaton (Q1285572) (← links)
- Parallel on-line parsing in constant time per word (Q1314377) (← links)
- Parallel RAM algorithms for factorizing words (Q1325834) (← links)
- A theorem on permutation graphs with applications (Q1328502) (← links)
- Locality-preserving hash functions for general purpose parallel computation (Q1333434) (← links)
- On two-dimensional pattern matching by optimal parallel algorithms (Q1334677) (← links)
- An optimal sublinear time parallel algorithm for some dynamic programming problems (Q1336746) (← links)
- List-ranking on interconnection networks. (Q1401927) (← links)
- Sorting and doubling techniques for set partitioning and automata minimization problems (Q1575899) (← links)