 | 2010 |
|---|
| 116 |       | Amos Fiat,
Stefano Leonardi,
Jared Saia,
Piotr Sankowski:
Combinatorial Auctions with Budgets
CoRR abs/1001.1686: (2010) |
| 2009 |
|---|
| 115 | | Amos Fiat,
Peter Sanders:
Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings
Springer 2009 |
| 114 | | Dan Feldman,
Amos Fiat,
Haim Kaplan,
Kobbi Nissim:
Private coresets.
STOC 2009: 361-370 |
| 113 | | Amos Fiat,
Amiram Wingarten:
Envy, Multi Envy, and Revenue Maximization.
WINE 2009: 498-504 |
| 112 | | Edith Cohen,
Michal Feldman,
Amos Fiat,
Haim Kaplan,
Svetlana Olonetsky:
Envy-Free Makespan Approximation
CoRR abs/0909.1072: (2009) |
| 111 | | Amos Fiat,
Amiram Wingarten:
Envy, Multi Envy, and Revenue Maximization
CoRR abs/0909.4569: (2009) |
| 2008 |
|---|
| 110 | | Amos Fiat,
Hila Pochter:
Subjective vs.Objective Reality - The Risk of Running Late.
SAGT 2008: 279-290 |
| 109 | | Amos Fiat,
Yishay Mansour,
Uri Nadav:
Competitive queue management for latency sensitive packets.
SODA 2008: 228-237 |
| 108 | | Leah Epstein,
Amos Fiat,
Meital Levy:
Caching Content under Digital Rights Management.
WAOA 2008: 188-200 |
| 2007 |
|---|
| 107 | | Amos Fiat,
Meital Levy,
Haim Kaplan,
Svetlana Olonetsky:
Strong Price of Anarchy for Machine Load Balancing.
Fair Division 2007 |
| 106 | | Amos Fiat,
Haim Kaplan,
Meital Levy,
Svetlana Olonetsky:
Strong Price of Anarchy for Machine Load Balancing.
ICALP 2007: 583-594 |
| 105 | | Amos Fiat,
Yishay Mansour,
Uri Nadav:
Efficient contention resolution protocols for selfish agents.
SODA 2007: 179-188 |
| 104 | | 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 |
| 103 | | Edith Cohen,
Amos Fiat,
Haim Kaplan:
Associative search in peer to peer networks: Harnessing latent semantics.
Computer Networks 51(8): 1861-1881 (2007) |
| 102 | | 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) |
| 101 | | Amos Fiat,
Jared Saia:
Censorship Resistant Peer-to-Peer Networks.
Theory of Computing 3(1): 1-23 (2007) |
| 2006 |
|---|
| 100 | | Serge Abiteboul,
Bogdan Cautis,
Amos Fiat,
Tova Milo:
Digital Signatures for Modifiable Collections.
ARES 2006: 390-399 |
| 99 | | Dan Feldman,
Amos Fiat,
Micha Sharir:
Coresets forWeighted Facilities and Their Applications.
FOCS 2006: 315-324 |
| 98 | | 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 |
| 97 | | Amos Fiat,
Manor Mendel:
Truly Online Paging with Locality of Reference
CoRR abs/cs/0601127: (2006) |
| 96 | | 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) |
| 95 | | Erik D. Demaine,
Dotan Emanuel,
Amos Fiat,
Nicole Immorlica:
Correlation clustering in general weighted graphs.
Theor. Comput. Sci. 361(2-3): 172-187 (2006) |
| 94 | | 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) |
| 2005 |
|---|
| 93 |  | Serge Abiteboul,
Bogdan Cautis,
Amos Fiat,
Haim Kaplan,
Tova Milo:
Secure Exchange of Modifiable Data and Queries.
BDA 2005 |
| 92 | | Amos Fiat,
Jared Saia,
Maxwell Young:
Making Chord Robust to Byzantine Attacks.
ESA 2005: 803-814 |
| 91 | | 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 |
| 90 | | Gagan Aggarwal,
Amos Fiat,
Andrew V. Goldberg,
Jason D. Hartline,
Nicole Immorlica,
Madhu Sudan:
Derandomization of auctions.
STOC 2005: 619-625 |
| 2004 |
|---|
| 89 | | Amos Fiat,
Dmitry Pechyony:
Decision Trees: More Theoretical Justification for Practical Algorithms.
ALT 2004: 156-170 |
| 88 | | Ron Berman,
Amos Fiat,
Amnon Ta-Shma:
Provable Unlinkability against Traffic Analysis.
Financial Cryptography 2004: 266-280 |
| 87 | | Amos Fiat,
Manor Mendel:
Better algorithms for unfair metrical task systems and applications
CoRR cs.DS/0406034: (2004) |
| 86 | | 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) |
| 85 | | Amos Fiat,
Sandy Irani:
Foreword.
Theor. Comput. Sci. 324(2-3): 133-135 (2004) |
| 2003 |
|---|
| 84 | | Dotan Emanuel,
Amos Fiat:
Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs.
ESA 2003: 208-220 |
| 83 | | Amos Fiat,
Sagi Shporer:
AIM: Another Itemset Miner.
FIMI 2003 |
| 82 | | Amos Fiat:
Some Issues Regarding Search, Censorship, and Anonymity in Peer to Peer Networks.
ICALP 2003: 33 |
| 81 | | Edith Cohen,
Amos Fiat,
Haim Kaplan:
Associative Search in Peer to Peer Networks: Harnessing Latent Semantics.
INFOCOM 2003 |
| 80 | | Edith Cohen,
Amos Fiat,
Haim Kaplan:
Efficient sequences of trials.
SODA 2003: 737-746 |
| 79 | | Yossi Azar,
Edith Cohen,
Amos Fiat,
Haim Kaplan,
Harald Räcke:
Optimal oblivious routing in polynomial time.
STOC 2003: 383-388 |
| 78 | | Edith Cohen,
Amos Fiat,
Haim Kaplan:
A case for associative peer to peer overlays.
Computer Communication Review 33(1): 95-100 (2003) |
| 77 | | Baruch Awerbuch,
Yair Bartal,
Amos Fiat:
Competitive distributed file allocation.
Inf. Comput. 185(1): 1-40 (2003) |
| 76 | | Amos Fiat,
Haim Kaplan:
Making data structures confluently persistent.
J. Algorithms 48(1): 16-58 (2003) |
| 75 | | Amos Fiat,
Manor Mendel:
Better Algorithms for Unfair Metrical Task Systems and Applications.
SIAM J. Comput. 32(6): 1403-1422 (2003) |
| 2002 |
|---|
| 74 | | Amos Fiat,
Manor Mendel,
Steven S. Seiden:
Online Companion Caching.
ESA 2002: 499-511 |
| 73 | | Jared Saia,
Amos Fiat,
Steven D. Gribble,
Anna R. Karlin,
Stefan Saroiu:
Dynamically Fault-Tolerant Content Addressable Networks.
IPTPS 2002: 270-279 |
| 72 | | Amos Fiat,
Jared Saia:
Censorship resistant peer-to-peer content addressable networks.
SODA 2002: 94-103 |
| 71 | | Amos Fiat,
Andrew V. Goldberg,
Jason D. Hartline,
Anna R. Karlin:
Competitive generalized auctions.
STOC 2002: 72-81 |
| 70 | | 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 |
|---|
| 69 | | Dimitris Achlioptas,
Amos Fiat,
Anna R. Karlin,
Frank McSherry:
Web Search via Hub Synthesis.
FOCS 2001: 500-509 |
| 68 | | Amos Fiat:
Some Recent Results on Data Mining and Search.
MFCS 2001: 33-36 |
| 67 | | Amos Fiat,
Haim Kaplan:
Making data structures confluently persistent.
SODA 2001: 537-546 |
| 66 | | Yossi Azar,
Amos Fiat,
Anna R. Karlin,
Frank McSherry,
Jared Saia:
Spectral analysis of data.
STOC 2001: 619-626 |
| 65 | | Ran El-Yaniv,
Amos Fiat,
Richard M. Karp,
G. Turpin:
Optimal Search and One-Way Trading Online Algorithms.
Algorithmica 30(1): 101-139 (2001) |
| 64 | | 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) |
| 63 | | Amos Fiat,
Tamir Tassa:
Dynamic Traitor Tracing.
J. Cryptology 14(3): 211-223 (2001) |
| 2000 |
|---|
| 62 | | Amos Fiat,
Manor Mendel:
Better algorithms for unfair metrical task systems and applications.
STOC 2000: 725-734 |
| 61 | | Benny Chor,
Amos Fiat,
Moni Naor,
Benny Pinkas:
Tracing traitors.
IEEE Transactions on Information Theory 46(3): 893-910 (2000) |
| 1999 |
|---|
| 60 | | Amos Fiat,
Tamir Tassa:
Dynamic Traitor Training.
CRYPTO 1999: 354-371 |
| 59 | | Amos Fiat,
Gerhard J. Woeginger:
On-Line Scheduling on a Single Machine: Minimizing the Total Completion Time.
Acta Inf. 36(4): 287-293 (1999) |
| 58 | | Yossi Azar,
Yair Bartal,
Esteban Feuerstein,
Amos Fiat,
Stefano Leonardi,
Adi Rosén:
On Capital Investment.
Algorithmica 25(1): 22-36 (1999) |
| 57 | | Amos Fiat,
Moni Naor:
Rigorous Time/Space Trade-offs for Inverting Functions.
SIAM J. Comput. 29(3): 790-803 (1999) |
| 1998 |
|---|
| 56 | | Amos Fiat,
Gerhard J. Woeginger:
Online Algorithms, The State of the Art (the book grow out of a Dagstuhl Seminar, June 1996)
Springer 1998 |
| 55 | | Baruch Awerbuch,
Yair Bartal,
Amos Fiat:
Distributed Paging for General Networks.
J. Algorithms 28(1): 67-104 (1998) |
| 54 | | 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) |
| 1997 |
|---|
| 53 | | Amos Fiat,
Manor Mendel:
Truly Online Paging with Locality of Reference.
FOCS 1997: 326-335 |
| 52 | | Amos Fiat,
Ziv Rosen:
Experimental Studies of Access Graph Based Heuristics: Beating the LRU Standard?
SODA 1997: 63-72 |
| 51 | | 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) |
| 50 | | Amos Fiat:
Batch RSA.
J. Cryptology 10(2): 75-88 (1997) |
| 1996 |
|---|
| 49 | | 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 |
| 48 | | Yossi Azar,
Yair Bartal,
Esteban Feuerstein,
Amos Fiat,
Stefano Leonardi,
Adi Rosén:
On Capital Investment.
ICALP 1996: 429-441 |
| 47 | | Baruch Awerbuch,
Yossi Azar,
Amos Fiat:
Packet Routing via Min-Cost Circuit Routing.
ISTCS 1996: 37-42 |
| 46 | | Amos Fiat,
Gerhard J. Woeginger:
Competitive Analysis of Algorithms.
Online Algorithms 1996: 1-12 |
| 45 | | Amos Fiat,
Gerhard J. Woeginger:
Competitive Odds and Ends.
Online Algorithms 1996: 385-394 |
| 44 | | Baruch Awerbuch,
Yair Bartal,
Amos Fiat:
Distributed Paging for General Networks.
SODA 1996: 574-583 |
| 43 | | Piotr Berman,
Avrim Blum,
Amos Fiat,
Howard J. Karloff,
Adi Rosén,
Michael E. Saks:
Randomized Robot Navigation Algorithms.
SODA 1996: 75-84 |
| 42 | | 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 |
| 41 | | 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 |
|---|
| 40 | | Amos Fiat,
Yishay Mansour,
Adi Rosén,
Orli Waarts:
Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version).
FOCS 1995: 392-401 |
| 39 | | Amos Fiat,
Anna R. Karlin:
Randomized and multipointer paging with locality of reference.
STOC 1995: 626-634 |
| 38 | | Yair Bartal,
Amos Fiat,
Yuval Rabani:
Competitive Algorithms for Distributed Data Management.
J. Comput. Syst. Sci. 51(3): 341-358 (1995) |
| 37 | | 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) |
| 1994 |
|---|
| 36 | | Benny Chor,
Amos Fiat,
Moni Naor:
Tracing Traitors.
CRYPTO 1994: 257-270 |
| 35 | | Baruch Awerbuch,
Yair Bartal,
Amos Fiat,
Adi Rosén:
Competitive Non-Preemptive Call Control.
SODA 1994: 312-320 |
| 34 | | Noga Alon,
Manuel Blum,
Amos Fiat,
Sampath Kannan,
Moni Naor,
Rafail Ostrovsky:
Matching Nuts and Bolts.
SODA 1994: 690-696 |
| 33 | | 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) |
| 32 | | Eldad Bar-Eli,
Piotr Berman,
Amos Fiat,
Peiyuan Yan:
Online Navigation in a Room.
J. Algorithms 17(3): 319-341 (1994) |
| 31 | | Amos Fiat,
Yuval Rabani,
Yiftach Ravid:
Competitive k-Server Algorithms.
J. Comput. Syst. Sci. 48(3): 410-428 (1994) |
| 30 | | Amos Fiat,
Moty Ricklin:
Competitive Algorithms for the Weighted Server Problem.
Theor. Comput. Sci. 130(1): 85-99 (1994) |
| 1993 |
|---|
| 29 | | Amos Fiat,
Moni Naor:
Broadcast Encryption.
CRYPTO 1993: 480-491 |
| 28 | | Baruch Awerbuch,
Yair Bartal,
Amos Fiat:
Heat & Dump: Competitive Distributed Paging
FOCS 1993: 22-31 |
| 27 | | Amos Fiat,
Moty Ricklin:
Competitive Algorithms for the Weighted Server Problem.
ISTCS 1993: 294-303 |
| 26 | | Baruch Awerbuch,
Yair Bartal,
Amos Fiat:
Competitive distributed file allocation.
STOC 1993: 164-173 |
| 25 | | 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 |
| 24 | | Amos Fiat,
Moni Naor:
Implicit O(1) Probe Search.
SIAM J. Comput. 22(1): 1-10 (1993) |
| 1992 |
|---|
| 23 | | Ran El-Yaniv,
Amos Fiat,
Richard M. Karp,
G. Turpin:
Competitive Analysis of Financial Games
FOCS 1992: 327-333 |
| 22 | | Eldad Bar-Eli,
Piotr Berman,
Amos Fiat,
Peiyuan Yan:
On-Line Navigation in a Room.
SODA 1992: 237-249 |
| 21 | | Yair Bartal,
Amos Fiat,
Yuval Rabani:
Competitive Algorithms for Distributed Data Management (Extended Abstract)
STOC 1992: 39-50 |
| 20 | | Yair Bartal,
Amos Fiat,
Howard J. Karloff,
Rakesh Vohra:
New Algorithms for an Ancient Scheduling Problem
STOC 1992: 51-58 |
| 19 | | Amos Fiat,
Moni Naor,
Jeanette P. Schmidt,
Alan Siegel:
Nonoblivious Hashing.
J. ACM 39(4): 764-782 (1992) |
| 1991 |
|---|
| 18 | | Amos Fiat,
Dean P. Foster,
Howard J. Karloff,
Yuval Rabani,
Yiftach Ravid,
Sundar Vishwanathan:
Competitive Algorithms for Layered Graph Traversal
FOCS 1991: 288-297 |
| 17 | | Amos Fiat,
Moni Naor:
Rigorous Time/Space Tradeoffs for Inverting Functions
STOC 1991: 534-541 |
| 16 | | 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) |
| 15 | | 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) |
| 1990 |
|---|
| 14 | | Amos Fiat,
Yuval Rabani,
Yiftach Ravid:
Competitive k-Server Algorithms (Extended Abstract)
FOCS 1990: 454-463 |
| 1989 |
|---|
| 13 | | Amos Fiat:
Batch RSA.
CRYPTO 1989: 175-185 |
| 12 | | Amos Fiat,
Shahar Moses,
Adi Shamir,
Ilan Shimshoni,
Gábor Tardos:
Planning and Learning in Permutation Groups
FOCS 1989: 274-279 |
| 11 | | Amos Fiat,
Moni Naor:
Implicit O(1) Probe Search
STOC 1989: 336-344 |
| 1988 |
|---|
| 10 | | David Chaum,
Amos Fiat,
Moni Naor:
Untraceable Electronic Cash.
CRYPTO 1988: 319-327 |
| 9 | | 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 |
| 8 | | Amos Fiat,
Moni Naor,
Jeanette P. Schmidt,
Alan Siegel:
Non-Oblivious Hashing (Extended Abstract)
STOC 1988: 367-376 |
| 7 | | Uriel Feige,
Amos Fiat,
Adi Shamir:
Zero-Knowledge Proofs of Identity.
J. Cryptology 1(2): 77-94 (1988) |
| 1987 |
|---|
| 6 | | Uriel Feige,
Amos Fiat,
Adi Shamir:
Zero Knowledge Proofs of Identity
STOC 1987: 210-217 |
| 1986 |
|---|
| 5 | | Amos Fiat,
Adi Shamir:
How to Prove Yourself: Practical Solutions to Identification and Signature Problems.
CRYPTO 1986: 186-194 |
| 4 | | Amos Fiat,
Adi Shamir:
Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers.
J. Comput. Syst. Sci. 33(1): 47-65 (1986) |
| 1985 |
|---|
| 3 | | Amos Fiat,
Adi Shamir,
Ehud Y. Shapiro:
Polymorphic Arrays: An Architecture for a Programmable Systolic Machine.
ICPP 1985: 112-117 |
| 1984 |
|---|
| 2 | | Amos Fiat,
Adi Shamir:
Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers
FOCS 1984: 37-45 |
| 1 | | Amos Fiat,
Adi Shamir:
Generalized 'write-once' memories.
IEEE Transactions on Information Theory 30(3): 470-479 (1984) |
