Computer Science
Curtis F
Profile Activity
Stats
971
reputation
11k
reached
19
answers
3
questions
About

A graduate from UMich.

"There are only two hard things in Computer Science: cache invalidation, naming things, and off-by-one errors."

Communities (44)

Top network posts

This user doesn’t have any gold badges yet.
6
silver badges
14
bronze badges
View all badges

Top tags (44)

Score 31
Posts 3
Posts % 14
Score 18
Posts 1
Score 18
Posts 1
Score 14
Posts 2
Score 8
Posts 1
Score 6
Posts 2
View all tags →

Top posts (22)

All Questions Answers
Votes Newest
18 Are Finite Automata Turing Complete? Jun 21 '19
9 Is computer science pointless Oct 10 '20
8 What is the Name of the Problem or Technique of Determining if a Line in a Program Will Execute Jan 23 '19
6 Is there a name for this priority queue data structure? Jan 26 '19
6 Is the derivative of a graph related to adjacency lists? Jul 5 '18
5 Why is 2^32 in a 32-bit system = 4GiB and not 4Gib? Jun 27 '19
5 Is "Query Equivalence" decidable? Jun 15 '19
4 Is this problem that's similar to integer linear programming also an NP-complete problem? Apr 23 '19
3 Can ropes (AVL trees) be interned? Apr 21 '18
3 Merge Sort Confusion - Initial Phase Missing? Aug 18 '19
View all questions and answers →

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.