User Vk1

4 votes

1 answer

2k views

Dynamic Data structure for All nearest smaller values

asked Mar 3, 2013 at 11:07

3 votes

1 answer

133 views

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

asked May 12, 2017 at 12:58

2 votes

0 answers

108 views

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

asked Sep 22, 2019 at 6:39

1 vote

2 answers

436 views

How do top researchers keep track new results in datastructures

asked Apr 28, 2013 at 17:50

1 vote

1 answer

252 views

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

asked Apr 28, 2013 at 17:56

1 vote

1 answer

238 views

Decomposition of a permutation into increasing subsequences

asked Jul 13, 2022 at 11:47

0 votes

0 answers

127 views

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

asked Apr 14, 2021 at 17:34

-1 votes

1 answer

144 views

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

asked May 2, 2021 at 15:29

-3 votes

1 answer

226 views

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

asked May 11, 2017 at 13:26

-4 votes

2 answers

233 views

A sandwich Algorithm / Data Structure [closed]

asked Oct 3, 2019 at 8:18

Stack Exchange Network

10 Questions

Dynamic Data structure for All nearest smaller values

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

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

How do top researchers keep track new results in datastructures

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

Decomposition of a permutation into increasing subsequences

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

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

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

A sandwich Algorithm / Data Structure [closed]