Amos Fiat

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

Amos Fiat: Why study the price of anarchy?: technical perspective. Commun. ACM 55(7): 115 (2012)

Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky: Envy-Free Makespan Approximation. SIAM J. Comput. 41(1): 12-25 (2012)

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

Michal Feldman, Amos Fiat, Stefano Leonardi, Piotr Sankowski: Revenue maximizing envy-free multi-unit auctions with budgets. ACM Conference on Electronic Commerce 2012: 532-549

Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yishay Mansour, Svetlana Olonetsky: Beyond myopic best response (in Cournot competition). SODA 2012: 993-1005

Amos Fiat, Ariel Levavi: Tight Lower Bounds on Envy-Free Makespan Approximation. WINE 2012: 553-558

Amos Fiat, Ariel Levavi: Tight Lower Bounds on Envy-Free Makespan Approximation. CoRR abs/1205.1786 (2012)

Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Angelina Vidali: Approaching Utopia: Strong Truthfulness and Externality-Resistant Mechanisms. CoRR abs/1208.3939 (2012)

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

Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan: Derandomization of auctions. Games and Economic Behavior 72(1): 1-11 (2011)

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

Amos Fiat, Stefano Leonardi, Jared Saia, Piotr Sankowski: Single valued combinatorial auctions with budgets. ACM Conference on Electronic Commerce 2011: 223-232

Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky: Truth, Envy, and Truthful Market Clearing Bundle Pricing. WINE 2011: 97-108

Amos Fiat, Christos H. Papadimitriou: When the Players Are Not Expectation Maximizers. SAGT 2010: 1-14

Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky: Envy-free makespan approximation: extended abstract. ACM Conference on Electronic Commerce 2010: 159-166

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

Amos Fiat, Stefano Leonardi, Jared Saia, Piotr Sankowski: Combinatorial Auctions with Budgets. CoRR abs/1001.1686 (2010)

Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky: Truth and Envy in Capacitated Allocation Games. CoRR abs/1003.5326 (2010)

Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky: On the Interplay between Incentive Compatibility and Envy Freeness. CoRR abs/1003.5328 (2010)

Dan Feldman, Amos Fiat, Haim Kaplan, Kobbi Nissim: Private coresets. STOC 2009: 361-370

Amos Fiat, Amiram Wingarten: Envy, Multi Envy, and Revenue Maximization. WINE 2009: 498-504

Amos Fiat, Peter Sanders (Eds.): Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings. Lecture Notes in Computer Science 5757, Springer 2009, isbn 978-3-642-04127-3

Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky: Envy-Free Makespan Approximation. CoRR abs/0909.1072 (2009)

Amos Fiat, Amiram Wingarten: Envy, Multi Envy, and Revenue Maximization. CoRR abs/0909.4569 (2009)

Amos Fiat, Hila Pochter: Subjective vs.Objective Reality - The Risk of Running Late. SAGT 2008: 279-290

Amos Fiat, Yishay Mansour, Uri Nadav: Competitive queue management for latency sensitive packets. SODA 2008: 228-237

Leah Epstein, Amos Fiat, Meital Levy: Caching Content under Digital Rights Management. WAOA 2008: 188-200

Edith Cohen, Amos Fiat, Haim Kaplan: Associative search in peer to peer networks: Harnessing latent semantics. Computer Networks 51(8): 1861-1881 (2007)

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

Amos Fiat, Jared Saia: Censorship Resistant Peer-to-Peer Networks. Theory of Computing 3(1): 1-23 (2007)

Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev: Bi-criteria linear-time approximations for generalized k-mean/median/center. Symposium on Computational Geometry 2007: 19-26

Amos Fiat, Meital Levy, Haim Kaplan, Svetlana Olonetsky: Strong Price of Anarchy for Machine Load Balancing. Fair Division 2007

Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky: Strong Price of Anarchy for Machine Load Balancing. ICALP 2007: 583-594

Amos Fiat, Yishay Mansour, Uri Nadav: Efficient contention resolution protocols for selfish agents. SODA 2007: 179-188

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

Erik D. Demaine, Dotan Emanuel, Amos Fiat, Nicole Immorlica: Correlation clustering in general weighted graphs. Theor. Comput. Sci. 361(2-3): 172-187 (2006)

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

Serge Abiteboul, Bogdan Cautis, Amos Fiat, Tova Milo: Digital Signatures for Modifiable Collections. ARES 2006: 390-399

Dan Feldman, Amos Fiat, Micha Sharir: Coresets forWeighted Facilities and Their Applications. FOCS 2006: 315-324

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

Amos Fiat, Manor Mendel: Truly Online Paging with Locality of Reference. CoRR abs/cs/0601127 (2006)

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

