jbapple's user avatar
jbapple's user avatar
jbapple's user avatar
jbapple
  • Member for 12 years, 1 month
  • Last seen more than a week ago
0 votes
Accepted

Probability of comparison of two nodes after insertion in AVL tree

1 vote

Perfect ordered hash function on ordered sequence

2 votes
Accepted

Efficiently count distinct in large range

0 votes

Amortized analysis on a dynamic table that grows its size by $\sqrt{size} $

2 votes

Universal family of hash functions — dependent on table size?

1 vote

Name for type of actions that only care for outcome

2 votes

How to prove that insert complexity in binary search tree is minimum O(log n)?

0 votes
Accepted

What is the name of a sequence structure where writes in the same area are faster?

2 votes
Accepted

Does this data structure already exist?

1 vote
Accepted

Integer set disjointness query on sketches with something like homomorphic hashing

3 votes
Accepted

How to maintain completely dynamic convex hull quickly?

1 vote

How do 2-3 FingerTrees generalize to bigger branching factors?

1 vote

Simple Uniform Hashing Assumption and worst-case complexity for hash tables

3 votes
Accepted

An online algorithm to maintain the Pareto frontier elements

1 vote
Accepted

Suffix array construction algorithm linear complexity constant

2 votes
Accepted

Linear time algorithm to sort points of a simple polygon

1 vote

supply a matching data structure that supports MakeEmpty, Insert and DeleteFreq

3 votes

print the nodes of an immutable single-linked list in reverse order

7 votes
Accepted

Why $e(C_i) = D_i$ is correct assumption? (FLP Impossibility 1985 - Lemma 3)

2 votes
Accepted

Succinct bounded-sum array with $O(1)$ access

16 votes
Accepted

Finding k'th smallest element from a given sequence only with O(k) memory O(n) time

3 votes

weight balanced binary tree vs height balanced binary tree

4 votes

Hash functions and pathological data sets

2 votes

Using persistence on a constant database

2 votes
Accepted

Checking whether a number divides any of a set of other numbers

2 votes

Simple pseudorandom split of data

1 vote

Is this some kind of hashing?

3 votes
Accepted

Is it possible to build a heap from the root to the leaves?

2 votes

Keeping a binary search tree by splitting nodes (like a B-Tree)

4 votes

Merkle tree collision probability