![]() | ![]() |
| 2012 | ||
|---|---|---|
| 31 | Tzvika Hartman, Avinatan Hassidim, Haim Kaplan, Danny Raz, Michal Segalov: How to split a flow? INFOCOM 2012: 828-836 | |
| 30 | Emilie Danna, Avinatan Hassidim, Haim Kaplan, Alok Kumar, Yishay Mansour, Danny Raz, Michal Segalov: Upward Max Min Fairness. INFOCOM 2012: 837-845 | |
| 29 | Bohua Zhan, Shelby Kimmel, Avinatan Hassidim: Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure. ITCS 2012: 249-265 | |
| 28 | Edward Farhi, David Gosset, Avinatan Hassidim, Andrew Lutomirski, Peter W. Shor: Quantum money from knots. ITCS 2012: 276-289 | |
| 2011 | ||
| 27 | Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan: Non-price equilibria in markets of discrete goods. ACM Conference on Electronic Commerce 2011: 295-296 | |
| 26 | Itai Ashlagi, Mark Braverman, Avinatan Hassidim: Matching with couples revisited. ACM Conference on Electronic Commerce 2011: 335-336 | |
| 25 | Alan Edelman, Avinatan Hassidim, Huy N. Nguyen, Krzysztof Onak: An Efficient Partitioning Oracle for Bounded-Treewidth Graphs. APPROX-RANDOM 2011: 530-541 | |
| 24 | Mark Braverman, Avinatan Hassidim, Yael Tauman Kalai: Leaky Pseudo-Entropy Functions. ICS 2011: 353-366 | |
| 23 | Animashree Anandkumar, Avinatan Hassidim, Jonathan A. Kelner: Topology discovery of sparse random graphs with few participants. SIGMETRICS 2011: 293-304 | |
| 22 | Animashree Anandkumar, Avinatan Hassidim, Jonathan A. Kelner: Topology Discovery of Sparse Random Graphs With Few Participants CoRR abs/1102.5063: (2011) | |
| 21 | Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan: Non-Price Equilibria in Markets of Discrete Goods CoRR abs/1103.3950: (2011) | |
| 20 | Alan Edelman, Avinatan Hassidim, Huy N. Nguyen, Krzysztof Onak: An Efficient Partitioning Oracle for Bounded-Treewidth Graphs CoRR abs/1106.4587: (2011) | |
| 19 | Sergey Bravyi, Aram Wettroth Harrow, Avinatan Hassidim: Quantum Algorithms for Testing Properties of Distributions. IEEE Transactions on Information Theory 57(6): 3971-3981 (2011) | |
| 2010 | ||
| 18 | Andrew Lutomirski, Scott Aaronson, Edward Farhi, David Gosset, Jonathan A. Kelner, Avinatan Hassidim, Peter W. Shor: Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol. ICS 2010: 20-31 | |
| 17 | Alexandr Andoni, Constantinos Daskalakis, Avinatan Hassidim, Sébastien Roch: Global Alignment of Molecular Sequences via Ancestral State Reconstruction. ICS 2010: 358-369 | |
| 16 | Ariel Gabizon, Avinatan Hassidim: Derandomizing Algorithms on Product Distributions and Other Applications of Order-Based Extraction. ICS 2010: 397-405 | |
| 15 | Avinatan Hassidim: Cache Replacement Policies for Multicore Processors. ICS 2010: 501-509 | |
| 14 | Jing Chen, Avinatan Hassidim, Silvio Micali: Robust Perfect Revenue From Perfectly Informed Players. ICS 2010: 94-105 | |
| 13 | Sergey Bravyi, Aram Wettroth Harrow, Avinatan Hassidim: Quantum Algorithms for Testing Properties of Distributions. STACS 2010: 131-142 | |
| 12 | Edward Farhi, David Gosset, Avinatan Hassidim, Andrew Lutomirski, Peter W. Shor: Quantum money from knots CoRR abs/1004.5127: (2010) | |
| 11 | Itai Ashlagi, Mark Braverman, Avinatan Hassidim: Matching with Couples Revisited CoRR abs/1011.2121: (2010) | |
| 2009 | ||
| 10 | Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguyen, Krzysztof Onak: Local Graph Partitions for Approximation and Testing. FOCS 2009: 22-31 | |
| 9 | Miklós Ajtai, Vitaly Feldman, Avinatan Hassidim, Jelani Nelson: Sorting and Selection with Imprecise Comparisons. ICALP (1) 2009: 37-48 | |
| 8 | Sergey Bravyi, Aram Wettroth Harrow, Avinatan Hassidim: Quantum algorithms for testing properties of distributions CoRR abs/0907.3920: (2009) | |
| 7 | Alexandr Andoni, Constantinos Daskalakis, Avinatan Hassidim, Sébastien Roch: Global Alignment of Molecular Sequences via Ancestral State Reconstruction CoRR abs/0912.2577: (2009) | |
| 2008 | ||
| 6 | Michael Ben-Or, Avinatan Hassidim: The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well). FOCS 2008: 221-230 | |
| 5 | Michael Ben-Or, Avinatan Hassidim, Haran Pilpel: Quantum Multi Prover Interactive Proofs with Communicating Provers. FOCS 2008: 467-476 | |
| 4 | Noga Alon, Eyal Lubetzky, Uri Stav, Amit Weinstein, Avinatan Hassidim: Broadcasting with Side Information. FOCS 2008: 823-832 | |
| 3 | Noga Alon, Avinatan Hassidim, Eyal Lubetzky, Uri Stav, Amit Weinstein: Broadcasting with side information CoRR abs/0806.3246: (2008) | |
| 2006 | ||
| 2 | Michael Ben-Or, Claude Crépeau, Daniel Gottesman, Avinatan Hassidim, Adam Smith: Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority. FOCS 2006: 249-260 | |
| 2005 | ||
| 1 | Michael Ben-Or, Avinatan Hassidim: Fast quantum byzantine agreement. STOC 2005: 481-485 | |
Colors in the list of coauthors
Last update Thu May 31 18:55:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page