Heykuki News

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