Optimal Parallel Algorithms for Finding Proximate Points, With Applications

IEEE Transactions on Parallel and Distributed Systems - United States
doi 10.1109/71.737693
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values

Journal of Algorithms
1993English

Algorithms for Finding Connected Separators Between Antipodal Points

Topology and its Applications
GeometryTopology
2007English

Finding a Minimal Cover for Binary Images: An Optimal Parallel Algorithm

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1991English

Analysis and Possibility of Modification of Available Algorithms for Finding the Optimal Path on a Square Grid Using Parallel Programming Methods

Actual problems of automation and information technology
2018English

Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms

SIAM Journal on Computing
MathematicsComputer Science
1989English

Parallel Multi-Scale Algorithms and Applications to Turbulence

1997English

Two Stage Adaptive Optimal Design With Applications to Dose-Finding Clinical Trials

English

Memory-Efficient Kronecker Algorithms With Applications to the Modelling of Parallel Systems

Future Generation Computer Systems
HardwareComputer NetworksSoftwareArchitectureCommunications
2006English

Algorithms for Parallel Polygon Rendering

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1989English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy