{"id":"https://openalex.org/W574995331","doi":null,"title":"Algorithms: Sequential, Parallel, and Distributed","display_name":"Algorithms: Sequential, Parallel, and Distributed","publication_year":2004,"publication_date":"2004-10-11","ids":{"openalex":"https://openalex.org/W574995331","mag":"574995331"},"language":"en","primary_location":{"id":"mag:574995331","doi":null,"is_oa":false,"landing_page_url":"http://ci.nii.ac.jp/ncid/BA81715189","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"book","is_traditional":true,"indexed_in":[],"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/A5110098262","display_name":"Kenneth A. Berman","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kenneth A. Berman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5013061606","display_name":"Jerome L. Paul","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jerome L. Paul","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6024,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.75276753,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9473000168800354,"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.9473000168800354,"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/T11269","display_name":"Algorithms and Data Compression","score":0.04500000178813934,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"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/T12288","display_name":"Optimization and Search Problems","score":0.0013000000035390258,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm-design","display_name":"algorithm design","score":0.6809999942779541},{"id":"https://openalex.org/keywords/analysis-of-algorithms","display_name":"algorithm analysis","score":0.9649999737739563},{"id":"https://openalex.org/keywords/sorting-algorithms","display_name":"sorting algorithms","score":0.7099999785423279},{"id":"https://openalex.org/keywords/divide-and-conquer","display_name":"divide-and-conquer","score":0.9789999723434448},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":1.0},{"id":"https://openalex.org/keywords/backtracking","display_name":"backtracking","score":0.9419999718666077},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.8519999980926514},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.9710000157356262},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"minimum spanning tree","score":0.8510000109672546},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.7770000100135803},{"id":"https://openalex.org/keywords/graph-connectivity","display_name":"graph connectivity","score":0.8500000238418579},{"id":"https://openalex.org/keywords/network-flow","display_name":"network flow","score":0.7139999866485596},{"id":"https://openalex.org/keywords/matching-algorithms","display_name":"matching algorithms","score":0.8240000009536743},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.9940000176429749},{"id":"https://openalex.org/keywords/distributed-algorithms","display_name":"distributed algorithms","score":0.9539999961853027},{"id":"https://openalex.org/keywords/network-algorithms","display_name":"network algorithms","score":0.6499999761581421},{"id":"https://openalex.org/keywords/string-matching","display_name":"string matching","score":0.8270000219345093},{"id":"https://openalex.org/keywords/balanced-search-trees","display_name":"balanced search trees","score":0.9520000219345093},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"fast Fourier transform","score":0.9700000286102295},{"id":"https://openalex.org/keywords/heuristic-search","display_name":"heuristic search","score":0.9629999995231628},{"id":"https://openalex.org/keywords/a-algorithm","display_name":"A* algorithm","score":0.906000018119812},{"id":"https://openalex.org/keywords/game-trees","display_name":"game trees","score":0.9710000157356262},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.9430000185966492},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.906000018119812},{"id":"https://openalex.org/keywords/np-complete-problems","display_name":"NP-complete problems","score":0.847000002861023},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":1.0}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6534265279769897},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.5579431653022766},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.5407713651657104},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.48749303817749023},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.46103644371032715},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44995880126953125},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.4491443932056427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42868202924728394},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4230436384677887},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.37050628662109375},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.13256651163101196},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:574995331","doi":null,"is_oa":false,"landing_page_url":"http://ci.nii.ac.jp/ncid/BA81715189","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2294448664","https://openalex.org/W1595295153","https://openalex.org/W130683720","https://openalex.org/W7075624185","https://openalex.org/W4388650829","https://openalex.org/W1545945432","https://openalex.org/W26399059","https://openalex.org/W642484882","https://openalex.org/W1506907352","https://openalex.org/W1547567214"],"abstract_inverted_index":{"Part":[0,38,56,86,114],"1:":[1],"Introduction":[2,6,93],"to":[3,7,24,94],"Algorithms":[4,25,30,37,61,72,85,91,96,105,109,113,145,154],"1.":[5],"Preliminaries":[8],"2.":[9],"Design":[10,41,101],"and":[11,22,33,54,59,64,70,76,82,89,97,121,138,143,159],"Analysis":[12,19],"Fundamentals":[13],"3.":[14],"Mathematical":[15,157],"Tools":[16],"for":[17],"Algorithm":[18],"4.":[20],"Trees":[21,127,140],"Applications":[23],"5.":[26],"More":[27],"on":[28],"Sorting":[29],"6.":[31],"Probability":[32,176],"Average":[34],"Complexity":[35],"of":[36,78,180],"2:":[39],"Major":[40],"Strategies":[42,102],"7.":[43],"The":[44,129],"Greedy":[45],"Method":[46],"8.":[47],"Divide-and-Conquer":[48],"9.":[49],"Dynamic":[50],"Programming":[51],"10.":[52],"Backtracking":[53],"Branch-and-Bound":[55],"3:":[57],"Graph":[58,74],"Network":[60,83,112],"11.":[62],"Graphs":[63],"Digraphs":[65,173],"12.":[66],"Minimum":[67],"Spanning":[68],"Tree":[69],"Shortest-Path":[71],"13.":[73],"Connectivity":[75],"Fault-Tolerance":[77],"Networks":[79],"14.":[80],"Matching":[81,120],"Flow":[84],"4:":[87],"Parallel":[88,95,100],"Distributed":[90,107,111],"15.":[92],"Architectures":[98],"16.":[99],"17.":[103],"Internet":[104],"18.":[106],"Computation":[108],"19.":[110],"5:":[115],"Special":[116],"Topics":[117],"20.":[118],"String":[119],"Document":[122],"Processing":[123],"21.":[124],"Balanced":[125],"Search":[126,135],"22.":[128],"Fast":[130],"Fourier":[131],"Transform":[132],"23.":[133],"Heuristic":[134],"Strategies:":[136],"A*-Search":[137],"Game":[139],"24.":[141],"Probabilistic":[142],"Randomized":[144],"25.":[146],"Lower-Bound":[147],"Theory":[148,177],"26.":[149],"NP-Complete":[150],"Problems":[151],"27.":[152],"Approximation":[153],"Appendices":[155],"A:":[156],"Notation":[158],"Background":[160],"B:":[161],"Linear":[162],"Data":[163],"Structures":[164],"C:":[165],"Interpolating":[166],"Asympotic":[167],"Behavior":[168],"D:":[169],"Random":[170],"Walks":[171],"in":[172],"E:":[174],"Elementary":[175],"F:":[178],"Examples":[179],"Message-Passing":[181],"Interface":[182],"Code":[183],"G:":[184],"Pseudocode":[185],"Conventions":[186]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}