A complexity theory of efficient parallel algorithms (Q913512): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random NC algorithm for depth first search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel selection has complexity O(log log N) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of Synchronous Versus Asynchronous Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sorting Algorithms for Parallel Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3766850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: New hash functions and their use in authentication and set equality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for some graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Merge Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a complexity theory of synchronous parallel computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Matrix Inversion Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to models of synchronous parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Permuting Data and Other Computations on Parallel Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Development of Parallel Methods for a $1024$-Processor Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding Fan-out in Logical Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of parallel search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a perfect matching is in random NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Work-preserving emulations of fixed-connection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching, Merging, and Sorting in Parallel Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient synchronization of multiprocessors with shared memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation and conflicts in memory access / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm for routing in permutation networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On describing the behavior and implementation of distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3051377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptation of the Fast Fourier Transform for Parallel Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting and Selecting in Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-first search is inherently sequential / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultracomputers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(logn) parallel connectivity algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Parallel Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on \(N\)-body computations with cutoffs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-depth trade-offs for monotone arithmetic circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share memory in a distributed system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in Comparison Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Computation of Polynomials Using Few Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic parallel memories / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:45, 20 June 2024

scientific article
Language Label Description Also known as
English
A complexity theory of efficient parallel algorithms
scientific article

    Statements

    A complexity theory of efficient parallel algorithms (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    See the review in Zbl 0657.68044.
    0 references
    0 references
    PE PRAM model
    0 references
    parallel algorithms
    0 references
    complexity
    0 references
    classes
    0 references
    models of computation
    0 references
    efficient simulation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references