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

Journal of Algorithms
doi 10.1006/jagm.1993.1018
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Optimal Parallel Algorithms for Finding Proximate Points, With Applications

IEEE Transactions on Parallel and Distributed Systems
HardwareComputational TheorySignal ProcessingArchitectureMathematics
1998English

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

A Parallel Radix-Sort-Based VLSI Architecture for Finding the First $W$ Maximum/Minimum Values

IEEE Transactions on Circuits and Systems II: Express Briefs
Electronic EngineeringElectrical
2014English

Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms

SIAM Journal on Computing
MathematicsComputer Science
1989English

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

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1991English

Finding the Optimal Assortment of Stores Based on Bimatrix Games

Bulletin of Perm National Research Polytechnic University. Electrotechnics, Informational Technologies, Control Systems
2019English

Quasi-Optimal Leader Election Algorithms in Radio Networks With Log-Logarithmic Awake Time-Slots

English

Space-Time Linear Dispersion Codes Based on Optimal Algorithms

2009English

Q-Learning Algorithms for Optimal Stopping Based on Least Squares

2007English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy