The following pages link to (Q4023519):
Displayed 50 items.
- The saga of minimum spanning trees (Q458468) (← links)
- Computational complexity of threshold automata networks under different updating schemes (Q475388) (← links)
- On efficient implicit OBDD-based algorithms for maximal matchings (Q476163) (← links)
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) (← links)
- On parallel recognition of cographs (Q627166) (← links)
- Fast evaluation of interlace polynomials on graphs of bounded treewidth (Q634679) (← links)
- A parallel algorithm based on convexity for the computing of Delaunay tessellation (Q664607) (← links)
- Parallel exact inference on the cell broadband engine processor (Q666125) (← links)
- Unified parallel encoding and decoding algorithms for Dandelion-like codes (Q666249) (← links)
- A linear time algorithm for finding all hinge vertices of a permutation graph (Q671396) (← links)
- Reliable computations on faulty EREW PRAM (Q671425) (← links)
- The element distinctness problem on one-tape Turing machines (Q671603) (← links)
- An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs (Q671937) (← links)
- Fast rehashing in PRAM emulations (Q672145) (← links)
- An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images (Q673013) (← links)
- Optimal parallel algorithms for path problems on planar graphs (Q673083) (← links)
- NC algorithms for the Single Most Vital Edge problem with respect to shortest paths (Q673229) (← links)
- Efficient algorithms for shortest distance queries on special classes of polygons (Q673766) (← links)
- Randomized multipacket routing and sorting on meshes (Q675295) (← links)
- Fast randomized parallel methods for planar convex hull construction (Q676065) (← links)
- Sequential and parallel algorithms for finding a maximum convex polygon (Q676573) (← links)
- When is the multiaffine image of a cube a convex polygon? (Q686224) (← links)
- NFA reduction algorithms by means of regular inequalities (Q703569) (← links)
- Algorithmic analysis of priority-based bin packing (Q831745) (← links)
- An optimal parallel algorithm forc-vertex-ranking of trees (Q834935) (← links)
- Fast parallel recognition of LR language suffixes (Q834947) (← links)
- Approximating weighted matchings in parallel (Q845697) (← links)
- The interval-merging problem (Q867634) (← links)
- \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs (Q868392) (← links)
- Recognizing and representing proper interval graphs in parallel using merging and sorting (Q869564) (← links)
- Oblivious algorithms for multicores and networks of processors (Q897114) (← links)
- Store-and-forward multicast routing on the mesh (Q927394) (← links)
- The strong distance problem on the Cartesian product of graphs (Q963395) (← links)
- A spectral lower bound for the treewidth of a graph and its consequences (Q1014419) (← links)
- Boolean circuit programming: A new paradigm to design parallel algorithms (Q1026240) (← links)
- An adjustable linear time parallel algorithm for maximum weight bipartite matching (Q1045931) (← links)
- The queue-read queue-write asynchronous PRAM model (Q1128706) (← links)
- The bulk-synchronous parallel random access machine (Q1128714) (← links)
- Improved parallel computations with Toeplitz-like and Hankel-like matrices (Q1260780) (← links)
- An optimal parallel algorithm for node ranking of cographs (Q1270781) (← links)
- Optimal parallel two dimensional text searching on a CREW PRAM (Q1271473) (← links)
- Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms (Q1274331) (← links)
- Simulating the CRCW PRAM on reconfigurable networks (Q1275082) (← links)
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth (Q1278042) (← links)
- An efficient parallel graph edge matching algorithm and its applications (Q1288436) (← links)
- Parallel construction and query of index data structures for pattern matching on square matrices (Q1288531) (← links)
- Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings (Q1305535) (← links)
- A note on bitonic sorting (Q1318746) (← links)
- An optimal parallel algorithm for merging using multiselection (Q1322118) (← links)
- \(O(\log n)\) numerical algorithms on a mesh with wormhole routing (Q1327296) (← links)