User A T - Computer Science Stack Exchange

A T

Member for 11 years, 7 months
Last seen more than a month ago

14 Answers

Score Activity Newest

7 votes

Accepted

Data structure with search, insert and delete in amortised time $O(1)$?

answered Jan 6, 2013 at 17:53

6 votes

For what kind of data are hash table operations O(1)?

answered Apr 19, 2012 at 4:31

4 votes

Most efficient known priority queue for inserts

answered Jul 19, 2012 at 15:49

4 votes

Set Similarity - Calculate Jaccard index without quadratic complexity

answered Nov 25, 2012 at 11:16

3 votes

Does there exist a priority queue with $O(1)$ extracts?

answered Jun 26, 2012 at 15:50

2 votes

Does there exist a priority queue with $O(1)$ extracts?

answered Apr 21, 2012 at 4:42

1 vote

Can every algorithm's running time be expressed as $\Theta(f(n))$?

answered Feb 13, 2013 at 15:38

0 votes

Priority queue with unique elements and sublinear time merge?

answered Mar 16, 2015 at 2:14

0 votes

Most efficient known priority queue for inserts

answered Dec 15, 2012 at 4:04

0 votes

Most efficient known priority queue for inserts

answered Jan 4, 2013 at 19:51

-1 votes

Most efficient known priority queue for inserts

answered Jan 5, 2013 at 8:59

-2 votes

Does there exist a priority queue with $O(1)$ extracts?

answered May 19, 2012 at 15:24

-2 votes

Does there exist a priority queue with $O(1)$ extracts?

answered Apr 17, 2012 at 7:42

-3 votes

An efficient data structure supporting Insert, Delete, and MostFrequent

answered Jan 23, 2013 at 15:48