Pages that link to "Item:Q4710686"
From MaRDI portal
The following pages link to Optimal bounds for decision problems on the CRCW PRAM (Q4710686):
Displaying 44 items.
- Transforming comparison model lower bounds to the parallel-random-access-machine (Q287050) (← links)
- Simulation of PRAMs with scan primitives by unbounded fan-in circuits (Q293467) (← links)
- Time lower bounds do not exist for CRCW PRAMs (Q672150) (← links)
- Exponential lower bounds for the pigeonhole principle (Q687506) (← links)
- Optimal simulation of multidimensional reconfigurable meshes by two- dimensional reconfigurable meshes (Q688237) (← links)
- A sublogarithmic convex hull algorithm (Q911280) (← links)
- Lower bounds for recognizing small cliques on CRCW PRAM's (Q919820) (← links)
- Incomparability in parallel computation (Q919822) (← links)
- Integer summing algorithms on reconfigurable meshes (Q1128663) (← links)
- The queue-read queue-write asynchronous PRAM model (Q1128706) (← links)
- Improved deterministic parallel integer sorting (Q1175944) (← links)
- Efficient parallel algorithms can be made robust (Q1189859) (← links)
- On a compaction theorem of Ragde (Q1195502) (← links)
- Optimal parallel time bounds for the maximum clique problem on intervals (Q1198058) (← links)
- Sorting on PRAMs with reconfigurable buses (Q1198059) (← links)
- Matching parentheses in parallel (Q1208458) (← links)
- Optimal circular arc representations: Properties, recognition, and construction (Q1271617) (← links)
- Sorting in linear time? (Q1273863) (← links)
- Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space (Q1318772) (← links)
- Designing algorithms by expectations (Q1328761) (← links)
- Constant-time parallel recognition of split graphs (Q1349719) (← links)
- The parallel complexity of integer prefix summation (Q1350241) (← links)
- The complexity of parallel prefix problems on small domains (Q1373137) (← links)
- Coloring permutation graphs in parallel (Q1613373) (← links)
- Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs (Q1842819) (← links)
- Designing checkers for programs that run in parallel (Q1911462) (← links)
- An exponential separation between the parity principle and the pigeonhole principle (Q1923563) (← links)
- INTEGER SORTING AND ROUTING IN ARRAYS WITH RECONFIGURABLE OPTICAL BUSES (Q2703018) (← links)
- NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth (Q3010398) (← links)
- OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS (Q3130162) (← links)
- Scalable algorithms for the mesh with buses: merging, sorting and selection (Q4208594) (← links)
- ON THE POWER OF SOME PRAM MODELS (Q4242705) (← links)
- Fast parallel Lyndon factorization with applications (Q4327381) (← links)
- SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS (Q4820152) (← links)
- FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH (Q4820153) (← links)
- MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗ (Q4820154) (← links)
- PARALLEL BLOCK-FINDING USING DISTANCE MATRICES (Q4820161) (← links)
- On the Parallel Evaluation of Dwba Integrals (Q4844588) (← links)
- Sorting and searching revisted (Q5054812) (← links)
- (Q5091162) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
- Optimal parallel algorithms for periods, palindromes and squares (Q5204325) (← links)
- Integer priority queues with decrease key in constant time and the single source shortest paths problem (Q5917573) (← links)
- More efficient parallel flow algorithms (Q6487968) (← links)
