Generalized 'write-once' memories. - Amos Fiat; Adi Shamir (IEEE Trans. Inf. Theory, 1984)

Polymorphic Arrays: An Architecture for a Programmable Systolic Machine. - Amos Fiat; Adi Shamir; Ehud Shapiro (ICPP, 1985)

How to Prove Yourself: Practical Solutions to Identification and Signature Problems. - Amos Fiat; Adi Shamir (CRYPTO, 1986)

Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers. - Amos Fiat; Adi Shamir (J. Comput. Syst. Sci., 1986)

Untraceable Electronic Cash. - David Chaum; Amos Fiat; Moni Naor (CRYPTO, 1988)

Non-Oblivious Hashing (Extended Abstract) - Amos Fiat; Moni Naor; Jeanette P. Schmidt; Alan Siegel (STOC, 1988)

Storing and Searching a Multikey Table (Extended Abstract) - Amos Fiat; Moni Naor; Alejandro A. Schäffer; Jeanette P. Schmidt; Alan Siegel (STOC, 1988)

Zero-Knowledge Proofs of Identity. - Uriel Feige; Amos Fiat; Adi Shamir (J. Cryptol., 1988)

Planning and Learning in Permutation Groups - Amos Fiat; Shahar Moses; Adi Shamir; Ilan Shimshoni; Gábor Tardos (FOCS, 1989)

How to find a battleship. - Amos Fiat; Adi Shamir (Networks, 1989)

Competitive k-Server Algorithms (Extended Abstract) - Amos Fiat; Yuval Rabani; Yiftach Ravid (FOCS, 1990)

Rigorous Time/Space Tradeoffs for Inverting Functions - Amos Fiat; Moni Naor (STOC, 1991)

Competitive Paging Algorithms. - Amos Fiat; Richard M. Karp; Michael Luby; Lyle A. McGeoch; Daniel Dominic Sleator; Neal E. Young (J. Algorithms, 1991)

An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time. - Amos Fiat; J. Ian Munro; Moni Naor; Alejandro A. Schäffer; Jeanette P. Schmidt; Alan Siegel (J. Comput. Syst. Sci., 1991)

Competitive Analysis of Financial Games - Ran El-Yaniv; Amos Fiat; Richard M. Karp; G. Turpin (FOCS, 1992)

On-Line Navigation in a Room. - Eldad Bar-Eli; Piotr Berman; Amos Fiat; Peiyuan Yan (SODA, 1992)

Competitive Algorithms for Distributed Data Management (Extended Abstract) - Yair Bartal; Amos Fiat; Yuval Rabani (STOC, 1992)

Nonoblivious Hashing. - Amos Fiat; Moni Naor; Jeanette P. Schmidt; Alan Siegel (J. ACM, 1992)

Broadcast Encryption. - Amos Fiat; Moni Naor (CRYPTO, 1993)

Heat & Dump: Competitive Distributed Paging - Baruch Awerbuch; Yair Bartal; Amos Fiat (FOCS, 1993)

On-line load balancing with applications to machine scheduling and virtual circuit routing. - James Aspnes; Yossi Azar; Amos Fiat; Serge A. Plotkin; Orli Waarts (STOC, 1993)

Implicit O(1) Probe Search. - Amos Fiat; Moni Naor (SIAM J. Comput., 1993)

Tracing Traitors. - Benny Chor; Amos Fiat; Moni Naor (CRYPTO, 1994)

Matching Nuts and Bolts. - Noga Alon; Manuel Blum 001; Amos Fiat; Sampath Kannan; Moni Naor; Rafail Ostrovsky (SODA, 1994)

Competitive Non-Preemptive Call Control. - Baruch Awerbuch; Yair Bartal; Amos Fiat; Adi Rosén (SODA, 1994)

A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle. - Amos Fiat; Yuval Rabani; Yiftach Ravid; Baruch Schieber (Algorithmica, 1994)

Online Navigation in a Room. - Eldad Bar-Eli; Piotr Berman; Amos Fiat; Peiyuan Yan (J. Algorithms, 1994)

Competitive k-Server Algorithms. - Amos Fiat; Yuval Rabani; Yiftach Ravid (J. Comput. Syst. Sci., 1994)

Competitive Algorithms for the Weighted Server Problem. - Amos Fiat; Moty Ricklin (Theor. Comput. Sci., 1994)

Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version). - Amos Fiat; Yishay Mansour; Adi Rosén; Orli Waarts (FOCS, 1995)

Randomized and multipointer paging with locality of reference. - Amos Fiat; Anna R. Karlin (STOC, 1995)

New Algorithms for an Ancient Scheduling Problem. - Yair Bartal; Amos Fiat; Howard J. Karloff; Rakesh Vohra (J. Comput. Syst. Sci., 1995)

Competitive Algorithms for Distributed Data Management. - Yair Bartal; Amos Fiat; Yuval Rabani (J. Comput. Syst. Sci., 1995)

Competitive Analysis of Algorithms. - Amos Fiat; Gerhard J. Woeginger (Online Algorithms, 1996)

Competitive Odds and Ends. - Amos Fiat; Gerhard J. Woeginger (Online Algorithms, 1996)

On-line Competive Algorithms for Call Admission in Optical Networks. - Baruch Awerbuch; Yossi Azar; Amos Fiat; Stefano Leonardi 001; Adi Rosén (ESA, 1996)

Packet Routing via Min-Cost Circuit Routing. - Baruch Awerbuch; Yossi Azar; Amos Fiat (ISTCS, 1996)

Randomized Robot Navigation Algorithms. - Piotr Berman; Avrim Blum; Amos Fiat; Howard J. Karloff; Adi Rosén; Michael E. Saks (SODA, 1996)

Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract). - Baruch Awerbuch; Yossi Azar; Amos Fiat; Frank Thomson Leighton (STOC, 1996)

Truly Online Paging with Locality of Reference. - Amos Fiat; Manor Mendel (FOCS, 1997)

Experimental Studies of Access Graph Based Heuristics: Beating the LRU Standard? - Amos Fiat; Ziv Rosen (SODA, 1997)

On-line routing of virtual circuits with applications to load balancing and machine scheduling. - James Aspnes; Yossi Azar; Amos Fiat; Serge A. Plotkin; Orli Waarts (J. ACM, 1997)

Batch RSA. - Amos Fiat (J. Cryptol., 1997)

Distributed Paging for General Networks. - Baruch Awerbuch; Yair Bartal; Amos Fiat (J. Algorithms, 1998)

Competitive Algorithms for Layered Graph Traversal. - Amos Fiat; Dean P. Foster; Howard J. Karloff; Yuval Rabani; Yiftach Ravid; Sundar Vishwanathan (SIAM J. Comput., 1998)

Dynamic Traitor Training. - Amos Fiat; Tamir Tassa (CRYPTO, 1999)

On-Line Scheduling on a Single Machine: Minimizing the Total Completion Time. - Amos Fiat; Gerhard J. Woeginger (Acta Informatica, 1999)

On Capital Investment. - Yossi Azar; Yair Bartal; Esteban Feuerstein; Amos Fiat; Stefano Leonardi 001; Adi Rosén (Algorithmica, 1999)

Rigorous Time/Space Trade-offs for Inverting Functions. - Amos Fiat; Moni Naor (SIAM J. Comput., 1999)

Tracing traitors. - Benny Chor; Amos Fiat; Moni Naor; Benny Pinkas (IEEE Trans. Inf. Theory, 2000)

Web Search via Hub Synthesis. - Dimitris Achlioptas; Amos Fiat; Anna R. Karlin; Frank McSherry (FOCS, 2001)

Some Recent Results on Data Mining and Search. - Amos Fiat (MFCS, 2001)

Spectral analysis of data. - Yossi Azar; Amos Fiat; Anna R. Karlin; Frank McSherry; Jared Saia (STOC, 2001)

On-Line Competitive Algorithms for Call Admission in Optical Networks. - Baruch Awerbuch; Yossi Azar; Amos Fiat; Stefano Leonardi 001; Adi Rosén (Algorithmica, 2001)

Optimal Search and One-Way Trading Online Algorithms. - Ran El-Yaniv; Amos Fiat; Richard M. Karp; G. Turpin (Algorithmica, 2001)

Dynamic Traitor Tracing. - Amos Fiat; Tamir Tassa (J. Cryptol., 2001)

Online Companion Caching. - Amos Fiat; Manor Mendel; Steven S. Seiden (ESA, 2002)

Dynamically Fault-Tolerant Content Addressable Networks. - Jared Saia; Amos Fiat; Steven D. Gribble; Anna R. Karlin; Stefan Saroiu (IPTPS, 2002)

Censorship resistant peer-to-peer content addressable networks. - Amos Fiat; Jared Saia (SODA, 2002)

Competitive generalized auctions. - Amos Fiat; Andrew V. Goldberg; Jason D. Hartline; Anna R. Karlin (STOC, 2002)

Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs. - Dotan Emanuel; Amos Fiat (ESA, 2003)

AIM: Another Itemset Miner. - Amos Fiat; Sagi Shporer (FIMI, 2003)

