#### Filter Results:

- Full text PDF available (49)

#### Publication Year

2005

2019

- This year (14)
- Last 5 years (51)
- Last 10 years (95)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Aram Wettroth Harrow, Avinatan Hassidim, Seth Lloyd
- Physical review letters
- 2009

Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix A and a vector b(-->), find a vector x(-->) such thatâ€¦ (More)

We study markets of indivisible items in which price-based (Walrasian) equilibria often do not exist due to the discrete non-convex setting. Instead we consider Nash equilibria of the market viewedâ€¦ (More)

- Noga Alon, Avinatan Hassidim, Eyal Lubetzky, Uri Stav, Amit Weinstein
- 49th Annual IEEE Symposium on Foundations ofâ€¦
- 2008

A sender holds a word x consisting of n blocks xi, each of t bits, and wishes to broadcast a codeword to m receivers, R1,...,Rm. Each receiver Ri is interested in one block, and has prior sideâ€¦ (More)

- Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguyen, Krzysztof Onak
- 50th Annual IEEE Symposium on Foundations ofâ€¦
- 2009

We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs with an excluded minor,â€¦ (More)

- Sergey Bravyi, Aram Wettroth Harrow, Avinatan Hassidim
- STACS
- 2010

- Avinatan Hassidim
- ICS
- 2010

Almost all of the modern computers use multiple cores, and the number of cores is expected to increase as hardware prices go down, and Mooreâ€™s law fails to hold. Most of the theoretical algorithmicâ€¦ (More)

We design a Generalized Position Auction for players with private values and private budget constraints. Our mechanism is a careful modification of the Generalized English Auction of Edelman,â€¦ (More)

- Michael Ben-Or, Claude CrÃ©peau, Daniel Gottesman, Avinatan Hassidim, Adam D. Smith
- 47th Annual IEEE Symposium on Foundations ofâ€¦
- 2006

Secret sharing and multiparty computation (also called "secure function evaluation") are fundamental primitives in modern cryptography, allowing a group of mutually distrustful players to performâ€¦ (More)

Consider an environment with a finite number of alternatives, and agents with private values and quasi-linear utility functions. A domain of valuation functions for an agent is a monotonicity domainâ€¦ (More)

A mechanism is said to be strategy-proof if no agent has an incentive to misrepresent her true preferences. This property is considered highly desirable for mechanisms that are used in real-lifeâ€¦ (More)