Amos Fiat, Jared Saia, Maxwell Young: Making Chord Robust to Byzantine Attacks. ESA 2005: 803-814

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

Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan: Derandomization of auctions. STOC 2005: 619-625

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

Amos Fiat, Sandy Irani: Foreword. Theor. Comput. Sci. 324(2-3): 133-135 (2004)

Amos Fiat, Dmitry Pechyony: Decision Trees: More Theoretical Justification for Practical Algorithms. ALT 2004: 156-170

Ron Berman, Amos Fiat, Amnon Ta-Shma: Provable Unlinkability against Traffic Analysis. Financial Cryptography 2004: 266-280

Amos Fiat, Manor Mendel: Better algorithms for unfair metrical task systems and applications. CoRR cs.DS/0406034 (2004)

Edith Cohen, Amos Fiat, Haim Kaplan: A case for associative peer to peer overlays. Computer Communication Review 33(1): 95-100 (2003)

Baruch Awerbuch, Yair Bartal, Amos Fiat: Competitive distributed file allocation. Inf. Comput. 185(1): 1-40 (2003)

Amos Fiat, Haim Kaplan: Making data structures confluently persistent. J. Algorithms 48(1): 16-58 (2003)

Amos Fiat, Manor Mendel: Better Algorithms for Unfair Metrical Task Systems and Applications. SIAM J. Comput. 32(6): 1403-1422 (2003)

Dotan Emanuel, Amos Fiat: Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs. ESA 2003: 208-220

Amos Fiat, Sagi Shporer: AIM: Another Itemset Miner. FIMI 2003

Amos Fiat: Some Issues Regarding Search, Censorship, and Anonymity in Peer to Peer Networks. ICALP 2003: 33

Edith Cohen, Amos Fiat, Haim Kaplan: Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. INFOCOM 2003

Edith Cohen, Amos Fiat, Haim Kaplan: Efficient sequences of trials. SODA 2003: 737-746

Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke: Optimal oblivious routing in polynomial time. STOC 2003: 383-388

Amos Fiat, Manor Mendel, Steven S. Seiden: Online Companion Caching. ESA 2002: 499-511

Jared Saia, Amos Fiat, Steven D. Gribble, Anna R. Karlin, Stefan Saroiu: Dynamically Fault-Tolerant Content Addressable Networks. IPTPS 2002: 270-279

Amos Fiat, Jared Saia: Censorship resistant peer-to-peer content addressable networks. SODA 2002: 94-103

Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin: Competitive generalized auctions. STOC 2002: 72-81

Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young: Competitive Paging Algorithms. CoRR cs.DS/0205038 (2002)

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

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

Amos Fiat, Tamir Tassa: Dynamic Traitor Tracing. J. Cryptology 14(3): 211-223 (2001)

Dimitris Achlioptas, Amos Fiat, Anna R. Karlin, Frank McSherry: Web Search via Hub Synthesis. FOCS 2001: 500-509

Amos Fiat: Some Recent Results on Data Mining and Search. MFCS 2001: 33-36

Amos Fiat, Haim Kaplan: Making data structures confluently persistent. SODA 2001: 537-546

Yossi Azar, Amos Fiat, Anna R. Karlin, Frank McSherry, Jared Saia: Spectral analysis of data. STOC 2001: 619-626

Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas: Tracing traitors. IEEE Transactions on Information Theory 46(3): 893-910 (2000)

Amos Fiat, Manor Mendel: Better algorithms for unfair metrical task systems and applications. STOC 2000: 725-734

Amos Fiat, Gerhard J. Woeginger: On-Line Scheduling on a Single Machine: Minimizing the Total Completion Time. Acta Inf. 36(4): 287-293 (1999)

Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén: On Capital Investment. Algorithmica 25(1): 22-36 (1999)

Amos Fiat, Moni Naor: Rigorous Time/Space Trade-offs for Inverting Functions. SIAM J. Comput. 29(3): 790-803 (1999)

Amos Fiat, Tamir Tassa: Dynamic Traitor Training. CRYPTO 1999: 354-371

Baruch Awerbuch, Yair Bartal, Amos Fiat: Distributed Paging for General Networks. J. Algorithms 28(1): 67-104 (1998)

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

Amos Fiat, Gerhard J. Woeginger (Eds.): Online Algorithms, The State of the Art (the book grow out of a Dagstuhl Seminar, June 1996). Lecture Notes in Computer Science 1442, Springer 1998, isbn 3-540-64917-4

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

Amos Fiat: Batch RSA. J. Cryptology 10(2): 75-88 (1997)

