{"id":"https://openalex.org/W2903917680","doi":"https://doi.org/10.1145/3300150.3300165","title":"Edsger W. Dijkstra","display_name":"Edsger W. Dijkstra","publication_year":2018,"publication_date":"2018-12-15","ids":{"openalex":"https://openalex.org/W2903917680","doi":"https://doi.org/10.1145/3300150.3300165","mag":"2903917680"},"language":"en","primary_location":{"id":"doi:10.1145/3300150.3300165","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3300150.3300165","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","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/A5021246811","display_name":"Bowen Alpern","orcid":null},"institutions":[{"id":"https://openalex.org/I161301626","display_name":"Lehman College","ror":"https://ror.org/03m908832","country_code":"US","type":"education","lineage":["https://openalex.org/I161301626"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bowen Alpern","raw_affiliation_strings":["Lehman College, CUNY, New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"Lehman College, CUNY, New York, NY, USA","institution_ids":["https://openalex.org/I161301626"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021246811"],"corresponding_institution_ids":["https://openalex.org/I161301626"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.17160281,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"49","issue":"4","first_page":"64","last_page":"65"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.20090000331401825,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.20090000331401825,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7845091819763184},{"id":"https://openalex.org/keywords/surprise","display_name":"Surprise","score":0.6796742677688599},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4303596317768097},{"id":"https://openalex.org/keywords/psychology","display_name":"Psychology","score":0.2902224063873291},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.20354780554771423},{"id":"https://openalex.org/keywords/communication","display_name":"Communication","score":0.10553407669067383},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08386605978012085}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7845091819763184},{"id":"https://openalex.org/C2780343955","wikidata":"https://www.wikidata.org/wiki/Q333173","display_name":"Surprise","level":2,"score":0.6796742677688599},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4303596317768097},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.2902224063873291},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.20354780554771423},{"id":"https://openalex.org/C46312422","wikidata":"https://www.wikidata.org/wiki/Q11024","display_name":"Communication","level":1,"score":0.10553407669067383},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08386605978012085},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3300150.3300165","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3300150.3300165","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGACT News","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.7300000190734863}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W4236382845","https://openalex.org/W4388712630","https://openalex.org/W2481168998","https://openalex.org/W2476994687","https://openalex.org/W642988558","https://openalex.org/W2324507472","https://openalex.org/W2511141457","https://openalex.org/W1999899047","https://openalex.org/W2173353921"],"abstract_inverted_index":{"It":[0,38],"would":[1],"be":[2,58],"understatement":[3],"to":[4,14,57],"say":[5],"that":[6],"news":[7],"of":[8,70],"this":[9],"year's":[10],"Dijkstra":[11],"award":[12],"came":[13],"me":[15,23],"as":[16],"a":[17,25,95],"surprise.":[18],"In":[19],"fact,":[20],"it":[21,100],"put":[22],"into":[24],"rather":[26],"profound":[27],"funk,":[28],"occasioning":[29],"unsought":[30],"re":[31],"ection":[32],"on":[33,77,83],"my":[34],"arguably":[35],"misspent":[36],"adulthood.":[37],"has":[39],"been":[40],"some":[41],"time":[42],"since":[43],"I":[44,53,60,67,93],"have":[45],"done":[46],"signi":[47],"cant":[48],"scienti":[49],"c":[50],"research.":[51],"So,":[52],"am":[54],"quite":[55],"humbled":[56],"here.":[59],"did":[61],"not":[62],"really":[63],"know":[64],"Dijkstra,":[65],"but":[66],"certainly":[68],"knew":[69],"him.":[71],"With":[72],"Fred":[73],"and":[74],"David":[75],"Gries":[76],"the":[78,84],"faculty,":[79],"his":[80],"in":[81],"uence":[82],"Computer":[85],"Science":[86],"Department":[87],"at":[88],"Cornell":[89],"was":[90,94],"substantial":[91],"when":[92],"graduate":[96],"student.":[97],"(I":[98],"trust":[99],"still":[101],"is.)":[102]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2018-12-22T00:00:00"}