Avinatan Hassidim

According to our database1, Avinatan Hassidim authored at least 101 papers between 2005 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
The Limits of Incentives in Economic Matching Procedures.
Manag. Sci., 2021

Adversarial Robustness of Streaming Algorithms through Importance Sampling.
CoRR, 2021

Explaining in Style: Training a GAN to explain a classifier in StyleSpace.
CoRR, 2021

Targeted Negative Campaigning: Complexity and Approximations.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Clustering in Hypergraphs to Minimize Average Edge Service Time.
ACM Trans. Algorithms, 2020

Envy-Free Division of Land.
Math. Oper. Res., 2020

Customization scenarios for de-identification of clinical notes.
BMC Medical Informatics Decis. Mak., 2020

Active deep learning to detect demographic traits in free-form clinical notes.
J. Biomed. Informatics, 2020

Fair Allocation with Diminishing Differences.
J. Artif. Intell. Res., 2020

ML-based Flood Forecasting: Advances in Scale, Accuracy and Reach.
CoRR, 2020

Dynamic Composition for Conversational Domain Exploration.
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

An Optimal Elimination Algorithm for Learning a Best Arm.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Adversarially Robust Streaming Algorithms via Differential Privacy.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Spectral Algorithm for Shared Low-rank Matrix Regressions.
Proceedings of the 11th IEEE Sensor Array and Multichannel Signal Processing Workshop, 2020

Average-Case Competitive Ratio of Scheduling Algorithms of Multi-user Cache.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2020

Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies.
Proceedings of the Algorithmic Learning Theory, 2020

2019
Approximating Weighted and Priced Bribery in Scoring Rules.
J. Artif. Intell. Res., 2019

New Approximations for Coalitional Manipulation in Scoring Rules.
J. Artif. Intell. Res., 2019

Spectral Algorithm for Low-rank Multitask Regression.
CoRR, 2019

Learning and Generalization for Matching Problems.
CoRR, 2019

ML for Flood Forecasting at Scale.
CoRR, 2019

Towards Global Remote Discharge Estimation: Using the Few to Estimate The Many.
CoRR, 2019

Learning to Screen.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Audio De-identification - a New Entity Recognition Task.
Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2019

Personalizing ASR for Dysarthric and Accented Speech with Limited Data.
Proceedings of the Interspeech 2019, 2019

Self-similar Epochs: Value in arrangement.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Looking to listen at the cocktail party: a speaker-independent audio-visual model for speech separation.
ACM Trans. Graph., 2018

Redesigning the Israeli Medical Internship Match.
ACM Trans. Economics and Comput., 2018

Planning and Learning with Stochastic Action Sets.
CoRR, 2018

LSH Microbatches for Stochastic Gradients: Value in Rearrangement.
CoRR, 2018

Hierarchical Reinforcement Learning: Approximating Optimal Discounted TSP Using Local Policies.
CoRR, 2018

Optimization for Approximate Submodularity.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Double Auctions in Markets for Multiple Kinds of Goods.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Planning and Learning with Stochastic Action Sets.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Online Linear Quadratic Control.
Proceedings of the 35th International Conference on Machine Learning, 2018

MUDA: A Truthful Multi-Unit Double-Auction Mechanism.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Approximating Bribery in Scoring Rules.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Upward Max-Min Fairness.
J. ACM, 2017

Truthful Bilateral Trade is Impossible even with Fixed Prices.
CoRR, 2017

New Approximations for Coalitional Manipulation in General Scoring Rules.
CoRR, 2017

Redesigning the Israeli Psychology Master's Match.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Fair Allocation based on Diminishing Differences.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Robust Guarantees of Stochastic Greedy Algorithms.
Proceedings of the 34th International Conference on Machine Learning, 2017

Submodular Optimization under Noise.
Proceedings of the 30th Conference on Learning Theory, 2017

New Approximation for Borda Coalitional Manipulation.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016
Optimal In/Out TCAM Encodings of Ranges.
IEEE/ACM Trans. Netw., 2016

