Sciweavers

182 search results - page 37 / 37
» A Theory of Strict P-completeness
Sort
View
JSAC
2007
97views more  JSAC 2007»
13 years 6 months ago
R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
Mea Wang, Baochun Li
JSYML
2007
100views more  JSYML 2007»
13 years 6 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore