Computer Science
Meta user
Network profile
830
reputation
4
14

Curtis F

A graduate from UMich.

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

16
answers
3
questions
~5k
people reached

Communities (30)

Top network posts

Top tags (39)

Score 25
Posts 3
Posts % 16
Score 15
Posts 1
Score 15
Posts 1
Score 14
Posts 2
Score 8
Posts 1
Score 6
Posts 2
View all tags →

Top posts (19) All Questions Answers | Votes Newest

15 Are Finite Automata Turing Complete? Jun 21
8 What is the Name of the Problem or Technique of Determining if a Line in a Program Will Execute Jan 23
6 Is there a name for this priority queue data structure? Jan 26
5 Is the derivative of a graph related to adjacency lists? Jul 5 '18
4 Why is 2^32 in a 32-bit system = 4GiB and not 4Gib? Jun 27
4 Is this problem that's similar to integer linear programming also an NP-complete problem? Apr 23
3 Can ropes (AVL trees) be interned? Apr 21 '18
3 Merge Sort Confusion - Initial Phase Missing? Aug 18
3 How a SMT / SAT Solver Generates Valuations for this Example Jul 21 '18
3 How a Symbolic Evaluator Generates Test Input for this Example Jul 20 '18
View all questions and answers →

Badges (18)

Gold

—

Silver

4

Rarest

Bronze

14

Rarest

View all badges →