{“id”：“https://openalex.org/W2336710587“，”doi“：”https://doi.org/10.1109/allerton.2015.7447037“，”title“：”On the communication complexity of greater-than“，”display_name“：”On the communication complexity for greater-th“，”publication_year“：2015，”publiation_date“：”2015-09-01“，”ids“：{”openalex“：”https://openalex.org/W2336710587“，”doi“：”https://doi.org/10.109/allerton.2015.7447037“，”mag“：”2336710587“}，”language“：”en“，”primary_location“：{”is_oa“：false，”landing_page_url“：”https://doi.org/10.109/allerton.2015.7447037“，”pdf_url“：null，”source“：null，”license“：null'，”licence_id“：null，”version“：nuller，”is_accepted“：false，”is_published“：false}，”type“：”article“，”type_crossref“：“procesdings-article”，”indexed_in“：[”crossref“]，”open_access“：{”is_oa“：false，”oa_status“：”closed“，”oa_url”：null“，”any_repository_has_fulltext“：false}”，”authorships“：[{”author_position“：”first“，”作者“：{”id“：”https://openalex.org/A5050424534“，”display_name“：”Sivaramakrishnan Natarajan Ramamoorthy“，”orcid“：null}，”institutions“：[{”id“：”https://openalex.org/I201448701“，”display_name“：”华盛顿大学“，”ror“：”https://ror.org/00cvxb145“，”country_code“：”US“，”type“：“教育”，”世系“：[”https://openalex.org/I201448701“]}]，”国家“：[“美国”]，”is_corresponding“：false，”raw_author_name“：”Sivaramakrishnan Natarajan Ramamoorthy“，”raw _ afiliation_strings“：[”华盛顿大学计算机科学与工程“]，”affiliations“：[{”raw _affiliation_strong“：”华盛顿大学计算科学与工程”，“institution_ids”：[“https://openalex.org/I201448701“]}]}，{”author_position“：”last“，”author“：{”id“：”https://openalex.org/A5025592127“，”display_name“：”Makrand Sinha“，”orcid“：”https://orcid.org/0000-0001-5702-2049}，“机构”：[{“id”：https://openalex.org/I201448701“，”display_name“：”华盛顿大学“，”ror“：”https://ror.org/00cvxb145“，”country_code“：”US“，”type“：“教育”，”世系“：[”https://openalex.org/I201448701“]}]，”国家“：[“美国”]，”is_corresponding“：false，”raw_author_name“：”Makrand Sinha“，”raw _ afiliation_strings“：[”华盛顿大学计算机科学与工程“]，”affiliations“：[{”raw_ afiliation _string“：”华盛顿大学计算科学与工程”，“institution_ids”：[“https://openalex.org/I201448701“]｝]｝]，”institution_assertions“：[]，”countries_destict_count“：1，”institutions_dispict_count“：1，”corresponding_author_ids“：[]，”corresponding_institution_ids“：[]，”apc_list“：null，”apc_payed“：null，”fwci“：0.348，”has_fulltext“：true，”fulltext_origin“：”ngrams“，”cited_by_count“：6，”citation_normalized_p百分位数“：｛”value“：0.689683，”is_in_top_1_percent“：false，”is_in_top_10_percennt“：false}，”cited_by_percentile_year“：{”min“：82，”max“：84}，“biblio”：{“volume”：null，“issue”：null:null，”first_page“：nullhttps://openalex.org/T10720“，”display_name“：”组合优化与复杂性理论“，”score“：0.9999，”subfield“：{”id“：”https://openalex.org/subfields/1703“，”display_name“：”计算理论与数学“}，”字段“：{”id“：”https://openalex.org/fields/17“，”display_name“：”Computer Science“}，”domain“：{”id“：”https://openalex.org/domains/3“，”display_name“：”物理科学“}}，”主题“：[{”id“：”https://openalex.org/T10720“，”display_name“：”组合优化与复杂性理论“，”score“：0.9999，”subfield“：{”id“：”https://openalex.org/subfields/1703“，”display_name“：”计算理论与数学“}，”字段“：{”id“：”https://openalex.org/fields/17“，”display_name“：”Computer Science“}，”domain“：{”id“：”https://openalex.org/domains/3“，”display_name“：”物理科学“}}，{”id“：”https://openalex.org/T10237“，”display_name“：”高级加密方案和协议“，”score“：0.9998，”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“：”物理科学“}}，{”id“：”https://openalex.org/T11567“，”display_name“：”自动机理论和形式语言“，”score“：0.9997，”subfield“：{”id“：”https://openalex.org/subfields/1703“，”display_name“：”计算理论与数学“}，”字段“：{”id“：”https://openalex.org/fields/17“，”display_name“：”Computer Science“}，”domain“：{”id“：”https://openalex.org/domains/3“，”display_name“：”物理科学“}}]，”关键词“：[{”id“：”https://openalex.org/keywords/communication-complexity网站“，”display_name“：”通信复杂性“，”score“：0.633078}，{”id“：”https://openalex.org/keywords/state-complexity网站“，”display_name“：”状态复杂性“，”score“：0.541605}]，”concepts“：[{”id“：”https://openalex.org/C41008148，“wikidata”：https://www.wikidata.org/wiki/Q21198“，”display_name“：”计算机科学“，”level“：0，”score“：0.63311523}]，”mesh“：[]，”locations_count“：1，”location“：[{”is_oa“：false，”landing_page_url“：”https://doi.org/10.109/allerton.2015.7447037“，”pdf_url“：null，”source“：null，”license“：null，”liccense_id“：nuld，”version“：nully，”is_accepted“：false，”is_published“：false}]，”best_oa_location“：nul，”sustainable_development_goals“：[{”score“：0.43，”id“：”https://metadata.un.org/sdg/10“，”display_name“：”Reduced不等式“}]，”grants“：[]，”datasets“：[]，”versions“：[】，”referenced_works_count“：14，”referrenced_works“：【”https://openalex.org/W135467536","https://openalex.org/W1994916325","https://openalex.org/W2082224527","https://openalex.org/W215161086","https://openalex.org/W2165899690","https://openalex.org/W2340787257","https://openalex.org/W2399968470","https://openalex.org/W2407924029","https://openalex.org/W2408362371","https://openalex.org/W2411019220","https://openalex.org/W2496614101","https://openalex.org/W2581093780","https://openalex.org/W3037669392","https://openalex.org/W4210551624“]，”related_works“：[”https://openalex.org/W3004735627","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2382290278","https://openalex.org/W2376932109","https://openalex.org/W2358668433","https://openalex.org/W2350741829","https://openalex.org/W2130043461","https://openalex.org/W2096946506“]，”abstract_inverted_index“：{”We“：[0]，”give“：[1]，”a“：[2]，”simple“：[3]，”information“：[4]，”理论“：[5]，”证明“：[6]，”that“：[7]，”the“：[8,14]，“public-coin”：[9]，“随机化”：[10]，“通信”：[11]，“复杂性”：[12]，“of”：[13,21]，“greater-than”：[15]，“函数”：[16]，“is”：[17]，“\u03a9（logn）”：[18]，“for”：[19]，“bit-strings”：[20]，“length”：[22]，“n.”：[23]}，“cited_by_api_url”：“https://api.openalex.org/works？filter=cites:W2336710587“，”“counts_by_year”：[{“年份”：2024，”“cited_by_count”：1}，{“年度”：2022，”“cited_by_cunt”：2}，}“年份“：2021，”“cited_by-count”“：1}，{”“年份”“：2018，”“icted_by_count”