default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmos Fiat
2020 – today
- 2025
[c106]Ran Canetti
, Amos Fiat, Yannai A. Gonczarowski:
Zero-Knowledge Mechanisms. EC 2025: 338-339- [i28]Hannaneh Akrami, Alon Eden, Michal Feldman, Amos Fiat, Yoav Gal Tzur:
Fair Division via Resource Augmentation. CoRR abs/2502.09377 (2025) - 2024
- [j47]Yossi Azar, Amos Fiat, Federico Fusco:
An α-regret analysis of adversarial bilateral trade. Artif. Intell. 337: 104231 (2024) - [j46]Alon Eden, Michal Feldman, Amos Fiat, Kira Goldner, Anna R. Karlin:
Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue. Math. Oper. Res. 49(2): 653-674 (2024) - 2023
- [c105]George Christodoulou, Amos Fiat, Elias Koutsoupias, Alkmini Sgouritsa:
Fair allocation in graphs. EC 2023: 473-488 - [i27]Ran Canetti, Amos Fiat, Yannai A. Gonczarowski:
Zero-Knowledge Mechanisms. CoRR abs/2302.05590 (2023) - 2022
- [c104]Ben Berger, Avi Cohen, Michal Feldman, Amos Fiat:
Almost Full EFX Exists for Four Agents. AAAI 2022: 4826-4833 - [c103]Yossi Azar, Amos Fiat, Federico Fusco:
An $\alpha$-regret analysis of Adversarial Bilateral Trade. NeurIPS 2022 - [i26]Yossi Azar, Amos Fiat, Federico Fusco:
An α-regret analysis of Adversarial Bilateral Trade. CoRR abs/2210.06846 (2022) - 2021
- [c102]Alon Eden, Michal Feldman, Amos Fiat, Kineret Segal:
An Economics-Based Analysis of RANKING for Online Bipartite Matching. SOSA 2021: 107-110 - [i25]Ben Berger, Avi Cohen, Michal Feldman, Amos Fiat:
(Almost Full) EFX Exists for Four Agents (and Beyond). CoRR abs/2102.10654 (2021) - [i24]Nir Andelman, Michal Feldman, Amos Fiat, Yishay Mansour:
Competitive Equilibria with Unequal Budgets: Supporting Arbitrary Pareto Optimal Allocations. CoRR abs/2103.08634 (2021)
2010 – 2019
- 2019
- [j45]Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yishay Mansour, Svetlana Olonetsky:
Beyond myopic best response (in Cournot competition). Games Econ. Behav. 113: 38-57 (2019) - [c101]Ilan Reuven Cohen, Alon Eden, Amos Fiat, Lukasz Jez:
Dynamic Pricing of Servers on Trees. APPROX-RANDOM 2019: 10:1-10:22 - [c100]Yossi Azar, Allan Borodin, Michal Feldman, Amos Fiat, Kineret Segal:
Efficient Allocation of Free Stuff. AAMAS 2019: 918-925 - [c99]Alon Eden, Michal Feldman, Amos Fiat, Kira Goldner, Anna R. Karlin:
Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue. EC 2019: 19-20 - [c98]Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Christos H. Papadimitriou:
Energy Equilibria in Proof-of-Work Mining. EC 2019: 489-502 - [i23]Alon Eden, Michal Feldman, Amos Fiat, Kira Goldner, Anna R. Karlin:
Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue. CoRR abs/1903.08384 (2019) - 2018
- [c97]Alon Eden, Michal Feldman, Amos Fiat, Tzahi Taub:
Truthful Prompt Scheduling for Minimizing Sum of Completion Times. ESA 2018: 27:1-27:14 - [c96]Alon Eden, Michal Feldman, Amos Fiat, Kira Goldner:
Interdependent Values without Single-Crossing. EC 2018: 369 - [i22]Alon Eden, Michal Feldman, Amos Fiat, Tzahi Taub:
Prompt Scheduling for Selfish Agents. CoRR abs/1804.03244 (2018) - [i21]Alon Eden, Michal Feldman, Amos Fiat, Kineret Segal:
An Economic-Based Analysis of RANKING for Online Bipartite Matching. CoRR abs/1804.06637 (2018) - [i20]Amos Fiat, Yishay Mansour, Lior Shultz:
Flow Equilibria via Online Surge Pricing. CoRR abs/1804.09672 (2018) - [i19]Alon Eden, Michal Feldman, Amos Fiat, Kira Goldner:
Interdependent Values without Single-Crossing. CoRR abs/1806.03865 (2018) - 2017
- [c95]Michal Feldman, Amos Fiat, Alan Roytman:
Makespan Minimization via Posted Prices. EC 2017: 405-422 - [c94]Shiri Chechik, Sarel Cohen, Amos Fiat, Haim Kaplan:
(1 + ∊)-Approximate f-Sensitive Distance Oracles. SODA 2017: 1479-1496 - [i18]Michal Feldman, Amos Fiat, Alan Roytman:
Makespan Minimization via Posted Prices. CoRR abs/1705.01965 (2017) - 2016
- [j44]Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato F. Werneck:
Highway Dimension and Provably Efficient Shortest Path Algorithms. J. ACM 63(5): 41:1-41:26 (2016) - [c93]Michal Feldman, Amos Fiat, Svetlana Obraztsova:
Variations on the Hotelling-Downs Model. AAAI 2016: 496-501 - [c92]Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Claire Mathieu, Rotem Zach:
Carpooling in Social Networks. ICALP 2016: 43:1-43:13 - [c91]Amos Fiat, Yishay Mansour, Mariano Schain:
History-Independent Distributed Multi-agent Learning. SAGT 2016: 77-89 - [c90]Amos Fiat, Kira Goldner, Anna R. Karlin, Elias Koutsoupias:
The FedEx Problem. EC 2016: 21-22 - [c89]Michal Feldman, Amos Fiat, Iddan Golomb:
On Voting and Facility Location. EC 2016: 269-286 - [c88]Vincent Cohen-Addad, Alon Eden, Michal Feldman, Amos Fiat:
The Invisible Hand of Dynamic Market Pricing. EC 2016: 383-400 - [c87]Shaddin Dughmi, Alon Eden, Michal Feldman, Amos Fiat, Stefano Leonardi:
Lottery Pricing Equilibria. EC 2016: 401-418 - [c86]Yossi Azar, Ilan Reuven Cohen, Amos Fiat, Alan Roytman:
Packing Small Vectors. SODA 2016: 1511-1525 - 2015
- [j43]Sarel Cohen, Amos Fiat, Moshik Hershcovitch, Haim Kaplan:
Minimal indices for predecessor search. Inf. Comput. 240: 12-30 (2015) - [j42]Ron Berman, Amos Fiat, Marcin Gomulkiewicz, Marek Klonowski, Miroslaw Kutylowski, Tomer Levinboim, Amnon Ta-Shma:
Provable Unlinkability Against Traffic Analysis with Low Message Overhead. J. Cryptol. 28(3): 623-640 (2015) - [c85]Amos Fiat, Ilia Gorelik, Haim Kaplan, Slava Novgorodov:
The Temp Secretary Problem. ESA 2015: 631-642 - [c84]Ilan Reuven Cohen, Alon Eden, Amos Fiat, Lukasz Jez:
Pricing Online Decisions: Beyond Auctions. SODA 2015: 73-91 - [i17]Ilan Reuven Cohen, Alon Eden, Amos Fiat, Lukasz Jez:
Pricing Online Decisions: Beyond Auctions. CoRR abs/1504.01093 (2015) - [i16]Amos Fiat, Ilia Gorelik, Haim Kaplan, Slava Novgorodov:
The Temp Secretary Problem. CoRR abs/1507.01732 (2015) - [i15]Vincent Cohen-Addad, Alon Eden, Michal Feldman, Amos Fiat:
The Invisible Hand of Dynamic Market Pricing. CoRR abs/1511.05646 (2015) - [i14]Michal Feldman, Amos Fiat, Iddan Golomb:
On Voting and Facility Location. CoRR abs/1512.05868 (2015) - 2013
- [c83]Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Angelina Vidali:
Approaching utopia: strong truthfulness and externality-resistant mechanisms. ITCS 2013: 221-230 - [c82]Sarel Cohen, Amos Fiat, Moshik Hershcovitch, Haim Kaplan:
Minimal Indices for Successor Search - (Extended Abstract). MFCS 2013: 278-289 - [i13]Sarel Cohen, Amos Fiat, Moshe Hershcovitch, Haim Kaplan:
Minimal Indices for Successor Search. CoRR abs/1306.3772 (2013) - [i12]Edith Cohen, Amos Fiat, Haim Kaplan, Liam Roditty:
A Labeling Approach to Incremental Cycle Detection. CoRR abs/1310.8381 (2013) - 2012
- [j41]Amos Fiat:
Why study the price of anarchy?: technical perspective. Commun. ACM 55(7): 115 (2012) - [j40]Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky:
Envy-Free Makespan Approximation. SIAM J. Comput. 41(1): 12-25 (2012) - [c81]Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck:
HLDB: location-based services in databases. SIGSPATIAL/GIS 2012: 339-348 - [c80]Michal Feldman, Amos Fiat, Stefano Leonardi, Piotr Sankowski:
Revenue maximizing envy-free multi-unit auctions with budgets. EC 2012: 532-549 - [c79]Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yishay Mansour, Svetlana Olonetsky:
Beyond myopic best response (in Cournot competition). SODA 2012: 993-1005 - [c78]Amos Fiat, Ariel Levavi:
Tight Lower Bounds on Envy-Free Makespan Approximation. WINE 2012: 553-558 - [i11]Amos Fiat, Ariel Levavi:
Tight Lower Bounds on Envy-Free Makespan Approximation. CoRR abs/1205.1786 (2012) - [i10]Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Angelina Vidali:
Approaching Utopia: Strong Truthfulness and Externality-Resistant Mechanisms. CoRR abs/1208.3939 (2012) - 2011
- [j39]Amos Fiat:
Special Issue: European Symposium on Algorithms, Design and Analysis. Algorithmica 61(1): 1-2 (2011) - [j38]Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan:
Derandomization of auctions. Games Econ. Behav. 72(1): 1-11 (2011) - [c77]Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck:
VC-Dimension and Shortest Path Algorithms. ICALP (1) 2011: 690-699 - [c76]Amos Fiat, Stefano Leonardi, Jared Saia, Piotr Sankowski:
Single valued combinatorial auctions with budgets. EC 2011: 223-232 - [c75]Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky:
Truth, Envy, and Truthful Market Clearing Bundle Pricing. WINE 2011: 97-108 - 2010
- [c74]Amos Fiat, Christos H. Papadimitriou:
When the Players Are Not Expectation Maximizers. SAGT 2010: 1-14 - [c73]Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky:
Envy-free makespan approximation: extended abstract. EC 2010: 159-166 - [c72]Ittai Abraham, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. SODA 2010: 782-793 - [i9]Amos Fiat, Stefano Leonardi, Jared Saia, Piotr Sankowski:
Combinatorial Auctions with Budgets. CoRR abs/1001.1686 (2010) - [i8]Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky:
Truth and Envy in Capacitated Allocation Games. CoRR abs/1003.5326 (2010) - [i7]Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky:
On the Interplay between Incentive Compatibility and Envy Freeness. CoRR abs/1003.5328 (2010)
2000 – 2009
- 2009
- [c71]Dan Feldman, Amos Fiat, Haim Kaplan, Kobbi Nissim:
Private coresets. STOC 2009: 361-370 - [c70]Amos Fiat, Amiram Wingarten:
Envy, Multi Envy, and Revenue Maximization. WINE 2009: 498-504 - [e2]Amos Fiat, Peter Sanders:
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 [contents] - [i6]Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky:
Envy-Free Makespan Approximation. CoRR abs/0909.1072 (2009) - [i5]Amos Fiat, Amiram Wingarten:
Envy, Multi Envy, and Revenue Maximization. CoRR abs/0909.4569 (2009) - 2008
- [c69]Amos Fiat, Hila Pochter:
Subjective vs.Objective Reality - The Risk of Running Late. SAGT 2008: 279-290 - [c68]Amos Fiat, Yishay Mansour, Uri Nadav:
Competitive queue management for latency sensitive packets. SODA 2008: 228-237 - [c67]Leah Epstein, Amos Fiat, Meital Levy:
Caching Content under Digital Rights Management. WAOA 2008: 188-200 - 2007
- [j37]Edith Cohen, Amos Fiat, Haim Kaplan:
Associative search in peer to peer networks: Harnessing latent semantics. Comput. Networks 51(8): 1861-1881 (2007) - [j36]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) - [j35]Amos Fiat, Jared Saia:
Censorship Resistant Peer-to-Peer Networks. Theory Comput. 3(1): 1-23 (2007) - [c66]Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev:
Bi-criteria linear-time approximations for generalized k-mean/median/center. SCG 2007: 19-26 - [c65]Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky:
Strong Price of Anarchy for Machine Load Balancing. ICALP 2007: 583-594 - [c64]Amos Fiat, Yishay Mansour, Uri Nadav:
Efficient contention resolution protocols for selfish agents. SODA 2007: 179-188 - [i4]Amos Fiat, Meital Levy, Haim Kaplan, Svetlana Olonetsky:
Strong Price of Anarchy for Machine Load Balancing. Fair Division 2007 - 2006
- [j34]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) - [j33]Erik D. Demaine, Dotan Emanuel, Amos Fiat, Nicole Immorlica:
Correlation clustering in general weighted graphs. Theor. Comput. Sci. 361(2-3): 172-187 (2006) - [j32]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) - [c63]Serge Abiteboul, Bogdan Cautis, Amos Fiat, Tova Milo:
Digital Signatures for Modifiable Collections. ARES 2006: 390-399 - [c62]Dan Feldman, Amos Fiat, Micha Sharir:
Coresets forWeighted Facilities and Their Applications. FOCS 2006: 315-324 - [c61]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 - [i3]Amos Fiat, Manor Mendel:
Truly Online Paging with Locality of Reference. CoRR abs/cs/0601127 (2006) - 2005
- [c60]Serge Abiteboul, Bogdan Cautis, Amos Fiat, Haim Kaplan, Tova Milo:
Secure Exchange of Modifiable Data and Queries. BDA 2005 - [c59]Amos Fiat, Jared Saia, Maxwell Young:
Making Chord Robust to Byzantine Attacks. ESA 2005: 803-814 - [c58]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 - [c57]Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan:
Derandomization of auctions. STOC 2005: 619-625 - 2004
- [j31]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) - [j30]Amos Fiat, Sandy Irani:
Foreword. Theor. Comput. Sci. 324(2-3): 133-135 (2004) - [c56]Amos Fiat, Dmitry Pechyony:
Decision Trees: More Theoretical Justification for Practical Algorithms. ALT 2004: 156-170 - [c55]Ron Berman, Amos Fiat, Amnon Ta-Shma:
Provable Unlinkability against Traffic Analysis. Financial Cryptography 2004: 266-280 - [i2]Amos Fiat, Manor Mendel:
Better algorithms for unfair metrical task systems and applications. CoRR cs.DS/0406034 (2004) - 2003
- [j29]Edith Cohen, Amos Fiat, Haim Kaplan:
A case for associative peer to peer overlays. Comput. Commun. Rev. 33(1): 95-100 (2003) - [j28]Baruch Awerbuch, Yair Bartal, Amos Fiat:
Competitive distributed file allocation. Inf. Comput. 185(1): 1-40 (2003) - [j27]Amos Fiat, Haim Kaplan:
Making data structures confluently persistent. J. Algorithms 48(1): 16-58 (2003) - [j26]Amos Fiat, Manor Mendel:
Better Algorithms for Unfair Metrical Task Systems and Applications. SIAM J. Comput. 32(6): 1403-1422 (2003) - [c54]Dotan Emanuel, Amos Fiat:
Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs. ESA 2003: 208-220 - [c53]Amos Fiat, Sagi Shporer:
AIM: Another Itemset Miner. FIMI 2003 - [c52]Amos Fiat:
Some Issues Regarding Search, Censorship, and Anonymity in Peer to Peer Networks. ICALP 2003: 33 - [c51]Edith Cohen, Amos Fiat, Haim Kaplan:
Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. INFOCOM 2003: 1261-1271 - [c50]Edith Cohen, Amos Fiat, Haim Kaplan:
Efficient sequences of trials. SODA 2003: 737-746 - [c49]Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke:
Optimal oblivious routing in polynomial time. STOC 2003: 383-388 - 2002
- [c48]Amos Fiat, Manor Mendel, Steven S. Seiden:
Online Companion Caching. ESA 2002: 499-511 - [c47]Jared Saia, Amos Fiat, Steven D. Gribble, Anna R. Karlin, Stefan Saroiu:
Dynamically Fault-Tolerant Content Addressable Networks. IPTPS 2002: 270-279 - [c46]Amos Fiat, Jared Saia:
Censorship resistant peer-to-peer content addressable networks. SODA 2002: 94-103 - [c45]Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin:
Competitive generalized auctions. STOC 2002: 72-81 - [i1]Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young:
Competitive Paging Algorithms. CoRR cs.DS/0205038 (2002) - 2001
- [j25]Ran El-Yaniv, Amos Fiat, Richard M. Karp, G. Turpin:
Optimal Search and One-Way Trading Online Algorithms. Algorithmica 30(1): 101-139 (2001) - [j24]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) - [j23]Amos Fiat, Tamir Tassa:
Dynamic Traitor Tracing. J. Cryptol. 14(3): 211-223 (2001) - [c44]Dimitris Achlioptas, Amos Fiat, Anna R. Karlin, Frank McSherry:
Web Search via Hub Synthesis. FOCS 2001: 500-509 - [c43]Amos Fiat:
Some Recent Results on Data Mining and Search. MFCS 2001: 33-36 - [c42]Amos Fiat, Haim Kaplan:
Making data structures confluently persistent. SODA 2001: 537-546 - [c41]Yossi Azar, Amos Fiat, Anna R. Karlin, Frank McSherry, Jared Saia:
Spectral analysis of data. STOC 2001: 619-626 - 2000
- [j22]Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas:
Tracing traitors. IEEE Trans. Inf. Theory 46(3): 893-910 (2000) - [c40]Amos Fiat, Manor Mendel:
Better algorithms for unfair metrical task systems and applications. STOC 2000: 725-734
1990 – 1999
- 1999
- [j21]Amos Fiat, Gerhard J. Woeginger:
On-Line Scheduling on a Single Machine: Minimizing the Total Completion Time. Acta Informatica 36(4): 287-293 (1999) - [j20]Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén:
On Capital Investment. Algorithmica 25(1): 22-36 (1999) - [j19]Amos Fiat, Moni Naor:
Rigorous Time/Space Trade-offs for Inverting Functions. SIAM J. Comput. 29(3): 790-803 (1999) - [c39]Amos Fiat, Tamir Tassa:
Dynamic Traitor Training. CRYPTO 1999: 354-371 - 1998
- [j18]Baruch Awerbuch, Yair Bartal, Amos Fiat:
Distributed Paging for General Networks. J. Algorithms 28(1): 67-104 (1998) - [j17]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) - [e1]Amos Fiat, Gerhard J. Woeginger:
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 [contents] - 1997
- [j16]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) - [j15]Amos Fiat:
Batch RSA. J. Cryptol. 10(2): 75-88 (1997) - [c38]Amos Fiat, Manor Mendel:
Truly Online Paging with Locality of Reference. FOCS 1997: 326-335 - [c37]Amos Fiat, Ziv Rosen:
Experimental Studies of Access Graph Based Heuristics: Beating the LRU Standard? SODA 1997: 63-72 - 1996
- [c36]Amos Fiat, Gerhard J. Woeginger:
Competitive Analysis of Algorithms. Online Algorithms 1996: 1-12 - [c35]Amos Fiat, Gerhard J. Woeginger:
Competitive Odds and Ends. Online Algorithms 1996: 385-394 - [c34]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 - [c33]Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén:
On Capital Investment. ICALP 1996: 429-441 - [c32]Baruch Awerbuch, Yossi Azar, Amos Fiat:
Packet Routing via Min-Cost Circuit Routing. ISTCS 1996: 37-42 - [c31]Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks:
Randomized Robot Navigation Algorithms. SODA 1996: 75-84 - [c30]Baruch Awerbuch, Yair Bartal, Amos Fiat:
Distributed Paging for General Networks. SODA 1996: 574-583 - [c29]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 - [c28]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 - 1995
- [j14]Yair Bartal, Amos Fiat, Yuval Rabani:
Competitive Algorithms for Distributed Data Management. J. Comput. Syst. Sci. 51(3): 341-358 (1995) - [j13]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) - [c27]Amos Fiat, Yishay Mansour, Adi Rosén, Orli Waarts:
Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version). FOCS 1995: 392-401 - [c26]Amos Fiat, Anna R. Karlin:
Randomized and multipointer paging with locality of reference. STOC 1995: 626-634 - 1994
- [j12]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) - [j11]Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan:
Online Navigation in a Room. J. Algorithms 17(3): 319-341 (1994) - [j10]Amos Fiat, Yuval Rabani, Yiftach Ravid:
Competitive k-Server Algorithms. J. Comput. Syst. Sci. 48(3): 410-428 (1994) - [j9]Amos Fiat, Moty Ricklin:
Competitive Algorithms for the Weighted Server Problem. Theor. Comput. Sci. 130(1): 85-99 (1994) - [c25]Benny Chor, Amos Fiat, Moni Naor:
Tracing Traitors. CRYPTO 1994: 257-270 - [c24]Baruch Awerbuch, Yair Bartal, Amos Fiat, Adi Rosén:
Competitive Non-Preemptive Call Control. SODA 1994: 312-320 - [c23]Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky:
Matching Nuts and Bolts. SODA 1994: 690-696 - 1993
- [j8]Amos Fiat, Moni Naor:
Implicit O(1) Probe Search. SIAM J. Comput. 22(1): 1-10 (1993) - [c22]Amos Fiat, Moni Naor:
Broadcast Encryption. CRYPTO 1993: 480-491 - [c21]Baruch Awerbuch, Yair Bartal, Amos Fiat:
Heat & Dump: Competitive Distributed Paging. FOCS 1993: 22-31 - [c20]Amos Fiat, Moty Ricklin:
Competitive Algorithms for the Weighted Server Problem. ISTCS 1993: 294-303 - [c19]Baruch Awerbuch, Yair Bartal, Amos Fiat:
Competitive distributed file allocation. STOC 1993: 164-173 - [c18]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 - 1992
- [j7]Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel:
Nonoblivious Hashing. J. ACM 39(4): 764-782 (1992) - [c17]Ran El-Yaniv, Amos Fiat, Richard M. Karp, G. Turpin:
Competitive Analysis of Financial Games. FOCS 1992: 327-333 - [c16]Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan:
On-Line Navigation in a Room. SODA 1992: 237-249 - [c15]Yair Bartal, Amos Fiat, Yuval Rabani:
Competitive Algorithms for Distributed Data Management (Extended Abstract). STOC 1992: 39-50 - [c14]Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra:
New Algorithms for an Ancient Scheduling Problem. STOC 1992: 51-58 - 1991
- [j6]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) - [j5]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) - [c13]Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan:
Competitive Algorithms for Layered Graph Traversal. FOCS 1991: 288-297 - [c12]Amos Fiat, Moni Naor:
Rigorous Time/Space Tradeoffs for Inverting Functions. STOC 1991: 534-541 - 1990
- [c11]Amos Fiat, Yuval Rabani, Yiftach Ravid:
Competitive k-Server Algorithms (Extended Abstract). FOCS 1990: 454-463
1980 – 1989
- 1989
- [j4]Amos Fiat, Adi Shamir:
How to find a battleship. Networks 19(3): 361-371 (1989) - [c10]Amos Fiat:
Batch RSA. CRYPTO 1989: 175-185 - [c9]Amos Fiat, Shahar Moses, Adi Shamir, Ilan Shimshoni, Gábor Tardos:
Planning and Learning in Permutation Groups. FOCS 1989: 274-279 - [c8]Amos Fiat, Moni Naor:
Implicit O(1) Probe Search. STOC 1989: 336-344 - 1988
- [j3]Uriel Feige, Amos Fiat, Adi Shamir:
Zero-Knowledge Proofs of Identity. J. Cryptol. 1(2): 77-94 (1988) - [c7]David Chaum, Amos Fiat, Moni Naor:
Untraceable Electronic Cash. CRYPTO 1988: 319-327 - [c6]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 - [c5]Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel:
Non-Oblivious Hashing (Extended Abstract). STOC 1988: 367-376 - 1987
- [c4]Uriel Feige, Amos Fiat, Adi Shamir:
Zero Knowledge Proofs of Identity. STOC 1987: 210-217 - 1986
- [j2]Amos Fiat, Adi Shamir:
Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers. J. Comput. Syst. Sci. 33(1): 47-65 (1986) - [c3]Amos Fiat, Adi Shamir:
How to Prove Yourself: Practical Solutions to Identification and Signature Problems. CRYPTO 1986: 186-194 - 1985
- [c2]Amos Fiat, Adi Shamir, Ehud Shapiro:
Polymorphic Arrays: An Architecture for a Programmable Systolic Machine. ICPP 1985: 112-117 - 1984
- [j1]Amos Fiat, Adi Shamir:
Generalized 'write-once' memories. IEEE Trans. Inf. Theory 30(3): 470-479 (1984) - [c1]Amos Fiat, Adi Shamir:
Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers. FOCS 1984: 37-45
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-08-10 22:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
