{"id":"https://openalex.org/W2281349988","doi":"https://doi.org/10.1007/978-3-642-40627-0_45","title":"Embarrassingly Parallel Search","display_name":"Embarrassingly Parallel Search","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2281349988","doi":"https://doi.org/10.1007/978-3-642-40627-0_45","mag":"2281349988"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-40627-0_45","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40627-0_45","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-01344074","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083321766","display_name":"Jean-Charles R\u00e9gin","orcid":"https://orcid.org/0000-0001-6204-5894"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I201841394","display_name":"Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/019tgvf94","country_code":"FR","type":"education","lineage":["https://openalex.org/I201841394"]},{"id":"https://openalex.org/I4210106479","display_name":"Laboratoire d'Informatique, Signaux et Syst\u00e8mes de Sophia Antipolis","ror":"https://ror.org/01215r597","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I201841394","https://openalex.org/I4210106479","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I4390039363","display_name":"Infection et inflammation","ror":"https://ror.org/021sh3243","country_code":"FR","type":"facility","lineage":["https://openalex.org/I154526488","https://openalex.org/I195731000","https://openalex.org/I277688954","https://openalex.org/I4390039363"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Charles R\u00e9gin","raw_affiliation_strings":["I3S UMR 6070, CNRS, Universit\u00e9 Nice-Sophia Antipolis, France","Laboratoire I3S - MDSC - Mod\u00e8les Discrets pour les Syst\u00e8mes Complexes (Laboratoire I3S\r\nCS 40121\r\n06903 Sophia Antipolis Cedex - France)","I3S - Laboratoire d'Informatique, Signaux, et Syst\u00e8mes de Sophia Antipolis (2000, route des Lucioles - Les Algorithmes - b\u00e2t. Euclide B 06900 Sophia Antipolis - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"I3S UMR 6070, CNRS, Universit\u00e9 Nice-Sophia Antipolis, France","institution_ids":["https://openalex.org/I201841394","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Laboratoire I3S - MDSC - Mod\u00e8les Discrets pour les Syst\u00e8mes Complexes (Laboratoire I3S\r\nCS 40121\r\n06903 Sophia Antipolis Cedex - France)","institution_ids":["https://openalex.org/I4210106479","https://openalex.org/I4390039363"]},{"raw_affiliation_string":"I3S - Laboratoire d'Informatique, Signaux, et Syst\u00e8mes de Sophia Antipolis (2000, route des Lucioles - Les Algorithmes - b\u00e2t. Euclide B 06900 Sophia Antipolis - France)","institution_ids":["https://openalex.org/I4210106479"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087966845","display_name":"Mohamed Rezgui","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I201841394","display_name":"Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/019tgvf94","country_code":"FR","type":"education","lineage":["https://openalex.org/I201841394"]},{"id":"https://openalex.org/I4210106479","display_name":"Laboratoire d'Informatique, Signaux et Syst\u00e8mes de Sophia Antipolis","ror":"https://ror.org/01215r597","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I201841394","https://openalex.org/I4210106479","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I4390039363","display_name":"Infection et inflammation","ror":"https://ror.org/021sh3243","country_code":"FR","type":"facility","lineage":["https://openalex.org/I154526488","https://openalex.org/I195731000","https://openalex.org/I277688954","https://openalex.org/I4390039363"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mohamed Rezgui","raw_affiliation_strings":["I3S UMR 6070, CNRS, Universit\u00e9 Nice-Sophia Antipolis, France","Laboratoire I3S - MDSC - Mod\u00e8les Discrets pour les Syst\u00e8mes Complexes (Laboratoire I3S\r\nCS 40121\r\n06903 Sophia Antipolis Cedex - France)","I3S - Laboratoire d'Informatique, Signaux, et Syst\u00e8mes de Sophia Antipolis (2000, route des Lucioles - Les Algorithmes - b\u00e2t. Euclide B 06900 Sophia Antipolis - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"I3S UMR 6070, CNRS, Universit\u00e9 Nice-Sophia Antipolis, France","institution_ids":["https://openalex.org/I201841394","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Laboratoire I3S - MDSC - Mod\u00e8les Discrets pour les Syst\u00e8mes Complexes (Laboratoire I3S\r\nCS 40121\r\n06903 Sophia Antipolis Cedex - France)","institution_ids":["https://openalex.org/I4210106479","https://openalex.org/I4390039363"]},{"raw_affiliation_string":"I3S - Laboratoire d'Informatique, Signaux, et Syst\u00e8mes de Sophia Antipolis (2000, route des Lucioles - Les Algorithmes - b\u00e2t. Euclide B 06900 Sophia Antipolis - France)","institution_ids":["https://openalex.org/I4210106479"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073932429","display_name":"Arnaud Malapert","orcid":"https://orcid.org/0000-0003-0099-479X"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I201841394","display_name":"Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/019tgvf94","country_code":"FR","type":"education","lineage":["https://openalex.org/I201841394"]},{"id":"https://openalex.org/I4210106479","display_name":"Laboratoire d'Informatique, Signaux et Syst\u00e8mes de Sophia Antipolis","ror":"https://ror.org/01215r597","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I201841394","https://openalex.org/I4210106479","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I4390039363","display_name":"Infection et inflammation","ror":"https://ror.org/021sh3243","country_code":"FR","type":"facility","lineage":["https://openalex.org/I154526488","https://openalex.org/I195731000","https://openalex.org/I277688954","https://openalex.org/I4390039363"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Arnaud Malapert","raw_affiliation_strings":["I3S UMR 6070, CNRS, Universit\u00e9 Nice-Sophia Antipolis, France","Laboratoire I3S - MDSC - Mod\u00e8les Discrets pour les Syst\u00e8mes Complexes (Laboratoire I3S\r\nCS 40121\r\n06903 Sophia Antipolis Cedex - France)","I3S - Laboratoire d'Informatique, Signaux, et Syst\u00e8mes de Sophia Antipolis (2000, route des Lucioles - Les Algorithmes - b\u00e2t. Euclide B 06900 Sophia Antipolis - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"I3S UMR 6070, CNRS, Universit\u00e9 Nice-Sophia Antipolis, France","institution_ids":["https://openalex.org/I201841394","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Laboratoire I3S - MDSC - Mod\u00e8les Discrets pour les Syst\u00e8mes Complexes (Laboratoire I3S\r\nCS 40121\r\n06903 Sophia Antipolis Cedex - France)","institution_ids":["https://openalex.org/I4210106479","https://openalex.org/I4390039363"]},{"raw_affiliation_string":"I3S - Laboratoire d'Informatique, Signaux, et Syst\u00e8mes de Sophia Antipolis (2000, route des Lucioles - Les Algorithmes - b\u00e2t. Euclide B 06900 Sophia Antipolis - France)","institution_ids":["https://openalex.org/I4210106479"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":16.6689,"has_fulltext":false,"cited_by_count":66,"citation_normalized_percentile":{"value":0.99421053,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"596","last_page":"610"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9966999888420105,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9944000244140625,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/embarrassingly-parallel","display_name":"Embarrassingly parallel","score":0.9478110074996948},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7712297439575195},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6804152727127075},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6515763998031616},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5685479640960693},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5418049693107605},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5159314274787903},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.5131524205207825},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5113856196403503},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.5083023905754089},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5027797222137451},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.45122331380844116},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4311203360557556},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.42308253049850464},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.37454336881637573},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.328887403011322},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25056594610214233},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14174899458885193},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.06861582398414612}],"concepts":[{"id":"https://openalex.org/C126909462","wikidata":"https://www.wikidata.org/wiki/Q5369501","display_name":"Embarrassingly parallel","level":3,"score":0.9478110074996948},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7712297439575195},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6804152727127075},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6515763998031616},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5685479640960693},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5418049693107605},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5159314274787903},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.5131524205207825},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5113856196403503},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.5083023905754089},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5027797222137451},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.45122331380844116},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4311203360557556},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.42308253049850464},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.37454336881637573},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.328887403011322},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25056594610214233},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14174899458885193},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.06861582398414612},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-642-40627-0_45","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40627-0_45","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.717.1642","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.717.1642","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.i3s.unice.fr/%7Emalapert/publications/regin.ea-13-CP.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-01344074v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01344074","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"19th International Conference on Principles and Practice of Constraint Programming (CP 2013), Sep 2013, Uppsala, Sweden. &#x27E8;10.1007/978-3-642-40627-0_45&#x27E9;","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01344074v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01344074","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"19th International Conference on Principles and Practice of Constraint Programming (CP 2013), Sep 2013, Uppsala, Sweden. &#x27E8;10.1007/978-3-642-40627-0_45&#x27E9;","raw_type":"Conference papers"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W153192071","https://openalex.org/W158822462","https://openalex.org/W185340237","https://openalex.org/W1504786175","https://openalex.org/W1592820899","https://openalex.org/W1601504107","https://openalex.org/W1949640842","https://openalex.org/W2005234139","https://openalex.org/W2030907583","https://openalex.org/W2106144871","https://openalex.org/W2107243813","https://openalex.org/W2108334735","https://openalex.org/W2136680084","https://openalex.org/W2150470619","https://openalex.org/W2604137245","https://openalex.org/W2730963839","https://openalex.org/W2912248191","https://openalex.org/W4230870880"],"related_works":["https://openalex.org/W4303044088","https://openalex.org/W2102858635","https://openalex.org/W2097415053","https://openalex.org/W1486916474","https://openalex.org/W1563755460","https://openalex.org/W1531664660","https://openalex.org/W2500041535","https://openalex.org/W1957191361","https://openalex.org/W1820477541","https://openalex.org/W1505402803"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":7}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
