Cell-probe lower bounds for the partial match problem

Keyphrases

• Cell-probe Model 100%
• Nearest Neighbor Problem 100%
• Communication Complexity 100%
• Complexity Lower Bounds 100%
• Cell-probe Lower Bounds 100%
• Partial Match 100%
• Cell number 50%
• Near-optimal 50%
• Problem Analysis 50%
• Computer Programming 50%
• Retrieval Algorithm 50%
• Addison 50%
• Stanford University 50%
• 1-bit 50%
• Associative Retrieval 50%
• Asymmetric Communication 50%
• Improved Communication 50%
• Theory of Computing 50%

Computer Science

• Partial Match Problem 100%
• Communication Complexity 100%
• Retrieval Algorithm 50%
• Computer Programming 50%
• Problem Analysis 50%

Mathematics

• Nearest Neighbor 100%
• Asymmetric 50%