{"id":"https://openalex.org/W2152272389","doi":"https://doi.org/10.1109/ccc.2003.1214411","title":"Lower bounds for predecessor searching in the cell probe model","display_name":"Lower bounds for predecessor searching in the cell probe model","publication_year":2004,"publication_date":"2004-01-23","ids":{"openalex":"https://openalex.org/W2152272389","doi":"https://doi.org/10.1109/ccc.2003.1214411","mag":"2152272389"},"language":"en","primary_location":{"id":"doi:10.1109/ccc.2003.1214411","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2003.1214411","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.","raw_type":"proceedings-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/A5070609086","display_name":"Pranab Kumar Sen","orcid":"https://orcid.org/0000-0003-0193-8562"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"P. Sen","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ONT, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ONT, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5070609086"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":4.9468,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.95218636,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"73","last_page":"83"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9987000226974487,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9987000226974487,"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"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9980999827384949,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9977999925613403,"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/lemma","display_name":"Lemma (botany)","score":0.865472674369812},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7552130222320557},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4880572557449341},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.487298846244812},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47176268696784973},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45428064465522766},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42956700921058655},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.41845694184303284},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4170878529548645},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3221106231212616}],"concepts":[{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.865472674369812},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7552130222320557},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4880572557449341},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.487298846244812},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47176268696784973},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45428064465522766},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42956700921058655},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.41845694184303284},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4170878529548645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3221106231212616},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/ccc.2003.1214411","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2003.1214411","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.155.2672","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.2672","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uvic.ca/~venkat/papers/sen.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.342.5954","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.5954","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0309033v1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W201917955","https://openalex.org/W1483763248","https://openalex.org/W1496883382","https://openalex.org/W1507711139","https://openalex.org/W1631356911","https://openalex.org/W1793119275","https://openalex.org/W1963973936","https://openalex.org/W1969016943","https://openalex.org/W1975663164","https://openalex.org/W1985177045","https://openalex.org/W1986633843","https://openalex.org/W1988155384","https://openalex.org/W1993022201","https://openalex.org/W2000211775","https://openalex.org/W2001964584","https://openalex.org/W2014482556","https://openalex.org/W2023146810","https://openalex.org/W2028406173","https://openalex.org/W2044344951","https://openalex.org/W2047673315","https://openalex.org/W2050108834","https://openalex.org/W2050749090","https://openalex.org/W2055706406","https://openalex.org/W2074286662","https://openalex.org/W2084652510","https://openalex.org/W2088101210","https://openalex.org/W2088263428","https://openalex.org/W2090021115","https://openalex.org/W2090747326","https://openalex.org/W2099111195","https://openalex.org/W2109924867","https://openalex.org/W2113077106","https://openalex.org/W2126532003","https://openalex.org/W2134146845","https://openalex.org/W2147717514","https://openalex.org/W2152506638","https://openalex.org/W2160083149","https://openalex.org/W2165461157","https://openalex.org/W2165621523","https://openalex.org/W2340787257","https://openalex.org/W2912956481","https://openalex.org/W2963679101","https://openalex.org/W3140526873","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3006682748","https://openalex.org/W1097487277","https://openalex.org/W2949964783","https://openalex.org/W1513451900","https://openalex.org/W2907393545","https://openalex.org/W2962784854","https://openalex.org/W2130100567","https://openalex.org/W4288641573","https://openalex.org/W2328371232","https://openalex.org/W1481287275"],"abstract_inverted_index":{"We":[0,42,91,145,190,214],"consider":[1],"a":[2,12,93,169,182,199],"fundamental":[3],"problem":[4,45,100],"in":[5,36,46,212],"data":[6],"structures,":[7],"static":[8],"predecessor":[9,33,188],"searching:":[10],"Given":[11],"subset":[13],"S":[14,23],"of":[15,27,34,66,84,105,155,222],"size":[16,86],"n":[17],"from":[18,164],"the":[19,28,32,47,64,75,103,114,151,187,205,210],"universe":[20],"[m],":[21],"store":[22],"so":[24],"that":[25,101,177,216],"queries":[26],"form":[29],"\"What":[30],"is":[31,138,221],"x":[35],"S?\"":[37],"can":[38],"be":[39],"answered":[40],"efficiently.":[41],"study":[43],"this":[44,99],"cell":[48],"probe":[49],"model":[50],"introduced":[51],"by":[52,69],"Yao":[53],"[1981].":[54],"Recently,":[55],"Beame":[56,106,125,141],"and":[57,107,126,142,159,225],"Fich":[58],"[2002]":[59],"obtained":[60],"optimal":[61],"bounds":[62,104],"on":[63,209],"number":[65],"probes":[67],"needed":[68],"any":[70],"deterministic":[71,131],"query":[72,121,132],"scheme":[73,78],"if":[74],"associated":[76],"storage":[77],"uses":[79],"only":[80],"n/sup":[81],"O(1)/":[82,89],"cells":[83],"word":[85],"(log":[87],"m)/sup":[88],"bits.":[90],"give":[92],"new":[94],"lower":[95,110,148,184],"bound":[96,111,149,185],"proof":[97,112,128],"for":[98,119,130,174,186,204],"matches":[102],"Fich.":[108],"Our":[109],"has":[113],"following":[115],"advantages:":[116],"it":[117,137],"works":[118,129],"randomised":[120],"schemes":[122,133],"too,":[123],"while":[124],"Fich's":[127,143],"only.":[134],"In":[135],"addition,":[136],"simpler":[139],"than":[140],"proof.":[144],"prove":[146,168],"our":[147,193,217],"using":[150],"round":[152,171,194,218],"elimination":[153,172,195,219],"approach":[154],"Miltersen,":[156],"Nisan,":[157],"Safra":[158],"Wigderson":[160],"[1998].":[161,213],"Using":[162],"tools":[163],"information":[165],"theory,":[166],"we":[167],"strong":[170],"lemma":[173,196,220],"communication":[175,202],"complexity":[176],"enables":[178],"us":[179],"to":[180,197],"obtain":[181,198],"tight":[183],"problem.":[189],"also":[191],"use":[192],"rounds":[200],"versus":[201],"tradeoff":[203,211],"'greater-than'":[206],"problem,":[207],"improving":[208],"believe":[215],"independent":[223],"interest":[224],"should":[226],"have":[227],"other":[228],"applications.":[229]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}