Back to Results
First PageMeta Content
Computational complexity theory / Quantum complexity theory / Communication / Communication complexity / Quantum information science / Multiparty communication complexity / Randomized algorithm / Nearest neighbor search / Pseudorandom generator / Theoretical computer science / Applied mathematics / Mathematics


Cell-Probe Lower Bounds for the Partial Match Problem T.S. Jayram∗ Subhash Khot† Ravi Kumar∗
Add to Reading List

Document Date: 2007-04-01 08:28:26

Open Document

File Size: 197,97 KB

Share Result on Facebook

City

Haifa / San Jose / /

Company

IBM / Y. / Cambridge University Press / /

Country

Israel / /

/

Event

FDA Phase / Person Communication and Meetings / /

Facility

Princeton University / IBM Almaden Research Center / Israel Institute of Technology / /

IndustryTerm

deterministic protocol / cell-probe algorithm / error protocol / high dimensional nearest neighbor search / deterministic protocols / error protocols / communication protocol / to deterministic algorithms / range search problem / nearest neighbor search / /

Organization

Cambridge University / National Science Foundation / Department of Computer Science / Fund for the Promotion of Research / Princeton University / Technion / Israel Institute of Technology / Computer Science Department / Technion / /

Person

Bob / Alice / Beame / Sanjeev Arora / Lucile Packard / David Packard / /

/

Position

author / reasonable model / model for proving lower bounds / wB / player / /

Product

CCR / Intersect All / /

ProgrammingLanguage

R / /

ProvinceOrState

New Jersey / California / /

PublishedMedium

the Theory of Computing / /

Technology

randomized two-sided error protocol / randomized algorithm / deterministic protocol / communication protocol / 3-approximation algorithm / two-sided error protocols / cell-probe algorithm / two algorithms / /

SocialTag