Amos Fiat, Manor Mendel: Truly Online Paging with Locality of Reference. FOCS 1997: 326-335

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

Amos Fiat, Gerhard J. Woeginger: Competitive Analysis of Algorithms. Online Algorithms 1996: 1-12

Amos Fiat, Gerhard J. Woeginger: Competitive Odds and Ends. Online Algorithms 1996: 385-394

Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén: On-line Competive Algorithms for Call Admission in Optical Networks. ESA 1996: 431-444

Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén: On Capital Investment. ICALP 1996: 429-441

Baruch Awerbuch, Yossi Azar, Amos Fiat: Packet Routing via Min-Cost Circuit Routing. ISTCS 1996: 37-42

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

Baruch Awerbuch, Yair Bartal, Amos Fiat: Distributed Paging for General Networks. SODA 1996: 574-583

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

Yair Bartal, Amos Fiat, Stefano Leonardi: Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. STOC 1996: 531-540

Yair Bartal, Amos Fiat, Yuval Rabani: Competitive Algorithms for Distributed Data Management. J. Comput. Syst. Sci. 51(3): 341-358 (1995)

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

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

Amos Fiat, Anna R. Karlin: Randomized and multipointer paging with locality of reference. STOC 1995: 626-634

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

Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan: Online Navigation in a Room. J. Algorithms 17(3): 319-341 (1994)

Amos Fiat, Yuval Rabani, Yiftach Ravid: Competitive k-Server Algorithms. J. Comput. Syst. Sci. 48(3): 410-428 (1994)

Amos Fiat, Moty Ricklin: Competitive Algorithms for the Weighted Server Problem. Theor. Comput. Sci. 130(1): 85-99 (1994)

Benny Chor, Amos Fiat, Moni Naor: Tracing Traitors. CRYPTO 1994: 257-270

Baruch Awerbuch, Yair Bartal, Amos Fiat, Adi Rosén: Competitive Non-Preemptive Call Control. SODA 1994: 312-320

Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky: Matching Nuts and Bolts. SODA 1994: 690-696

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

Amos Fiat, Moni Naor: Broadcast Encryption. CRYPTO 1993: 480-491

Baruch Awerbuch, Yair Bartal, Amos Fiat: Heat & Dump: Competitive Distributed Paging. FOCS 1993: 22-31

Amos Fiat, Moty Ricklin: Competitive Algorithms for the Weighted Server Problem. ISTCS 1993: 294-303

Baruch Awerbuch, Yair Bartal, Amos Fiat: Competitive distributed file allocation. STOC 1993: 164-173

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

Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel: Nonoblivious Hashing. J. ACM 39(4): 764-782 (1992)

Ran El-Yaniv, Amos Fiat, Richard M. Karp, G. Turpin: Competitive Analysis of Financial Games. FOCS 1992: 327-333

Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan: On-Line Navigation in a Room. SODA 1992: 237-249

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

Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra: New Algorithms for an Ancient Scheduling Problem. STOC 1992: 51-58

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

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

Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan: Competitive Algorithms for Layered Graph Traversal. FOCS 1991: 288-297

Amos Fiat, Moni Naor: Rigorous Time/Space Tradeoffs for Inverting Functions. STOC 1991: 534-541

Amos Fiat, Yuval Rabani, Yiftach Ravid: Competitive k-Server Algorithms (Extended Abstract). FOCS 1990: 454-463

Amos Fiat, Adi Shamir: How to find a battleship. Networks 19(3): 361-371 (1989)

Amos Fiat: Batch RSA. CRYPTO 1989: 175-185

Amos Fiat, Shahar Moses, Adi Shamir, Ilan Shimshoni, Gábor Tardos: Planning and Learning in Permutation Groups. FOCS 1989: 274-279

Amos Fiat, Moni Naor: Implicit O(1) Probe Search. STOC 1989: 336-344

Uriel Feige, Amos Fiat, Adi Shamir: Zero-Knowledge Proofs of Identity. J. Cryptology 1(2): 77-94 (1988)

David Chaum, Amos Fiat, Moni Naor: Untraceable Electronic Cash. CRYPTO 1988: 319-327

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

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

Uriel Feige, Amos Fiat, Adi Shamir: Zero Knowledge Proofs of Identity. STOC 1987: 210-217

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

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

Amos Fiat, Adi Shamir, Ehud Y. Shapiro: Polymorphic Arrays: An Architecture for a Programmable Systolic Machine. ICPP 1985: 112-117

Amos Fiat, Adi Shamir: Generalized 'write-once' memories. IEEE Transactions on Information Theory 30(3): 470-479 (1984)

Amos Fiat, Adi Shamir: Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers. FOCS 1984: 37-45