Stack Exchange

Alex ten Brink

Eindhoven, The Netherlands

http://-

Age: 22

I'm a 1st year graduate student at the university of Technology in Eindhoven, The Netherlands.

top accounts reputation activity favorites subscriptions
Top Questions
45 votes

Are $PSPACE$-complete problems inherently less tractable than $NP$-complete problems?

cc.complexity-theory np-hardness big-picture asked Mar 7 '11 at 13:52
cstheory.stackexchange.com

32 votes

'Delegate 'System.Action' does not take 0 arguments.' Is this a C# compiler bug (lambdas + two projects)?

c# compiler-errors lambda-functions compiler-bug asked Dec 17 '10 at 1:04
stackoverflow.com

26 votes

What do we know about provably correct programs?

reference-request complexity-classes computability pl.programming-languages asked Jan 1 '11 at 16:56
cstheory.stackexchange.com

23 votes

Does there exist a priority queue with $O(1)$ extracts?

data-structures amortized-analysis priority-queues asked Mar 19 '12 at 14:31
cs.stackexchange.com

20 votes

Can a fully homomorphic encryption be used for oblivious code execution?

cr.crypto-security homomorphic-encryption obfuscation asked Nov 11 '10 at 10:55
cstheory.stackexchange.com

20 votes

Can all unambiguous grammars be parsed in linear time?

reference-request fl.formal-languages time-complexity parsing context-free asked Mar 1 '12 at 21:56
cstheory.stackexchange.com

16 votes

Is there an expressiveness hierarchy for type systems?

pl.programming-languages type-theory asked Sep 15 '11 at 8:53
cstheory.stackexchange.com

16 votes

CFG parsing using $o(n^2)$ space

ds.algorithms fl.formal-languages space-bounded parsing context-free asked Oct 21 '11 at 10:31
cstheory.stackexchange.com

16 votes

Why can't the meaning of a base class specification recursively depend on itself in C#?

c# generics inheritance asked Jan 7 '12 at 0:47
stackoverflow.com

15 votes

Is there any nongeneral CFG parsing algorithm that recognises EPAL?

formal-languages formal-grammars parsers asked Mar 7 '12 at 16:56
cs.stackexchange.com

1 2 3

Top Answers
26
Why is quicksort better than other sorting algorithms in practice?
cs.stackexchange.com

23
Language theoretic comparison of LL and LR grammars
cs.stackexchange.com

23
What is the most powerful kind of parser?
cstheory.stackexchange.com

18
Should I use a parser generator or should I roll my own custom lexer and parser code?
programmers.stackexchange.com

18
What are the main advantages and disadvantages of LL and LR parsing?
programmers.stackexchange.com

17
Can anyone help solve this complex algorithmic problem?
programmers.stackexchange.com

16
What is the significance of context-sensitive (Type 1) languages?
cs.stackexchange.com

15
Are there inherently ambiguous and deterministic context-free languages?
cs.stackexchange.com

15
Is an infinite union of context-free languages always context-free?
cs.stackexchange.com

14
Determining capabilities of a min-heap (or other exotic) state machines
cs.stackexchange.com

14
What is the enlightenment I'm supposed to attain after studying finite automata?
cstheory.stackexchange.com

11
Complexity of Special Case Problems
cs.stackexchange.com

10
Is this language defined using twin primes regular?
cs.stackexchange.com

10
Why would one ever use an Octree over a KD-tree?
cstheory.stackexchange.com

9
Parsing arbitrary context-free grammars, mostly short snippets
cs.stackexchange.com

9
In-place algorithm for interleaving an array
cs.stackexchange.com

9
Dinner-table description of theoretical computer science?
cstheory.stackexchange.com

9
How to improve very loopy method?
codereview.stackexchange.com

8
Is Directed Graph a Graph?
cs.stackexchange.com

8
For every computable function $f$ does there exist a problem that can be solved at best in $\Theta(f(n))$ time?
cs.stackexchange.com

8
Why is Relativization a barrier?
cs.stackexchange.com

8
Is there any way to distinguish between LL(k) and LR(k) grammar?
cs.stackexchange.com

8
One Stack, Two Queues
cstheory.stackexchange.com

8
Do the undecidable attributes of P pose an obstruction to deciding P versus NP? (answer: maybe)
cstheory.stackexchange.com

7
Efficient compression of unlabeled trees
cs.stackexchange.com

7
Generating uniformly distributed random numbers using a coin
cs.stackexchange.com

7
Branch and Bound explanation
cs.stackexchange.com

7
HALF CLIQUE - NP Complete Problem
cs.stackexchange.com

7
When to use recursion?
cs.stackexchange.com

7
Differences and relations between randomized and nondeterministic algorithms?
cs.stackexchange.com

1 2