Search results
Jump to navigation
Jump to search
- ...fusc function''', named<ref>The fusc name was given in 1976 by [[Edsger W. Dijkstra]]; see EWD570 and EWD578.</ref> according to the obfuscating appearance of *{{citation|first=Edsger W.|last=Dijkstra|authorlink=Edsger W. Dijkstra|title=Selected Writings on Computing: A Personal Perspective|publisher=[[Sp ...16 KB (2,279 words) - 09:18, 6 January 2025
- ...er development of the calculational proof format introduced by [[Edsger W. Dijkstra]] and others in the early 1990s. In essence, three main extensions have bee ...9 KB (1,353 words) - 17:56, 3 September 2023
- ...a [[tree (graph theory)|tree]] was proposed by [[Edsger W. Dijkstra|Edsger Dijkstra]] around 1960, while a formal proof of this algorithm was published in 2002 ...22 KB (3,035 words) - 20:57, 12 October 2024
- ...annot completely be removed by standard methods such as testing,<ref name="Dijkstra 1970"/> and since complex models often are neither published in detail nor <ref name="Dijkstra 1970">{{cite book ...22 KB (2,994 words) - 19:10, 25 June 2024
- [[Edsger W. Dijkstra]] has stated this proposition about acute, right, and obtuse triangles in t ...link=Edsger W. Dijkstra|date=September 7, 1986|work=EWD975|publisher=E. W. Dijkstra Archive}}</ref> ...94 KB (14,362 words) - 04:02, 3 February 2025
- ...uter science)|garbage collection]] algorithm in a 1978 paper with [[Edsger Dijkstra]].<ref name="lamport-garbage"> ...40 KB (5,355 words) - 06:27, 17 January 2025