The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Amos Fiat: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yair Bartal, Amos Fiat, Yuval Rabani
    Competitive Algorithms for Distributed Data Management (Extended Abstract) [Citation Graph (5, 0)][DBLP]
    STOC, 1992, pp:39-50 [Conf]
  2. Baruch Awerbuch, Yair Bartal, Amos Fiat
    Competitive distributed file allocation. [Citation Graph (4, 0)][DBLP]
    STOC, 1993, pp:164-173 [Conf]
  3. Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young
    Competitive Paging Algorithms. [Citation Graph (3, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:4, pp:685-699 [Journal]
  4. David Chaum, Amos Fiat, Moni Naor
    Untraceable Electronic Cash. [Citation Graph (1, 0)][DBLP]
    CRYPTO, 1988, pp:319-327 [Conf]
  5. Baruch Awerbuch, Yair Bartal, Amos Fiat
    Heat & Dump: Competitive Distributed Paging [Citation Graph (1, 0)][DBLP]
    FOCS, 1993, pp:22-31 [Conf]
  6. James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts
    On-line load balancing with applications to machine scheduling and virtual circuit routing. [Citation Graph (1, 0)][DBLP]
    STOC, 1993, pp:623-631 [Conf]
  7. Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra
    New Algorithms for an Ancient Scheduling Problem [Citation Graph (1, 0)][DBLP]
    STOC, 1992, pp:51-58 [Conf]
  8. Amos Fiat, Moni Naor
    Implicit O(1) Probe Search [Citation Graph (1, 0)][DBLP]
    STOC, 1989, pp:336-344 [Conf]
  9. Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel
    Non-Oblivious Hashing (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1988, pp:367-376 [Conf]
  10. Amos Fiat, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel
    Storing and Searching a Multikey Table (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1988, pp:344-353 [Conf]
  11. Serge Abiteboul, Bogdan Cautis, Amos Fiat, Tova Milo
    Digital Signatures for Modifiable Collections. [Citation Graph (0, 0)][DBLP]
    ARES, 2006, pp:390-399 [Conf]
  12. Amos Fiat, Dmitry Pechyony
    Decision Trees: More Theoretical Justification for Practical Algorithms. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:156-170 [Conf]
  13. Serge Abiteboul, Bogdan Cautis, Amos Fiat, Haim Kaplan, Tova Milo
    Secure Exchange of Modifiable Data and Queries. [Citation Graph (0, 0)][DBLP]
    BDA, 2005, pp:- [Conf]
  14. Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev
    Bi-criteria linear-time approximations for generalized k-mean/median/center. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:19-26 [Conf]
  15. Benny Chor, Amos Fiat, Moni Naor
    Tracing Traitors. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1994, pp:257-270 [Conf]
  16. Amos Fiat
    Batch RSA. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1989, pp:175-185 [Conf]
  17. Amos Fiat, Moni Naor
    Broadcast Encryption. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1993, pp:480-491 [Conf]
  18. Amos Fiat, Adi Shamir
    How to Prove Yourself: Practical Solutions to Identification and Signature Problems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1986, pp:186-194 [Conf]
  19. Amos Fiat, Tamir Tassa
    Dynamic Traitor Training. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1999, pp:354-371 [Conf]
  20. Amos Fiat, Gerhard J. Woeginger
    Competitive Analysis of Algorithms. [Citation Graph (0, 0)][DBLP]
    Online Algorithms, 1996, pp:1-12 [Conf]
  21. Amos Fiat, Gerhard J. Woeginger
    Competitive Odds and Ends. [Citation Graph (0, 0)][DBLP]
    Online Algorithms, 1996, pp:385-394 [Conf]
  22. Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén
    On-line Competive Algorithms for Call Admission in Optical Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:431-444 [Conf]
  23. Dotan Emanuel, Amos Fiat
    Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:208-220 [Conf]
  24. Amos Fiat, Manor Mendel, Steven S. Seiden
    Online Companion Caching. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:499-511 [Conf]
  25. Amos Fiat, Jared Saia, Maxwell Young
    Making Chord Robust to Byzantine Attacks. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:803-814 [Conf]
  26. Ron Berman, Amos Fiat, Amnon Ta-Shma
    Provable Unlinkability against Traffic Analysis. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 2004, pp:266-280 [Conf]
  27. Amos Fiat, Sagi Shporer
    AIM: Another Itemset Miner. [Citation Graph (0, 0)][DBLP]
    FIMI, 2003, pp:- [Conf]
  28. Dimitris Achlioptas, Amos Fiat, Anna R. Karlin, Frank McSherry
    Web Search via Hub Synthesis. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:500-509 [Conf]
  29. Ran El-Yaniv, Amos Fiat, Richard M. Karp, G. Turpin
    Competitive Analysis of Financial Games [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:327-333 [Conf]
  30. Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan
    Competitive Algorithms for Layered Graph Traversal [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:288-297 [Conf]
  31. Amos Fiat, Manor Mendel
    Truly Online Paging with Locality of Reference. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:326-335 [Conf]
  32. Amos Fiat, Yishay Mansour, Adi Rosén, Orli Waarts
    Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:392-401 [Conf]
  33. Amos Fiat, Shahar Moses, Adi Shamir, Ilan Shimshoni, Gábor Tardos
    Planning and Learning in Permutation Groups [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:274-279 [Conf]
  34. Amos Fiat, Yuval Rabani, Yiftach Ravid
    Competitive k-Server Algorithms (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:454-463 [Conf]
  35. Amos Fiat, Adi Shamir
    Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:37-45 [Conf]
  36. Dan Feldman, Amos Fiat, Micha Sharir
    Coresets forWeighted Facilities and Their Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:315-324 [Conf]
  37. Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén
    On Capital Investment. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:429-441 [Conf]
  38. Amos Fiat
    Some Issues Regarding Search, Censorship, and Anonymity in Peer to Peer Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:33- [Conf]
  39. Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky, Ronen Shabo
    On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:608-618 [Conf]
  40. Amos Fiat, Adi Shamir, Ehud Y. Shapiro
    Polymorphic Arrays: An Architecture for a Programmable Systolic Machine. [Citation Graph (0, 0)][DBLP]
    ICPP, 1985, pp:112-117 [Conf]
  41. Edith Cohen, Amos Fiat, Haim Kaplan
    Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2003, pp:- [Conf]
  42. Jared Saia, Amos Fiat, Steven D. Gribble, Anna R. Karlin, Stefan Saroiu
    Dynamically Fault-Tolerant Content Addressable Networks. [Citation Graph (0, 0)][DBLP]
    IPTPS, 2002, pp:270-279 [Conf]
  43. Baruch Awerbuch, Yossi Azar, Amos Fiat
    Packet Routing via Min-Cost Circuit Routing. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:37-42 [Conf]
  44. Amos Fiat, Moty Ricklin
    Competitive Algorithms for the Weighted Server Problem. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:294-303 [Conf]
  45. Amos Fiat
    Some Recent Results on Data Mining and Search. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:33-36 [Conf]
  46. Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky
    Matching Nuts and Bolts. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:690-696 [Conf]
  47. Baruch Awerbuch, Yair Bartal, Amos Fiat
    Distributed Paging for General Networks. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:574-583 [Conf]
  48. Baruch Awerbuch, Yair Bartal, Amos Fiat, Adi Rosén
    Competitive Non-Preemptive Call Control. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:312-320 [Conf]
  49. Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan
    On-Line Navigation in a Room. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:237-249 [Conf]
  50. Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks
    Randomized Robot Navigation Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:75-84 [Conf]
  51. Edith Cohen, Amos Fiat, Haim Kaplan
    Efficient sequences of trials. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:737-746 [Conf]
  52. Amos Fiat, Haim Kaplan
    Making data structures confluently persistent. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:537-546 [Conf]
  53. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:545-554 [Conf]
  54. Amos Fiat, Ziv Rosen
    Experimental Studies of Access Graph Based Heuristics: Beating the LRU Standard? [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:63-72 [Conf]
  55. Amos Fiat, Jared Saia
    Censorship resistant peer-to-peer content addressable networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:94-103 [Conf]
  56. Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan
    Derandomization of auctions. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:619-625 [Conf]
  57. 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). [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:519-530 [Conf]
  58. Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke
    Optimal oblivious routing in polynomial time. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:383-388 [Conf]
  59. Yossi Azar, Amos Fiat, Anna R. Karlin, Frank McSherry, Jared Saia
    Spectral analysis of data. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:619-626 [Conf]
  60. Yair Bartal, Amos Fiat, Stefano Leonardi
    Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:531-540 [Conf]
  61. Uriel Feige, Amos Fiat, Adi Shamir
    Zero Knowledge Proofs of Identity [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:210-217 [Conf]
  62. Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin
    Competitive generalized auctions. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:72-81 [Conf]
  63. Amos Fiat, Anna R. Karlin
    Randomized and multipointer paging with locality of reference. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:626-634 [Conf]
  64. Amos Fiat, Manor Mendel
    Better algorithms for unfair metrical task systems and applications. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:725-734 [Conf]
  65. Amos Fiat, Moni Naor
    Rigorous Time/Space Tradeoffs for Inverting Functions [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:534-541 [Conf]
  66. Amos Fiat, Gerhard J. Woeginger
    On-Line Scheduling on a Single Machine: Minimizing the Total Completion Time. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1999, v:36, n:4, pp:287-293 [Journal]
  67. Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén
    On-Line Competitive Algorithms for Call Admission in Optical Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:1, pp:29-43 [Journal]
  68. Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén
    On Capital Investment. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:25, n:1, pp:22-36 [Journal]
  69. Ran El-Yaniv, Amos Fiat, Richard M. Karp, G. Turpin
    Optimal Search and One-Way Trading Online Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:1, pp:101-139 [Journal]
  70. Amos Fiat, Yuval Rabani, Yiftach Ravid, Baruch Schieber
    A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:6, pp:572-578 [Journal]
  71. Edith Cohen, Amos Fiat, Haim Kaplan
    A case for associative peer to peer overlays. [Citation Graph (0, 0)][DBLP]
    Computer Communication Review, 2003, v:33, n:1, pp:95-100 [Journal]
  72. Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young
    Competitive Paging Algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  73. Amos Fiat, Manor Mendel
    Better algorithms for unfair metrical task systems and applications [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  74. Baruch Awerbuch, Yair Bartal, Amos Fiat
    Competitive distributed file allocation. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:185, n:1, pp:1-40 [Journal]
  75. 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. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:3, pp:486-504 [Journal]
  76. Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel
    Nonoblivious Hashing. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:4, pp:764-782 [Journal]
  77. Baruch Awerbuch, Yair Bartal, Amos Fiat
    Distributed Paging for General Networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:28, n:1, pp:67-104 [Journal]
  78. Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan
    Online Navigation in a Room. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:3, pp:319-341 [Journal]
  79. Amos Fiat, Haim Kaplan
    Making data structures confluently persistent. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:1, pp:16-58 [Journal]
  80. Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke
    Optimal oblivious routing in polynomial time. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:3, pp:383-394 [Journal]
  81. Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra
    New Algorithms for an Ancient Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:3, pp:359-366 [Journal]
  82. Yair Bartal, Amos Fiat, Yuval Rabani
    Competitive Algorithms for Distributed Data Management. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:3, pp:341-358 [Journal]
  83. 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. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:43, n:3, pp:406-424 [Journal]
  84. Amos Fiat, Yuval Rabani, Yiftach Ravid
    Competitive k-Server Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:48, n:3, pp:410-428 [Journal]
  85. Amos Fiat, Adi Shamir
    Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:33, n:1, pp:47-65 [Journal]
  86. Uriel Feige, Amos Fiat, Adi Shamir
    Zero-Knowledge Proofs of Identity. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1988, v:1, n:2, pp:77-94 [Journal]
  87. Amos Fiat
    Batch RSA. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1997, v:10, n:2, pp:75-88 [Journal]
  88. Amos Fiat, Tamir Tassa
    Dynamic Traitor Tracing. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2001, v:14, n:3, pp:211-223 [Journal]
  89. Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan
    Competitive Algorithms for Layered Graph Traversal. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:447-462 [Journal]
  90. Amos Fiat, Manor Mendel
    Better Algorithms for Unfair Metrical Task Systems and Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1403-1422 [Journal]
  91. Amos Fiat, Moni Naor
    Implicit O(1) Probe Search. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:1-10 [Journal]
  92. Amos Fiat, Moni Naor
    Rigorous Time/Space Trade-offs for Inverting Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:790-803 [Journal]
  93. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1342-1359 [Journal]
  94. Yair Bartal, Amos Fiat, Stefano Leonardi
    Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:354-393 [Journal]
  95. Yossi Azar, Amos Fiat, Meital Levy, N. S. Narayanaswamy
    An improved algorithm for online coloring of intervals with bandwidth. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:363, n:1, pp:18-27 [Journal]
  96. Erik D. Demaine, Dotan Emanuel, Amos Fiat, Nicole Immorlica
    Correlation clustering in general weighted graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:361, n:2-3, pp:172-187 [Journal]
  97. Amos Fiat, Sandy Irani
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:133-135 [Journal]
  98. Amos Fiat, Moty Ricklin
    Competitive Algorithms for the Weighted Server Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:130, n:1, pp:85-99 [Journal]
  99. Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas
    Tracing traitors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:893-910 [Journal]
  100. Amos Fiat, Adi Shamir
    Generalized 'write-once' memories. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:3, pp:470-479 [Journal]
  101. Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky
    Strong Price of Anarchy for Machine Load Balancing. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:583-594 [Conf]
  102. Amos Fiat, Yishay Mansour, Uri Nadav
    Efficient contention resolution protocols for selfish agents. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:179-188 [Conf]
  103. Edith Cohen, Amos Fiat, Haim Kaplan
    Associative search in peer to peer networks: Harnessing latent semantics. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2007, v:51, n:8, pp:1861-1881 [Journal]
  104. Amos Fiat, Manor Mendel
    Truly Online Paging with Locality of Reference [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  105. Strong Price of Anarchy for Machine Load Balancing. [Citation Graph (, )][DBLP]


  106. Envy-free makespan approximation: extended abstract. [Citation Graph (, )][DBLP]


  107. Competitive queue management for latency sensitive packets. [Citation Graph (, )][DBLP]


  108. Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. [Citation Graph (, )][DBLP]


  109. Private coresets. [Citation Graph (, )][DBLP]


  110. Caching Content under Digital Rights Management. [Citation Graph (, )][DBLP]


  111. Envy, Multi Envy, and Revenue Maximization. [Citation Graph (, )][DBLP]


  112. Subjective vs.Objective Reality - The Risk of Running Late. [Citation Graph (, )][DBLP]


  113. Envy-Free Makespan Approximation [Citation Graph (, )][DBLP]


  114. Envy, Multi Envy, and Revenue Maximization [Citation Graph (, )][DBLP]


  115. Combinatorial Auctions with Budgets [Citation Graph (, )][DBLP]


  116. Truth and Envy in Capacitated Allocation Games [Citation Graph (, )][DBLP]


  117. On the Interplay between Incentive Compatibility and Envy Freeness [Citation Graph (, )][DBLP]


Search in 0.033secs, Finished in 0.036secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002