Pages that link to "Item:Q4401551"
From MaRDI portal
The following pages link to The Parallel Evaluation of General Arithmetic Expressions (Q4401551):
Displaying 50 items.
- A generalization of Spira's theorem and circuits with small segregators or separators (Q342721) (← links)
- On the applicability of Post's lattice (Q436335) (← links)
- Sufficient conditions for the existence of spanning colored trees in edge-colored graphs (Q442397) (← links)
- Engineering parallel string sorting (Q513306) (← links)
- Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278) (← links)
- Scalability and communication in parallel low-complexity lossless compression (Q626896) (← links)
- Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks (Q666411) (← links)
- A work-time optimal algorithm for computing all string covers (Q671438) (← links)
- Parallel detection of all palindromes in a string (Q673783) (← links)
- Fast parallel string prefix-matching (Q674342) (← links)
- Towards optimal simulations of formulas by bounded-width programs (Q685723) (← links)
- The cache complexity of multithreaded cache oblivious algorithms (Q733717) (← links)
- Building heaps in parallel (Q751273) (← links)
- Optimal parallel quicksort on EREW PRAM (Q751287) (← links)
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
- Improved parallel construction of wavelet trees and rank/select structures (Q776833) (← links)
- An optimal parallel connectivity algorithm (Q797997) (← links)
- Size-depth trade-offs for monotone arithmetic circuits (Q804295) (← links)
- On optimal parallel computations for sequences of brackets (Q808700) (← links)
- Parallel tree pattern matching (Q912610) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- An optimal parallel algorithm for linear programming in the plane (Q915450) (← links)
- Parallel recognition of complement reducible graphs and cotree construction (Q919826) (← links)
- Subtree isomorphism is in random NC (Q922707) (← links)
- On limits on the computational power of data-accumulating algorithms (Q1007605) (← links)
- Finding small simple cycle separators for 2-connected planar graphs (Q1085169) (← links)
- Optimal computation of prefix sums on a binary tree of processors (Q1099947) (← links)
- Fast parallel graph searching with applications (Q1103409) (← links)
- Communication-efficient parallel algorithms for distributed random-access machines (Q1104096) (← links)
- A parallel bucket sort (Q1108803) (← links)
- An optimally efficient selection algorithm (Q1108805) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- Parallel computational geometry (Q1115600) (← links)
- Size-depth tradeoff in non-monotone Boolean formulae (Q1132635) (← links)
- A space efficient algorithm for the monotone planar circuit value problem (Q1133895) (← links)
- Methods and means of parallel processing of information (Q1155954) (← links)
- A unified approach to parallel depth-first traversals of general trees (Q1178197) (← links)
- Processor-efficient implementation of a maximum flow algorithm (Q1178222) (← links)
- Planar orientations with low out-degree and compaction of adjacency matrices (Q1178710) (← links)
- Data-movement-intensive problems: Two folk theorems in parallel computation revisited (Q1184985) (← links)
- Parallel restructuring and evaluation of expressions (Q1185242) (← links)
- Optimal parallel algorithms for forest and term matching (Q1186605) (← links)
- Parallel rectilinear shortest paths with rectangular obstacles (Q1190293) (← links)
- Parallel solution of Toeplitzlike linear systems (Q1190529) (← links)
- Symbolic computation of derivations using labelled trees (Q1198243) (← links)
- Parallel recognition of series-parallel graphs (Q1201288) (← links)
- A faster parallel algorithm for a matrix searching problem (Q1206437) (← links)
- Bounds on the parallel evaluation of arithmetic expressions using associativity and commutativity (Q1216179) (← links)
- The time required to evaluate division-free arithmetic expressions (Q1231389) (← links)
- Optimal circular arc representations: Properties, recognition, and construction (Q1271617) (← links)
