GitHub - mikolalysenko/functional-red-black-tree: A purely functional red-black tree data structureYou signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert
Dekker's algorithm - Wikipedia
Dekker's algorithm is the first known correct solution to the mutual exclusion problem in concurrent programming where processes only communicate via shared memory. The solution is attributed to Dutch mathematician Th. J. Dekker by Edsger W. Dijkstra in an unpublished paper on sequential process descriptions[1] and his manuscript on cooperating sequential processes.[2] It allows two threads to sha
E.W.Dijkstra Archive: Cooperating sequential processes (EWD 123)
Cooperating sequential processes Table of Contents. Preface. 0. Introduction 1. On the Nature of Sequential Processes. 2. Loosely Connected Processes. 2.1 . A Simple Example. 2.2. The Generalized Mutual Exclusion Problem. 2.3. A Linguistic Interlude. 3. The Mutual Exclusion Problem Revisited. 3.1. The Need for a More Realistic Solution. 3.2. The Synchronizing Primitives. 3.3. The Synchronizing Pri
Quicksort - Wikipedia
Animated visualization of the quicksort algorithm. The horizontal lines are pivot values. Quicksort is an efficient, general-purpose sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959[1] and published in 1961.[2] It is still a commonly used algorithm for sorting. Overall, it is slightly faster than merge sort and heapsort for randomized data, particularly o
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Peterson's algorithm - Wikipedia
Coursera