Some Issues Regarding Search, Censorship, and Anonymity in Peer to Peer Networks. - Amos Fiat (ICALP, 2003)

Efficient sequences of trials. - Edith Cohen; Amos Fiat; Haim Kaplan (SODA, 2003)

A case for associative peer to peer overlays. - Edith Cohen; Amos Fiat; Haim Kaplan (Comput. Commun. Rev., 2003)

Competitive distributed file allocation. - Baruch Awerbuch; Yair Bartal; Amos Fiat (Inf. Comput., 2003)

Making data structures confluently persistent. - Amos Fiat; Haim Kaplan (J. Algorithms, 2003)

Better Algorithms for Unfair Metrical Task Systems and Applications. - Amos Fiat; Manor Mendel (SIAM J. Comput., 2003)

Decision Trees: More Theoretical Justification for Practical Algorithms. - Amos Fiat; Dmitry Pechyony (ALT, 2004)

Provable Unlinkability against Traffic Analysis. - Ron Berman; Amos Fiat; Amnon Ta-Shma (Financial Cryptography, 2004)

Optimal oblivious routing in polynomial time. - Yossi Azar; Edith Cohen; Amos Fiat; Haim Kaplan; Harald Räcke (J. Comput. Syst. Sci., 2004)

Foreword. - Amos Fiat; Sandy Irani (Theor. Comput. Sci., 2004)

Secure Exchange of Modifiable Data and Queries. - Serge Abiteboul; Bogdan Cautis; Amos Fiat; Haim Kaplan; Tova Milo (BDA, 2005)

Making Chord Robust to Byzantine Attacks. - Amos Fiat; Jared Saia; Maxwell Young (ESA, 2005)

Online conflict-free coloring for intervals. - Amos Fiat; Meital Levy; Jirí Matousek 001; Elchanan Mossel; János Pach; Micha Sharir; Shakhar Smorodinsky; Uli Wagner 001; Emo Welzl (SODA, 2005)

Digital Signatures for Modifiable Collections. - Serge Abiteboul; Bogdan Cautis; Amos Fiat; Tova Milo (ARES, 2006)

Coresets forWeighted Facilities and Their Applications. - Dan Feldman; Amos Fiat; Micha Sharir (FOCS, 2006)

On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations. - Amos Fiat; Haim Kaplan; Meital Levy; Svetlana Olonetsky; Ronen Shabo (ICALP (1), 2006)

Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. - Yair Bartal; Amos Fiat; Stefano Leonardi 001 (SIAM J. Comput., 2006)

An improved algorithm for online coloring of intervals with bandwidth. - Yossi Azar; Amos Fiat; Meital Levy; N. S. Narayanaswamy (Theor. Comput. Sci., 2006)

Correlation clustering in general weighted graphs. - Erik D. Demaine; Dotan Emanuel; Amos Fiat; Nicole Immorlica (Theor. Comput. Sci., 2006)

Bi-criteria linear-time approximations for generalized k-mean/median/center. - Dan Feldman; Amos Fiat; Micha Sharir; Danny Segev (SCG, 2007)

Strong Price of Anarchy for Machine Load Balancing. - Amos Fiat; Haim Kaplan; Meital Levy; Svetlana Olonetsky (ICALP, 2007)

Efficient contention resolution protocols for selfish agents. - Amos Fiat; Yishay Mansour; Uri Nadav (SODA, 2007)

Associative search in peer to peer networks: Harnessing latent semantics. - Edith Cohen; Amos Fiat; Haim Kaplan (Comput. Networks, 2007)

Online Conflict-Free Coloring for Intervals. - Ke Chen 006; Amos Fiat; Haim Kaplan; Meital Levy; Jirí Matousek 001; Elchanan Mossel; János Pach; Micha Sharir; Shakhar Smorodinsky; Uli Wagner 001; Emo Welzl (SIAM J. Comput., 2007)

Censorship Resistant Peer-to-Peer Networks. - Amos Fiat; Jared Saia (Theory Comput., 2007)

Subjective vs.Objective Reality - The Risk of Running Late. - Amos Fiat; Hila Pochter (SAGT, 2008)

Competitive queue management for latency sensitive packets. - Amos Fiat; Yishay Mansour; Uri Nadav (SODA, 2008)

Caching Content under Digital Rights Management. - Leah Epstein; Amos Fiat; Meital Levy (WAOA, 2008)

Private coresets. - Dan Feldman; Amos Fiat; Haim Kaplan; Kobbi Nissim (STOC, 2009)

