The Parallel Evaluation of General Arithmetic Expressions

Cited in

(only showing first 100 items - show all)

On limits on the computational power of data-accumulating algorithms
Finding small simple cycle separators for 2-connected planar graphs
Optimal computation of prefix sums on a binary tree of processors
Fast parallel graph searching with applications
Communication-efficient parallel algorithms for distributed random-access machines
A parallel bucket sort
An optimally efficient selection algorithm
Feasible arithmetic computations: Valiant's hypothesis
Parallel computational geometry
Size-depth tradeoff in non-monotone Boolean formulae
A space efficient algorithm for the monotone planar circuit value problem
Methods and means of parallel processing of information
A unified approach to parallel depth-first traversals of general trees
Processor-efficient implementation of a maximum flow algorithm
Planar orientations with low out-degree and compaction of adjacency matrices
Data-movement-intensive problems: Two folk theorems in parallel computation revisited
Parallel restructuring and evaluation of expressions
Optimal parallel algorithms for forest and term matching
Parallel rectilinear shortest paths with rectangular obstacles
Parallel solution of Toeplitzlike linear systems
Symbolic computation of derivations using labelled trees
Parallel recognition of series-parallel graphs
A faster parallel algorithm for a matrix searching problem
Bounds on the parallel evaluation of arithmetic expressions using associativity and commutativity
The time required to evaluate division-free arithmetic expressions
Optimal circular arc representations: Properties, recognition, and construction
Lower bounds on the depth of monotone arithmetic computations
On parallel rectilinear obstacle-avoiding paths
Parallel solutions to geometric problems in the scan model of computation
Testing string superprimitivity in parallel
Size-depth tradeoffs for Boolean formulae
Improved parallel solution of a triangular linear system
A chained-matrices approach for parallel computation of continued fractions and its applications
Dynamic expression trees
Parallel computation of polynomial GCD and some related parallel computations over abstract fields
A note on parallel algorithms for optimal h-v drawings of binary trees
Use of algebraically independent numbers for zero recognition of polynomial terms.
Computing Prüfer codes efficiently in parallel
Circuits over PP and PL
An algorithm for the Tutte polynomials of graphs of bounded treewidth
Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity
Balancing bounded treewidth circuits
A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution
Counting paths in VPA is complete for \(\#\mathrm{NC}^1\)
Constructing arrangements optimally in parallel
Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
Optimal edge ranking of trees in polynomial time
Finding all periods and initial palindromes of a string in parallel
Sweep methods for parallel computational geometry
Parallel local search
Parameterized random complexity
Optimal computation of shortest paths on doubly convex bipartite graphs
On measures of space over real and complex numbers
Limitations of sums of bounded read formulas and ABPs
Parallel computation of the Burrows Wheeler transform in compact space
An O(n n) time algorithm for computing the path-length distance between trees
Geometric complexity theory: an introduction for geometers
Resequencing a set of strings based on a target string
Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs
On computing accurate singular values and eigenvalues of matrices with acyclic graphs
Finding least-weight subsequences with fewer processors
An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram
The delay of circuits whose inputs have specified arrival times
Constructing small tree grammars and small circuits for formulas
Two parallel algorithms for finding all minimal maximum subsequences
Optimal parallel construction of prescribed tournaments
Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science
On treewidth, separators and Yao's garbling
Algebraic complexity classes
\(\mathrm P \overset {?} {=} \mathrm{NP}\)
A generalization of Spira's theorem and circuits with small segregators or separators
Types of depth and formula size
Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation
On the rapid computation of various polylogarithmic constants
OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications.
A generalization of Spira's theorem and circuits with small segregators or separators
Optimal Parallel Searching an Array for Certain Repetitions
Grammar-Based Tree Compression
Speedup-aware co-schedules for efficient workload management
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
Parallel algorithms for solving linear equations using givens transformations
On the time and space complexity of computation using write-once memory or is pen really much worse than pencil?
An nc algorithm to recognize hhd-free graphs
ON THE POWER OF SOME PRAM MODELS
Efficient string matching on packed texts
On the applicability of Post's lattice
Sufficient conditions for the existence of spanning colored trees in edge-colored graphs
Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree^∗
An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
Characterizing propositional proofs as noncommutative formulas
Equations for secant varieties of Chow varieties
The method of shifted partial derivatives cannot separate the permanent from the determinant
Small-depth multilinear formula lower bounds for iterated matrix multiplication with applications
PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
Context-based compression of binary images in parallel
AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗
THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗†
A quadratic size-hierarchy theorem for small-depth multilinear formulas
Sequential and parallel algorithms for embedding problems on classes of partial k-trees

This page was built for publication: The Parallel Evaluation of General Arithmetic Expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4401551)