Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.

Sign up to join this community
Anybody can ask a question
Anybody can answer
The best answers are voted up and rise to the top

Explore our questions

0 votes
1 answer
56 views

Probability of comparison of two nodes after insertion in AVL tree

2 votes
2 answers
83 views

Data structure to estimate the frequency of low frequency elements

0 votes
0 answers
20 views

What the algorith should return and how to implement

0 votes
1 answer
33 views

What are common heuristic algorithms of self-organizing list?

1 vote
1 answer
59 views

Another Game Theory Problem

2 votes
1 answer
153 views

Retrieving the cheapest path of a graph with time-dependent edge weights

2 votes
1 answer
422 views

Proof of Fenwick Tree's correctness

0 votes
2 answers
24 views

Convert lower-left matrix triangle 1D index to row, column

-2 votes
1 answer
43 views

Is there an algorithm that can get the minimal element of a min-heap in O(log* n)?

0 votes
1 answer
48 views

Asking server for range of documents -- how to ask as few times as possible based on what is already in memory?

1 vote
1 answer
42 views

Find MST with bounded edge weight in O(|V|+|E|)

1 vote
1 answer
49 views

What data structure/s can I use for fastest lookup of a permutation between two arrays of pairs (preserving order)?

1 vote
1 answer
154 views

Interval Tree by Augmenting an AVL Tree

2 votes
1 answer
2k views

Find maximum length subarray whose bitwise AND is at least $k$ in $o(n^2)$

Browse more Questions