The following pages link to (Q4023519):
Displayed 50 items.
- An efficient parallel algorithm for the single function coarsest partition problem (Q1329732) (← links)
- Local consistency in parallel constraint satisfaction networks (Q1337684) (← links)
- Load balancing for the parallel adaptive solution of partial differential equations (Q1344328) (← links)
- Fast parallel algorithm for polynomial interpolation (Q1346834) (← links)
- A parallel algorithm for nearly optimal edge search (Q1350305) (← links)
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q1351004) (← links)
- Improved parallel integer sorting without concurrent writing (Q1362905) (← links)
- Unified all-pairs shortest path algorithms in the chordal hierarchy (Q1364781) (← links)
- Sorting strings and constructing digital search trees in parallel (Q1365679) (← links)
- Parallel evaluation of arithmetic circuits (Q1365929) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- Efficient massively parallel implementation of some combinatorial algorithms (Q1365935) (← links)
- Exploiting few inversions when sorting: Sequential and parallel algorithms (Q1365941) (← links)
- Simulating shared memory in real time: On the computation power of reconfigurable architectures (Q1369096) (← links)
- Transversal partitioning in balanced hypergraphs (Q1372732) (← links)
- The complexity of parallel prefix problems on small domains (Q1373137) (← links)
- Separating the power of EREW and CREW PRAMs with small communication width (Q1373140) (← links)
- Efficient computation of implicit representations of sparse graphs (Q1377648) (← links)
- Straight-line programs in geometric elimination theory (Q1380007) (← links)
- On chromatic sums and distributed resource allocation (Q1383159) (← links)
- A canonical form of vector machines (Q1383713) (← links)
- Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems (Q1389649) (← links)
- An optimal parallel algorithm for digital curve segmentation (Q1391535) (← links)
- On the parallel complexity of loops (Q1391751) (← links)
- Planar stage graphs: Characterizations and applications (Q1392202) (← links)
- A time-optimal solution for the path cover problem on cographs. (Q1401176) (← links)
- List-ranking on interconnection networks. (Q1401927) (← links)
- Powers of geometric intersection graphs and dispersion algorithms (Q1414578) (← links)
- Computing Prüfer codes efficiently in parallel (Q1566573) (← links)
- Algorithms for generalized vertex-rankings of partial k-trees (Q1575443) (← links)
- Algorithms for the parallel alternating direction access machine (Q1575740) (← links)
- Optimal gray-code labeling and recognition algorithms for hypercubes (Q1602516) (← links)
- An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs (Q1607053) (← links)
- Coloring permutation graphs in parallel (Q1613373) (← links)
- Parallel algorithms for separable permutations (Q1763485) (← links)
- Efficiently parallelizable problems on a class of decomposable graphs (Q1765226) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
- Parallel preprocessing for path queries without concurrent reading. (Q1854339) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- Reduction algorithms for graphs of small treewidth (Q1854433) (← links)
- A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs (Q1864209) (← links)
- Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees. (Q1874394) (← links)
- Two optimal parallel algorithms on the commutation class of a word (Q1882917) (← links)
- Parallel adaptive mesh refinement and redistribution on distributed memory computers (Q1913184) (← links)
- Maximum entropy and interval computations (September notes on summer impressions) (Q1916974) (← links)
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms (Q1917270) (← links)
- A new algorithm for the integer knapsack problem and its parallelization (Q1919114) (← links)
- A quadratic-time algorithm for smoothing interval functions (Q1921294) (← links)
- Parallel approximation schemes for problems on planar graphs (Q1924999) (← links)
- Efficient algorithmic learning of the structure of permutation groups by examples (Q1963029) (← links)