The following pages link to (Q4385522):
Displaying 50 items.
- Nearly-perfect hypergraph packing is in NC (Q286955) (← links)
- An insight on PRAM computational bounds (Q287202) (← links)
- An optimal EREW PRAM algorithm for minimum spanning tree verification (Q290239) (← links)
- A note on parallel complexity of maximum \(f\)-matching (Q293199) (← links)
- Parallel approximation algorithms for maximum weighted matching in general graphs (Q294847) (← links)
- A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis (Q313981) (← links)
- More agents may decrease global work: a case in butterfly decontamination (Q343925) (← links)
- Optimal algorithms of Gram-Schmidt type (Q393367) (← links)
- A bridging model for multi-core computing (Q619912) (← links)
- On parallel recognition of cographs (Q627166) (← links)
- Integer merging on EREW PRAM (Q644851) (← links)
- Reliable computations on faulty EREW PRAM (Q671425) (← links)
- Fast rehashing in PRAM emulations (Q672145) (← links)
- Parallel algorithms for priority queue operations (Q672391) (← links)
- Optimal parallel execution of complete binary trees and grids into most popular interconnection networks (Q672453) (← links)
- A simple randomized parallel algorithm for maximal f-matchings (Q672735) (← links)
- On 2-QBF truth testing in parallel (Q672737) (← links)
- The maximal \(f\)-dependent set problem for planar graphs is in NC (Q673069) (← links)
- Optimal parallel algorithms for path problems on planar graphs (Q673083) (← links)
- Multilist layering: Complexity and applications (Q673793) (← links)
- Efficient parallel recognition of some circular arc graphs. II (Q675297) (← links)
- Efficient parallel algorithms for computing all pair shortest paths in directed graphs (Q676269) (← links)
- An efficient algorithm for the Knight's tour problem (Q678854) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- Testing a simple polygon for monotonicity optimally in parallel (Q688449) (← links)
- Efficient parallel term matching and anti-unification (Q688582) (← links)
- An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon (Q750155) (← links)
- On parallel methods for boundary value ODEs (Q756947) (← links)
- Improved algorithms for graph four-connectivity (Q808289) (← links)
- The parallel complexity of two problems on concurrency (Q811123) (← links)
- The interval-merging problem (Q867634) (← links)
- Parallel tree pattern matching (Q912610) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- Parallel recognition of complement reducible graphs and cotree construction (Q919826) (← links)
- Lower bounds on the computational power of an optical model of computation (Q926521) (← links)
- Fast rectangular matrix multiplication and some applications (Q931517) (← links)
- Parallel heap: an optimal parallel priority queue (Q973413) (← links)
- A randomized sublinear time parallel GCD algorithm for the EREW PRAM (Q991752) (← links)
- Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs (Q995752) (← links)
- Parallel merging with restriction (Q1009355) (← links)
- A parallel extended GCD algorithm (Q1018106) (← links)
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (Q1024477) (← links)
- Optical computing (Q1036535) (← links)
- The queue-read queue-write asynchronous PRAM model (Q1128706) (← links)
- The bulk-synchronous parallel random access machine (Q1128714) (← links)
- ERCW PRAMs and optical communication (Q1128717) (← links)
- A unified approach to parallel depth-first traversals of general trees (Q1178197) (← links)
- Circuits for computing the GCD of two polynomials over an algebraic number field (Q1178209) (← links)
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields (Q1178687) (← links)
- Matrix inversion in RNC\(^ 1\) (Q1179457) (← links)
