โ
Tate, Kristy
๐
Fiction
๐
2019
๐
English
โ 92 KB
โฆ LIBER โฆ
The Oblivious Billionaire
โ Scribed by Tate, Kristy
- Year
- 2019
- Tongue
- English
- Weight
- 92 KB
- Series
- Misbehaving Billionaires 2
- Category
- Fiction
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Randomness-optimal oblivious sampling
โ
David Zuckerman
๐
Article
๐
1997
๐
John Wiley and Sons
๐
English
โ 246 KB
We present the first efficient oblivious sampler that uses an optimal number of random bits, up to an arbitrary constant factor bigger than 1. Specifically, for any โฃ ) 0, it ลฝ .ลฝ y 1 . ลฝ y 1 y 1 . uses 1 q โฃ m q log โฅ random bits to output ds poly โ , log โฅ , m sample points ร 4 m ร 4 m w x w<ลฝ .
Oblivious Gossiping on Tori
โ
Ulrich Meyer; Jop F. Sibeyn
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 175 KB
Near-optimal gossiping algorithms are given for two-dimensional and higher dimensional tori, assuming the full-port store-and-forward communication model. For two-dimensional tori, a previous algorithm achieved optimality in an intricate way, with an adaptive routing pattern. In contrast, the proces
Oblivious Routing Algorithms on the Mesh
โ
Kazuo Iwama; Eiji Miyano
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 226 KB
An optimal W1.5N 1ร2 X lower bound is shown for oblivious routing on the mesh of buses: a two-dimensional parallel model consisting of N 1ร2 \_N 1ร2 processors and N 1ร2 row and N 1ร2 column buses but no local connections between neighboring processors. Many lower bound proofs for routing on mesh-st
โ
Ellis, Eliza
๐
Fiction
๐
2018
๐
English
โ 82 KB
๐ 4 views
A cache-oblivious self-adaptive full mul
โ
M. Mehl; T. Weinzierl; Chr. Zenger
๐
Article
๐
2006
๐
John Wiley and Sons
๐
English
โ 450 KB