Implementation of simultaneous memory address access in models that forbid it
From MaRDI portal
Publication:4747506
DOI10.1016/0196-6774(83)90033-0zbMath0509.68024WikidataQ63353488 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
A simple nc algorithm to recognize weakly triangulated graphs, FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS, PARALLEL BLOCK-FINDING USING DISTANCE MATRICES, On the Parallel Evaluation of Dwba Integrals, Optimal parallel quicksort on EREW PRAM, A parallel-design distributed-implementation (PDDI) general-purpose computer, An optimal parallel connectivity algorithm, Finding Euler tours in parallel, Incomparability in parallel computation, An O(log n) algorithm for parallel update of minimum spanning trees, Unbounded fan-in circuits and associative functions, Towards optimal parallel bucket sorting, An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits, An efficient parallel algorithm for planarity, A parallel algorithm for the maximum 2-chain edge packing problem, 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, A parallel algorithm for computing Steiner trees in strongly chordal graphs, The parallel solution of domination problems on chordal and strongly chordal graphs, Constant-time parallel recognition of split graphs, Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM, Efficient massively parallel implementation of some combinatorial algorithms, Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs, An nc algorithm to recognize hhd-free graphs
