Parallelism in random access machines
From MaRDI portal
Recommendations
- Parallel random access machines with both multiplication and shifts
- Parallelism in randomized incremental algorithms
- scientific article; zbMATH DE number 4047072
- Parallel random access machines with bounded memory wordsize
- scientific article; zbMATH DE number 755684
- scientific article; zbMATH DE number 549925
- Part I Parallel architectures and algorithms
- scientific article; zbMATH DE number 917697
- Communication-efficient parallel algorithms for distributed random-access machines
- Advances in randomized parallel computing
Cited in
(only showing first 100 items - show all)- Optical computing
- A note on the parallel computation thesis
- Depth-first search is inherently sequential
- Speedups of deterministic machines by synchronous parallel machines
- Routing, merging, and sorting on parallel models of computation
- A parallel algorithm for the monadic unification problem
- Parallel approximation schemes for subset sum and knapsack problems
- Optimal parallel parsing of bracket languages
- Array processing machines: an abstract model
- Parallel time O(log n) recognition of unambiguous context-free languages
- Parallelism and the maximal path problem
- On nondeterminism in parallel computation
- An optimal parallel algorithm for triangulating a set of points in the plane
- A parallel algorithm for the maximal path problem
- On the time required to sum n semigroup elements on a parallel machine with simultaneous writes
- Optimal parallel randomized algorithms for sparse addition and identification
- Data structures and algorithms for approximate string matching
- An efficient parallel algorithm for updating minimum spanning trees
- Parallel computation with threshold functions
- Parallel O(log n) time edge-colouring of trees and Halin graphs
- An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits
- Parallel algorithms for finding Hamilton cycles in random graphs
- A probabilistic simulation of PRAMs on a bounded degree network
- An efficient parallel algorithm for planarity
- Complexity theory of parallel time and hardware
- Parallel approximation algorithms for bin packing
- An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm
- On the relationship of congruence closure and unification
- The bulk-synchronous parallel random access machine
- On uniform circuit complexity
- Division in idealized unit cost RAMs
- Parallel computation and conflicts in memory access
- Improved deterministic parallel integer sorting
- Processor-efficient implementation of a maximum flow algorithm
- Parallel cardinality stacks and an application
- Achieving optimal CRCW PRAM fault-tolerance
- Parallel priority queues
- Expected parallel time and sequential space complexity of graph and digraph problems
- Efficient parallel algorithms can be made robust
- Multiplication, division, and shift instructions in parallel random access machines
- Matching theory -- a sampler: From Dénes König to the present
- Tight complexity bounds for term matching problems
- An efficient parallel logarithmic time algorithm for the channel routing problem
- Unambiguity of circuits
- An efficient write-all algorithm for fail-stop PRAM without initialized memory
- Approximating matchings in parallel
- Modelling knowledge and action in distributed systems
- A parallel algorithm for finding a blocking flow in an acyclic network
- On the parallel complexity of the polynomial ideal membership problem
- A new lower bound on approximability of the ground state problem for tridimensional Ising spin glasses
- Feasible real random access machines
- Removing randomness in parallel computation without a processor penalty
- Restricted CRCW PRAMs
- Parallel solutions to geometric problems in the scan model of computation
- Nondeterministics circuits, space complexity and quasigroups
- Parallel algorithms for the assignment and minimum-cost flow problems
- Parallel random access machines with both multiplication and shifts
- A fast algorithm for scalar Nevanlinna-Pick interpolation
- A parallel algorithm for computing Steiner trees in strongly chordal graphs
- The parallel solution of domination problems on chordal and strongly chordal graphs
- A theory of strict P-completeness
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- Formal specification of parallel SIMD execution
- Divide-and-conquer algorithms on the hypercube
- Efficient execution of nondeterministic parallel programs on asynchronous systems
- Graph coloring on coarse grained multicomputers
- A space-efficient Huffman decoding algorithm and its parallelism
- Sorting signed permutations by reversals, revisited
- Speeding up the large-scale consensus fuzzy clustering for handling big data
- Limits on the power of parallel random access machines with weak forms of write conflict resolution
- A note on optimal parallel transformations of regular expressions to nondeterministic finite automata
- On efficient parallel computations of costs of paths on a grid graph
- A fixpoint theory for non-monotonic parallelism
- Randomization and the parallel solution of linear algebra problems
- Does indirect addressing matter?
- Data independence of read, write, and control structures in PRAM computations
- Efficient parallel algorithms for parameterized problems
- Finding least-weight subsequences with fewer processors
- Parallel pointer machines
- P-RAM vs. RP-RAM
- The graph matching problem
- The weakest specifunction
- Combined hierarchies of finite random access machines
- The latency-of-data-access model for analyzing parallel computation
- The complexity of ranking simple languages
- Randomized Gandy-Păun-Rozenberg machines
- The active element machine
- Simulation of Parallel Random Access Machines by Circuits
- scientific article; zbMATH DE number 3850476 (Why is no real title available?)
- On Synchronous Parallel Computations with Independent Probabilistic Choice
- Parallel algorithms for nevanlinna-pick interpolation:the scalar case∗
- On approximating the ideal random access machine by physical machines
- scientific article; zbMATH DE number 3917713 (Why is no real title available?)
- scientific article; zbMATH DE number 3938524 (Why is no real title available?)
- On similarity and duality of computation (I)
- scientific article; zbMATH DE number 3954278 (Why is no real title available?)
- scientific article; zbMATH DE number 4051005 (Why is no real title available?)
- Parallel random access machines with powerful instruction sets
- scientific article; zbMATH DE number 18636 (Why is no real title available?)
This page was built for publication: Parallelism in random access machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402548)
