Search Results

Since none of the comments gave the concrete answer, I'll write it explicitly here in case anyone needs it (like I did). Firstly, unfortunately, the inverse of a band-limited matrix is a full (non-ba …

I think I have a solution. It's totally symmetric with no coordination. Each arbiter runs the following algorithm to choose their comparisons. First, they consider evenly dividing n into k "sections" …

I think I've thought up a solution. First, do a first pass with any decent sorting algorithm you want (like quicksort), which should, at worst, result in only one item that's significantly far from wh …

I want to sort a list of n items with a comparison sort. However, one of the comparisons made by the algorithm will be flipped from what it's supposed to be. Specifically, there is one pair of items f …

I want to sort a list of n items from pairwise comparisons. Each round, I receive k comparisons, one each from k different "arbiters". The arbiters cannot coordinate, and must choose their comparisons …

You have n items x[0], ..., x[n-1]. Beforehand, you're given a list of several comparisons c[0], ..., c[k] for those items (e.g. c[0] = (x[0] < x[4]), c[1] = (x[3] > x[7]), etc.). The objective is to …

You have a list of $n$ items you want to sort over $r$ rounds using binary comparisons. In each round, you specify $k$ binary comparisons to be made in parallel. The objective is to fully sort the lis …

Are there any TSP algorithms with decently efficient run-times given in terms of these alternative metrics for the graph "size"? Approximate algorithms are fine too, I think. …

A contiguous single polygon is specified by it's vertices $(v_1, \ldots, v_n)$, given in order such that the line between $v_i$ and $v_{i+1}$ is an edge of the polygon (there's also an edge between $v …

LogLog/HyperLogLog provides a great way for estimating the cardinality of the set of $n$ objects. At its simplest, you hash all $n$ objects into binary strings, find the largest number of leading 0's …