Skip to main content
Vk1's user avatar
Vk1's user avatar
Vk1's user avatar
Vk1
  • Member for 11 years, 3 months
  • Last seen more than a month ago
4 votes
1 answer
2k views

Dynamic Data structure for All nearest smaller values

3 votes
1 answer
132 views

Necessary and sufficient number of comparisons by every element to fully sort a set of n elements? [duplicate]

2 votes
0 answers
105 views

Can you partially sort using $O(\log n)$ comparisons per element?

1 vote
2 answers
432 views

How do top researchers keep track new results in datastructures

1 vote
1 answer
248 views

Give a simple way to augment Van emde boas tree, to find/delete median in O(log log u) time

1 vote
1 answer
199 views

Decomposition of a permutation into increasing subsequences

0 votes
0 answers
122 views

Creating a random tree (BST) on $n$ elements using a random sequence of zeroes and ones

-1 votes
1 answer
139 views

What are the known classes of undirected graphs such that every graph belonging to that class is guaranteed to have a Hamiltonian Path?

-3 votes
1 answer
218 views

Is finding a solution harder than verifying a solution? [closed]

-4 votes
2 answers
232 views

A sandwich Algorithm / Data Structure [closed]