Expander graph based overlapped chunked codes

Author(s):  
Bin Tang ◽  
Shenghao Yang ◽  
Yitong Yin ◽  
Baoliu Ye ◽  
Sanglu Lu
Keyword(s):  
1999 ◽  
Vol 33 (1) ◽  
pp. 166-172 ◽  
Author(s):  
Alan M Frieze ◽  
Michael Molloy
Keyword(s):  

1995 ◽  
Vol 05 (03) ◽  
pp. 413-420 ◽  
Author(s):  
DAVID J. HAGLIN

A work-efficient deterministic [Formula: see text] algorithm is presented for finding a maximum matching in a bipartite expander graph with any expansion factor β > 1. This improves upon a recently presented deterministic [Formula: see text] maximum matching algorithm which is restricted to those bipartite expanders with large expansion factors (β ≥ Δ∊, ∊ > 0), and is not work-efficient [1].


2002 ◽  
Vol 9 (9) ◽  
Author(s):  
Anna Östlin ◽  
Rasmus Pagh

We consider dictionaries that perform lookups by probing a <em>single word</em> of memory, knowing only the size of the data structure. We describe a randomized dictionary where a lookup returns the correct answer with probability 1 - epsilon, and otherwise returns "don't know''. The lookup procedure uses an expander graph to select the memory location to probe. Recent explicit expander constructions are shown to yield space usage much smaller than what would be required using a deterministic lookup procedure. Our data structure supports efficient <em>deterministic</em> updates, exhibiting new probabilistic guarantees on dictionary running time.


Author(s):  
Bin Tang ◽  
Shenghao Yang ◽  
Baoliu Ye ◽  
Yitong Yin ◽  
Sanglu Lu
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document