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)- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- Achieving optimal CRCW PRAM fault-tolerance
- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
- Divide-and-conquer algorithms on the hypercube
- A new scheme for the deterministic simulation of PRAMs in VLSI
- Multiplication, division, and shift instructions in parallel random access machines
- The complexity of synchronous iterative do-all with crashes
- Parallel algorithms for a class of graphs generated recursively
- Parallelism and fast solution of linear systems
- Low-contention data structures
- Speedups of deterministic machines by synchronous parallel machines
- Sorting signed permutations by reversals, revisited
- An efficient write-all algorithm for fail-stop PRAM without initialized memory
- Randomization and the parallel solution of linear algebra problems
- Efficient parallel algorithms can be made robust
- A bridging model for multi-core computing
- Unambiguity of circuits
- Parallel \(\mathcal H\)-matrix arithmetics on shared memory systems
- Analysis of parallel uniform hashing
- Processor-efficient implementation of a maximum flow algorithm
- Deterministic P-RAM simulation with constant redundancy
- Formal specification of parallel SIMD execution
- Parallel computation and conflicts in memory access
- Efficient execution of nondeterministic parallel programs on asynchronous systems
- An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm
- Fast rehashing in PRAM emulations
- Simulation of Parallel Random Access Machines by Circuits
- Modelling knowledge and action in distributed systems
- A theory of strict P-completeness
- An efficient parallel algorithm for planarity
- Distributed MST for constant diameter graphs
- Feasible real random access machines
- Parallel time O(log n) recognition of unambiguous context-free languages
- Approximating matchings in parallel
- Parallel approximation schemes for subset sum and knapsack problems
- Sequential and parallel algorithms for the NCA problem on pure pointer machines
- The cache complexity of multithreaded cache oblivious algorithms
- Parallel computation with threshold functions
- A theory of strict P-completeness
- SCHEDULING INTERVAL ORDERS IN PARALLEL
- Complexity theory of parallel time and hardware
- Parallel pointer machines
- Fast recognition of deterministic cfl's with a smaller number of processors
- On the relationship of congruence closure and unification
- Optimal parallel parsing of bracket languages
- A note on the parallel complexity of anti-unification
- scientific article; zbMATH DE number 512845 (Why is no real title available?)
- Reliable computations on faulty EREW PRAM
- Re-scheduling invocations of services for RPC grids
- A complexity theory of efficient parallel algorithms
- A parallel method for fast and practical high-order Newton interpolation
- A parallel algorithm for the maximal path problem
- Division in idealized unit cost RAMs
- A parallel-design distributed-implementation (PDDI) general-purpose computer
- Depth-first search is inherently sequential
- On Synchronous Parallel Computations with Independent Probabilistic Choice
- Parallelism and the maximal path problem
- Matching theory -- a sampler: From Dénes König to the present
- Graph coloring on coarse grained multicomputers
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
- Routing, merging, and sorting on parallel models of computation
- A probabilistic simulation of PRAMs on a bounded degree network
- Data structures and algorithms for approximate string matching
- Parallel O(log n) time edge-colouring of trees and Halin graphs
- A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
- scientific article; zbMATH DE number 177541 (Why is no real title available?)
- Parallel solutions to geometric problems in the scan model of computation
- Removing randomness in parallel computation without a processor penalty
- Parallel recognition and ranking of context-free languages
- The bulk-synchronous parallel random access machine
- The graph matching problem
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups
- Parallel priority queues
- The latency-of-data-access model for analyzing parallel computation
- Parallel approximation algorithms for bin packing
- On uniform circuit complexity
- A fixpoint theory for non-monotonic parallelism
- On efficient parallel computations of costs of paths on a grid graph
- Membership in polynomial ideals over \(\mathcal{Q}\) is exponential space complete
- On-line construction of two-dimensional suffix trees
- Arbitrary sequence RAMs
- Optical computing
- scientific article; zbMATH DE number 18636 (Why is no real title available?)
- Improved deterministic parallel integer sorting
- Formula dissection: A parallel algorithm for constraint satisfaction
- The parallel complexity of tree embedding problems (extended abstract)
- A note on the parallel computation thesis
- A parallel algorithm for the monadic unification problem
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
- Randomized Gandy-Păun-Rozenberg machines
- The active element machine
- scientific article; zbMATH DE number 3917713 (Why is no real title available?)
- A space-efficient Huffman decoding algorithm and its parallelism
- A constructive proof of the soundness of the encoding of random access machines in a Linda calculus with ordered semantics.
- A parallel algorithm for finding a blocking flow in an acyclic network
- On the parallel complexity of the polynomial ideal membership problem
- Parallel models of computation: An introductory survey
- Efficient address generation in a parallel processor
- A parallel algorithm for computing Steiner trees in strongly chordal graphs
- Computation models and function algebras
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)
