Matches in SemOpenAlex for { <https://semopenalex.org/work/W2739149210> ?p ?o ?g. }
Showing items 1 to 75 of
75
with 100 items per page.
- W2739149210 abstract "Proving the optimality of algorithms for important combinatorial problems and determining their intrinsic hardness properties requires finding strong lower bounds for them. The model of computation we consider is the PRAM without bit operations. The model eliminates those operations that allow bit-extraction or updates of the bits of the individual registers, but provides the usual arithmetic, indirect referencing, conditional and unconditional branch operations at unit cost. We consider here an unbounded fan-in model, in which the operations {+, min, max} can have unbounded fan-in at unit cost. We show that computing the shortest path between two specified vertices in a weighted graph on n vertices cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using nΩ(1) processors, even when the bit-lengths of the weights on the edges are restricted to be of size o(log3 n). This shows that the matrix repeated-squaring algorithm for the SHORTEST PATH PROBLEM is optimal in the unbounded fan-in PRAM model without bit operations. We also show that computing the maximum blocking flow (or equivalently, the maximum flow in a directed acyclic graph) cannot be computed in time o(n1/4) using 2Ω( n1/4) processors in the same model, even when the inputs are restricted to be of length O(n 2). The lower bounds also hold (with slightly weaker parameters) in the case of randomized algorithms with two-sided error, and even when the running time of the algorithm is allowed to depend on the total bit-length. The thesis also provides lower bounds for other restricted cases of these problems which are useful in practice. We also obtain as a corollary a weak lower bound on the problem of computing weighted matchings in bipartite graphs which is not known to have a fast parallel algorithm." @default.
- W2739149210 created "2017-07-31" @default.
- W2739149210 creator A5013834335 @default.
- W2739149210 creator A5028134406 @default.
- W2739149210 date "2001-01-01" @default.
- W2739149210 modified "2023-09-23" @default.
- W2739149210 title "Lower bounds for parallel algorithms" @default.
- W2739149210 hasPublicationYear "2001" @default.
- W2739149210 type Work @default.
- W2739149210 sameAs 2739149210 @default.
- W2739149210 citedByCount "2" @default.
- W2739149210 countsByYear W27391492102018 @default.
- W2739149210 countsByYear W27391492102019 @default.
- W2739149210 crossrefType "journal-article" @default.
- W2739149210 hasAuthorship W2739149210A5013834335 @default.
- W2739149210 hasAuthorship W2739149210A5028134406 @default.
- W2739149210 hasConcept C11413529 @default.
- W2739149210 hasConcept C114614502 @default.
- W2739149210 hasConcept C118615104 @default.
- W2739149210 hasConcept C120373497 @default.
- W2739149210 hasConcept C128669082 @default.
- W2739149210 hasConcept C132525143 @default.
- W2739149210 hasConcept C134306372 @default.
- W2739149210 hasConcept C157469704 @default.
- W2739149210 hasConcept C199360897 @default.
- W2739149210 hasConcept C22590252 @default.
- W2739149210 hasConcept C2777735758 @default.
- W2739149210 hasConcept C33923547 @default.
- W2739149210 hasConcept C41008148 @default.
- W2739149210 hasConcept C45374587 @default.
- W2739149210 hasConcept C63553672 @default.
- W2739149210 hasConcept C77553402 @default.
- W2739149210 hasConceptScore W2739149210C11413529 @default.
- W2739149210 hasConceptScore W2739149210C114614502 @default.
- W2739149210 hasConceptScore W2739149210C118615104 @default.
- W2739149210 hasConceptScore W2739149210C120373497 @default.
- W2739149210 hasConceptScore W2739149210C128669082 @default.
- W2739149210 hasConceptScore W2739149210C132525143 @default.
- W2739149210 hasConceptScore W2739149210C134306372 @default.
- W2739149210 hasConceptScore W2739149210C157469704 @default.
- W2739149210 hasConceptScore W2739149210C199360897 @default.
- W2739149210 hasConceptScore W2739149210C22590252 @default.
- W2739149210 hasConceptScore W2739149210C2777735758 @default.
- W2739149210 hasConceptScore W2739149210C33923547 @default.
- W2739149210 hasConceptScore W2739149210C41008148 @default.
- W2739149210 hasConceptScore W2739149210C45374587 @default.
- W2739149210 hasConceptScore W2739149210C63553672 @default.
- W2739149210 hasConceptScore W2739149210C77553402 @default.
- W2739149210 hasLocation W27391492101 @default.
- W2739149210 hasOpenAccess W2739149210 @default.
- W2739149210 hasPrimaryLocation W27391492101 @default.
- W2739149210 hasRelatedWork W1537954077 @default.
- W2739149210 hasRelatedWork W1886232660 @default.
- W2739149210 hasRelatedWork W2029360271 @default.
- W2739149210 hasRelatedWork W2044334960 @default.
- W2739149210 hasRelatedWork W2053182026 @default.
- W2739149210 hasRelatedWork W2074687256 @default.
- W2739149210 hasRelatedWork W2093517369 @default.
- W2739149210 hasRelatedWork W2272441262 @default.
- W2739149210 hasRelatedWork W2296544654 @default.
- W2739149210 hasRelatedWork W2569244175 @default.
- W2739149210 hasRelatedWork W2949633532 @default.
- W2739149210 hasRelatedWork W2951913790 @default.
- W2739149210 hasRelatedWork W2952183636 @default.
- W2739149210 hasRelatedWork W2962700536 @default.
- W2739149210 hasRelatedWork W2963692174 @default.
- W2739149210 hasRelatedWork W2964757429 @default.
- W2739149210 hasRelatedWork W3022296711 @default.
- W2739149210 hasRelatedWork W3083278038 @default.
- W2739149210 hasRelatedWork W3128057791 @default.
- W2739149210 hasRelatedWork W3186563147 @default.
- W2739149210 isParatext "false" @default.
- W2739149210 isRetracted "false" @default.
- W2739149210 magId "2739149210" @default.
- W2739149210 workType "article" @default.