`Travelled to:`

1 × Germany

1 × Greece

1 × Italy

1 × Poland

1 × Switzerland

1 × The Netherlands

11 × USA

2 × Canada

`Collaborated with:`

M.Naor Y.Bartal Y.Azar A.R.Karlin H.Kaplan A.V.Goldberg B.Awerbuch ∅ M.Mendel S.Leonardi M.Levy S.Olonetsky J.P.Schmidt A.Siegel J.D.Hartline Y.Rabani U.Feige A.Shamir D.Feldman K.Nissim F.T.Leighton H.J.Karloff R.Vohra I.Abraham D.Delling R.F.F.Werneck R.Shabo E.Cohen H.Räcke F.McSherry J.Saia J.Aspnes S.A.Plotkin O.Waarts A.A.Schäffer G.Aggarwal N.Immorlica M.Sudan E.Feuerstein A.Rosén

`Talks about:`

algorithm (4) competit (3) search (3) applic (3) time (3) rout (3) line (3) distribut (2) schedul (2) problem (2)

## Person: Amos Fiat

### DBLP: Fiat:Amos

### Contributed to:

### Wrote 23 papers:

- ICALP-v1-2011-AbrahamDFGW #algorithm
- VC-Dimension and Shortest Path Algorithms (IA, DD, AF, AVG, RFFW), pp. 690–699.
- STOC-2009-FeldmanFKN
- Private coresets (DF, AF, HK, KN), pp. 361–370.
- ICALP-2007-FiatKLO
- Strong Price of Anarchy for Machine Load Balancing (AF, HK, ML, SO), pp. 583–594.
- ICALP-v1-2006-FiatKLOS #design #network #on the
- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations (AF, HK, ML, SO, RS), pp. 608–618.
- STOC-2005-AggarwalFGHIS
- Derandomization of auctions (GA, AF, AVG, JDH, NI, MS), pp. 619–625.
- ICALP-2003-Fiat #network
- Some Issues Regarding Search, Censorship, and Anonymity in Peer to Peer Networks (AF), p. 33.
- STOC-2003-AzarCFKR #polynomial
- Optimal oblivious routing in polynomial time (YA, EC, AF, HK, HR), pp. 383–388.
- STOC-2002-FiatGHK
- Competitive generalized auctions (AF, AVG, JDH, ARK), pp. 72–81.
- STOC-2001-AzarFKMS #analysis
- Spectral analysis of data (YA, AF, ARK, FM, JS), pp. 619–626.
- STOC-2000-FiatM #algorithm
- Better algorithms for unfair metrical task systems and applications (AF, MM), pp. 725–734.
- ICALP-1996-AzarBFFLR #on the
- On Capital Investment (YA, YB, EF, AF, SL, AR), pp. 429–441.
- STOC-1996-AwerbuchAFL #how #nondeterminism
- Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (BA, YA, AF, FTL), pp. 519–530.
- STOC-1996-BartalFL #bound #graph #online #problem
- Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing (YB, AF, SL), pp. 531–540.
- STOC-1995-FiatK #locality #multi #random
- Randomized and multipointer paging with locality of reference (AF, ARK), pp. 626–634.
- STOC-1993-AspnesAFPW #online #scheduling
- On-line load balancing with applications to machine scheduling and virtual circuit routing (JA, YA, AF, SAP, OW), pp. 623–631.
- STOC-1993-AwerbuchBF #distributed
- Competitive distributed file allocation (BA, YB, AF), pp. 164–173.
- STOC-1992-BartalFKV #algorithm #problem #scheduling
- New Algorithms for an Ancient Scheduling Problem (YB, AF, HJK, RV), pp. 51–58.
- STOC-1992-BartalFR #algorithm #data transformation #distributed
- Competitive Algorithms for Distributed Data Management (YB, AF, YR), pp. 39–50.
- STOC-1991-FiatN #trade-off
- Rigorous Time/Space Tradeoffs for Inverting Functions (AF, MN), pp. 534–541.
- STOC-1989-FiatN
- Implicit O(1) Probe Search (AF, MN), pp. 336–344.
- STOC-1988-FiatNSS
- Non-Oblivious Hashing (AF, MN, JPS, AS), pp. 367–376.
- STOC-1988-FiatNSSS #multi
- Storing and Searching a Multikey Table (AF, MN, AAS, JPS, AS), pp. 344–353.
- STOC-1987-FeigeFS #proving
- Zero Knowledge Proofs of Identity (UF, AF, AS), pp. 210–217.