Local Computation Mechanism Design.
ACM Trans. Economics and Comput., 2016

The AND-OR Game.
ACM Trans. Economics and Comput., 2016

Waste Makes Haste: Bounded Time Algorithms for Envy-Free Cake Cutting with Free Disposal.
ACM Trans. Algorithms, 2016

Sorting and Selection with Imprecise Comparisons.
ACM Trans. Algorithms, 2016

Demand-flow of agents with gross-substitute valuations.
Oper. Res. Lett., 2016

Envy-Free Cake-Cutting in Two Dimensions.
CoRR, 2016

A Random-Sampling Double-Auction Mechanism.
CoRR, 2016

Negotiation in exploration-based environment.
Auton. Agents Multi Agent Syst., 2016

"Strategic" Behavior in a Strategy-proof Environment.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism.
Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

2015
Auctioning Time: Truthful Auctions of Heterogeneous Divisible Goods.
ACM Trans. Economics and Comput., 2015

Fair and Square: Cake-Cutting in Two Dimensions.
CoRR, 2015

Optimistic-Conservative Bidding in Sequential Auctions.
CoRR, 2015

An Approximate Law of One Price in Random Assignment Games.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Implementing the Wisdom of Waze.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Adapting the Social Network to Affect Elections.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Envy-Free Cake-Cutting in Two Dimensions.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

Strategy-Proof and Efficient Kidney Exchange Using a Credit Mechanism.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Quantum Multiprover Interactive Proofs with Communicating Provers.
SIAM J. Comput., 2014

Probe scheduling for efficient detection of silent failures.
Perform. Evaluation, 2014

Compressing Forwarding Tables for Datacenter Scalability.
IEEE J. Sel. Areas Commun., 2014

Stability in Large Matching Markets with Complementarities.
Oper. Res., 2014

Auctioning a cake: truthful auctions of heterogeneous divisible goods.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013
Topology discovery of sparse random graphs with few participants.
Random Struct. Algorithms, 2013

How to grow more pairs: suggesting review targets for comparison-friendly review ecosystems.
Proceedings of the 22nd International World Wide Web Conference, 2013

Joint Cache Partition and Job Assignment on Multi-core Processors.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Finding the Minimum-Weight k-Path.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Movie recommender system for profit maximization.
Proceedings of the Seventh ACM Conference on Recommender Systems, 2013

Compressing forwarding tables.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

On finding an optimal TCAM encoding scheme for packet classification.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Network utilization: The flow view.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Computing socially-efficient cake divisions.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Movie Recommender System for Profit Maximization (Short LBP).
Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

2012
Quantum money.
Commun. ACM, 2012

The AND-OR Game: Equilibrium Characterization - (Working Paper).
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

Quantum money from knots.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

How to split a flow?
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

2011
Quantum Algorithms for Testing Properties of Distributions.
IEEE Trans. Inf. Theory, 2011

Non-price equilibria in markets of discrete goods.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Matching with couples revisited.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Leaky Pseudo-Entropy Functions.
Proceedings of the Innovations in Computer Science, 2011

An Efficient Partitioning Oracle for Bounded-Treewidth Graphs.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol.
Proceedings of the Innovations in Computer Science, 2010

Cache Replacement Policies for Multicore Processors.
Proceedings of the Innovations in Computer Science, 2010

Derandomizing Algorithms on Product Distributions and Other Applications of Order-Based Extraction.
Proceedings of the Innovations in Computer Science, 2010

Robust Perfect Revenue From Perfectly Informed Players.
Proceedings of the Innovations in Computer Science, 2010

Global Alignment of Molecular Sequences via Ancestral State Reconstruction.
Proceedings of the Innovations in Computer Science, 2010

2009
Local Graph Partitions for Approximation and Testing.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008
Quantum Multi Prover Interactive Proofs with Communicating Provers.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well).
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

Broadcasting with Side Information.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2006
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005
Fast quantum byzantine agreement.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005


  Loading...