Implementation of simultaneous memory address access in models that forbid it
From MaRDI portal
Publication:4747506
DOI10.1016/0196-6774(83)90033-0zbMath0509.68024OpenAlexW1985592215WikidataQ63353488 ScholiaQ63353488MaRDI QIDQ4747506
Publication date: 1983
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(83)90033-0
Related Items (26)
An O(log n) algorithm for parallel update of minimum spanning trees ⋮ A parallel algorithm for computing Steiner trees in strongly chordal graphs ⋮ The parallel solution of domination problems on chordal and strongly chordal graphs ⋮ Unbounded fan-in circuits and associative functions ⋮ Constant-time parallel recognition of split graphs ⋮ Towards optimal parallel bucket sorting ⋮ Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM ⋮ An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits ⋮ FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS ⋮ PARALLEL BLOCK-FINDING USING DISTANCE MATRICES ⋮ Efficient massively parallel implementation of some combinatorial algorithms ⋮ An efficient parallel algorithm for planarity ⋮ An nc algorithm to recognize hhd-free graphs ⋮ A parallel algorithm for the maximum 2-chain edge packing problem ⋮ On the Parallel Evaluation of Dwba Integrals ⋮ Incomparability in parallel computation ⋮ Multiplication, division, and shift instructions in parallel random access machines ⋮ A parallelization of Miller's \(n^{\log n}\) isomorphism technique ⋮ Parallel search algorithms for graphs and trees ⋮ Modelling knowledge and action in distributed systems ⋮ Optimal parallel quicksort on EREW PRAM ⋮ A simple nc algorithm to recognize weakly triangulated graphs ⋮ Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs ⋮ A parallel-design distributed-implementation (PDDI) general-purpose computer ⋮ An optimal parallel connectivity algorithm ⋮ Finding Euler tours in parallel
This page was built for publication: Implementation of simultaneous memory address access in models that forbid it
