#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2011

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Hoda Bidkhori, Shaunak Kishore
- Combinatorics, Probability & Computing
- 2011

Combinatorics, Probability and Computing / Volume 20 / Issue 01 / January 2011, pp 11 25 DOI: 10.1017/S0963548310000192, Published online: 21 July 2010 Link to this article: http://journals.cambridge.org/abstract_S0963548310000192 How to cite this article: HODA BIDKHORI and SHAUNAK KISHORE (2011). A Bijective Proof of a Theorem of Knuth. Combinatorics,… (More)

- Paul Christiano, Erik D. Demaine, Shaunak Kishore
- WADS
- 2011

We develop the first dynamic data structures that tolerate δ memory faults, lose no data, and incur only an Õ(δ) additive overhead in overall space and time per operation. We obtain such data structures for arrays, linked lists, binary search trees, interval trees, predecessor search, and suffix trees. Like previous data structures, δ must be known in… (More)

When users search online for a business, the search engine may present them with a list of related business recommendations. We address the problem of constructing a useful and diverse list of such recommendations that would include an optimal combination of substitutes and complements. Substitutes are similar potential alternatives to the searched… (More)

We obtain improved running times for two algorithms for clustering data: the expectationmaximization (EM) algorithm and Lloyd's algorithm. The EM algorithm is a heuristic for finding a mixture of k normal distributions in Rd that maximizes the probability of drawing n given data points. Lloyd's algorithm is a special case of this algorithm in which the… (More)

- Christiano, Paul, +5 authors Paul Christiano
- 2011

We develop the first dynamic data structures that tolerate δ memory faults, lose no data, and incur only an Õ(δ) additive overhead in overall space and time per operation. We obtain such data structures for arrays, linked lists, binary search trees, interval trees, predecessor search, and suffix trees. Like previous data structures, δ must be known in… (More)

- ‹
- 1
- ›