151 search results - page 6 / 31 » A Lower Bound on List Size for List Decoding |
SODA
2008
ACM
13 years 8 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
ACID
2006
13 years 8 months ago
2006
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
VTC
2006
IEEE
14 years 1 months ago
2006
IEEE
The interest in near-ML detection algorithms for Multiple-Input/lMultiple-Output (MIMO) systems have always been high due to their drastic performance gain over suboptimal algorith...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
Algebraic codes that achieve list decoding capacity were recently constructed by a careful "folding" of the Reed-Solomon code. The "low-degree" nature of this f...
STOC
2012
ACM
11 years 10 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...