A bridging model for parallel computation
Communications of the ACM
Lower bounds for parallel computation on linked structures
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Performance analysis of concurrent-read exclusive-write
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Efficient parallel algorithms on restartable fail-stop processors
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Processor efficient parallel solution of linear systems over an abstract field
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Algorithms for sparse rational interpolation
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Dynamic expression trees and their applications
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
On finding minimal 2-connected subgraphs
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
On the parallel complexity of computing a maximal independent set in a hypergraph
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The p-shovelers problem: (computing with time-varying data)
ACM SIGACT News
On parallel complexity of integer linear programming, GCD and the iterated mod function
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Designing synchronous algorithms for asynchronous processors
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Efficient parallel algorithms for computing all pair shortest paths in directed graphs
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
O(nlog log n)-work parallel algorithms for straight-line grid embeddings of planar graphs
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Geometric partitioning made easier, even in parallel
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
An NC parallel 3D convex hull algorithm
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Parallel computations with Toeplitz-like and Hankel-like matrices
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Parallel algorithms column 1: models of computation
ACM SIGACT News
Simple, efficient shared memory simulations
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Fast parallel matching in expander graphs
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
A survey of PRAM simulation techniques
ACM Computing Surveys (CSUR)
An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Dynamic parallel tree contraction (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
An optimal parallel algorithm for learning DFA
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Efficient low-contention parallel algorithms
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
An optical simulation of shared memory
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
How much can we speedup Gaussian elimination with pivoting?
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the 30th IEEE symposium on Foundations of computer science
A randomized linear-time algorithm for finding minimum spanning trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Powerlist: a structure for parallel recursion
ACM Transactions on Programming Languages and Systems (TOPLAS)
Designing programs that check their work
Journal of the ACM (JACM)
A randomized linear-time algorithm to find minimum spanning trees
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
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Parallel sorting with limited bandwidth
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Approximating biconnectivity in parallel
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Optimal parallel dictionary matching and compression (extended abstract)
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Lower bounds for randomized exclusive write PRAMs
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
A parallel algorithm for linear programming in fixed dimension
Proceedings of the eleventh annual symposium on Computational geometry
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
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Sorting on a parallel pointer machine with applications to set expression evaluation
Journal of the ACM (JACM)
Graph Isomorphism and Identification Matrices: Parallel Algorithms
IEEE Transactions on Parallel and Distributed Systems
Programming parallel algorithms
Communications of the ACM
3D Shape Reconstruction by Using Vanishing Points
IEEE Transactions on Pattern Analysis and Machine Intelligence
A provable time and space efficient implementation of NESL
Proceedings of the first ACM SIGPLAN international conference on Functional programming
ACM Computing Surveys (CSUR)
A new approach to the minimum cut problem
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Finding minimum spanning forests in logarithmic time and linear work using random sampling
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
An analysis of dag-consistent distributed shared-memory algorithms
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Minimum cuts in near-linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Communication-efficient parallel sorting (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Possible and Impossible Self-Stabilizing Digital ClockSynchronization in General Graphs
Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part I
Can shared-memory model serve as a bridging model for parallel computation?
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Time-work tradeoffs for parallel algorithms
Journal of the ACM (JACM)
Teaching the analysis of algorithms with visual proofs
SIGCSE '98 Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education
Computational bounds for fundamental problems on general-purpose parallel models
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Models and languages for parallel computation
ACM Computing Surveys (CSUR)
Scaling Simulation of the Fusing-Restricted Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
Finding connected components in O(log n loglog n) time on the EREW PRAM
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Optimal parallel approximation for prefix sums and integer sorting
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On the parallel time complexity of undirected connectivity and minimum spanning trees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An efficient parallel algorithm for the general planar monotone circuit value problem4
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The QRQW PRAM: accounting for contention in parallel algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Optimum parallel computations with banded matrices
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Minimum cuts in near-linear time
Journal of the ACM (JACM)
Concurrent threads and optimal parallel minimum spanning trees algorithm
Journal of the ACM (JACM)
Finding large independent sets of hypergraphs in parallel
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Towards practical deteministic write-all algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Finding strongly connected components in parallel in particle transport sweeps
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
On a parallel Lehmer-Euclid GCD algorithm
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Fully Dynamic Maintenance of k-Connectivity in Parallel
IEEE Transactions on Parallel and Distributed Systems
Approximating unweighted connectivity problems in parallel
Information and Computation
Optimal and efficient algorithms for summing and prefix summing on parallel machines
Journal of Parallel and Distributed Computing
On non-determinism in machines and languages
Annals of Mathematics and Artificial Intelligence
The Connectionist Inductive Learning and Logic Programming System
Applied Intelligence
Parallel Self-Index Integer Sorting
The Journal of Supercomputing
An Optimal Implementation of Broadcasting with Selective Reduction
IEEE Transactions on Parallel and Distributed Systems
Concurrent Iterative Algorithm for Toeplitz-like Linear Systems
IEEE Transactions on Parallel and Distributed Systems
Work-Time Optimal k-Merge Algorithms on the PRAM
IEEE Transactions on Parallel and Distributed Systems
An Efficient Parallel Algorithm for the Efficient Domination Problem on Distance-Hereditary Graphs
IEEE Transactions on Parallel and Distributed Systems
Parallel dynamic lowest common ancestors
Nordic Journal of Computing
Work-optimal simulation of PRAM models on meshes
Nordic Journal of Computing
Controlling memory access concurrency in efficient fault-tolerant parallel algorithms
Nordic Journal of Computing
Optimal parallel algorithms for direct dominance problems
Nordic Journal of Computing
A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Parallel Algorithm Design with Coarse-Grained Synchronization
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
A Framework for the Investigation of Aggregate Functions in Database Queries
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Optimizing Parallel Bitonic Sort
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Space Efficient Algorithms for Series-Parallel Graphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
A Parallel Simulation of Cellular Automata by Spatial Machines
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Scheduling Iterative Programs onto LogP-Machine
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Portable List Ranking: An Experimental Study
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Polynomial and Rational Evaluation and Interpolation (with Structured Matrices)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A time-optimal solution for the path cover problem on cographs
Theoretical Computer Science
On finding optimal clusterings of task graphs
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Parallel algorithms for maximal acyclic sets
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Fundamenta Informaticae - Concurrency specification and programming
Abstract state machines capture parallel algorithms
ACM Transactions on Computational Logic (TOCL)
Computer algebra handbook
Portable list ranking: an experimental study
Journal of Experimental Algorithmics (JEA)
Graph coloring on coarse grained multicomputers
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Emulations between QSM, BSP and LogP: a framework for general-purpose parallel algorithm design
Journal of Parallel and Distributed Computing
A modular reduction for GCD computation
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
Gossiping and broadcasting versus computing functions in networks
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
An NC algorithm for finding a maximal acyclic set in a graph
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Lower bounds for adaptive collect and related objects
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Journal of Parallel and Distributed Computing
Derivation of a logarithmic time carry lookahead addition circuit
Journal of Functional Programming
Efficiently parallelizable problems on a class of decomposable graphs
Journal of Computer and System Sciences
A modular integer GCD algorithm
Journal of Algorithms
Finding strongly connected components in distributed graphs
Journal of Parallel and Distributed Computing
The Hamiltonian problem on distance-hereditary graphs
Discrete Applied Mathematics
On the computational complexity of coalitional resource games
Artificial Intelligence
Space efficient algorithms for directed series-parallel graphs
Journal of Algorithms
An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs
The Journal of Supercomputing
Randomized minimum spanning tree algorithms using exponentially fewer random bits
ACM Transactions on Algorithms (TALG)
Parallel merging with restriction
The Journal of Supercomputing
Foundations for the integration of scheduling techniques into compilers for parallel languages
International Journal of Computational Science and Engineering
Parallelizing dynamic information flow tracking
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Finding strongly connected components in parallel using O(log2n) reachability queries
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Fundamental parallel algorithms for private-cache chip multiprocessors
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
A parallel extended GCD algorithm
Journal of Discrete Algorithms
Parallel and Sequential Optical Computing
OSC '08 Proceedings of the 1st international workshop on Optical SuperComputing
A Bridging Model for Multi-core Computing
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A Characterisation of NL Using Membrane Systems without Charges and Dissolution
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Logarithmic-time updates and queries in probabilistic networks
Journal of Artificial Intelligence Research
On the computational complexity of coalitional resource games
Artificial Intelligence
Tractable database design and datalog abduction through bounded treewidth
Information Systems
Graph coloring on coarse grained multicomputers
Discrete Applied Mathematics
The Hamiltonian problem on distance-hereditary graphs
Discrete Applied Mathematics
On designing optimal parallel triangular solvers
Information and Computation
A modular integer GCD algorithm
Journal of Algorithms
Automatic remote-sensing images registration by matching close-regions
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Towards optimizing energy costs of algorithms for shared memory architectures
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
The system of common algorithmic space to create visual models of phenomena and processes
Proceedings of the International Conference on Applications of Computer and Information Sciences to Nature Research
Additive spanners and (α, β)-spanners
ACM Transactions on Algorithms (TALG)
Algorithms and theory of computation handbook
Basic notions in computational complexity
Algorithms and theory of computation handbook
Parallel computation: models and complexity issues
Algorithms and theory of computation handbook
A bridging model for multi-core computing
Journal of Computer and System Sciences
LogfP - a model for small messages in InfiniBand
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
On parallel recognition of cographs
Theoretical Computer Science
Logarithmic-time updates and queries in probabilistic networks
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Lower bounds on the computational power of an optical model of computation
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Practical integer sorting on shared memory
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Upper bounds on the computational power of an optical model of computation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Testing graph isomorphism in parallel by playing a game
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Translational lemmas for alternating TMs and PRAMs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
On the implementation of parallel shortest path algorithms on a supercomputer
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
Merging data records on EREW PRAM
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up
Theory of Computing Systems
Lower Bounds for Randomized Exclusive Write PRAMs
Theory of Computing Systems
| Hi-index | 0.03 |