jbapple's user avatar
jbapple's user avatar
jbapple's user avatar
jbapple
  • Member for 13 years, 8 months
  • Last seen this week
606 votes
Accepted

What's new in purely functional data structures since Okasaki?

20 votes

What's the difference between ADTs, GADTs, and inductive types?

16 votes

Powerful Algorithms too complex to implement

16 votes
Accepted

Bootstrapping a Finger Tree Structure

13 votes
Accepted

Complexity of blind sort?

12 votes
Accepted

Fun with inverse Ackermann

12 votes
Accepted

Purely Functional Equivalent of B-Tree?

11 votes

Can we prove weak normalization for System F by induction on a transfinite ordinal

11 votes
Accepted

Does there exist a data structure for quick list manipulation and order queries?

11 votes

I dreamt of a data structure, does it exist?

10 votes
Accepted

Set data structure for efficient repeated insertions

9 votes
Accepted

Difference lists in functional programming

8 votes

Curry-Howard and programs from non-constructive proofs

8 votes
Accepted

How high are the higher types that appear in practice?

7 votes
Accepted

Improving Bloom filter - can we distinguish elements of a database using less than 2.33275 bits/element?

7 votes

What is the theoretical basis of imperative programming?

7 votes
Accepted

Optimal Self Balancing Trees with Canonical Form?

6 votes

How can we know that formal methods work?

6 votes

Lower Bounds for Data Structures

6 votes

What are the most known database disk storage layout algorithms?

6 votes

Starting point for cache-oblivious algorithms?

6 votes
Accepted

Maintaining order in a list in $AC^0$ in $O(1)$ time

6 votes
Accepted

Can three stacks be implemented in one array, with O(1) push/pop time?

6 votes

Data structure for dynamic memory allocation

5 votes
Accepted

Why use two separate tables in cuckoo hashing?

5 votes

Minimal encoding of a set (unordered collection of elements)?

5 votes

Optimal encoding of $k$-subsets of $n$

5 votes
Accepted

Lower bounds on simple hash table operations?

5 votes
Accepted

Almost universal string hashing in $Z_{2^n}$ and sublinear space

5 votes
Accepted

Heapsort:Heaps =~ Quicksort:BSTs =~ Mergesort:___?