Structural parallel algorithmics

DOI10.1007/3-540-54233-7_148MaRDI QIDQ4036578zbMATH OpenFDO

Authors Uzi Vishkin

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54233-7_148

zbMATH Keywords

non-numerical parallel algorithmsPRAM model of parallel computationvery fast deterministic parallel algorithmsvery fast randomized parallel algorithms

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Cited in

(15)

• On saving space in parallel computation
• A practical hierarchical model of parallel computation. I: The model
• A practical hierarchical model of parallel computation. II: Binary tree and FFT algorithms
• Randomized range-maxima in nearly-constant parallel time
• New algorithms for the LCA problem and the binary tree reconstruction problem
• Virtual shared memory: Algorithms and complexity
• Almost fully-parallel parentheses matching
• Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM
• Parallel `go with the winners' algorithms in distributed memory models.
• scientific article; zbMATH DE number 4131653 (Why is no real title available?)
• AN EFFICIENT EREW ALGORITHM FOR MINIMUM PATH COVER AND HAMILTONICITY ON COGRAPHS
• Heap construction in the parallel comparison tree model
• Generic parallel algorithms
• scientific article; zbMATH DE number 278827 (Why is no real title available?)
• Continuous functions and parallel algorithms on concrete data structures

This page was built for publication: Structural parallel algorithmics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036578)