Heykuki News
Top
New
Best
Ask
Show
Jobs
Toggle theme
Login
Top
New
Best
Ask
Show
Jobs
271.
▲
A Short Introduction to the Art of Programming by Edsger W. Dijkstra
(cs.utexas.edu)
2 points
nosefrog
13 years ago
discuss
272.
▲
De-anonymizing Social Networks (2009; Narayanan, Shmatikov)
(cs.utexas.edu)
2 points
floatingatoll
17 years ago
discuss
273.
▲
Step-by-step: Get 90% of peak FLOPS on a matrix-matrix product
(z.cs.utexas.edu)
2 points
RhysU
13 years ago
discuss
274.
▲
The Humble Programmer
(cs.utexas.edu)
2 points
justhw
13 years ago
discuss
275.
▲
The Free Lunch Is Over (2005) [pdf]
(cs.utexas.edu)
2 points
tosh
13 days ago
discuss
276.
▲
E.W. Dijkstra Archive: The Three Golden Rules for Successful Scientific Research
(cs.utexas.edu)
2 points
codelion
14 years ago
discuss
277.
▲
The Bitter Lesson Rich Sutton [pdf]
(cs.utexas.edu)
2 points
prakashqwerty
2 months ago
discuss
278.
▲
The cruelty of teaching computing science (1988)
(cs.utexas.edu)
2 points
ipnon
3 months ago
discuss
279.
▲
Answer Set Programming (PDF, 2019)
(cs.utexas.edu)
2 points
tempodox
5 months ago
discuss
280.
▲
Answer Set Programming (2019) [pdf]
(cs.utexas.edu)
2 points
todsacerdoti
5 months ago
discuss
281.
▲
McCarthy's 91-function: an unfortunate paradigm (EWD 845)
(cs.utexas.edu)
2 points
throwoutway
6 months ago
discuss
282.
▲
The Bitter Lesson [pdf]
(cs.utexas.edu)
2 points
jkuria
a year ago
discuss
283.
▲
Dijkstra: On the foolishness of "natural language programming" (2010)
(cs.utexas.edu)
2 points
stevekrouse
a year ago
discuss
284.
▲
The Bitter Lesson (2019) [pdf]
(cs.utexas.edu)
2 points
yamrzou
a year ago
discuss
285.
▲
The Tale of the PCP Theorem [pdf]
(cs.utexas.edu)
2 points
gone35
a year ago
discuss
286.
▲
The Bitter Lesson [pdf]
(cs.utexas.edu)
2 points
nycdatasci
a year ago
discuss
287.
▲
A systematic analysis of the Juniper Dual EC DRBG backdoor [pdf]
(cs.utexas.edu)
2 points
fanf2
2 years ago
discuss
288.
▲
Efficiently Computing Static Single Assignment Form and the Control Graph [pdf]
(cs.utexas.edu)
2 points
de_keyboard
2 years ago
discuss
289.
▲
Edsger W. Dijkstra interview (1985)
(cs.utexas.edu)
2 points
duopixel
14 years ago
discuss
290.
▲
The Humble Programmer (1972)
(cs.utexas.edu)
2 points
saikatsg
2 years ago
discuss
291.
▲
Why American Computing Science seems incurable
(cs.utexas.edu)
2 points
ethanwillis
3 years ago
discuss
292.
▲
How do we tell truths that might hurt? (1975)
(cs.utexas.edu)
2 points
Jtsummers
3 years ago
discuss
293.
▲
On the cruelty of teaching computing science (1988) [pdf]
(cs.utexas.edu)
2 points
Jakob
3 years ago
discuss
294.
▲
Edsger Dijkstra: Why numbering should start at zero (1982) [pdf]
(cs.utexas.edu)
2 points
cpeterso
3 years ago
discuss
295.
▲
Proof: Strongest consistency guarantee possible for P+A distributed systems
(cs.utexas.edu)
2 points
LiveTheDream
14 years ago
discuss
296.
▲
E. W. Dijkstra Archive
(cs.utexas.edu)
2 points
talonx
3 years ago
discuss
297.
▲
Why numbering should start at zero (1982)
(cs.utexas.edu)
2 points
scrlk
3 years ago
discuss
298.
▲
Novel-View Acoustic Synthesis
(vision.cs.utexas.edu)
2 points
lnyan
3 years ago
discuss
299.
▲
Summary of SQL Commands
(cs.utexas.edu)
2 points
omarfarooq
3 years ago
discuss
300.
▲
Reading List on Theories of Modern Programming Languages
(cs.utexas.edu)
2 points
ahalan
14 years ago
discuss
More