{"id":"https://openalex.org/W2067729110","doi":"https://doi.org/10.1007/bf01206355","title":"Parallel comparison algorithms for approximation problems","display_name":"Parallel comparison algorithms for approximation problems","publication_year":1991,"publication_date":"1991-06-01","ids":{"openalex":"https://openalex.org/W2067729110","doi":"https://doi.org/10.1007/bf01206355","mag":"2067729110"},"language":"en","primary_location":{"id":"doi:10.1007/bf01206355","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01206355","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","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/A5083469386","display_name":"Noga Alon","orcid":"https://orcid.org/0000-0003-1332-4883"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"N. Alon","raw_affiliation_strings":["The Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"The Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082061504","display_name":"Yossi Azar","orcid":"https://orcid.org/0000-0002-5097-8993"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Y. Azar","raw_affiliation_strings":["The Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"The Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083469386"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.5113,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.644886,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":"2","first_page":"97","last_page":"122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.995199978351593,"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/mathematics","display_name":"Mathematics","score":0.7857956886291504},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6059014797210693},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6035473942756653},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5657193660736084},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.517992377281189},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.48326975107192993},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4530082941055298},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.44501954317092896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43606826663017273},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4259202480316162},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4186890125274658},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.4144037365913391},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3443332314491272},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13419824838638306},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.08368337154388428}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7857956886291504},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6059014797210693},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6035473942756653},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5657193660736084},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.517992377281189},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.48326975107192993},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4530082941055298},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.44501954317092896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43606826663017273},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4259202480316162},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4186890125274658},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4144037365913391},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3443332314491272},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13419824838638306},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.08368337154388428},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01206355","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01206355","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W151503973","https://openalex.org/W205591407","https://openalex.org/W1510730180","https://openalex.org/W1836810876","https://openalex.org/W1973732321","https://openalex.org/W1976907644","https://openalex.org/W2004621408","https://openalex.org/W2005090472","https://openalex.org/W2011036899","https://openalex.org/W2014992380","https://openalex.org/W2015188932","https://openalex.org/W2025558913","https://openalex.org/W2026729827","https://openalex.org/W2027679733","https://openalex.org/W2051576617","https://openalex.org/W2060210427","https://openalex.org/W2067928123","https://openalex.org/W2069489095","https://openalex.org/W2071054511","https://openalex.org/W2076458424","https://openalex.org/W2087489294","https://openalex.org/W2089062581","https://openalex.org/W2127265216","https://openalex.org/W2132200819","https://openalex.org/W2433940709","https://openalex.org/W2799004609","https://openalex.org/W2912298798","https://openalex.org/W4210622426"],"related_works":["https://openalex.org/W1759995226","https://openalex.org/W2962917430","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W4299801389","https://openalex.org/W2089134982","https://openalex.org/W2028468530","https://openalex.org/W1903284337"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}