Envy, Multi Envy, and Revenue Maximization. - Amos Fiat; Amiram Wingarten (WINE, 2009)

When the Players Are Not Expectation Maximizers. - Amos Fiat; Christos H. Papadimitriou (SAGT, 2010)

Envy-free makespan approximation: extended abstract. - Edith Cohen; Michal Feldman; Amos Fiat; Haim Kaplan; Svetlana Olonetsky (EC, 2010)

Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. - Ittai Abraham; Amos Fiat; Andrew V. Goldberg; Renato Fonseca F. Werneck (SODA, 2010)

Combinatorial Auctions with Budgets - Amos Fiat; Stefano Leonardi 001; Jared Saia; Piotr Sankowski (CoRR, 2010)

Truth and Envy in Capacitated Allocation Games - Edith Cohen; Michal Feldman; Amos Fiat; Haim Kaplan; Svetlana Olonetsky (CoRR, 2010)

On the Interplay between Incentive Compatibility and Envy Freeness - Edith Cohen; Michal Feldman; Amos Fiat; Haim Kaplan; Svetlana Olonetsky (CoRR, 2010)

VC-Dimension and Shortest Path Algorithms. - Ittai Abraham; Daniel Delling; Amos Fiat; Andrew V. Goldberg; Renato Fonseca F. Werneck (ICALP (1), 2011)

Single valued combinatorial auctions with budgets. - Amos Fiat; Stefano Leonardi 001; Jared Saia; Piotr Sankowski (EC, 2011)

Truth, Envy, and Truthful Market Clearing Bundle Pricing. - Edith Cohen; Michal Feldman; Amos Fiat; Haim Kaplan; Svetlana Olonetsky (WINE, 2011)

Special Issue: European Symposium on Algorithms, Design and Analysis. - Amos Fiat (Algorithmica, 2011)

Derandomization of auctions. - Gagan Aggarwal; Amos Fiat; Andrew V. Goldberg; Jason D. Hartline; Nicole Immorlica; Madhu Sudan 001 (Games Econ. Behav., 2011)

HLDB: location-based services in databases. - Ittai Abraham; Daniel Delling; Amos Fiat; Andrew V. Goldberg; Renato Fonseca F. Werneck (SIGSPATIAL/GIS, 2012)

Revenue maximizing envy-free multi-unit auctions with budgets. - Michal Feldman; Amos Fiat; Stefano Leonardi 001; Piotr Sankowski (EC, 2012)

Tight Lower Bounds on Envy-Free Makespan Approximation. - Amos Fiat; Ariel Levavi (WINE, 2012)

Why study the price of anarchy?: technical perspective. - Amos Fiat (Commun. ACM, 2012)

Envy-Free Makespan Approximation. - Edith Cohen; Michal Feldman; Amos Fiat; Haim Kaplan; Svetlana Olonetsky (SIAM J. Comput., 2012)

Approaching utopia: strong truthfulness and externality-resistant mechanisms. - Amos Fiat; Anna R. Karlin; Elias Koutsoupias; Angelina Vidali (ITCS, 2013)

Minimal Indices for Successor Search - (Extended Abstract). - Sarel Cohen; Amos Fiat; Moshik Hershcovitch; Haim Kaplan (MFCS, 2013)

Minimal Indices for Successor Search. - Sarel Cohen; Amos Fiat; Moshe Hershcovitch; Haim Kaplan (CoRR, 2013)

A Labeling Approach to Incremental Cycle Detection. - Edith Cohen; Amos Fiat; Haim Kaplan; Liam Roditty (CoRR, 2013)

The Temp Secretary Problem. - Amos Fiat; Ilia Gorelik; Haim Kaplan; Slava Novgorodov (ESA, 2015)

Pricing Online Decisions: Beyond Auctions. - Ilan Reuven Cohen; Alon Eden; Amos Fiat; Lukasz Jez (SODA, 2015)

Minimal indices for predecessor search. - Sarel Cohen; Amos Fiat; Moshik Hershcovitch; Haim Kaplan (Inf. Comput., 2015)

Provable Unlinkability Against Traffic Analysis with Low Message Overhead. - Ron Berman; Amos Fiat; Marcin Gomulkiewicz; Marek Klonowski; Miroslaw Kutylowski; Tomer Levinboim; Amnon Ta-Shma (J. Cryptol., 2015)

Variations on the Hotelling-Downs Model. - Michal Feldman; Amos Fiat; Svetlana Obraztsova (AAAI, 2016)

Carpooling in Social Networks. - Amos Fiat; Anna R. Karlin; Elias Koutsoupias; Claire Mathieu; Rotem Zach (ICALP, 2016)

