๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On optimal algorithms for problems defined on groups

โœ Scribed by Misako Yokoyama

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
459 KB
Volume
5
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimal-Algorithms for Multipacket Routi
Optimal-Algorithms for Multipacket Routing Problems on Rings
โœ F. Makedon; A. Symvonis ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 643 KB

We study multipacket routing problems on rings of processors. We prove a new lower bound of \(2 n / 3\) routing steps for the case that \(k\), the number of packets per processor, is at most 2 . We also give an algorithm that tightens this lower bound. For the case where \(k>2\), the lower bound is

Optimal Parallel Algorithms for Quadtree
Optimal Parallel Algorithms for Quadtree Problems
โœ S. Kasif ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science โš– 449 KB

In this paper we describe optimal processor-time parallel algorithms for set operations such as union, intersection, comparison on quadtrees. The algorithms presented in this paper run in \(O(\log\) \(N\) ) time using \(N / \log N\) processors on a shared memory model of computation that allows conc

On algorithms for discrete problems
On algorithms for discrete problems
โœ R.G. Jeroslow ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 631 KB

The paper presents a theorem, applicable to many algorithms used in integer programming, which states that, under frequently met hypotheses! arbitrarily close (in the topology on real space) to most "well-behaved"integer programs there exist integer programs for which the algorithm requires arbitrar