Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract) - Yonatan Aumann; Michael Ben-Or (FOCS, 1991)

Improved Memory Utilization in Deterministic PRAM Simulation. - Yonatan Aumann; Assaf Schuster (J. Parallel Distributed Comput., 1991)

Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract) - Yonatan Aumann; Michael O. Rabin (FOCS, 1992)

Computing with Faulty Arrays - Yonatan Aumann; Michael Ben-Or (STOC, 1992)

On Message Proof Systems with Known Space Verifiers. - Yonatan Aumann; Uriel Feige (CRYPTO, 1993)

Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs - Yonatan Aumann; Zvi M. Kedem; Krishna V. Palem; Michael O. Rabin (FOCS, 1993)

Computing with low degree networks: shared memory implementation and dynamic Fault-Tolerance (חשוב מקבילי ברשתות דלילות.). - Yonatan Aumann (1993)

Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation. - Yonatan Aumann; Michael O. Rabin (Theor. Comput. Sci., 1994)

Improved Bounds for All Optical Routing. - Yonatan Aumann; Yuval Rabani (SODA, 1995)

Fault Tolerant Data Structures. - Yonatan Aumann; Michael A. Bender (FOCS, 1996)

Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler. - Yonatan Aumann; Michael A. Bender (ICALP, 1996)

Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. - Ronen Feldman; Yonatan Aumann; Amihood Amir; Heikki Mannila (DMKD, 1997)

Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections. - Ronen Feldman; Yonatan Aumann; Amihood Amir; Amir Zilberstein; Willi Klösgen (KDD, 1997)

Efficient Asynchronous Consensus with the Weak Adversary Scheduler. - Yonatan Aumann (PODC, 1997)

Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. - Yonatan Aumann; Michael A. Bender; Lisa Zhang (Inf. Comput., 1997)

Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract). - Yonatan Aumann; Michael O. Rabin (CRYPTO, 1998)

Knowledge Management: A Text Mining Approach. - Ronen Feldman; Moshe Fresko; Haym Hirsh; Yonatan Aumann; Orly Liphstat; Yonatan Schler; Martin Rajman (PAKM, 1998)

Trend Graphs: Visualizing the Evolution of Concept Relationships in Large Document Collections. - Ronen Feldman; Yonatan Aumann; Amir Zilberstein; Yaron Ben-Yehuda (PKDD, 1998)

TextVis: An Integrated Visual Environment for Text Mining. - David Landau; Ronen Feldman; Yonatan Aumann; Moshe Fresko; Yehuda Lindell; Orly Liphstat; Oren Zamir (PKDD, 1998)

An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm. - Yonatan Aumann; Yuval Rabani (SIAM J. Comput., 1998)

Information Theoretically Secure Communication in the Limited Storage Space Model. - Yonatan Aumann; Michael O. Rabin (CRYPTO, 1999)

Circle Graphs: New Visualization Tools for Text-Mining. - Yonatan Aumann; Ronen Feldman; Yaron Ben-Yehuda; David Landau; Orly Liphstat; Yonatan Schler (PKDD, 1999)

Text Mining via Information Extraction. - Ronen Feldman; Yonatan Aumann; Moshe Fresko; Orly Liphstat; Binyamin Rosenfeld; Yonatan Schler (PKDD, 1999)

Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers. - Yonatan Aumann; Avivit Kapah-Levy (SODA, 1999)

Borders: An Efficient Algorithm for Association Generation in Dynamic Databases. - Yonatan Aumann; Ronen Feldman; Orly Liphstat; Heikki Mannila (J. Intell. Inf. Syst., 1999)

Pattern Matching with Swaps. - Amihood Amir; Yonatan Aumann; Gad M. Landau; Moshe Lewenstein; Noa Lewenstein (J. Algorithms, 2000)

On the cost of recomputing: Tight bounds on pebbling with faults. - Yonatan Aumann; Judit Bar-Ilan; Uriel Feige (Theor. Comput. Sci., 2000)

A Domain Independent Environment for Creating Information Extraction Modules. - Ronen Feldman; Yonatan Aumann; Yair Liberzon; Kfir Ankori; Yonatan Schler; Binyamin Rosenfeld (CIKM, 2001)

