A New Programming Technique Derived from Dijkstra’s Methodology (Q3747703): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1080/02522667.1986.10698861 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2071096454 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Jumping to some purpose / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Jumping About and Getting into a State / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4133079 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4144755 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3925859 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Critical comments on the programming language Pascal / rank | |||
Normal rank |
Latest revision as of 18:07, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A New Programming Technique Derived from Dijkstra’s Methodology |
scientific article |
Statements
A New Programming Technique Derived from Dijkstra’s Methodology (English)
0 references
1986
0 references
termination indicators
0 references
searching-and-updating problem
0 references
linear search of a linked list
0 references
2-D search of an 2-D array
0 references