Pages that link to "Item:Q3753489"
From MaRDI portal
The following pages link to Deterministic coin tossing with applications to optimal parallel list ranking (Q3753489):
Displaying 50 items.
- Optimal parallel algorithms on planar graphs (Q582094) (← links)
- Optimal merging and sorting on the EREW PRAM (Q582111) (← links)
- The power of multimedia: Combining point-to-point and multi-access networks (Q582899) (← links)
- Maintaining dynamic sequences under equality tests in polylogarithmic time (Q675314) (← links)
- Efficient parallel term matching and anti-unification (Q688582) (← links)
- Distributed \((\varDelta + 1)\)-coloring in the physical model (Q742411) (← links)
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
- Deterministic parallel list ranking (Q808699) (← links)
- Distributed algorithms for weighted problems in sparse graphs (Q866546) (← links)
- Efficient quantum algorithms for simulating sparse Hamiltonians (Q883042) (← links)
- Distributed algorithms for random graphs (Q888436) (← links)
- Deterministic local algorithms, unique identifiers, and fractional graph colouring (Q896700) (← links)
- Oblivious algorithms for multicores and networks of processors (Q897114) (← links)
- Improved nonconservative sequential and parallel integer sorting (Q917274) (← links)
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- Distributed approximation for maximum weight matching on bounded degree bounded integer weight graphs (Q989486) (← links)
- An optimal maximal independent set algorithm for bounded-independence graphs (Q992507) (← links)
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition (Q992509) (← links)
- Towards optimal parallel bucket sorting (Q1098305) (← links)
- Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees (Q1098631) (← links)
- Parallel construction of a suffix tree with applications (Q1104104) (← links)
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time (Q1104105) (← links)
- An optimally efficient selection algorithm (Q1108805) (← links)
- Hybridsort revisited and parallelized (Q1123628) (← links)
- Improved deterministic parallel integer sorting (Q1175944) (← links)
- A unified approach to parallel depth-first traversals of general trees (Q1178197) (← links)
- Processor-efficient implementation of a maximum flow algorithm (Q1178222) (← links)
- Breadth-first traversal of trees and integer sorting in parallel (Q1186572) (← links)
- Expected parallel time and sequential space complexity of graph and digraph problems (Q1186789) (← links)
- Parallel recognition of series-parallel graphs (Q1201288) (← links)
- Counting clique trees and computing perfect elimination schemes in parallel (Q1262131) (← links)
- Sorting in linear time? (Q1273863) (← links)
- More general parallel tree contraction: Register allocation and broadcasting in a tree (Q1274316) (← links)
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth (Q1278042) (← links)
- An optimal parallel algorithm for maximal matching (Q1341686) (← links)
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q1351004) (← links)
- Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM (Q1356881) (← links)
- Improved parallel integer sorting without concurrent writing (Q1362905) (← links)
- Transversal partitioning in balanced hypergraphs (Q1372732) (← links)
- Efficient computation of implicit representations of sparse graphs (Q1377648) (← links)
- Text sparsification via local maxima. (Q1401406) (← links)
- An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs (Q1607053) (← links)
- Constant-time local computation algorithms (Q1743110) (← links)
- Best of two local models: centralized local and distributed local algorithms (Q1784947) (← links)
- Faster optimal parallel prefix sums and list ranking (Q1825647) (← links)
- The local nature of \(\Delta\)-coloring and its algorithmic applications (Q1894705) (← links)
- Designing checkers for programs that run in parallel (Q1911462) (← links)
- (Q5009593) (← links)
- Improved Dynamic Graph Coloring (Q5009642) (← links)
- Introduction to local certification (Q5024672) (← links)