History-Independent Distributed Multi-agent Learning. - Amos Fiat; Yishay Mansour; Mariano Schain (SAGT, 2016)

The Invisible Hand of Dynamic Market Pricing. - Vincent Cohen-Addad; Alon Eden; Michal Feldman; Amos Fiat (EC, 2016)

Lottery Pricing Equilibria. - Shaddin Dughmi; Alon Eden; Michal Feldman; Amos Fiat; Stefano Leonardi 001 (EC, 2016)

On Voting and Facility Location. - Michal Feldman; Amos Fiat; Iddan Golomb (EC, 2016)

The FedEx Problem. - Amos Fiat; Kira Goldner; Anna R. Karlin; Elias Koutsoupias (EC, 2016)

Packing Small Vectors. - Yossi Azar; Ilan Reuven Cohen; Amos Fiat; Alan Roytman (SODA, 2016)

Highway Dimension and Provably Efficient Shortest Path Algorithms. - Ittai Abraham; Daniel Delling; Amos Fiat; Andrew V. Goldberg; Renato F. Werneck (J. ACM, 2016)

Makespan Minimization via Posted Prices. - Michal Feldman; Amos Fiat; Alan Roytman (EC, 2017)

(1 + ∊)-Approximate f-Sensitive Distance Oracles. - Shiri Chechik; Sarel Cohen; Amos Fiat; Haim Kaplan (SODA, 2017)

Truthful Prompt Scheduling for Minimizing Sum of Completion Times. - Alon Eden; Michal Feldman; Amos Fiat; Tzahi Taub (ESA, 2018)

Interdependent Values without Single-Crossing. - Alon Eden; Michal Feldman; Amos Fiat; Kira Goldner (EC, 2018)

Prompt Scheduling for Selfish Agents. - Alon Eden; Michal Feldman; Amos Fiat; Tzahi Taub (CoRR, 2018)

An Economic-Based Analysis of RANKING for Online Bipartite Matching. - Alon Eden; Michal Feldman; Amos Fiat; Kineret Segal (CoRR, 2018)

Flow Equilibria via Online Surge Pricing. - Amos Fiat; Yishay Mansour; Lior Shultz (CoRR, 2018)

Dynamic Pricing of Servers on Trees. - Ilan Reuven Cohen; Alon Eden; Amos Fiat; Lukasz Jez (APPROX-RANDOM, 2019)

Efficient Allocation of Free Stuff. - Yossi Azar; Allan Borodin; Michal Feldman; Amos Fiat; Kineret Segal (AAMAS, 2019)

Energy Equilibria in Proof-of-Work Mining. - Amos Fiat; Anna R. Karlin; Elias Koutsoupias; Christos H. Papadimitriou (EC, 2019)

Beyond myopic best response (in Cournot competition). - Amos Fiat; Elias Koutsoupias; Katrina Ligett; Yishay Mansour; Svetlana Olonetsky (Games Econ. Behav., 2019)

An Economics-Based Analysis of RANKING for Online Bipartite Matching. - Alon Eden; Michal Feldman; Amos Fiat; Kineret Segal (SOSA, 2021)

(Almost Full) EFX Exists for Four Agents (and Beyond). - Ben Berger; Avi Cohen; Michal Feldman; Amos Fiat (CoRR, 2021)

Competitive Equilibria with Unequal Budgets: Supporting Arbitrary Pareto Optimal Allocations. - Nir Andelman; Michal Feldman; Amos Fiat; Yishay Mansour (CoRR, 2021)

Almost Full EFX Exists for Four Agents. - Ben Berger; Avi Cohen; Michal Feldman; Amos Fiat (AAAI, 2022)

An $ alpha$-regret analysis of Adversarial Bilateral Trade. - Yossi Azar; Amos Fiat; Federico Fusco (NeurIPS, 2022)

Fair allocation in graphs. - George Christodoulou 001; Amos Fiat; Elias Koutsoupias; Alkmini Sgouritsa (EC, 2023)

An α-regret analysis of adversarial bilateral trade. - Yossi Azar; Amos Fiat; Federico Fusco (Artif. Intell., 2024)

Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue. - Alon Eden; Michal Feldman; Amos Fiat; Kira Goldner; Anna R. Karlin (Math. Oper. Res., 2024)

Zero-Knowledge Mechanisms. - Ran Canetti; Amos Fiat; Yannai A. Gonczarowski (EC, 2025)

Fair Division via Resource Augmentation. - Hannaneh Akrami; Alon Eden; Michal Feldman; Amos Fiat; Yoav Gal Tzur (CoRR, 2025)