MST 2016 | Sciweavers

Inspired by applications in parallel computing, we analyze the setting of work stealing in multithreaded computations. We obtain tight upper bounds on the number of steals when the...

Charles E. Leiserson, Tao B. Schardl, Warut Suksom...

claim paper

Read More »

31

click to vote

MST
2016

62views Hardware» more MST 2016»

Approximating the Sparsest k-Subgraph in Chordal Graphs

8 years 8 months ago

Download www4.comp.polyu.edu.hk

Rémi Watrigant, Marin Bougeret, Rodolphe Gi...

claim paper

Read More »

41

click to vote

MST
2016

113views Hardware» more MST 2016»

Online Knapsack Revisited

8 years 8 months ago

Download iuuk.mff.cuni.cz

Marek Cygan, Lukasz Jez, Jirí Sgall

claim paper

Read More »

31

click to vote

MST
2016

89views Hardware» more MST 2016»

Min-Sum 2-Paths Problems

8 years 8 months ago

Download www.dcs.bbk.ac.uk

An orientation of an undirected graph G is a directed graph obtained by replacing each edge {u, v} of G by exactly one of the arcs (u, v) or (v, u). In the min-sum k-paths orienta...

Trevor I. Fenner, Oded Lachish, Alexandru Popa

claim paper

Read More »

32

click to vote

MST
2016

73views Hardware» more MST 2016»

Reducibilities Relating to Schnorr Randomness

8 years 8 months ago

Download kenshi.miyabe.name

Abstract Some measures of randomness have been introduced for MartinL¨of randomness such as K-reducibility, C-reducibility and vL-reducibility. In this paper we study Schnorr-rand...

Kenshi Miyabe

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers