Results 51 to 60 of about 98,549 (74)

Hazard-free Decision Trees

arXiv.org
Decision trees are one of the most fundamental computational models for computing Boolean functions $f : \{0, 1\}^n \mapsto \{0, 1\}$. It is well-known that the depth and size of decision trees are closely related to time and number of processors ...
Deepu Benson, Balagopal Komarath, Jayalal Sarma, Nalli Sai Soumya   +3 more
semanticscholar   +1 more source

Optimal Parallel Algorithms for Convex Hulls in 2D and 3D under Noisy Primitive Operations

Canadian Conference on Computational Geometry
In the noisy primitives model, each primitive comparison performed by an algorithm, e.g., testing whether one value is greater than another, returns the incorrect answer with random, independent probability ...
M. Goodrich, Vinesh Sridhar
semanticscholar   +1 more source

Efficient Parallel Algorithms for Hypergraph Matching

arXiv.org
We present efficient parallel algorithms for computing maximal matchings in hypergraphs. Our algorithm finds locally maximal edges in the hypergraph and adds them in parallel to the matching.
Henrik Reinstädtler, Christian Schulz, Nodari Sitchinava, Fabian Walliser   +3 more
semanticscholar   +1 more source

Linear programming on the reconfigurable mesh and the CREW PRAM

1991
This thesis presents a new parallel algorithm for solving the linear programming problem in $R sp{d}$ for the reconfigurable mesh architecture and for the CREW PRAM model. The algorithm is based on the sequential technique discovered independently by Megiddo (Meg83, Meg84) and by Dyer (Dye84, Dye86), which gives a linear time algorithm, in n, the ...
openaire   +1 more source

The CREW PRAM Complexity of Modular Inversion

SIAM journal on computing (Print), 1998
J. Gathen, I. Shparlinski
semanticscholar   +1 more source

Parsing algorithms for dictionary compression on the PRAM

Data Compression Conference, 1994
D. Hirschberg, L. M. Stauffer
semanticscholar   +1 more source

Work-time optimal k-merge algorithms on the PRAM

Proceedings 11th International Parallel Processing Symposium, 1997
Tatsuya Hayashi, K. Nakano, S. Olariu
semanticscholar   +1 more source

Computing External Watchman Routes on Pram, BSR, and Interconnection Network Models of Parallel Computation

Parallel Processing Letters, 1994
L. Gewali, I. Stojmenovic
semanticscholar   +1 more source

PRAM algorithms for static dictionary compression

Proceedings of 8th International Parallel Processing Symposium, 1994
L. M. Stauffer, D. Hirschberg
semanticscholar   +1 more source

An efficient pram algorithm for maximum-weight independent set on permutation graphs

, 2005
Anita Saha, M. Pal, T. Pal
semanticscholar   +1 more source