|
Volumn , Issue , 1990, Pages 1-7
|
Blasting through the information theoretic barrier with Fusion Trees
a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTER PROGRAMMING--ALGORITHMS;
MATHEMATICAL TECHNIQUES--TREES;
FUSION TREES;
INFORMATION THEORETIC BOUNDS;
RANDOM ACCESS MACHINES;
SUBLOGARITHMIC DATA STRUCTURE;
DATA PROCESSING;
|
EID: 0024984002
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/100216.100217 Document Type: Conference Paper |
Times cited : (60)
|
References (7)
|