Stack Exchange

Alex ten Brink

Utrecht, The Netherlands

I work at IMC Financial Markets since 2016.

I'm a graduee of the university of Technology in Eindhoven, The Netherlands.

Publications:

  • Computing the Greedy Spanner in Linear Space - ESA2013, co-won best paper award.
  • Distribution-Sensitive Construction of the Greedy Spanner - ESA2014
  • A Framework for Computing the Greedy Spanner - SOCG2014
top accounts reputation activity favorites subscriptions
Top Questions
66 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

46 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

42 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

37 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

30 votes

Hash tables versus binary trees

algorithms data-structures binary-trees hash-tables asked Mar 13 '12 at 0:30
cs.stackexchange.com

28 votes

Is there a 'string stack' data structure that supports these string operations?

data-structures time-complexity strings stack asked Mar 22 '12 at 17:49
cs.stackexchange.com

25 votes

Does there exist an extension of regular expressions that captures the context free languages?

fl.formal-languages context-free context-free-languages asked Mar 17 '13 at 11:11
cstheory.stackexchange.com

23 votes

Is there an expressiveness hierarchy for type systems?

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

23 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

23 votes

Is there an equivalent of van Emde Boas trees for ropes?

data-structures asked Mar 9 '12 at 12:47
cs.stackexchange.com

1 2 3

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

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

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

43
What are the main advantages and disadvantages of LL and LR parsing?
softwareengineering.stackexchange.com

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

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

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

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

23
Can anyone help solve this complex algorithmic problem?
softwareengineering.stackexchange.com

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

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

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

18
Too many loops in Drawing App
codereview.stackexchange.com

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

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

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

15
Differences and relationships between randomized and nondeterministic algorithms?
cs.stackexchange.com

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

15
Bellman-Ford algorithm - Why can edges be updated out of order?
cs.stackexchange.com

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

13
Max-Cut algorithm that shouldn't work, unclear why
cstheory.stackexchange.com

13
One Stack, Two Queues
cstheory.stackexchange.com

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

12
One Stack, Two Queues
cstheory.stackexchange.com

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

11
Complexity of Special Case Problems
cs.stackexchange.com

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

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

10
How is this grammar LL(1)?
cs.stackexchange.com

10
Efficient compression of unlabeled trees
cs.stackexchange.com

1 2