{"id":"https://openalex.org/W2063284471","doi":"https://doi.org/10.1137/070684859","title":"Higher Lower Bounds for Near-Neighbor and Further Rich Problems","display_name":"Higher Lower Bounds for Near-Neighbor and Further Rich Problems","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2063284471","doi":"https://doi.org/10.1137/070684859","mag":"2063284471"},"language":"en","primary_location":{"id":"doi:10.1137/070684859","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070684859","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014255854","display_name":"Mihai Ptra\u015fcu","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mihai Ptra\u015fcu","raw_affiliation_strings":["mip@alum.mit.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"mip@alum.mit.edu#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039232562","display_name":"Mikkel Thorup","orcid":"https://orcid.org/0000-0001-5237-1709"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mikkel Thorup","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014255854"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":1.7623,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.83777567,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"39","issue":"2","first_page":"730","last_page":"741"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5085831880569458},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46491438150405884},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4557282030582428},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33163726329803467}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5085831880569458},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46491438150405884},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4557282030582428},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33163726329803467},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/070684859","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070684859","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1972068724","https://openalex.org/W1975663164","https://openalex.org/W1992402998","https://openalex.org/W2001964584","https://openalex.org/W2016185430","https://openalex.org/W2062539466","https://openalex.org/W2085218027","https://openalex.org/W2088101210","https://openalex.org/W2095681182","https://openalex.org/W2134146845","https://openalex.org/W2139128805","https://openalex.org/W2147717514","https://openalex.org/W2165461157","https://openalex.org/W2295913109","https://openalex.org/W3023640601","https://openalex.org/W4212978476"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2042127053"],"abstract_inverted_index":{"We":[0],"convert":[1],"cell-probe":[2],"lower":[3,10,20,83,103,150,157],"bounds":[4,11,84,120,158],"for":[5,12,39,44,85,114,129,163],"polynomial":[6],"space":[7,68,115],"into":[8],"stronger":[9],"near-linear":[13,67],"space.":[14],"Our":[15],"technique":[16],"applies":[17,30],"to":[18,31,35,51,79,110],"any":[19,164],"bound":[21,104],"proved":[22],"through":[23,106],"the":[24,53,70,92,101,107,138,147,160],"richness":[25,75],"method.":[26],"For":[27],"example,":[28],"it":[29],"partial":[32],"match":[33],"and":[34],"near-neighbor":[36],"problems,":[37],"either":[38],"randomized":[40],"exact":[41],"search":[42,47],"or":[43],"deterministic":[45],"approximate":[46],"(which":[48],"are":[49,59,159],"thought":[50],"exhibit":[52],"curse":[54],"of":[55,94,96,121,132,142],"dimensionality).":[56],"These":[57],"problems":[58],"motivated":[60],"by":[61],"searching":[62],"in":[63],"large":[64],"databases,":[65],"so":[66],"is":[69,91,100,125],"most":[71,139],"relevant":[72],"regime.":[73],"Typically,":[74],"has":[76],"been":[77],"used":[78],"imply":[80],"$\\Omega(d/\\lg":[81,122],"n)$":[82],"polynomial-space":[86],"data":[87,166],"structures,":[88],"where":[89],"d":[90],"number":[93],"bits":[95],"a":[97,126,153],"query.":[98],"This":[99,124],"highest":[102,161],"provable":[105],"classic":[108],"reduction":[109],"communication":[111],"complexity.":[112],"However,":[113],"$n\\lg^{O(1)}n$,":[116],"we":[117,145],"now":[118],"obtain":[119],"d)$.":[123],"significant":[127],"improvement":[128],"natural":[130],"values":[131],"d,":[133],"such":[134],"as":[135],"$\\lg^{O(1)}n$.":[136],"In":[137],"important":[140],"case":[141],"$d=\\Theta(\\lg":[143],"n)$,":[144],"have":[146],"first":[148],"superconstant":[149],"bound.":[151],"From":[152],"complexity-theoretic":[154],"perspective,":[155],"our":[156],"known":[162],"static":[165],"structure":[167],"problem,":[168],"significantly":[169],"improving":[170],"on":[171],"previous":[172],"records.":[173]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}