The Parallel Evaluation of General Arithmetic Expressions

Cited in

(only showing first 100 items - show all)

Parallel computation of polynomial GCD and some related parallel computations over abstract fields
An optimally efficient selection algorithm
An O(n n) time algorithm for computing the path-length distance between trees
Grammar-Based Tree Compression
Characterizing propositional proofs as noncommutative formulas
Oracle-guided scheduling for controlling granularity in implicitly parallel languages
Application of high-performance computing to solve the Cauchy problem with the fractional Riccati equation using an nonlocal implicit finite-difference scheme
Towards optimal simulations of formulas by bounded-width programs
Testing string superprimitivity in parallel
A work-time optimal algorithm for computing all string covers
\(\mathrm P \overset {?} {=} \mathrm{NP}\)
Parallel computational geometry
Computing Prüfer codes efficiently in parallel
Lower bounds to processor-time tradeoffs under bounded-speed message propagation
Computing the all-pairs longest chains in the plane
Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
A parallel bucket sort
Finding small simple cycle separators for 2-connected planar graphs
Feasible arithmetic computations: Valiant's hypothesis
Short Proofs for the Determinant Identities
Constructing small tree grammars and small circuits for formulas
Constructing arrangements optimally in parallel
A unified approach to parallel depth-first traversals of general trees
Optimal parallel algorithms for forest and term matching
Communication-efficient parallel algorithms for distributed random-access machines
Fast parallel graph searching with applications
A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution
Parallel detection of all palindromes in a string
Limitations of sums of bounded read formulas and ABPs
On parallel rectilinear obstacle-avoiding paths
Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation
Context-based compression of binary images in parallel
Processor-efficient implementation of a maximum flow algorithm
Optimal circular arc representations: Properties, recognition, and construction
scientific article; zbMATH DE number 7650084 (Why is no real title available?)
Optimal parallel algorithms for periods, palindromes and squares (extended abstract)
The cache complexity of multithreaded cache oblivious algorithms
Types of depth and formula size
On a relation between the depth and complexity of monotone Boolean formulas
Planar orientations with low out-degree and compaction of adjacency matrices
Use of algebraically independent numbers for zero recognition of polynomial terms.
AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗
THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗†
On measures of space over real and complex numbers
On the applicability of Post's lattice
ON THE POWER OF SOME PRAM MODELS
The delay of circuits whose inputs have specified arrival times
Sequential and parallel algorithms for embedding problems on classes of partial k-trees
On the rapid computation of various polylogarithmic constants
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications.
Resequencing a set of strings based on a target string
Finding smallest supertrees
Size-depth tradeoff in non-monotone Boolean formulae
Parallel recognition of series-parallel graphs
Data-movement-intensive problems: Two folk theorems in parallel computation revisited
Counting paths in VPA is complete for \(\#\mathrm{NC}^1\)
Size-depth tradeoffs for Boolean formulae
Sufficient conditions for the existence of spanning colored trees in edge-colored graphs
Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
A faster parallel algorithm for a matrix searching problem
An optimal parallel connectivity algorithm
Sweep methods for parallel computational geometry
Parallel local search
On limits on the computational power of data-accumulating algorithms
A complexity theory of efficient parallel algorithms
Optimal parallel construction of prescribed tournaments
Scheduling \(UET\)-tasks on a star network: complexity and approximation
Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs
Finding least-weight subsequences with fewer processors
Restructuring expression dags for efficient parallelization
On treewidth, separators and Yao's garbling
Two parallel algorithms for finding all minimal maximum subsequences
Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks
Parallel solution of Toeplitzlike linear systems
OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS
An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
A parallel batch-dynamic data structure for the closest pair problem
An improved approximation algorithm for scheduling monotonic moldable tasks
An nc algorithm to recognize hhd-free graphs
Methods and means of parallel processing of information
Hopfield neural networks for online constrained parameter estimation with time-varying dynamics and disturbances
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
Equations for secant varieties of Chow varieties
Parallel solutions to geometric problems in the scan model of computation
Size-depth trade-offs for monotone arithmetic circuits
Malleable scheduling beyond identical machines
Optimal parallel quicksort on EREW PRAM
A note on parallel algorithms for optimal h-v drawings of binary trees
Nearly work-efficient parallel algorithm for digraph reachability
An optimal parallel algorithm for linear programming in the plane
Fast sequential and parallel vertex relabelings of \({K_{m,m}}\)
PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram
Improved parallel solution of a triangular linear system
(Time × space)-efficient implementations of hlerarchical conceptual models
An algorithm for the Tutte polynomials of graphs of bounded treewidth
Finding all periods and initial palindromes of a string in parallel
On computing accurate singular values and eigenvalues of matrices with acyclic graphs
Parallel construction of quadtrees and quality triangulations
Balancing bounded treewidth circuits

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)