scientific article; zbMATH DE number 1142306

Cited in

(only showing first 100 items - show all)

Parallel merging with restriction
A parallel extended GCD algorithm
A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
Optical computing
The queue-read queue-write asynchronous PRAM model
The bulk-synchronous parallel random access machine
ERCW PRAMs and optical communication
A unified approach to parallel depth-first traversals of general trees
Circuits for computing the GCD of two polynomials over an algebraic number field
On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields
Matrix inversion in RNC\(^ 1\)
Achieving optimal CRCW PRAM fault-tolerance
A note on the subtree isomorphism for ordered trees and related problems
Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems
Data-movement-intensive problems: Two folk theorems in parallel computation revisited
Perfect matching for regular graphs is AC^ 0-hard for the general matching problem
On the evaluation of the eigenvalues of a banded Toeplitz block matrix
Maintaining bridge-connected and biconnected components on-line
Learning in parallel
A model classifying algorithms as inherently sequential with applications to graph searching
Parallel solution of Toeplitzlike linear systems
The complexity of circuit value and network stability
A new graph triconnectivity algorithm and its parallelization
Multiplication, division, and shift instructions in parallel random access machines
A parallel algorithm for minimum weighted colouring of triangulated graphs
Efficient parallel algorithms for shortest paths in planar digraphs
PRAMs with variable word-size
An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3
Approximating the minimum-cost maximum flow is P-complete
Matching theory -- a sampler: From Dénes König to the present
Deciding bisimilarity is P-complete
Two \(P\)-complete problems in the theory of the reals
Parallel search algorithms for graphs and trees
Polynomial division with a remainder by means of evaluation and interpolation
An optimal parallel algorithm for computing furthest neighbors in a tree
Parametrization of Newton's iteration for computations with structured matrices and applications
I/O- and CPU-optimal recognition of strongly connected components
Improved processor bounds for parallel algorithms for weighted directed graphs
Improved parallel computations with Toeplitz-like and Hankel-like matrices
Product rules for the displacement of near-Toeplitz matrices
Parallel processing for difficult combinatorial optimization problems
A nearly parallel algorithm for the Voronoi diagram of a convex polygon
Fast rectangular matrix multiplication and applications
The parallel complexity of approximating the high degree subgraph problem
Scheduling inverse trees under the communication model of the LogP-machine
Synthesizers and their application to the parallel construction of pseudo-random functions
Parallel construction and query of index data structures for pattern matching on square matrices
Topological queries in spatial databases
A parallel algorithm for constructing projection polyhedra
Fast parallel constraint satisfaction
The complexity of computing maximal word functions
Probabilistic methods in coloring and decomposition problems
Oracle computations in parallel numerical linear algebra
Improved parallel solution of a triangular linear system
On the computation of pfaffians
The parallel solution of domination problems on chordal and strongly chordal graphs
Complexity models for incremental computation
Dynamic scheduling on parallel machines
Locality-preserving hash functions for general purpose parallel computation
A theory of strict P-completeness
A parallel list update problem
On the parallel complexity of digraph reachability
An optimal parallel algorithm for maximal matching
An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
Planarity testing in parallel
Dynamic expression trees
A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity
Parallel maximum independent set in convex bipartite graphs
Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
A fast and efficient NC algorithm for maximal matching
Parallel algorithms for the domination problems in trapezoid graphs
Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM
On randomized versus deterministic computation
Parallel evaluation of arithmetic circuits
Parallel computation of polynomial GCD and some related parallel computations over abstract fields
Efficient massively parallel implementation of some combinatorial algorithms
A remark on maximum matching of line graphs
A canonical form of vector machines
Parallel algorithms for certain matrix computations
On the computational power of self-stabilizing systems
Parallel algorithms for the minimum cut and the minimum length tree layout problems
Queries with arithmetical constraints
Planar stage graphs: Characterizations and applications
A time-optimal solution for the path cover problem on cographs.
Graph coloring on coarse grained multicomputers
A modular reduction for GCD computation.
Gossiping and broadcasting versus computing functions in networks.
Computing Prüfer codes efficiently in parallel
A selected tour of the theory of identification matrices
Algorithms for the parallel alternating direction access machine
Improved algorithms via approximations of probability distributions
An algorithm for the Tutte polynomials of graphs of bounded treewidth
Algorithms for testing occurrences of length 4 patterns in permutations
Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
Efficiently parallelizable problems on a class of decomposable graphs
Constructing arrangements optimally in parallel
Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
On designing optimal parallel triangular solvers.
Approximating unweighted connectivity problems in parallel
Logic programs and connectionist networks

This page was built for publication:

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