Pages that link to "Item:Q4401551"
From MaRDI portal
The following pages link to The Parallel Evaluation of General Arithmetic Expressions (Q4401551):
Displaying 46 items.
- Optimal Parallel Searching an Array for Certain Repetitions (Q3438903) (← links)
- Grammar-Based Tree Compression (Q3451087) (← links)
- SPEEDUP-AWARE CO-SCHEDULES FOR EFFICIENT WORKLOAD MANAGEMENT (Q3458241) (← links)
- Lower Bounds for Syntactically Multilinear Algebraic Branching Programs (Q3599145) (← links)
- Parallel algorithms for solving linear equations using givens transformations (Q3779651) (← links)
- On the time and space complexity of computation using write-once memory or is pen really much worse than pencil? (Q4000866) (← links)
- An nc algorithm to recognize hhd-free graphs (Q4009712) (← links)
- ON THE POWER OF SOME PRAM MODELS (Q4242705) (← links)
- Efficient string matching on packed texts (Q4341037) (← links)
- Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree<sup>∗</sup> (Q4511611) (← links)
- An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction (Q4513199) (← links)
- Characterizing Propositional Proofs as Noncommutative Formulas (Q4577770) (← links)
- Equations for secant varieties of Chow varieties (Q4601326) (← links)
- The method of shifted partial derivatives cannot separate the permanent from the determinant (Q4637587) (← links)
- Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications (Q4646460) (← links)
- PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS (Q4682197) (← links)
- Context-based compression of binary images in parallel (Q4791040) (← links)
- AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ (Q4820048) (← links)
- THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗† (Q4820105) (← links)
- A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas (Q5002707) (← links)
- Sequential and parallel algorithms for embedding problems on classes of partial k-trees (Q5054759) (← links)
- Two-variable linear programming in parallel (Q5054853) (← links)
- A faster parallel algorithm for a matrix searching problem (Q5056103) (← links)
- Lower bounds to processor-time tradeoffs under bounded-speed message propagation (Q5057417) (← links)
- Computing the all-pairs longest chains in the plane (Q5060093) (← links)
- Parallel construction of quadtrees and quality triangulations (Q5060112) (← links)
- On a relation between the depth and complexity of monotone Boolean formulas (Q5090140) (← links)
- The parallel complexity of tree embedding problems (extended abstract) (Q5096766) (← links)
- Nearly Work-Efficient Parallel Algorithm for Digraph Reachability (Q5129233) (← links)
- (Q5136328) (← links)
- Restructuring Expression Dags for Efficient Parallelization (Q5140732) (← links)
- Optimal parallel algorithms for periods, palindromes and squares (Q5204325) (← links)
- Fast Sequential and Parallel Vertex Relabelings of <i>K<sub>m,m</sub></i> (Q5250275) (← links)
- Short Proofs for the Determinant Identities (Q5252690) (← links)
- Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies (Q5270943) (← links)
- Oracle-guided scheduling for controlling granularity in implicitly parallel languages (Q5371969) (← links)
- (Q5875469) (← links)
- Trade-offs between communication throughput and parallel time (Q5906374) (← links)
- Shadows of Newton polytopes (Q6076195) (← links)
- Malleable scheduling beyond identical machines (Q6090217) (← links)
- An improved approximation algorithm for scheduling monotonic moldable tasks (Q6106483) (← links)
- Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms (Q6136082) (← links)
- NC algorithms for antidirected hamiltonian paths and cycles in tournaments (Q6184385) (← links)
- Finding smallest supertrees (Q6487952) (← links)
- Application of high-performance computing to solve the Cauchy problem with the fractional Riccati equation using an nonlocal implicit finite-difference scheme (Q6554409) (← links)
- On the parallel complexity of the alternating Hamiltonian cycle problem (Q6567696) (← links)