Amos Fiat

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2012
65Beyond myopic best response (in Cournot competition). Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yishay Mansour, Svetlana Olonetsky. SODA 2012, 993-1005. Web SearchBibTeXDownload
2011
64Single valued combinatorial auctions with budgets. Amos Fiat, Stefano Leonardi, Jared Saia, Piotr Sankowski. ACM Conference on Electronic Commerce 2011, 223-232. Web SearchBibTeXDownload
63Truth, Envy, and Truthful Market Clearing Bundle Pricing. Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky. WINE 2011, 97-108. Web SearchBibTeXDownload
2010
62Envy-free makespan approximation: extended abstract. Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky. ACM Conference on Electronic Commerce 2010, 159-166. Web SearchBibTeXDownload
61Truth and Envy in Capacitated Allocation Games. Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky. CoRR (abs/1003.5326) (2010). Web SearchBibTeXDownload
60Combinatorial Auctions with Budgets. Amos Fiat, Stefano Leonardi, Jared Saia, Piotr Sankowski. CoRR (abs/1001.1686) (2010). Web SearchBibTeXDownload
59On the Interplay between Incentive Compatibility and Envy Freeness. Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky. CoRR (abs/1003.5328) (2010). Web SearchBibTeXDownload
58When the Players Are Not Expectation Maximizers. Amos Fiat, Christos H. Papadimitriou. SAGT 2010, 1-14. Web SearchBibTeXDownload
2009
57Envy-Free Makespan Approximation. Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky. CoRR (abs/0909.1072) (2009). Web SearchBibTeXDownload
56Private coresets. Dan Feldman, Amos Fiat, Haim Kaplan, Kobbi Nissim. STOC 2009, 361-370. Web SearchBibTeXDownload
2007
55Associative search in peer to peer networks: Harnessing latent semantics. Edith Cohen, Amos Fiat, Haim Kaplan. Computer Networks (51): 1861-1881 (2007). Cited by 183Web SearchBibTeXDownload
54Strong Price of Anarchy for Machine Load Balancing. Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky. ICALP 2007, 583-594. Web SearchBibTeXDownload
53Online Conflict-Free Coloring for Intervals. Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl. SIAM J. Comput. (36): 1342-1359 (2007). Web SearchBibTeXDownload
52Censorship Resistant Peer-to-Peer Networks. Amos Fiat, Jared Saia. Theory of Computing (3): 1-23 (2007). Web SearchBibTeXDownload
2006
51Digital Signatures for Modifiable Collections. Serge Abiteboul, Bogdan Cautis, Amos Fiat, Tova Milo. ARES 2006, 390-399. Cited by 4Web SearchBibTeXDownload
50On 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, 608-618. Web SearchBibTeXDownload
49Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. Yair Bartal, Amos Fiat, Stefano Leonardi. SIAM J. Comput. (36): 354-393 (2006). Web SearchBibTeXDownload
48Correlation clustering in general weighted graphs. Erik D. Demaine, Dotan Emanuel, Amos Fiat, Nicole Immorlica. Theor. Comput. Sci. (361): 172-187 (2006). Web SearchBibTeXDownload
2005
47Secure Exchange of Modifiable Data and Queries. Serge Abiteboul, Bogdan Cautis, Amos Fiat, Haim Kaplan, Tova Milo. BDA 2005. Web SearchBibTeX
46Making Chord Robust to Byzantine Attacks. Amos Fiat, Jared Saia, Maxwell Young. ESA 2005, 803-814. Web SearchBibTeXDownload
45Derandomization of auctions. Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan. STOC 2005, 619-625. Cited by 21Web SearchBibTeXDownload
2004
44Optimal oblivious routing in polynomial time. Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke. J. Comput. Syst. Sci. (69): 383-394 (2004). Cited by 95Web SearchBibTeXDownload
2003
43A case for associative peer to peer overlays. Edith Cohen, Amos Fiat, Haim Kaplan. Computer Communication Review (33): 95-100 (2003). Cited by 37Web SearchBibTeXDownload
42Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. Edith Cohen, Amos Fiat, Haim Kaplan. INFOCOM 2003. Web SearchBibTeXDownload
41Making data structures confluently persistent. Amos Fiat, Haim Kaplan. J. Algorithms (48): 16-58 (2003). Web SearchBibTeXDownload
40Efficient sequences of trials. Edith Cohen, Amos Fiat, Haim Kaplan. SODA 2003, 737-746. Cited by 23Web SearchBibTeXDownload
39Optimal oblivious routing in polynomial time. Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke. STOC 2003, 383-388. Cited by 95Web SearchBibTeXDownload
2002
38Competitive Paging Algorithms. Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young. CoRR (cs.DS/0205038) (2002). Web SearchBibTeXDownload
37Dynamically Fault-Tolerant Content Addressable Networks. Jared Saia, Amos Fiat, Steven D. Gribble, Anna R. Karlin, Stefan Saroiu. IPTPS 2002, 270-279. Web SearchBibTeXDownload
36Censorship resistant peer-to-peer content addressable networks. Amos Fiat, Jared Saia. SODA 2002, 94-103. Web SearchBibTeXDownload
2001
35Optimal Search and One-Way Trading Online Algorithms. Ran El-Yaniv, Amos Fiat, Richard M. Karp, G. Turpin. Algorithmica (30): 101-139 (2001). Web SearchBibTeXDownload
34On-Line Competitive Algorithms for Call Admission in Optical Networks. Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén. Algorithmica (31): 29-43 (2001). Web SearchBibTeXDownload
33Web Search via Hub Synthesis. Dimitris Achlioptas, Amos Fiat, Unknown, Frank McSherry. FOCS 2001, 500-509. Web SearchBibTeXDownload
32Dynamic Traitor Tracing. Amos Fiat, Tamir Tassa. J. Cryptology (14): 211-223 (2001). Web SearchBibTeXDownload
31Making data structures confluently persistent. Amos Fiat, Haim Kaplan. SODA 2001, 537-546. Web SearchBibTeXDownload
30Spectral analysis of data. Yossi Azar, Amos Fiat, Anna R. Karlin, Frank McSherry, Jared Saia. STOC 2001, 619-626. Web SearchBibTeXDownload
2000
29Tracing traitors. Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas. IEEE Transactions on Information Theory (46): 893-910 (2000). Cited by 493Web SearchBibTeXDownload
1999
28On Capital Investment. Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén. Algorithmica (25): 22-36 (1999). Web SearchBibTeXDownload
27Dynamic Traitor Training. Amos Fiat, Tamir Tassa. CRYPTO 1999, 354-371. Web SearchBibTeXDownload
26Rigorous Time/Space Trade-offs for Inverting Functions. Amos Fiat, Moni Naor. SIAM J. Comput. (29): 790-803 (1999). Web SearchBibTeXDownload
1998
25Competitive Algorithms for Layered Graph Traversal. Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan. SIAM J. Comput. (28): 447-462 (1998). Web SearchBibTeXDownload
1997
24On-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 (44): 486-504 (1997). Web SearchBibTeXDownload
1996
23On-line Competive Algorithms for Call Admission in Optical Networks. Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén. ESA 1996, 431-444. Web SearchBibTeXDownload
22On Capital Investment. Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén. ICALP 1996, 429-441. Web SearchBibTeXDownload
21Randomized Robot Navigation Algorithms. Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks. SODA 1996, 75-84. Web SearchBibTeXDownload
20Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. Yair Bartal, Amos Fiat, Stefano Leonardi. STOC 1996, 531-540. Web SearchBibTeXDownload
19Making 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, 519-530. Web SearchBibTeXDownload
1995
18New Algorithms for an Ancient Scheduling Problem. Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra. J. Comput. Syst. Sci. (51): 359-366 (1995). Web SearchBibTeXDownload
1994
17Tracing Traitors. Benny Chor, Amos Fiat, Moni Naor. CRYPTO 1994, 257-270. Web SearchBibTeXDownload
16Matching Nuts and Bolts. Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky. SODA 1994, 690-696. Web SearchBibTeXDownload
1993
15Broadcast Encryption. Amos Fiat, Moni Naor. CRYPTO 1993, 480-491. Web SearchBibTeXDownload
14Implicit O(1) Probe Search. Amos Fiat, Moni Naor. SIAM J. Comput. (22): 1-10 (1993). Web SearchBibTeXDownload
13On-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, 623-631. Web SearchBibTeXDownload
1992
12Competitive Analysis of Financial Games. Ran El-Yaniv, Amos Fiat, Richard M. Karp, G. Turpin. FOCS 1992, 327-333. Web SearchBibTeXDownload
11Nonoblivious Hashing. Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel. J. ACM (39): 764-782 (1992). Cited by 35Web SearchBibTeXDownload
10New Algorithms for an Ancient Scheduling Problem. Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra. STOC 1992, 51-58. Web SearchBibTeXDownload
1991
9Competitive Algorithms for Layered Graph Traversal. Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan. FOCS 1991, 288-297. Web SearchBibTeXDownload
8Competitive Paging Algorithms. Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young. J. Algorithms (12): 685-699 (1991). Web SearchBibTeXDownload
7An 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. (43): 406-424 (1991). Web SearchBibTeXDownload
6Rigorous Time/Space Tradeoffs for Inverting Functions. Amos Fiat, Moni Naor. STOC 1991, 534-541. Web SearchBibTeXDownload
1989
5Planning and Learning in Permutation Groups. Amos Fiat, Shahar Moses, Adi Shamir, Ilan Shimshoni, Gábor Tardos. FOCS 1989, 274-279. Web SearchBibTeXDownload
4Implicit O(1) Probe Search. Amos Fiat, Moni Naor. STOC 1989, 336-344. Web SearchBibTeXDownload
1988
3Untraceable Electronic Cash. David Chaum, Amos Fiat, Moni Naor. CRYPTO 1988, 319-327. Web SearchBibTeXDownload
2Non-Oblivious Hashing (Extended Abstract). Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel. STOC 1988, 367-376. Web SearchBibTeXDownload
1Storing and Searching a Multikey Table (Extended Abstract). Amos Fiat, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel. STOC 1988, 344-353. Cited by 5Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research