String problems in the congested clique model
From MaRDI portal
Cites work
- A deterministic algorithm for the MST problem in constant rounds of congested clique
- A fast string searching algorithm
- A Tournament Problem
- An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
- Clique here: on the distributed complexity in fully-connected networks
- Efficient randomized pattern-matching algorithms
- Fast approximate shortest paths in the congested clique
- Fast distributed algorithms for girth, cycles and small subgraphs
- Fast Pattern Matching in Strings
- scientific article; zbMATH DE number 1559569 (Why is no real title available?)
- scientific article; zbMATH DE number 1786458 (Why is no real title available?)
- scientific article; zbMATH DE number 6472611 (Why is no real title available?)
- Linear work suffix array construction
- MST in \(O(1)\) rounds of congested clique
- Optimal deterministic routing and sorting on the congested clique
- Optimal parallel algorithms for string matching
- Optimal parallel pattern matching in strings
- Optimal parallel string algorithms: sorting, merging and computing the minimum
- Parallel algorithms for geometric graph problems
- Parallel External Memory Suffix Sorting
- Quorums from difference covers
- Real-time streaming string-matching
- Suffix Arrays: A New Method for On-Line String Searches
- The round complexity of distributed sorting, extended abstract
- Time-space trade-offs for the longest common substring problem
This page was built for publication: String problems in the congested clique model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299437)
