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.
- Lower bounds on the depth of monotone arithmetic computations (Q1288530) (← links)
- On parallel rectilinear obstacle-avoiding paths (Q1314529) (← links)
- Parallel solutions to geometric problems in the scan model of computation (Q1318471) (← links)
- Testing string superprimitivity in parallel (Q1318749) (← links)
- Size-depth tradeoffs for Boolean formulae (Q1318766) (← links)
- Improved parallel solution of a triangular linear system (Q1328830) (← links)
- A chained-matrices approach for parallel computation of continued fractions and its applications (Q1332396) (← links)
- Dynamic expression trees (Q1346771) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- A note on parallel algorithms for optimal h-v drawings of binary trees (Q1384199) (← links)
- Use of algebraically independent numbers for zero recognition of polynomial terms. (Q1426048) (← links)
- Computing Prüfer codes efficiently in parallel (Q1566573) (← links)
- Circuits over PP and PL (Q1567408) (← links)
- An algorithm for the Tutte polynomials of graphs of bounded treewidth (Q1584397) (← links)
- Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity (Q1616616) (← links)
- Balancing bounded treewidth circuits (Q1678757) (← links)
- A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution (Q1750526) (← links)
- Counting paths in VPA is complete for \(\#\mathrm{NC}^1\) (Q1759656) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
- Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree (Q1816995) (← links)
- Optimal edge ranking of trees in polynomial time (Q1892584) (← links)
- Finding all periods and initial palindromes of a string in parallel (Q1899224) (← links)
- Sweep methods for parallel computational geometry (Q1907233) (← links)
- Parallel local search (Q1922627) (← links)
- Parameterized random complexity (Q1946497) (← links)
- Optimal computation of shortest paths on doubly convex bipartite graphs (Q1963107) (← links)
- On measures of space over real and complex numbers (Q2019497) (← links)
- Limitations of sums of bounded read formulas and ABPs (Q2117084) (← links)
- Parallel computation of the Burrows Wheeler transform in compact space (Q2297855) (← links)
- An \(O(n \log n)\) time algorithm for computing the path-length distance between trees (Q2319639) (← links)
- Geometric complexity theory: an introduction for geometers (Q2346304) (← links)
- Resequencing a set of strings based on a target string (Q2354022) (← links)
- Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs (Q2365177) (← links)
- On computing accurate singular values and eigenvalues of matrices with acyclic graphs (Q2365723) (← links)
- Finding least-weight subsequences with fewer processors (Q2366242) (← links)
- An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram (Q2367127) (← links)
- The delay of circuits whose inputs have specified arrival times (Q2370422) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- Two parallel algorithms for finding all minimal maximum subsequences (Q2424687) (← links)
- Optimal parallel construction of prescribed tournaments (Q2641314) (← links)
- Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science (Q2672320) (← links)
- On treewidth, separators and Yao's garbling (Q2697873) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- A Generalization of Spira’s Theorem and Circuits with Small Segregators or Separators (Q2891374) (← links)
- Types of depth and formula size (Q2920906) (← links)
- Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation (Q2968148) (← links)
- On the rapid computation of various polylogarithmic constants (Q3127345) (← links)
- OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS (Q3130162) (← links)
- Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. (Q3304115) (← links)