Linear-Consistency Testing. - Yonatan Aumann; Johan Håstad; Michael O. Rabin; Madhu Sudan 001 (J. Comput. Syst. Sci., 2001)

A Comparative Study of Information Extraction Strategies. - Ronen Feldman; Yonatan Aumann; Michal Finkelstein-Landau; Eyal Hurvitz; Yizhar Regev; Ariel Yaroshevich (CICLing, 2002)

Structural extraction from visual layout of documents. - Binyamin Rosenfeld; Ronen Feldman; Yonatan Aumann (CIKM, 2002)

Everlasting security in the bounded storage model. - Yonatan Aumann; Yan Zong Ding; Michael O. Rabin (IEEE Trans. Inf. Theory, 2002)

Function Matching: Algorithms, Applications, and a Lower Bound. - Amihood Amir; Yonatan Aumann; Richard Cole 001; Moshe Lewenstein; Ely Porat (ICALP, 2003)

A Statistical Theory for Quantitative Association Rules. - Yonatan Aumann; Yehuda Lindell (J. Intell. Inf. Syst., 2003)

TEG: a hybrid approach to information extraction. - Binyamin Rosenfeld; Ronen Feldman; Moshe Fresko; Jonathan Schler; Yonatan Aumann (CIKM, 2004)

Dotted interval graphs and high throughput genotyping. - Yonatan Aumann; Moshe Lewenstein; Oren Melamud; Ron Y. Pinter; Zohar Yakhini (SODA, 2005)

Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler. - Yonatan Aumann; Michael A. Bender (Distributed Comput., 2005)

Designing optimally multiplexed SNP genotyping assays. - Yonatan Aumann; Efrat Manisterski; Zohar Yakhini (J. Comput. Syst. Sci., 2005)

Maximal Association Rules: A Tool for Mining Associations in Text. - Amihood Amir; Yonatan Aumann; Ronen Feldman; Moshe Fresko (J. Intell. Inf. Syst., 2005)

Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. - Doron Lipson; Yonatan Aumann; Amir Ben-Dor; Nathan Linial; Zohar Yakhini (J. Comput. Biol., 2006)

Visual information extraction. - Yonatan Aumann; Ronen Feldman; Yair Liberzon; Binyamin Rosenfeld; Jonathan Schler (Knowl. Inf. Syst., 2006)

Function Matching. - Amihood Amir; Yonatan Aumann; Moshe Lewenstein; Ely Porat (SIAM J. Comput., 2006)

Efficient Computations of l1 and linfinity Rearrangement Distances. - Amihood Amir; Yonatan Aumann; Piotr Indyk; Avivit Levy; Ely Porat (SPIRE, 2007)

Optimization of probe coverage for high-resolution oligonucleotide aCGH. - Doron Lipson; Zohar Yakhini; Yonatan Aumann (Bioinform., 2007)

Physical Search Problems Applying Economic Search Models. - Yonatan Aumann; Noam Hazon; Sarit Kraus; David Sarne (AAAI, 2008)

Fixed Structure Complexity. - Yonatan Aumann; Yair Dombb (IWPEC, 2008)

Easy and hard coalition resource game formation problems: a parameterized complexity analysis. - Tammar Shrot; Yonatan Aumann; Sarit Kraus (AAMAS (1), 2009)

Collaborative Multi Agent Physical Search with Probabilistic Knowledge. - Noam Hazon; Yonatan Aumann; Sarit Kraus (IJCAI, 2009)

Pattern matching with address errors: Rearrangement distances. - Amihood Amir; Yonatan Aumann; Gary Benson; Avivit Levy; Ohad Lipsky; Ely Porat; Steven Skiena; Uzi Vishne (J. Comput. Syst. Sci., 2009)

Efficient computations of l1 and l∞ rearrangement distances. - Amihood Amir; Yonatan Aumann; Piotr Indyk; Avivit Levy; Ely Porat (Theor. Comput. Sci., 2009)

Approximate string matching with address bit errors. - Amihood Amir; Yonatan Aumann; Oren Kapah; Avivit Levy; Ely Porat (Theor. Comput. Sci., 2009)

Search Costs as a Means for Improving Market Performance. - David Sarne; Yonatan Aumann (AMEC/TADA, 2010)

