Stack Exchange

Mohammad Al-Turkistany

Saudi Arabia

turkistany.blogspot.com

Age: 42

Wild Florida Gator living in Arabia

Mohammad Al-Turkistany, Ph.D. in Computer Engineering, University of Florida

Chairman of Computer Engineering Department, Umm Al-Qura University, Saudi Arabia

"The reasonable man adapts himself to the world; the unreasonable persists in trying to adapt the world to himself. Therefore all progress depends on the unreasonable".

George Bernard Shaw

top accounts reputation activity favorites subscriptions
325
259 votes
86 answers

Algorithms from the Book.

ds.algorithms soft-question ds.data-structures big-list Jun 16 at 19:36 Vincenzo
cstheory.stackexchange.com

434
242 votes
66 answers

What papers should everyone read?

big-list soft-question Aug 16 '12 at 9:00 vorushin
cstheory.stackexchange.com

132
228 votes
7 answers

Understanding the Linux kernel source

linux kernel linux-kernel source Oct 5 '12 at 6:34 ire_and_curses
unix.stackexchange.com

117
129 votes
53 answers

Major unsolved problems in theoretical computer science?

big-list open-problem Mar 31 at 21:18 Kaveh
cstheory.stackexchange.com

129
114 votes
10 answers

What is the enlightenment I'm supposed to attain after studying finite automata?

fl.formal-languages automata-theory big-picture teaching dfa Dec 26 '12 at 19:28 David
cstheory.stackexchange.com

59
99 votes
17 answers

What can I do to increase battery life on my Android device?

battery-life Oct 29 '12 at 10:56 eug
android.stackexchange.com

177
94 votes
35 answers

What videos should everybody watch?

soft-question big-list Apr 2 at 22:29 Yash
cstheory.stackexchange.com

48
88 votes
9 answers

How hard is unshuffling a string?

ds.algorithms open-problem Mar 29 at 6:19 Aryabhata
cstheory.stackexchange.com

73
77 votes
13 answers

Advice on good research practices

soft-question research-practice advice-request Nov 23 '10 at 23:12 Alessandro Cosentino
cstheory.stackexchange.com

29
75 votes
15 answers

Examples of the price of abstraction?

ds.algorithms reference-request big-list lower-bounds Apr 13 at 19:27 Community
cstheory.stackexchange.com

46
71 votes
17 answers

What are the alternative Android app markets?

alternative-markets May 25 at 8:36 Stefano
android.stackexchange.com

45
69 votes
22 answers

Problems Between P and NPC

cc.complexity-theory np-hardness big-list np-intermediate Aug 20 '11 at 14:45 Lev Reyzin
cstheory.stackexchange.com

98
64 votes
15 answers

What Lecture Notes Should Everyone Read?

reference-request soft-question big-list Jul 31 '12 at 4:02 Daniel Apon
cstheory.stackexchange.com

62
62 votes
29 answers

What are the recent TCS books whose drafts are available online?

reference-request big-list books Apr 17 at 9:37 Kaveh
cstheory.stackexchange.com

33
61 votes
5 answers

Solid applications of category theory in TCS?

pl.programming-languages lo.logic ct.category-theory Apr 2 at 5:02 tcamps
cstheory.stackexchange.com

29
55 votes
5 answers

Techniques for Reversing the Order of Quantifiers

lo.logic big-picture proof-techniques Jan 24 '11 at 12:25 Tsuyoshi Ito
cstheory.stackexchange.com

16
49 votes
15 answers

How do you choose a distribution?

linux distros bsd distribution-choice Nov 14 '12 at 18:39 Jahaic Rigeck
unix.stackexchange.com

28
49 votes
6 answers

How to get a job

soft-question career advice-request Apr 4 '12 at 19:24 Tim Sally
cstheory.stackexchange.com

18
47 votes
5 answers

Which interesting theorems in TCS rely on the Axiom of Choice? (Or alternatively, the Axiom of Determinacy?)

cc.complexity-theory lo.logic pl.programming-languages big-picture set-theory Dec 30 '10 at 20:10 Timothy Chow
cstheory.stackexchange.com

26
45 votes
11 answers

Common false beliefs in theoretical computer science

big-list examples May 17 at 13:10 user1596990
cstheory.stackexchange.com

27
45 votes
11 answers

Information Theory used to prove neat combinatorial statements?

co.combinatorics big-list it.information-theory Dec 31 '12 at 6:08 DurgaDatta
cstheory.stackexchange.com

22
45 votes
4 answers

Problems that can be used to show polynomial-time hardness results

cc.complexity-theory lower-bounds conditional-results Nov 5 '10 at 23:38 Robin Kothari
cstheory.stackexchange.com

23
45 votes
9 answers

Are research papers hard to read?

soft-question research-practice Jun 20 '12 at 23:57 Mike Samuel
cstheory.stackexchange.com

14
45 votes
23 answers

What would it take in a book to convince a rational person that it had been written by or directly inspired by a god?

epistemology theology hermeneutics May 26 at 9:55 Neil Meyer
philosophy.stackexchange.com

17
44 votes
14 answers

Where and how did computers help prove a theorem?

proofs survey examples Nov 8 '10 at 13:28 Peter Shor
cstheory.stackexchange.com

14
41 votes
6 answers

Ways for a mathematician to stay informed of current research in complexity theory

cc.complexity-theory soft-question research-practice Jan 27 '11 at 5:53 Oleksandr Bondarenko
cstheory.stackexchange.com

24
39 votes
8 answers

Powerful Algorithms too complex to implement

ds.algorithms ds.data-structures big-list implementation Jun 10 '11 at 7:21 singhsumit
cstheory.stackexchange.com

19
38 votes
11 answers

Is there an offline maps application for Android?

offline maps Apr 4 at 10:49 Flow
android.stackexchange.com

12
38 votes
4 answers

Why do we consider log-space as a model of efficient computation (instead of polylog-space) ?

cc.complexity-theory space-bounded big-picture Dec 2 '10 at 13:54 Michael Blondin
cstheory.stackexchange.com

14
38 votes
8 answers

Parameterized complexity from P to NP-hard and back again

cc.complexity-theory np-hardness big-list phase-transition Apr 29 at 15:22 vb le
cstheory.stackexchange.com

1 2 3 4 5 … 8