#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2016

2018

- This year (13)
- Last 5 years (17)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Venkata Gandikota, Elena Grigorescu, Sidharth Jaggi, Samson Zhou
- 2016 54th Annual Allerton Conference on…
- 2016

Group testing is the process of pooling arbitrary subsets from a set of n items so as to identify, with a minimal number of disjunctive tests, a “small” subset of d defective items. In “classical”… (More)

- Jeremiah Blocki, Samson Zhou
- TCC
- 2017

Argon2i is a data-independent memory hard function that won the password hashing competition. The password hashing algorithm has already been incorporated into several open source crypto libraries… (More)

- Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
- APPROX-RANDOM
- 2017

We study the problem of finding all k-periods of a length-n string S, presented as a data stream. S is said to have k-period p if its prefix of length n− p differs from its suffix of length n− p in… (More)

- Jeremiah Blocki, Samson Zhou
- ArXiv
- 2016

We consider the computational complexity of finding a legal black pebbling of a DAG G = (V, E) with minimum cumulative cost. A black pebbling is a sequence P0, . . . , Pt ⊆ V of sets of nodes which… (More)

- Elena Grigorescu, Morteza Monemizadeh, Samson Zhou
- ArXiv
- 2016

We consider the problem of approximating a maximum weighted matching, when the edges of an underlying weighted graph G(V, E) are revealed in a streaming fashion. We analyze a variant of the… (More)

- Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
- FSTTCS
- 2017

A palindrome is a string that reads the same as its reverse, such as “aibohphobia” (fear of palindromes). Given an integer d > 0, a d-near-palindrome is a string of Hamming distance at most d from… (More)

We develop an economic model of an offline password cracker which allows us to make quantitative predictions about the fraction of accounts that a rational password attacker would crack in the event… (More)

We study the distinct elements and lp-heavy hitters problems in the sliding window model, where only the most recent n elements in the data stream form the underlying set. We first introduce the… (More)

15 We study variants of locally decodable and locally correctable codes in computationally 16 bounded, adversarial channels, under the assumption that collision-resistant hash functions exist, 17 and… (More)

- Jeremiah Blocki, Ling Ren, Samson Zhou
- IACR Cryptology ePrint Archive
- 2018

Memory Hard Functions (MHFs) have been proposed as an answer to the growing inequality between the computational speed of general purpose CPUs and Application Specific Integrated Circuits (ASICs).… (More)