An axiomatic approach to code optimization for expressions
Journal of the ACM (JACM)
Optimal parallel generation of a computation tree form
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Introducing efficient parallelism into approximate string matching and a new serial algorithm
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
An Instruction Issuing Approach to Enhancing Performance in Multiple Functional Unit Processors
IEEE Transactions on Computers
The Boolean formula value problem is in ALOGTIME
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Feasible arithmetic computations: Valiant's hypothesis
Journal of Symbolic Computation
Computing algebraic formulas with a constant number of registers
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Intersecting line segments in parallel with an output-sensitive number of processors
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
The APRAM: incorporating asynchrony into the PRAM model
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Optimal on-line load balancing
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Optimal parallel suffix-prefix matching algorithm and applications
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Labeled trees and the efficient computation of derivations
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Parallel tree pattern matching
Journal of Symbolic Computation
High-probability parallel transitive closure algorithms
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Parallel searching in generalized Monge arrays with applications
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Parallel rectilinear shortest paths with rectangular obstacles
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Generalized sweep methods for parallel computational geometry
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Efficient parallel computation of arrangements of hyperplanes in d dimensions
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Efficient robust parallel computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Combining tentative and definite executions for very fast dependable parallel computing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
More time-work tradeoffs for parallel graph algorithms
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Constructing arrangements optimally in parallel (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Dynamic expression trees and their applications
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Efficient sequential and parallel algorithms for computing recovery points in trees and paths
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Parallel complexity of tridiagonal symmetric Eigenvalue problem
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
On the parallel complexity of evaluating game trees
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Time-work tradeoffs for parallel graph algorithms
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
A constant-time optimal parallel string-matching algorithm
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Planar separators and parallel polygon triangulation (preliminary version)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Connected components and the interval graph
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Supereffective slow-down of parallel computations
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
Efficient parallel evaluation of CSG tree using fixed number of processors
SMA '93 Proceedings on the second ACM symposium on Solid modeling and applications
Critical path minimization using retiming and algebraic speed-up
DAC '93 Proceedings of the 30th international Design Automation Conference
Highly efficient dictionary matching in parallel
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Scan grammars: parallel attribute evaluation via data-parallelism
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Space-efficient scheduling of multithreaded computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient low-contention parallel algorithms
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Parallel solutions to geometric problems in the scan model of computation
Journal of Computer and System Sciences
Integrating program transformations in the memory-based synthesis of image and video algorithms
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Trade-offs between communication throughput and parallel time
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
NP trees and Carnap's modal logic
Journal of the ACM (JACM)
Cilk: an efficient multithreaded runtime system
PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
A constant-time optimal parallel string-matching algorithm
Journal of the ACM (JACM)
Provably efficient scheduling for languages with fine-grained parallelism
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Parallel algorithms for the circuit value update problem
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Upper bounds to processor-time tradeoffs under bounded-speed message propagation
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Parallelism in sequential functional languages
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Upper time bounds for executing PRAM-programs on the LogP-machine
ICS '95 Proceedings of the 9th international conference on Supercomputing
Efficient Parallel Binary Search on Sorted Arrays, with Applications
IEEE Transactions on Parallel and Distributed Systems
Programming parallel algorithms
Communications of the ACM
A provably time-efficient parallel implementation of full speculation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On Parallel Algorithms for Single-Fault Diagnosis in Fault Propagation Graph Systems
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Time-work tradeoffs for parallel algorithms
Journal of the ACM (JACM)
Thread scheduling for multiprogrammed multiprocessors
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
The implementation of the Cilk-5 multithreaded language
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Parallel Algorithms for Relational Coarsest Partition Problems
IEEE Transactions on Parallel and Distributed Systems
ACM Transactions on Mathematical Software (TOMS)
A Gracefully Degrading Massively Parallel System Using the BSP Model, and Its Evaluation
IEEE Transactions on Computers
Provably efficient scheduling for languages with fine-grained parallelism
Journal of the ACM (JACM)
Resource Scaling Effects on MPP Performance: The STAP Benchmark Implications
IEEE Transactions on Parallel and Distributed Systems
Scheduling threads for low space requirement and good locality
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Optimizations and oracle parallelism with dynamic translation
Proceedings of the 32nd annual ACM/IEEE international symposium on Microarchitecture
Applying parallel processing techniques to classification problems in constructive solid geometry
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
An efficient parallel algorithm that finds independent sets of guaranteed size
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
On the Parallel Evaluation of Certain Arithmetic Expressions
Journal of the ACM (JACM)
The Complexity of Parallel Evaluation of Linear Recurrences
Journal of the ACM (JACM)
Some Complexity Results for Matrix Computations on Parallel Processors
Journal of the ACM (JACM)
Upper Bounds for Speedup in Parallel Parsing
Journal of the ACM (JACM)
Parallel permutation and sorting algorithms and a new generalized connection network
Journal of the ACM (JACM)
Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments
IEEE Transactions on Parallel and Distributed Systems
Scheduling multithreaded computations by work stealing
Journal of the ACM (JACM)
Efficient parallel algorithms for some integer problems
CSC '91 Proceedings of the 19th annual conference on Computer Science
Building programs in the network of tasks model
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Scheduling Cilk multithreaded parallel programs on processors of different speeds
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Software for Roundoff Analysis
ACM Transactions on Mathematical Software (TOMS)
A Survey of Parallel Machine Organization and Programming
ACM Computing Surveys (CSUR)
On Parsing and Compiling Arithmetic Expressions on Vector Computers
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel Generation of Postfix and Tree Forms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing connected components on parallel computers
Communications of the ACM
Fast parallel sorting algorithms
Communications of the ACM
Fully Dynamic Maintenance of k-Connectivity in Parallel
IEEE Transactions on Parallel and Distributed Systems
On Time Bounds, the Work-Time Scheduling Principle, and Optimality for BSR
IEEE Transactions on Parallel and Distributed Systems
Context-based compression of binary images in parallel
Software—Practice & Experience
Optimal Algorithms on the Pipelined Hypercube and Related Networks
IEEE Transactions on Parallel and Distributed Systems
Concurrent Iterative Algorithm for Toeplitz-like Linear Systems
IEEE Transactions on Parallel and Distributed Systems
Parallel Algorithms for the Longest Common Subsequence Problem
IEEE Transactions on Parallel and Distributed Systems
Work-Time Optimal k-Merge Algorithms on the PRAM
IEEE Transactions on Parallel and Distributed Systems
Controlling memory access concurrency in efficient fault-tolerant parallel algorithms
Nordic Journal of Computing
Work-Time Optimal K-Merge Algorithms on the PRAM
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Seamless Integration of Parallelism and Memory Hierarchy
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On limits on the computational power of data-accumulating algorithms
Information Processing Letters
The complexity of parallel evaluation of linear recurrence
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Fault-secure algorithms for multiple-processor systems
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
An Optimal Parallel Algorithm for Two-Processor Scheduling
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima
Journal of Parallel and Distributed Computing
Use of algebraically independent numbers for zero recognition of polynomial terms
Journal of Complexity
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
A generic approach to parallel chart parsing with an application to LinGO
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Value-maximizing deadline scheduling and its application to animation rendering
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Speeding up the primal simplex algorithm on parallel computer
ACM SIGMAP Bulletin
Adaptive scheduling with parallelism feedback
Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming
Translating submachine locality into locality of reference
Journal of Parallel and Distributed Computing - Special issue: 18th International parallel and distributed processing symposium
The cache complexity of multithreaded cache oblivious algorithms
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Adaptive work stealing with parallelism feedback
Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming
The delay of circuits whose inputs have specified arrival times
Discrete Applied Mathematics
Scheduling DAGs on asynchronous processors
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Journal of Parallel and Distributed Computing
Binary Trees and Parallel Scheduling Algorithms
IEEE Transactions on Computers
Reduction of Depth of Boolean Networks with a Fan-In Constraint
IEEE Transactions on Computers
Scheduling Trees in Parallel/Pipelined Processing Environments
IEEE Transactions on Computers
Optimal Parallel Scheduling of Gaussian Elimination DAG's
IEEE Transactions on Computers
PRO: a model for the design and analysis of efficient and scalable parallel algorithms
Nordic Journal of Computing
Provably good multicore cache performance for divide-and-conquer algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Area-efficient arithmetic expression evaluation using deeply pipelined floating-point cores
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM)
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Cascading divide-and-conquer: A technique for designing parallel algorithms
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Adaptive work-stealing with parallelism feedback
ACM Transactions on Computer Systems (TOCS)
Bounded Ciphertext Policy Attribute Based Encryption
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
An Optimal Parallel Algorithm for Finding All Hinge Vertices of a Circular-Arc Graph
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
An Optimal Parallel Algorithm for Constructing a Spanning Forest on Trapezoid Graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Theoretical Issues of Cluster Pattern Interfaces
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
The Cilk++ concurrency platform
The Journal of Supercomputing
Stability aspects in using parallel algorithms
Parallel Computing
Paper: Parallel computation of matchings in trees
Parallel Computing
Provably efficient two-level adaptive scheduling
JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
Incremental query evaluation in a ring of databases
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Cilkview scalability analyzer
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Algorithms and theory of computation handbook
Counting paths in VPA Is complete for #NC1
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
On unlimited parallelism of DSP arithmetic computations
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: plenary, special, audio, underwater acoustics, VLSI, neural networks - Volume I
Balance principles for algorithm-architecture co-design
HotPar'11 Proceedings of the 3rd USENIX conference on Hot topic in parallelism
Balanced trees inhabiting functional parallel programming
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Oracle scheduling: controlling granularity in implicitly parallel languages
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
A cost optimal parallel quicksorting and its implementation on a shared memory parallel computer
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Probabilistic abstraction of uncertain temporal data for multiple subjects
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
An extended evaluation of two-phase scheduling methods for animation rendering
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
On the applicability of Post's lattice
Information Processing Letters
Balancing bounded treewidth circuits
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Parallel algorithms for encoding and decoding blob code
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
A generalization of spira's theorem and circuits with small segregators or separators
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
A Deterministic Linear Time Algorithm For Geometric Separators And Its Applications
Fundamenta Informaticae
On distributed file tree walk of parallel file systems
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Non-commutative arithmetic circuits with division
Proceedings of the 5th conference on Innovations in theoretical computer science
Balancing Bounded Treewidth Circuits
Theory of Computing Systems
Processor--Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds
Theory of Computing Systems
Parallel Algorithms for the Circuit Value Update Problem
Theory of Computing Systems
| Hi-index | 0.07 |
It is shown that arithmetic expressions with n ≥ 1 variables and constants; operations of addition, multiplication, and division; and any depth of parenthesis nesting can be evaluated in time 4 log2n + 10(n - 1)/p using p ≥ 1 processors which can independently perform arithmetic operations in unit time. This bound is within a constant factor of the best possible. A sharper result is given for expressions without the division operation, and the question of numerical stability is discussed.