{"id":"https://openalex.org/W1581719612","doi":null,"title":"Data structures & algorithm analysis in Java","display_name":"Data structures & algorithm analysis in Java","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1581719612","mag":"1581719612"},"language":"en","primary_location":{"id":"mag:1581719612","doi":null,"is_oa":false,"landing_page_url":"http://ci.nii.ac.jp/ncid/BA38981123","pdf_url":null,"source":{"id":"https://openalex.org/S4306462774","display_name":"Addison-Wesley eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"ebook platform"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Addison-Wesley eBooks","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/A5079482182","display_name":"Mark Allen Weiss","orcid":"https://orcid.org/0000-0003-4056-4428","observed_orcids":["https://orcid.org/0000-0003-4056-4428"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mark Allen Weiss","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-4056-4428","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5079482182"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4975,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.70833333,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"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/T11269","display_name":"Algorithms and Data Compression","score":0.95169997215271,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.95169997215271,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.03310000151395798,"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/T10533","display_name":"Teaching and Learning Programming","score":0.011800000444054604,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/data-structures","display_name":"data structures","score":0.9789999723434448},{"id":"https://openalex.org/keywords/analysis-of-algorithms","display_name":"algorithm analysis","score":0.9850000143051147},{"id":"https://openalex.org/keywords/java","display_name":"Java","score":0.8019999861717224},{"id":"https://openalex.org/keywords/recursion","display_name":"recursion","score":0.800000011920929},{"id":"https://openalex.org/keywords/generic-objects","display_name":"generic objects","score":0.5870000123977661},{"id":"https://openalex.org/keywords/abstract-data-types","display_name":"abstract data types","score":0.8700000047683716},{"id":"https://openalex.org/keywords/trees","display_name":"trees","score":0.8830000162124634},{"id":"https://openalex.org/keywords/binary-search-trees","display_name":"binary search trees","score":0.9890000224113464},{"id":"https://openalex.org/keywords/avl-trees","display_name":"AVL trees","score":0.8539999723434448},{"id":"https://openalex.org/keywords/splay-trees","display_name":"splay trees","score":0.9739999771118164},{"id":"https://openalex.org/keywords/b-tree","display_name":"B-trees","score":0.9700000286102295},{"id":"https://openalex.org/keywords/hashing","display_name":"hashing","score":0.972000002861023},{"id":"https://openalex.org/keywords/priority-queues","display_name":"priority queues","score":0.8190000057220459},{"id":"https://openalex.org/keywords/heaps","display_name":"heaps","score":0.9599999785423279},{"id":"https://openalex.org/keywords/sorting-algorithms","display_name":"sorting algorithms","score":0.878000020980835},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.875},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.8970000147819519},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.9449999928474426},{"id":"https://openalex.org/keywords/divide-and-conquer","display_name":"divide-and-conquer","score":0.9900000095367432},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":1.0},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.996999979019165},{"id":"https://openalex.org/keywords/backtracking","display_name":"backtracking","score":0.9750000238418579},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"amortized analysis","score":0.9950000047683716},{"id":"https://openalex.org/keywords/red-black-trees","display_name":"red-black trees","score":0.9169999957084656},{"id":"https://openalex.org/keywords/skip-lists","display_name":"skip lists","score":0.9599999785423279},{"id":"https://openalex.org/keywords/k-d-tree","display_name":"k-d tree","score":0.7649999856948853}],"concepts":[{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.6202941536903381},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6083902716636658},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5629246830940247},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5304127335548401},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.526925265789032},{"id":"https://openalex.org/C2333172","wikidata":"https://www.wikidata.org/wiki/Q1425985","display_name":"Preorder","level":2,"score":0.48507562279701233},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.47717466950416565},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4677783250808716},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.46175146102905273},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.45846685767173767},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.45525842905044556},{"id":"https://openalex.org/C35555965","wikidata":"https://www.wikidata.org/wiki/Q189057","display_name":"Merge sort","level":4,"score":0.4319267272949219},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.3694392442703247},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34636014699935913},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.3161197900772095},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29534679651260376},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.20105770230293274},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.20055630803108215},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13444507122039795}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:1581719612","doi":null,"is_oa":false,"landing_page_url":"http://ci.nii.ac.jp/ncid/BA38981123","pdf_url":null,"source":{"id":"https://openalex.org/S4306462774","display_name":"Addison-Wesley eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"ebook platform"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Addison-Wesley eBooks","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/W3111072203","https://openalex.org/W1560262631","https://openalex.org/W2150580621","https://openalex.org/W1576138761","https://openalex.org/W2063557315","https://openalex.org/W2465479405","https://openalex.org/W7018082353","https://openalex.org/W1587089917","https://openalex.org/W3185724103","https://openalex.org/W1495010687"],"abstract_inverted_index":{"Introduction.":[0,242],"What's":[1],"the":[2],"Book":[3],"About?":[4],"Mathematics":[5],"Review.":[6],"A":[7,104,115],"Brief":[8],"Introduction":[9,170],"to":[10,28,171],"Recursion.":[11],"Generic":[12],"Objects":[13],"in":[14,226,230,234],"Java.":[15],"Exceptions.":[16],"Input":[17],"and":[18,35,148,179,203],"Output.":[19],"Code":[20],"Organization.":[21],"Algorithm":[22,173],"Analysis.":[23,188],"Mathematical":[24],"Background.":[25],"Model.":[26,84],"What":[27],"Analyze.":[29],"Running":[30],"Time":[31],"Calculations.":[32],"Lists,":[33],"Stacks,":[34],"Queues.":[36,92,99,193],"Abstract":[37],"Data":[38,136,201],"Types":[39],"(ADTs).":[40],"The":[41,44,47,54,125,131,239],"List":[42],"ADT.":[43,46,49,128],"Stack":[45],"Queue":[48],"Trees.":[50,53,60,62,64,199,207,210,217],"Preliminaries.":[51,101],"Binary":[52,58,87],"Search":[55,59],"Tree":[56,65],"ADT:":[57],"AVL":[61],"Splay":[63,198,206],"Traversals":[66],"(Revisited).":[67],"B-Trees.":[68],"Hashing.":[69,80],"General":[70,116],"Idea.":[71],"Hash":[72],"Function.":[73],"Separate":[74],"Chaining.":[75],"Open":[76],"Addressing.":[77],"Rehasing.":[78],"Extendible":[79],"Priority":[81,91],"Queues":[82],"(Heaps).":[83],"Simple":[85,108],"Implementations.":[86],"Heap.":[88],"Applications":[89,166],"of":[90,167],"d-heaps.":[93],"Leftist":[94],"Heaps.":[95,97,195,197,219],"Skew":[96,194],"Binomial":[98,192],"Sorting.":[100,120,124],"Insertion":[102],"Sort.":[103,122,157],"Lower":[105,117],"Bound":[106,118],"for":[107,119,145],"Sorting":[109],"Algorithms.":[110,140,154,159,177,184,186],"Shellsort.":[111],"Heapsort.":[112],"Mergesort.":[113],"Quicksort.":[114],"Bucket":[121],"External":[123],"Disjoint":[126],"Set":[127],"Equivalence":[129,133],"Relations.":[130],"Dynamic":[132,181],"Problem.":[134],"Basic":[135,243],"Structure.":[137],"Smart":[138],"Union":[139],"Path":[141,149,254],"Compression.":[142,150],"Worst":[143],"Case":[144],"Union-by":[146],"Rank":[147],"An":[151,189],"Application.":[152],"Graph":[153],"Definitions.":[155],"Topological":[156],"Shortest-Path":[158],"Network":[160],"Flow":[161],"Problems.":[162],"Minimum":[163],"Spanning":[164],"Tree.":[165],"Depth-First":[168],"Search.":[169],"NP-Completeness.":[172],"Design":[174],"Techniques.":[175],"Greedy":[176],"Divide":[178],"Conquer.":[180],"Programming.":[182],"Randomized":[183],"Backtracking":[185],"Amortized":[187],"Unrelated":[190],"Puzzle.":[191],"Fibonacci":[196],"Advanced":[200],"Structures":[202],"Implementation.":[204],"Top-Down":[205],"Red":[208],"Black":[209],"Deterministic":[211],"Skip":[212],"Lists.":[213,245],"AA-Trees.":[214],"Treaps.":[215],"k-d":[216],"Pairing":[218],"Appendix":[220,237],"A:":[221],"Some":[222],"Library":[223],"Routines.":[224],"Classes":[225,229,233],"Package":[227,231,235],"java.lang.":[228],"java.io.":[232],"java.util.":[236],"B:":[238],"Collections":[240],"Library.":[241],"Classes.":[244],"Sets.":[246],"Maps.":[247],"Example:":[248,252],"Generating":[249],"a":[250],"Concordance.":[251],"Shortest":[253],"Calculation.":[255],"0201357442T04062001":[256]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2016-06-24T00:00:00"}