{"id":"https://openalex.org/W2066981968","doi":"https://doi.org/10.1007/pl00008261","title":"The Complexity of Parallel Multisearch on Coarse-Grained Machines","display_name":"The Complexity of Parallel Multisearch on Coarse-Grained Machines","publication_year":1999,"publication_date":"1999-07-01","ids":{"openalex":"https://openalex.org/W2066981968","doi":"https://doi.org/10.1007/pl00008261","mag":"2066981968"},"language":"en","primary_location":{"id":"doi:10.1007/pl00008261","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00008261","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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/A5027065890","display_name":"Armin B\u00e4umker","orcid":null},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"A. B\u00e4umker","raw_affiliation_strings":["Department of Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn, Paderborn, Germany.  abk@uni-paderborn.de,  dittrich@uni-paderborn.de., , , , , , DE","Department of Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn, Paderborn, Germany. abk@uni-paderborn.de, dittrich@uni-paderborn.de., DE"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn, Paderborn, Germany.  abk@uni-paderborn.de,  dittrich@uni-paderborn.de., , , , , , DE","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn, Paderborn, Germany. abk@uni-paderborn.de, dittrich@uni-paderborn.de., DE","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047156985","display_name":"Wolfgang Dittrich","orcid":null},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"W. Dittrich","raw_affiliation_strings":["Department of Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn, Paderborn, Germany.  abk@uni-paderborn.de,  dittrich@uni-paderborn.de., , , , , , DE","Department of Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn, Paderborn, Germany. abk@uni-paderborn.de, dittrich@uni-paderborn.de., DE"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn, Paderborn, Germany.  abk@uni-paderborn.de,  dittrich@uni-paderborn.de., , , , , , DE","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn, Paderborn, Germany. abk@uni-paderborn.de, dittrich@uni-paderborn.de., DE","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036587129","display_name":"Andrea Pietracaprina","orcid":"https://orcid.org/0000-0002-9189-9618"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"A. Pietracaprina","raw_affiliation_strings":["Dipartimento di Elettronica e Informatica, Universit\u00e0 di Padova, Padova, Italy.  andrea@artemide.dei.unipd.it., , , , , , IT","Dipartimento di Elettronica e Informatica, Universit\u00e0 di Padova, Padova, Italy.  andrea@artemide.dei.unipd.it., , IT"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Elettronica e Informatica, Universit\u00e0 di Padova, Padova, Italy.  andrea@artemide.dei.unipd.it., , , , , , IT","institution_ids":["https://openalex.org/I138689650"]},{"raw_affiliation_string":"Dipartimento di Elettronica e Informatica, Universit\u00e0 di Padova, Padova, Italy.  andrea@artemide.dei.unipd.it., , IT","institution_ids":["https://openalex.org/I138689650"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5027065890"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.4033,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.73241055,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":"3-4","first_page":"209","last_page":"242"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9991999864578247,"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/theory-of-computation","display_name":"Theory of computation","score":0.7388295531272888},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7051737308502197},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6910890340805054},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.6464157104492188},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.59715735912323},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5581567287445068},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.500267505645752},{"id":"https://openalex.org/keywords/distributed-memory","display_name":"Distributed memory","score":0.48929426074028015},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4778011441230774},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47076845169067383},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.455698162317276},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4179970324039459},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4106025695800781},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.384299099445343},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3674633502960205},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.30518972873687744},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28843504190444946},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21222278475761414}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7388295531272888},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7051737308502197},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6910890340805054},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.6464157104492188},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.59715735912323},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5581567287445068},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.500267505645752},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.48929426074028015},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4778011441230774},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47076845169067383},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.455698162317276},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4179970324039459},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4106025695800781},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.384299099445343},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3674633502960205},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.30518972873687744},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28843504190444946},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21222278475761414},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/pl00008261","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00008261","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.35.5763","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.5763","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dei.unipd.it/~capri/PAPERS/algorithmica99-2.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/2","display_name":"Zero hunger","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1977338887","https://openalex.org/W1993156001","https://openalex.org/W2006795057","https://openalex.org/W2028325745","https://openalex.org/W2031876823","https://openalex.org/W2041520855","https://openalex.org/W2045271686","https://openalex.org/W2053283444","https://openalex.org/W2064757275","https://openalex.org/W2076346949","https://openalex.org/W2077314450","https://openalex.org/W2103012681","https://openalex.org/W2150078521"],"related_works":["https://openalex.org/W2026512611","https://openalex.org/W1985165680","https://openalex.org/W4245497162","https://openalex.org/W2353146130","https://openalex.org/W1990817968","https://openalex.org/W2150064838","https://openalex.org/W1933089384","https://openalex.org/W2185094550","https://openalex.org/W2088823210","https://openalex.org/W2135766592"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}