{"id":"https://openalex.org/W1585016596","doi":"https://doi.org/10.1007/bfb0105107","title":"Tree machines and divide-and-conquer algorithms","display_name":"Tree machines and divide-and-conquer algorithms","publication_year":2007,"publication_date":"2007-06-12","ids":{"openalex":"https://openalex.org/W1585016596","doi":"https://doi.org/10.1007/bfb0105107","mag":"1585016596"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0105107","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0105107","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110539302","display_name":"Frans J. Peters","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Frans J. Peters","raw_affiliation_strings":["Eindhoven University of Technology, 5600 MB, Eindhoven, the Netherlands","EINDHOVEN UNIVERSITY OF TECHNOLOGY"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, 5600 MB, Eindhoven, the Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"EINDHOVEN UNIVERSITY OF TECHNOLOGY","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110539302"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.12516749,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"25","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.9090626239776611},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7486330270767212},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.683779239654541},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6170662641525269},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5284476280212402},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.48395827412605286},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4398324191570282},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.35810309648513794},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1916925609111786},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19058462977409363},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08378222584724426}],"concepts":[{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.9090626239776611},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7486330270767212},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.683779239654541},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6170662641525269},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5284476280212402},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.48395827412605286},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4398324191570282},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.35810309648513794},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1916925609111786},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19058462977409363},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08378222584724426}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/bfb0105107","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0105107","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:pure.tue.nl:openaire_cris_publications/307e8ab3-45dc-4739-8cef-bf68ae40903b","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/307e8ab3-45dc-4739-8cef-bf68ae40903b","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Peters, F J 1981, Tree machines and divide-and-conquer algorithms. in W Brauer, P Brinch Hansen, C Moler & W H\u00e4ndler (eds), CONPAR 81: Conference on Analysing Problem Classes and Programming for Parallel Computing (N\u00fcrnberg, Germany, June 10-12, 1981). Lecture Notes in Computer Science, vol. 111, Springer, Berlin, pp. 25-36. https://doi.org/10.1007/BFb0105107","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:744790","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=744790","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:744790","is_oa":false,"landing_page_url":"http://repository.tue.nl/744790","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/307e8ab3-45dc-4739-8cef-bf68ae40903b","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/307e8ab3-45dc-4739-8cef-bf68ae40903b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CONPAR 81: Conference on Analysing Problem Classes and Programming for Parallel Computing (N\u00fcrnberg, Germany, June 10-12, 1981), 25 - 36","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1548560094","https://openalex.org/W1560420247","https://openalex.org/W1996641400","https://openalex.org/W2042297594","https://openalex.org/W2044355921","https://openalex.org/W2085468385","https://openalex.org/W2109911863","https://openalex.org/W2110425399","https://openalex.org/W2128703518","https://openalex.org/W2321310861","https://openalex.org/W2809521187","https://openalex.org/W3144368627","https://openalex.org/W4211008702","https://openalex.org/W4235295823","https://openalex.org/W4298235092"],"related_works":["https://openalex.org/W4247094814","https://openalex.org/W2340701376","https://openalex.org/W2902549273","https://openalex.org/W2981001626","https://openalex.org/W2357738827","https://openalex.org/W1966383678","https://openalex.org/W2486717996","https://openalex.org/W3107197685","https://openalex.org/W33990053","https://openalex.org/W2790184291"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}