On agent types in coalition formation problems. - Tammar Shrot; Yonatan Aumann; Sarit Kraus (AAMAS, 2010)

Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games. - Yonatan Aumann; Yair Dombb (SAGT, 2010)

Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. - Yonatan Aumann; Yehuda Lindell (J. Cryptol., 2010)

Throw One's Cake - and Eat It Too. - Orit Arzi; Yonatan Aumann; Yair Dombb (SAGT, 2011)

Throw One's Cake — and Have It Too - Orit Arzi; Yonatan Aumann; Yair Dombb (CoRR, 2011)

Finding witnesses by peeling. - Yonatan Aumann; Moshe Lewenstein; Noa Lewenstein; Dekel Tsur (ACM Trans. Algorithms, 2011)

Automated Strategies for Determining Rewards for Human Work. - Amos Azaria; Yonatan Aumann; Sarit Kraus (AAAI, 2012)

The benefits of search costs in multiagent exploration. - David Sarne; Yonatan Aumann (AAMAS, 2012)

On the evaluation of election outcomes under uncertainty. - Noam Hazon; Yonatan Aumann; Sarit Kraus; Michael J. Wooldridge (Artif. Intell., 2012)

Dotted interval graphs. - Yonatan Aumann; Moshe Lewenstein; Oren Melamud; Ron Y. Pinter; Zohar Yakhini (ACM Trans. Algorithms, 2012)

Quasi-distinct parsing and optimal compression methods. - Amihood Amir; Yonatan Aumann; Avivit Levy; Yuri Roshko (Theor. Comput. Sci., 2012)

Computing socially-efficient cake divisions. - Yonatan Aumann; Yair Dombb; Avinatan Hassidim (AAMAS, 2013)

Physical search problems with probabilistic knowledge. - Noam Hazon; Yonatan Aumann; Sarit Kraus; David Sarne (Artif. Intell., 2013)

Auctioning a cake: truthful auctions of heterogeneous divisible goods. - Yonatan Aumann; Yair Dombb; Avinatan Hassidim (AAMAS, 2014)

Automated agents for reward determination for human work in crowdsourcing applications. - Amos Azaria; Yonatan Aumann; Sarit Kraus (Auton. Agents Multi Agent Syst., 2014)

Exploration costs as a means for improving performance in multiagent systems. - David Sarne; Yonatan Aumann (Ann. Math. Artif. Intell., 2014)

Envy-Free Cake-Cutting in Two Dimensions. - Erel Segal-Halevi; Avinatan Hassidim; Yonatan Aumann (AAAI, 2015)

Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal. - Erel Segal-Halevi; Avinatan Hassidim; Yonatan Aumann (AAMAS, 2015)

Fair and Square: Cake-Cutting in Two Dimensions. - Erel Segal-Halevi; Shmuel Nitzan; Avinatan Hassidim; Yonatan Aumann (CoRR, 2015)

The Efficiency of Fair Division with Connected Pieces. - Yonatan Aumann; Yair Dombb (ACM Trans. Economics and Comput., 2015)

Auctioning Time: Truthful Auctions of Heterogeneous Divisible Goods. - Yonatan Aumann; Yair Dombb; Avinatan Hassidim (ACM Trans. Economics and Comput., 2015)

SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism. - Erel Segal-Halevi; Avinatan Hassidim; Yonatan Aumann (SAGT, 2016)

Efficiency and fairness in team search with self-interested agents. - Igor Rochlin; Yonatan Aumann; David Sarne; Luba Golosman (Auton. Agents Multi Agent Syst., 2016)

A Random-Sampling Double-Auction Mechanism. - Erel Segal-Halevi; Avinatan Hassidim; Yonatan Aumann (CoRR, 2016)

Envy-Free Cake-Cutting in Two Dimensions. - Erel Segal-Halevi; Shmuel Nitzan; Avinatan Hassidim; Yonatan Aumann (CoRR, 2016)

Fair Division (Dagstuhl Seminar 16232). - Yonatan Aumann; Jérôme Lang; Ariel D. Procaccia (Dagstuhl Reports, 2016)

