{"id":"https://openalex.org/W2123417578","doi":"https://doi.org/10.1142/s0218195999000030","title":"AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS","display_name":"AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS","publication_year":1999,"publication_date":"1999-02-01","ids":{"openalex":"https://openalex.org/W2123417578","doi":"https://doi.org/10.1142/s0218195999000030","mag":"2123417578"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195999000030","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195999000030","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","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/A5113562454","display_name":"Mikhail J. Atallah","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"MIKHAIL J. ATALLAH","raw_affiliation_strings":["Department of Computer Science, Purdue University, West Lafayette, IN\u00a047907, USA","Department of Computer Science, Purdue University, West Lafayette, IN, 47907, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette, IN\u00a047907, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette, IN, 47907, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5113562454"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25871819,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"09","issue":"01","first_page":"29","last_page":"38"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/hypercube","display_name":"Hypercube","score":0.9441149234771729},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.691102921962738},{"id":"https://openalex.org/keywords/simd","display_name":"SIMD","score":0.5928632020950317},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5728327035903931},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5630537271499634},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5016677379608154},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.47097042202949524},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45788824558258057},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4525640606880188},{"id":"https://openalex.org/keywords/point-location","display_name":"Point location","score":0.4523884952068329},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4015849232673645},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.37255382537841797},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.36481204628944397},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32676365971565247},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.08138599991798401}],"concepts":[{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.9441149234771729},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.691102921962738},{"id":"https://openalex.org/C150552126","wikidata":"https://www.wikidata.org/wiki/Q339387","display_name":"SIMD","level":2,"score":0.5928632020950317},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5728327035903931},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5630537271499634},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5016677379608154},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.47097042202949524},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45788824558258057},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4525640606880188},{"id":"https://openalex.org/C186750021","wikidata":"https://www.wikidata.org/wiki/Q7208210","display_name":"Point location","level":3,"score":0.4523884952068329},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4015849232673645},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.37255382537841797},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.36481204628944397},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32676365971565247},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.08138599991798401},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0218195999000030","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195999000030","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},{"id":"pmh:oai:docs.lib.purdue.edu:cstech-2276","is_oa":false,"landing_page_url":"https://docs.lib.purdue.edu/cstech/1277","pdf_url":null,"source":{"id":"https://openalex.org/S4377196310","display_name":"Purdue e-Pubs (Purdue University System)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801333002","host_organization_name":"Purdue University System","host_organization_lineage":["https://openalex.org/I2801333002"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science Technical Reports","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":11,"referenced_works":["https://openalex.org/W1971869874","https://openalex.org/W1982291599","https://openalex.org/W1993156001","https://openalex.org/W1998754508","https://openalex.org/W2028325745","https://openalex.org/W2030999197","https://openalex.org/W2042607215","https://openalex.org/W2071153521","https://openalex.org/W2092472617","https://openalex.org/W2108610799","https://openalex.org/W2141389982"],"related_works":["https://openalex.org/W2119628172","https://openalex.org/W2123989209","https://openalex.org/W2116868304","https://openalex.org/W1982770663","https://openalex.org/W2059106180","https://openalex.org/W2137245520","https://openalex.org/W2950019404","https://openalex.org/W1999859645","https://openalex.org/W4248673176","https://openalex.org/W2123417578"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,9,38,46,48,158],"result":[3],"that":[4,157],"implies":[5],"an":[6,103,121],"improvement":[7],"by":[8],"factor":[10],"of":[11,23],"log":[12,13,94,96,97,112,114,115,153],"n":[14],"in":[15,55,74],"the":[16,20,42,53,56,85,106,134],"hypercube":[17,125],"bounds":[18,132],"for":[19,127],"geometric":[21],"problems":[22],"batched":[24],"planar":[25],"point":[26],"location,":[27],"trapezoidal":[28],"decomposition,":[29],"and":[30,82,144],"polygon":[31],"triangulation.":[32],"The":[33,124],"improvements":[34],"are":[35,63],"achieved":[36],"through":[37],"better":[39],"solution":[40,88,107],"to":[41,60,72,89],"multisearch":[43],"problem":[44,51,91],"on":[45,102,120],"hypercube,":[47,105],"parallel":[49],"search":[50],"where":[52,67],"elements":[54],"data":[57],"structure":[58],"S":[59],"be":[61],"searched":[62],"totally":[64],"ordered,":[65],"but":[66],"it":[68],"is":[69,133],"not":[70],"possible":[71],"compare":[73],"constant":[75],"time":[76,101,119],"any":[77],"two":[78],"given":[79,108],"queries":[80],"q":[81],"q\u2032.":[83],"Whereas":[84],"previous":[86],"best":[87],"this":[90],"took":[92],"O(":[93,111,152],"n(":[95,113],"n)":[98,116,154],"3":[99],")":[100,118],"n-processor":[104,122],"here":[109],"takes":[110],"2":[117],"hypercube.":[123],"model":[126],"which":[128],"we":[129],"claim":[130],"our":[131],"standard":[135],"one,":[136],"SIMD,":[137],"with":[138,145],"O(1)":[139],"memory":[140],"registers":[141],"per":[142],"processor,":[143],"one-port":[146],"communication.":[147],"Each":[148],"register":[149],"can":[150],"store":[151],"bits,":[155],"so":[156],"processor":[159],"knows":[160],"its":[161],"ID.":[162]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}