Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDAvinatan Hassidim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[c71]Or Honovich, Roee Aharoni, Jonathan Herzig, Hagai Taitelbaum, Doron Kukliansy, Vered Cohen, Thomas Scialom, Idan Szpektor, Avinatan Hassidim, Yossi Matias:
TRUE: Re-evaluating Factual Consistency Evaluation. DialDoc@ACL 2022: 161-175- [i47]Or Honovich, Roee Aharoni, Jonathan Herzig, Hagai Taitelbaum, Doron Kukliansky, Vered Cohen, Thomas Scialom, Idan Szpektor, Avinatan Hassidim, Yossi Matias:
TRUE: Re-evaluating Factual Consistency Evaluation. CoRR abs/2204.04991 (2022) - 2021
- [j26]Avinatan Hassidim, Assaf Romm, Ran I. Shorrer
:
The Limits of Incentives in Economic Matching Procedures. Manag. Sci. 67(2): 951-963 (2021) - [c70]Avishai Zagoury, Orgad Keller, Avinatan Hassidim, Noam Hazon:
Targeted Negative Campaigning: Complexity and Approximations. AAAI 2021: 5768-5778 - [c69]Shlomo Hoory, Amir Feder, Avichai Tendler, Sofia Erell, Alon Peled-Cohen, Itay Laish, Hootan Nakhost, Uri Stemmer, Ayelet Benjamini, Avinatan Hassidim, Yossi Matias:
Learning and Evaluating a Differentially Private Pre-trained Language Model. EMNLP (Findings) 2021: 1178-1189 - [c68]Oran Lang, Yossi Gandelsman, Michal Yarom, Yoav Wald, Gal Elidan, Avinatan Hassidim, William T. Freeman, Phillip Isola, Amir Globerson, Michal Irani, Inbar Mosseri:
Explaining in Style: Training a GAN to explain a classifier in StyleSpace. ICCV 2021: 673-682 - [c67]Vladimir Braverman, Avinatan Hassidim, Yossi Matias, Mariano Schain, Sandeep Silwal, Samson Zhou:
Adversarial Robustness of Streaming Algorithms through Importance Sampling. NeurIPS 2021: 3544-3557 - [i46]Oran Lang, Yossi Gandelsman, Michal Yarom, Yoav Wald, Gal Elidan, Avinatan Hassidim, William T. Freeman, Phillip Isola, Amir Globerson, Michal Irani, Inbar Mosseri:
Explaining in Style: Training a GAN to explain a classifier in StyleSpace. CoRR abs/2104.13369 (2021) - [i45]Vladimir Braverman, Avinatan Hassidim, Yossi Matias, Mariano Schain, Sandeep Silwal, Samson Zhou:
Adversarial Robustness of Streaming Algorithms through Importance Sampling. CoRR abs/2106.14952 (2021) - [i44]Sella Nevo, Efrat Morin, Adi Gerzi Rosenthal, Asher Metzger, Chen Barshai, Dana Weitzner, Dafi Voloshin, Frederik Kratzert, Gal Elidan, Gideon Dror, Gregory Begelman, Grey Nearing, Guy Shalev, Hila Noga, Ira Shavitt, Liora Yuklea, Moriah Royz, Niv Giladi, Nofar Peled Levi, Ofir Reich, Oren Gilon, Ronnie Maor, Shahar Timnat, Tal Shechter, Vladimir Anisimov, Yotam Gigi, Yuval Levin, Zach Moshe, Zvika Ben-Haim, Avinatan Hassidim, Yossi Matias:
Flood forecasting with machine learning models in an operational framework. CoRR abs/2111.02780 (2021) - 2020
- [j25]Erel Segal-Halevi, Avinatan Hassidim, Haris Aziz:
Fair Allocation with Diminishing Differences. J. Artif. Intell. Res. 67: 471-507 (2020) - [j24]Amir Feder, Danny Vainstein, Roni Rosenfeld, Tzvika Hartman, Avinatan Hassidim, Yossi Matias:
Active deep learning to detect demographic traits in free-form clinical notes. J. Biomed. Informatics 107: 103436 (2020) - [j23]Tzvika Hartman, Michael D. Howell, Jeff Dean, Shlomo Hoory, Ronit Slyper, Itay Laish, Oren Gilon, Danny Vainstein, Greg Corrado, Katherine Chou, Ming Jack Po, Jutta Williams, Scott Ellis, Gavin Bee, Avinatan Hassidim, Rony Amira, Genady Beryozkin, Idan Szpektor, Yossi Matias:
Customization scenarios for de-identification of clinical notes. BMC Medical Informatics Decis. Mak. 20(1): 14 (2020) - [j22]Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann:
Envy-Free Division of Land. Math. Oper. Res. 45(3): 896-922 (2020) - [j21]Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim:
Clustering in Hypergraphs to Minimize Average Edge Service Time. ACM Trans. Algorithms 16(3): 40:1-40:28 (2020) - [c66]Tom Zahavy, Avinatan Hassidim, Haim Kaplan, Yishay Mansour:
Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies. ALT 2020: 906-934 - [c65]Daniel Berend, Shlomi Dolev, Avinatan Hassidim, Marina Kogan-Sadetsky:
Average-Case Competitive Ratio of Scheduling Algorithms of Multi-user Cache. CSCML 2020: 237-244 - [c64]Yotam Gigi, Sella Nevo, Gal Elidan, Avinatan Hassidim, Yossi Matias, Ami Wiesel:
Spectral Algorithm for Shared Low-rank Matrix Regressions. SAM 2020: 1-5 - [c63]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer:
Adversarially Robust Streaming Algorithms via Differential Privacy. NeurIPS 2020 - [c62]Avinatan Hassidim, Ron Kupfer, Yaron Singer:
An Optimal Elimination Algorithm for Learning a Best Arm. NeurIPS 2020 - [c61]Idan Szpektor, Deborah Cohen, Gal Elidan, Michael Fink, Avinatan Hassidim, Orgad Keller, Sayali Kulkarni, Eran Ofek, Sagie Pudinsky, Asaf Revach, Shimi Salant, Yossi Matias:
Dynamic Composition for Conversational Domain Exploration. WWW 2020: 872-883 - [i43]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer:
Adversarially Robust Streaming Algorithms via Differential Privacy. CoRR abs/2004.05975 (2020) - [i42]Avinatan Hassidim, Ron Kupfer, Yaron Singer:
An Optimal Elimination Algorithm for Learning a Best Arm. CoRR abs/2006.11647 (2020) - [i41]Sella Nevo, Gal Elidan, Avinatan Hassidim, Guy Shalev, Oren Gilon, Grey Nearing, Yossi Matias:
ML-based Flood Forecasting: Advances in Scale, Accuracy and Reach. CoRR abs/2012.00671 (2020)
2010 – 2019
- 2019
- [j20]Orgad Keller, Avinatan Hassidim, Noam Hazon:
New Approximations for Coalitional Manipulation in Scoring Rules. J. Artif. Intell. Res. 64: 109-145 (2019) - [j19]Orgad Keller, Avinatan Hassidim, Noam Hazon:
Approximating Weighted and Priced Bribery in Scoring Rules. J. Artif. Intell. Res. 66: 1057-1098 (2019) - [c60]Eliav Buchnik, Edith Cohen, Avinatan Hassidim, Yossi Matias:
Self-similar Epochs: Value in arrangement. ICML 2019: 841-850 - [c59]Joel Shor, Dotan Emanuel, Oran Lang, Omry Tuval, Michael P. Brenner, Julie Cattiau, Fernando Vieira, Maeve McNally, Taylor Charbonneau, Melissa Nollstadt, Avinatan Hassidim, Yossi Matias:
Personalizing ASR for Dysarthric and Accented Speech with Limited Data. INTERSPEECH 2019: 784-788 - [c58]Ido Cohn, Itay Laish, Genady Beryozkin, Gang Li, Izhak Shafran, Idan Szpektor, Tzvika Hartman, Avinatan Hassidim, Yossi Matias:
Audio De-identification - a New Entity Recognition Task. NAACL-HLT (2) 2019: 197-204 - [c57]Alon Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Shay Moran:
Learning to Screen. NeurIPS 2019: 8612-8621 - [i40]Yotam Gigi, Gal Elidan, Avinatan Hassidim, Yossi Matias, Zach Moshe, Sella Nevo, Guy Shalev, Ami Wiesel:
Towards Global Remote Discharge Estimation: Using the Few to Estimate The Many. CoRR abs/1901.00786 (2019) - [i39]Sella Nevo, Vova Anisimov, Gal Elidan, Ran El-Yaniv, Pete Giencke, Yotam Gigi, Avinatan Hassidim, Zach Moshe, Mor Schlesinger, Guy Shalev, Ajai Tirumali, Ami Wiesel, Oleg Zlydenko, Yossi Matias:
ML for Flood Forecasting at Scale. CoRR abs/1901.09583 (2019) - [i38]Alon Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Shay Moran:
Learning and Generalization for Matching Problems. CoRR abs/1902.04741 (2019) - [i37]Tom Zahavy, Avinatan Hassidim, Haim Kaplan, Yishay Mansour:
Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies. CoRR abs/1902.10140 (2019) - [i36]Ido Cohn, Itay Laish, Genady Beryozkin, Gang Li, Izhak Shafran, Idan Szpektor, Tzvika Hartman, Avinatan Hassidim, Yossi Matias:
Audio De-identification: A New Entity Recognition Task. CoRR abs/1903.07037 (2019) - [i35]Joel Shor, Dotan Emanuel, Oran Lang, Omry Tuval, Michael P. Brenner, Julie Cattiau, Fernando Vieira, Maeve McNally, Taylor Charbonneau, Melissa Nollstadt, Avinatan Hassidim, Yossi Matias:
Personalizing ASR for Dysarthric and Accented Speech with Limited Data. CoRR abs/1907.13511 (2019) - [i34]Yotam Gigi, Ami Wiesel, Sella Nevo, Gal Elidan, Avinatan Hassidim, Yossi Matias:
Spectral Algorithm for Low-rank Multitask Regression. CoRR abs/1910.12204 (2019) - 2018
- [j18]Slava Bronfman, Noga Alon, Avinatan Hassidim, Assaf Romm:
Redesigning the Israeli Medical Internship Match. ACM Trans. Economics and Comput. 6(3-4): 21:1-21:18 (2018) - [j17]Ariel Ephrat, Inbar Mosseri, Oran Lang, Tali Dekel, Kevin Wilson, Avinatan Hassidim, William T. Freeman, Michael Rubinstein:
Looking to listen at the cocktail party: a speaker-independent audio-visual model for speech separation. ACM Trans. Graph. 37(4): 112 (2018) - [c56]Orgad Keller, Avinatan Hassidim, Noam Hazon:
Approximating Bribery in Scoring Rules. AAAI 2018: 1121-1129 - [c55]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
MUDA: A Truthful Multi-Unit Double-Auction Mechanism. AAAI 2018: 1193-1201 - [c54]Alon Cohen, Avinatan Hassidim, Tomer Koren, Nevena Lazic, Yishay Mansour, Kunal Talwar:
Online Linear Quadratic Control. ICML 2018: 1028-1037 - [c53]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Double Auctions in Markets for Multiple Kinds of Goods. IJCAI 2018: 489-497 - [c52]Craig Boutilier, Alon Cohen, Avinatan Hassidim, Yishay Mansour, Ofer Meshi, Martin Mladenov, Dale Schuurmans:
Planning and Learning with Stochastic Action Sets. IJCAI 2018: 4674-4682 - [c51]Yaron Singer, Avinatan Hassidim:
Optimization for Approximate Submodularity. NeurIPS 2018: 394-405 - [i33]Tom Zahavy, Avinatan Hassidim, Haim Kaplan, Yishay Mansour:
Hierarchical Reinforcement Learning: Approximating Optimal Discounted TSP Using Local Policies. CoRR abs/1803.04674 (2018) - [i32]Eliav Buchnik, Edith Cohen, Avinatan Hassidim, Yossi Matias:
LSH Microbatches for Stochastic Gradients: Value in Rearrangement. CoRR abs/1803.05389 (2018) - [i31]Ariel Ephrat, Inbar Mosseri, Oran Lang, Tali Dekel, Kevin Wilson, Avinatan Hassidim, William T. Freeman, Michael Rubinstein:
Looking to Listen at the Cocktail Party: A Speaker-Independent Audio-Visual Model for Speech Separation. CoRR abs/1804.03619 (2018) - [i30]Craig Boutilier, Alon Cohen, Amit Daniely, Avinatan Hassidim, Yishay Mansour, Ofer Meshi, Martin Mladenov, Dale Schuurmans:
Planning and Learning with Stochastic Action Sets. CoRR abs/1805.02363 (2018) - [i29]Alon Cohen, Avinatan Hassidim, Tomer Koren, Nevena Lazic, Yishay Mansour, Kunal Talwar:
Online Linear Quadratic Control. CoRR abs/1806.07104 (2018) - 2017
- [j16]Emilie Danna, Avinatan Hassidim, Haim Kaplan, Alok Kumar, Yishay Mansour, Danny Raz, Michal Segalov:
Upward Max-Min Fairness. J. ACM 64(1): 2:1-2:24 (2017) - [c50]Orgad Keller, Avinatan Hassidim, Noam Hazon:
New Approximation for Borda Coalitional Manipulation. AAMAS 2017: 606-614 - [c49]Avinatan Hassidim, Yaron Singer:
Submodular Optimization under Noise. COLT 2017: 1069-1122 - [c48]Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim:
Clustering in Hypergraphs to Minimize Average Edge Service Time. ESA 2017: 64:1-64:14 - [c47]Avinatan Hassidim, Yaron Singer:
Robust Guarantees of Stochastic Greedy Algorithms. ICML 2017: 1424-1432 - [c46]Erel Segal-Halevi, Haris Aziz, Avinatan Hassidim:
Fair Allocation based on Diminishing Differences. IJCAI 2017: 1254-1261 - [c45]Avinatan Hassidim, Assaf Romm, Ran I. Shorrer:
Redesigning the Israeli Psychology Master's Match. EC 2017: 121-122 - [i28]Erel Segal-Halevi, Haris Aziz, Avinatan Hassidim:
Fair Allocation based on Diminishing Differences. CoRR abs/1705.07993 (2017) - [i27]Orgad Keller, Avinatan Hassidim, Noam Hazon:
New Approximations for Coalitional Manipulation in General Scoring Rules. CoRR abs/1708.04862 (2017) - [i26]Erel Segal-Halevi, Avinatan Hassidim:
Truthful Bilateral Trade is Impossible even with Fixed Prices. CoRR abs/1711.08057 (2017) - [i25]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
MUDA: A Truthful Multi-Unit Double-Auction Mechanism. CoRR abs/1712.06848 (2017) - 2016
- [j15]Israel Sofer, David Sarne, Avinatan Hassidim:
Negotiation in exploration-based environment. Auton. Agents Multi Agent Syst. 30(4): 724-764 (2016) - [j14]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Demand-flow of agents with gross-substitute valuations. Oper. Res. Lett. 44(6): 757-760 (2016) - [j13]Miklós Ajtai, Vitaly Feldman, Avinatan Hassidim, Jelani Nelson:
Sorting and Selection with Imprecise Comparisons. ACM Trans. Algorithms 12(2): 19:1-19:19 (2016) - [j12]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Waste Makes Haste: Bounded Time Algorithms for Envy-Free Cake Cutting with Free Disposal. ACM Trans. Algorithms 13(1): 12:1-12:32 (2016) - [j11]Avinatan Hassidim, Yishay Mansour, Shai Vardi:
Local Computation Mechanism Design. ACM Trans. Economics and Comput. 4(4): 21:1-21:24 (2016) - [j10]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
The AND-OR Game. ACM Trans. Economics and Comput. 5(1): 1:1-1:22 (2016) - [j9]Ori Rottenstreich, Isaac Keslassy, Avinatan Hassidim, Haim Kaplan, Ely Porat:
Optimal In/Out TCAM Encodings of Ranges. IEEE/ACM Trans. Netw. 24(1): 555-568 (2016) - [c44]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism. SAGT 2016: 260-272 - [c43]Avinatan Hassidim, Assaf Romm, Ran I. Shorrer:
"Strategic" Behavior in a Strategy-proof Environment. EC 2016: 763-764 - [i24]Avinatan Hassidim, Yaron Singer:
Submodular Optimization under Noise. CoRR abs/1601.03095 (2016) - [i23]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
A Random-Sampling Double-Auction Mechanism. CoRR abs/1604.06210 (2016) - [i22]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Demand-Flow of Agents with Gross-Substitute Valuations. CoRR abs/1607.01989 (2016) - [i21]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
SBBA: a Strongly-Budget-Balanced Double-Auction Mechanism. CoRR abs/1607.05139 (2016) - [i20]Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann:
Envy-Free Cake-Cutting in Two Dimensions. CoRR abs/1609.03938 (2016) - 2015
- [j8]Yonatan Aumann, Yair Dombb, Avinatan Hassidim:
Auctioning Time: Truthful Auctions of Heterogeneous Divisible Goods. ACM Trans. Economics and Comput. 4(1): 3:1-3:16 (2015) - [c42]Chen Hajaj, John P. Dickerson, Avinatan Hassidim, Tuomas Sandholm, David Sarne:
Strategy-Proof and Efficient Kidney Exchange Using a Credit Mechanism. AAAI 2015: 921-928 - [c41]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Envy-Free Cake-Cutting in Two Dimensions. AAAI 2015: 1021-1028 - [c40]Sigal Sina, Noam Hazon, Avinatan Hassidim, Sarit Kraus:
Adapting the Social Network to Affect Elections. AAMAS 2015: 705-713 - [c39]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal. AAMAS 2015: 901-908 - [c38]Shoshana Vasserman, Michal Feldman, Avinatan Hassidim:
Implementing the Wisdom of Waze. IJCAI 2015: 660-666 - [c37]Assaf Romm, Avinatan Hassidim:
An Approximate Law of One Price in Random Assignment Games. EC 2015: 279-280 - [c36]Slava Bronfman, Noga Alon, Avinatan Hassidim, Assaf Romm:
Redesigning the Israeli Medical Internship Match. EC 2015: 753-754 - [i19]Miklós Ajtai, Vitaly Feldman, Avinatan Hassidim, Jelani Nelson:
Sorting and Selection with Imprecise Comparisons. CoRR abs/1501.02911 (2015) - [i18]Avinatan Hassidim, Yishay Mansour:
Optimistic-Conservative Bidding in Sequential Auctions. CoRR abs/1501.07687 (2015) - [i17]Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann:
Fair and Square: Cake-Cutting in Two Dimensions. CoRR abs/1510.03170 (2015) - [i16]Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal. CoRR abs/1511.02599 (2015) - 2014
- [j7]Itai Ashlagi, Mark Braverman, Avinatan Hassidim:
Stability in Large Matching Markets with Complementarities. Oper. Res. 62(4): 713-732 (2014) - [j6]Ori Rottenstreich, Marat Radan, Yuval Cassuto, Isaac Keslassy, Carmi Arad, Tal Mizrahi, Yoram Revah, Avinatan Hassidim:
Compressing Forwarding Tables for Datacenter Scalability. IEEE J. Sel. Areas Commun. 32(1): 138-151 (2014) - [j5]Edith Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Danny Raz, Yoav Tzur:
Probe scheduling for efficient detection of silent failures. Perform. Evaluation 79: 73-89 (2014) - [j4]Michael Ben-Or, Avinatan Hassidim, Haran Pilpel:
Quantum Multiprover Interactive Proofs with Communicating Provers. SIAM J. Comput. 43(3): 987-1011 (2014) - [c35]Yonatan Aumann, Yair Dombb, Avinatan Hassidim:
Auctioning a cake: truthful auctions of heterogeneous divisible goods. AAMAS 2014: 1045-1052 - [c34]Avinatan Hassidim, Yishay Mansour, Shai Vardi:
Local computation mechanism design. EC 2014: 601-616 - [i15]Avinatan Hassidim, Assaf Romm:
An Approximate "Law of One Price" in Random Assignment Games. CoRR abs/1404.6103 (2014) - 2013
- [j3]Animashree Anandkumar, Avinatan Hassidim, Jonathan A. Kelner:
Topology discovery of sparse random graphs with few participants. Random Struct. Algorithms 43(1): 16-48 (2013) - [c33]Amos Azaria, Avinatan Hassidim, Sarit Kraus, Adi Eshkol, Ofer Weintraub, Irit Netanely:
Movie Recommender System for Profit Maximization (Short LBP). AAAI (Late-Breaking Developments) 2013 - [c32]Yonatan Aumann, Yair Dombb, Avinatan Hassidim:
Computing socially-efficient cake divisions. AAMAS 2013: 343-350 - [c31]Ori Rottenstreich, Marat Radan, Yuval Cassuto, Isaac Keslassy, Carmi Arad, Tal Mizrahi, Yoram Revah, Avinatan Hassidim:
Compressing forwarding tables. INFOCOM 2013: 1231-1239 - [c30]Avinatan Hassidim, Danny Raz, Michal Segalov, Ariel Shaqed:
Network utilization: The flow view. INFOCOM 2013: 1429-1437 - [c29]Ori Rottenstreich, Isaac Keslassy, Avinatan Hassidim, Haim Kaplan, Ely Porat:
On finding an optimal TCAM encoding scheme for packet classification. INFOCOM 2013: 2049-2057 - [c28]Amos Azaria, Avinatan Hassidim, Sarit Kraus, Adi Eshkol, Ofer Weintraub, Irit Netanely:
Movie recommender system for profit maximization. RecSys 2013: 121-128 - [c27]Avinatan Hassidim, Haim Kaplan, Omry Tuval:
Joint Cache Partition and Job Assignment on Multi-core Processors. WADS 2013: 378-389 - [c26]Avinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty:
Finding the Minimum-Weight k-Path. WADS 2013: 390-401 - [c25]James Cook, Alex Fabrikant, Avinatan Hassidim:
How to grow more pairs: suggesting review targets for comparison-friendly review ecosystems. WWW 2013: 237-248 - [i14]Edith Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Danny Raz, Yoav Tzur:
Probe Scheduling for Efficient Detection of Silent Failures. CoRR abs/1302.0792 (2013) - [i13]Avinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty:
Finding the Minimum-Weight k-Path. CoRR abs/1307.2415 (2013) - [i12]Avinatan Hassidim, Yishay Mansour, Shai Vardi:
Local computation mechanism design. CoRR abs/1311.3939 (2013) - 2012
- [j2]Scott Aaronson, Edward Farhi, David Gosset, Avinatan Hassidim, Jonathan A. Kelner, Andrew Lutomirski:
Quantum money. Commun. ACM 55(8): 84-92 (2012) - [c24]Israel Sofer, David Sarne, Avinatan Hassidim:
Negotiation in Exploration-Based Environment. AAAI 2012 - [c23]Tzvika Hartman, Avinatan Hassidim, Haim Kaplan, Danny Raz, Michal Segalov:
How to split a flow? INFOCOM 2012: 828-836 - [c22]Emilie Danna, Avinatan Hassidim, Haim Kaplan, Alok Kumar, Yishay Mansour, Danny Raz, Michal Segalov:
Upward Max Min Fairness. INFOCOM 2012: 837-845 - [c21]Bohua Zhan, Shelby Kimmel, Avinatan Hassidim:
Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure. ITCS 2012: 249-265 - [c20]Edward Farhi, David Gosset, Avinatan Hassidim, Andrew Lutomirski, Peter W. Shor:
Quantum money from knots. ITCS 2012: 276-289 - [c19]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
The AND-OR Game: Equilibrium Characterization - (Working Paper). WINE 2012: 561 - [i11]Yonatan Aumann, Yair Dombb, Avinatan Hassidim:
Computing Socially-Efficient Cake Divisions. CoRR abs/1205.3982 (2012) - [i10]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
The AND-OR game: Equilibrium Characterization (Working Paper). CoRR abs/1210.1757 (2012) - [i9]Avinatan Hassidim, Haim Kaplan, Omry Tuval:
Joint Cache Partition and Job Assignment on Multi-Core Processors. CoRR abs/1210.4053 (2012) - 2011
- [j1]Sergey Bravyi, Aram W. Harrow, Avinatan Hassidim:
Quantum Algorithms for Testing Properties of Distributions. IEEE Trans. Inf. Theory 57(6): 3971-3981 (2011) - [c18]Alan Edelman, Avinatan Hassidim, Huy N. Nguyen, Krzysztof Onak:
An Efficient Partitioning Oracle for Bounded-Treewidth Graphs. APPROX-RANDOM 2011: 530-541 - [c17]Mark Braverman, Avinatan Hassidim, Yael Tauman Kalai:
Leaky Pseudo-Entropy Functions. ICS 2011: 353-366 - [c16]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
Non-price equilibria in markets of discrete goods. EC 2011: 295-296 - [c15]Itai Ashlagi, Mark Braverman, Avinatan Hassidim:
Matching with couples revisited. EC 2011: 335-336 - [c14]Animashree Anandkumar, Avinatan Hassidim, Jonathan A. Kelner:
Topology discovery of sparse random graphs with few participants. SIGMETRICS 2011: 293-304 - [i8]Animashree Anandkumar, Avinatan Hassidim, Jonathan A. Kelner:
Topology Discovery of Sparse Random Graphs With Few Participants. CoRR abs/1102.5063 (2011) - [i7]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
Non-Price Equilibria in Markets of Discrete Goods. CoRR abs/1103.3950 (2011) - [i6]Alan Edelman, Avinatan Hassidim, Huy N. Nguyen, Krzysztof Onak:
An Efficient Partitioning Oracle for Bounded-Treewidth Graphs. CoRR abs/1106.4587 (2011) - 2010
- [c13]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 - [c12]