An efficient parallel algorithm for the single function coarsest partition problem

DOI10.1016/0304-3975(94)90030-2zbMath0822.68043OpenAlexW2090195984MaRDI QIDQ1329732

Kwan Woo Ryu, Joseph F. Ja'Ja'

Publication date: 31 July 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90030-2

zbMATH Keywords

parallel algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Distributed algorithms (68W15)

Related Items

Sorting strings and constructing digital search trees in parallel ⋮ Lowerbounds for Bisimulation by Partition Refinement

Cites Work

• Unnamed Item
• Unnamed Item
• A linear time solution to the single function coarsest partition problem
• Parallel construction of a suffix tree with applications
• Lexicographically least circular substrings
• Improved deterministic parallel integer sorting
• Optimal parallel algorithms for forest and term matching
• Optimal algorithms for computing the canonical form of a circular string
• The parallel complexity of coarsest set partition problems
• On the computational power of pushdown automata
• An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
• An Efficient Parallel Biconnectivity Algorithm
• Optimal parallel pattern matching in strings
• Parallel Merge Sort
• Relations between Concurrent-Write Models of Parallel Computation
• Parallel algorithms for planar graph isomorphism and related problems
• Fast canonization of circular strings
• A parallel algorithm for the minimization of finite state automata
• Merging and sorting strings in parallel