HK
Heykuki News
Top
New
Best
Ask
Show
Jobs
Toggle theme
Top
New
Best
Ask
Show
Jobs
Request
211.
▲
Science fiction and science reality in computing
cs.utexas.edu
discuss
3 years ago
alexzeitler
3 points
212.
▲
To the members of the Budget Council (2001)
cs.utexas.edu
discuss
4 years ago
vector_spaces
3 points
213.
▲
On the Theorem of Pythagoras
cs.utexas.edu
discuss
4 years ago
User23
3 points
214.
▲
Leisure: Don Knuth's 1984 article on the complexity of songs [pdf]
cs.utexas.edu
discuss
15 years ago
bdhe
3 points
215.
▲
On the economy of doing mathematics [pdf]
cs.utexas.edu
discuss
5 years ago
bmc7505
3 points
216.
▲
OOP inheritance expressed with typed λ-calculus [pdf]
cs.utexas.edu
discuss
5 years ago
nemexis
3 points
217.
▲
Why numbering should begin with zero
cs.utexas.edu
discuss
15 years ago
gcmalloc
3 points
218.
▲
Kalman Filter Simulation
cs.utexas.edu
discuss
5 years ago
tediousdemise
3 points
219.
▲
CS349 – Contemporary Issues in Computer Science
cs.utexas.edu
discuss
6 years ago
killvung
3 points
220.
▲
On the foolishness of “natural language programming”. (1978)
cs.utexas.edu
discuss
6 years ago
mpweiher
3 points
221.
▲
Synthesizing JIT Compilers for In-Kernel DSLs [pdf]
cs.utexas.edu
discuss
6 years ago
matt_d
3 points
222.
▲
Dijkstra's Answers to Questions from Students
cs.utexas.edu
discuss
7 years ago
Melchizedek
3 points
223.
▲
Dijkstra: On the cruelty of teching computer science [pdf]
cs.utexas.edu
discuss
7 years ago
roschdal
3 points
224.
▲
Edsger W. Dijkstra: The notational conventions I adopted, and why (2000)
cs.utexas.edu
discuss
7 years ago
tosh
3 points
225.
▲
Paxos made live: an engineering perspective from Google Chubby [pdf]
cs.utexas.edu
discuss
8 years ago
fanf2
3 points
226.
▲
The notational conventions I adopted, and why
cs.utexas.edu
discuss
8 years ago
User23
3 points
227.
▲
E.W. Dijkstra: Why numbering should start at zero
cs.utexas.edu
discuss
8 years ago
rspivak
3 points
228.
▲
Why numbering should start at zero? – By Dijkstra [pdf]
cs.utexas.edu
discuss
8 years ago
susam
3 points
229.
▲
PebblesDB: Building Key-Value Stores Using Fragmented Log-Structured Merge Trees [pdf]
cs.utexas.edu
discuss
8 years ago
espeed
3 points
230.
▲
Dijkstra: The Humble Programmer
cs.utexas.edu
discuss
18 years ago
bootload
3 points
231.
▲
EWD 498: How do we tell truths that might hurt? [pdf]
cs.utexas.edu
discuss
10 years ago
Jtsummers
3 points
232.
▲
Analysis of X86 Application and System Programs via Machine-Code Verification [pdf]
cs.utexas.edu
discuss
10 years ago
luu
3 points
233.
▲
The Humble Programmer (1972)
cs.utexas.edu
discuss
11 years ago
hamoperator
3 points
234.
▲
Pruning the Search Tree (1997)
cs.utexas.edu
discuss
11 years ago
Jtsummers
3 points
235.
▲
Why numbering should start at zero (1982)
cs.utexas.edu
1 comment
11 years ago
nreece
2 points
236.
▲
Kalman Filter Simulator
cs.utexas.edu
1 comment
12 years ago
kqr2
2 points
237.
▲
Learn you a Haskell for great good [pdf]
cs.utexas.edu
1 comment
13 years ago
tosh
2 points
238.
▲
The cruelty of teaching computing science (1988)
cs.utexas.edu
1 comment
8 days ago
archargelod
2 points
239.
▲
EWD 1094 – The undeserved status of the pigeon-hole principle (1991)
cs.utexas.edu
1 comment
7 months ago
vismit2000
2 points
240.
▲
Dijkstra on computer addiction (1991) [pdf]
cs.utexas.edu
1 comment
a year ago
quantumHazer
2 points
More