Demand-flow of agents with gross-substitute valuations. - Erel Segal-Halevi; Avinatan Hassidim; Yonatan Aumann (Oper. Res. Lett., 2016)

Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting. - Orit Arzi; Yonatan Aumann; Yair Dombb (Soc. Choice Welf., 2016)

Waste Makes Haste: Bounded Time Algorithms for Envy-Free Cake Cutting with Free Disposal. - Erel Segal-Halevi; Avinatan Hassidim; Yonatan Aumann (ACM Trans. Algorithms, 2016)

Distributed Matching with Mixed Maximum-Minimum Utilities. - Amos Azaria; David Sarne; Yonatan Aumann (ACM Trans. Economics and Comput., 2017)

MUDA: A Truthful Multi-Unit Double-Auction Mechanism. - Erel Segal-Halevi; Avinatan Hassidim; Yonatan Aumann (AAAI, 2018)

Tractable (Simple) Contests. - Priel Levy; David Sarne; Yonatan Aumann (IJCAI, 2018)

Double Auctions in Markets for Multiple Kinds of Goods. - Erel Segal-Halevi; Avinatan Hassidim; Yonatan Aumann (IJCAI, 2018)

Selective Information Disclosure in Contests. - Priel Levy; David Sarne; Yonatan Aumann (AAMAS, 2019)

Approval voting with costly information. - Michael Gershtein; David Sarne; Yonatan Aumann (DAI, 2019)

Temporal Information Design in Contests. - Priel Levy; David Sarne; Yonatan Aumann (IJCAI, 2019)

Envy-Free Division of Land. - Erel Segal-Halevi; Shmuel Nitzan; Avinatan Hassidim; Yonatan Aumann (Math. Oper. Res., 2020)

Fair and Truthful Giveaway Lotteries. - Tal Arbiv; Yonatan Aumann (AAAI, 2022)

Robust Solutions for Multi-Defender Stackelberg Security Games. - Dolev Mutzari; Yonatan Aumann; Sarit Kraus (IJCAI, 2022)

Efficient Customer Service Combining Human Operators and Virtual Agents. - Yaniv Oshrat; Yonatan Aumann; Tal Hollander; Oleg Maksimov; Anita Ostroumov; Natali Shechtman; Sarit Kraus (CoRR, 2022)

Customer Service Combining Human Operators and Virtual Agents: A Call for Multidisciplinary AI Research. - Sarit Kraus; Yaniv Oshrat; Yonatan Aumann; Tal Hollander; Oleg Maksimov; Anita Ostroumov; Natali Shechtman (AAAI, 2023)

Resilient Fair Allocation of Indivisible Goods. - Dolev Mutzari; Yonatan Aumann; Sarit Kraus (AAMAS, 2023)

Leximin Approximation: From Single-Objective to Multi-Objective. - Eden Hartman; Avinatan Hassidim; Yonatan Aumann; Erel Segal-Halevi (ECAI, 2023)

Tractable Binary Contests. - Priel Levy; David Sarne; Yonatan Aumann (ACM Trans. Economics and Comput., 2024)

Contest partitioning in binary contests. - Priel Levy; Yonatan Aumann; David Sarne (Auton. Agents Multi Agent Syst., 2024)

Reducing Leximin Fairness to Utilitarian Optimization. - Eden Hartman; Yonatan Aumann; Avinatan Hassidim; Erel Segal-Halevi (AAAI, 2025)

Heterogeneous Multi-Robot Graph Coverage with Proximity and Movement Constraints. - Dolev Mutzari; Yonatan Aumann; Sarit Kraus (AAAI, 2025)

Voter Priming Campaigns: Strategies, Equilibria, and Algorithms. - Jonathan Shaki; Yonatan Aumann; Sarit Kraus (AAAI, 2025)

Contest Partitioning in Binary Contests: Costly, yet Beneficial. - Priel Levy; Yonatan Aumann; David Sarne (AAMAS, 2025)

Control for Coalitions in Parliamentary Elections. - Hodaya Barr; Eden Hartman; Yonatan Aumann; Sarit Kraus (CoRR, 2025)

Bribery for Coalitions in Parliamentary Elections. - Hodaya Barr; Yonatan Aumann; Sarit Kraus (CoRR, 2025)