Amos Fiat
#145,641
Most Influential Person Now
Amos Fiat's AcademicInfluence.com Rankings
Amos Fiatmathematics Degrees
Mathematics
#6830
World Rank
#9385
Historical Rank
Measure Theory
#1643
World Rank
#2024
Historical Rank
Download Badge
Computer Science Mathematics
Amos Fiat's Degrees
- PhD Computer Science Tel Aviv University
- Bachelors Mathematics Tel Aviv University
Similar Degrees You Can Earn
Why Is Amos Fiat Influential?
(Suggest an Edit or Addition)Amos Fiat's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems (1986) (3973)
- Untraceable Electronic Cash (1990) (1237)
- Zero-knowledge proofs of identity (1988) (822)
- Tracing traitors (1994) (735)
- Competitive Paging Algorithms (1991) (463)
- Spectral analysis of data (2001) (307)
- Correlation clustering in general weighted graphs (2006) (305)
- On-line routing of virtual circuits with applications to load balancing and machine scheduling (1997) (295)
- Online Algorithms (1998) (265)
- Developments from a June 1996 seminar on Online algorithms: the state of the art (1998) (253)
- Associative search in peer to peer networks: harnessing latent semantics (2003) (250)
- New algorithms for an ancient scheduling problem (1992) (233)
- Highway dimension, shortest paths, and provably efficient algorithms (2010) (230)
- On-line load balancing with applications to machine scheduling and virtual circuit routing (1993) (225)
- Optimal oblivious routing in polynomial time (2003) (208)
- Competitive Algorithms for Distributed Data Management (1995) (196)
- Dynamic Traitor Tracing (2001) (193)
- Optimal Search and One-Way Trading Online Algorithms (2001) (182)
- Batch RSA (1989) (180)
- Zero knowledge proofs of identity (1987) (174)
- Censorship resistant peer-to-peer content addressable networks (2002) (169)
- Competitive k-server algorithms (1990) (162)
- Competitive non-preemptive call control (1994) (158)
- Competitive generalized auctions (2002) (153)
- Making Chord Robust to Byzantine Attacks (2005) (120)
- Competitive distributed file allocation (1993) (119)
- Dynamically Fault-Tolerant Content Addressable Networks (2002) (116)
- Resolution enhancement in MRI. (2006) (112)
- Dynamic Traitor Training (1999) (111)
- Private coresets (2009) (104)
- Competitive analysis of financial games (1992) (92)
- On Voting and Facility Location (2015) (90)
- Making commitments in the face of uncertainty: how to pick a winner almost every time (extended abstract) (1996) (89)
- Distributed paging for general networks (1996) (88)
- Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs (2003) (88)
- Online conflict-free coloring for intervals (2005) (88)
- Generalized 'write-once' memories (1984) (87)
- Algorithms - ESA 2009 (2009) (79)
- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations (2006) (79)
- VC-Dimension and Shortest Path Algorithms (2011) (77)
- Better algorithms for unfair metrical task systems and applications (2000) (70)
- Competitive algorithms for layered graph traversal (1991) (69)
- Competitive algorithms for distributed data management (extended abstract) (1992) (67)
- Lower bounds for on-line graph problems with application to on-line circuit and optical routing (1996) (67)
- Derandomization of auctions (2005) (64)
- Web search via hub synthesis (2001) (62)
- On-Line Competitive Algorithms for Call Admission in Optical Networks (1996) (61)
- Highway Dimension and Provably Efficient Shortest Path Algorithms (2016) (59)
- Randomized and multipointer paging with locality of reference (1995) (58)
- Strong Price of Anarchy for Machine Load Balancing (2007) (58)
- Single valued combinatorial auctions with budgets (2011) (57)
- Rigorous time/space tradeoffs for inverting functions (1991) (57)
- On Capital Investment (1996) (55)
- Randomized robot navigation algorithms (1996) (55)
- Online Navigation in a Room (1992) (54)
- Experimental studies of access graph based heuristics: beating the LRU standard? (1997) (54)
- Revenue maximizing envy-free multi-unit auctions with budgets (2012) (51)
- Rigorous Time/Space Trade-offs for Inverting Functions (1999) (48)
- On-line navigation in a room (1992) (45)
- Implicit O(1) probe search (1989) (44)
- A case for associative peer to peer overlays (2003) (44)
- Coresets forWeighted Facilities and Their Applications (2006) (44)
- HLDB: location-based services in databases (2012) (44)
- Making data structures confluently persistent (2001) (40)
- Provable Unlinkability against Traffic Analysis (2004) (39)
- Competitive algorithms for the weighted server problem (1993) (37)
- On ~ competitive algorithms for paging problems (1991) (34)
- Matching nuts and bolts (1994) (34)
- Truly online paging with locality of reference (1997) (33)
- The Invisible Hand of Dynamic Market Pricing (2015) (33)
- When the Players Are Not Expectation Maximizers (2010) (32)
- Envy, Multi Envy, and Revenue Maximization (2009) (32)
- Bi-criteria linear-time approximations for generalized k-mean/median/center (2007) (31)
- Competitive Analysis of Algorithms (1996) (31)
- An Economic-Based Analysis of RANKING for Online Bipartite Matching (2018) (26)
- Heat and Dump: competitive distributed paging (1993) (25)
- Pricing Online Decisions: Beyond Auctions (2015) (25)
- Efficient sequences of trials (2003) (25)
- Packing Small Vectors (2016) (24)
- Energy Equilibria in Proof-of-Work Mining (2019) (24)
- Truth, Envy, and Truthful Market Clearing Bundle Pricing (2011) (24)
- Nonoblivious hashing (1992) (22)
- Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers (1984) (22)
- Decision Trees: More Theoretical Justification for Practical Algorithms (2004) (22)
- (Almost Full) EFX Exists for Four Agents (and Beyond) (2021) (21)
- Variations on the Hotelling-Downs Model (2016) (20)
- (1 + ∊)-Approximate f-Sensitive Distance Oracles (2017) (20)
- Non-oblivious hashing (1988) (20)
- Approaching utopia: strong truthfulness and externality-resistant mechanisms (2012) (20)
- Competitive Odds and Ends (1996) (19)
- AIM: Another Itemset Miner (2003) (19)
- Competitive k-Server Algorithms (Extended Abstract) (1990) (18)
- Makespan Minimization via Posted Prices (2017) (18)
- Competitive queue management for latency sensitive packets (2008) (18)
- Efficient contention resolution protocols for selfish agents (2007) (18)
- On-line scheduling on a single machine: minimizing the total completion time (1999) (18)
- Censorship Resistant Peer-to-Peer Networks (2007) (17)
- Beyond myopic best response (in Cournot competition) (2012) (17)
- Planning and learning in permutation groups (1989) (15)
- The Temp Secretary Problem (2015) (14)
- An improved algorithm for online coloring of intervals with bandwidth (2006) (14)
- Interdependent Values without Single-Crossing (2018) (14)
- How to find a battleship (1989) (13)
- Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue (2019) (13)
- Almost Full EFX Exists for Four Agents (2022) (13)
- Packet Routing via Min-Cost Circuit Routing (1996) (12)
- The FedEx Problem (2016) (12)
- Envy-free makespan approximation: extended abstract (2009) (11)
- An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time (1991) (10)
- A deterministicO(k3)-competitivek-server algorithm for the circle (1994) (8)
- Envy-Free Makespan Approximation (2009) (8)
- On the Interplay between Incentive Compatibility and Envy Freeness (2010) (7)
- Competitive access time via dynamic storage rearrangement (1995) (7)
- Data mining through spectral analy - sis (2001) (7)
- Storing and searching a multikey table (1988) (7)
- A Labeling Approach to Incremental Cycle Detection (2013) (7)
- Lottery Pricing Equilibria (2016) (7)
- Digital signatures for modifiable collections (2006) (6)
- Polymorphic Arrays: An Architecture for a Programmable Systolic Machine (1985) (5)
- Provable Unlinkability Against Traffic Analysis with Low Message Overhead (2015) (5)
- Truthful Prompt Scheduling for Minimizing Sum of Completion Times (2018) (4)
- Truth and Envy in Capacitated Allocation Games (2010) (4)
- Tight Lower Bounds on Envy-Free Makespan Approximation (2012) (4)
- Combinatorial Auctions with Budgets (2010) (3)
- Flow Equilibria via Online Surge Pricing (2018) (3)
- Competitive analysis of algorithms (Chapter 1) (1998) (2)
- Efficient Allocation of Free Stuff (2019) (2)
- Algorithms -- ESA 2009 : 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009 : proceedings (2009) (2)
- Dynamic Pricing of Servers on Trees (2019) (2)
- On-line network routing - a survey (1997) (1)
- An α-regret analysis of Adversarial Bilateral Trade (2022) (1)
- Some Issues Regarding Search, Censorship, and Anonymity in Peer to Peer Networks (2003) (1)
- Why study the price of anarchy? (2012) (1)
- Storing and Searching a Multikey Table (Extended Abstract) (1988) (1)
- Special Issue: European Symposium on Algorithms, Design and Analysis (2011) (1)
- Prompt Scheduling for Selfish Agents (2018) (1)
- Caching Content under Digital Rights Management (2009) (1)
- Minimal indices for predecessor search (2015) (1)
- Non-Oblivious Hashing (Extended Abstract) (1988) (1)
- Constructing Delaunay triangulations along space-filling curves (2009) (0)
- Erratum to “Resolution enhancement in MRI” [Magn Reson Imaging 24 (2006) 133–154] (2011) (0)
- Minimal Indices for Successor Search (2013) (0)
- Subjective vs.Objective Reality - The Risk of Running Late (2008) (0)
- Fairness in Scheduling On-line Load Balancing with Applications to Machine Scheduling and Virtual Circuit Routing. In (1995) (0)
- Minimal Indices for Successor Search - (Extended Abstract) (2013) (0)
- Broadcast Encrypt ion (1994) (0)
- Competitive odds and ends (Chapter 17) (1998) (0)
- History-Independent Distributed Multi-agent Learning (2016) (0)
- Online Algorithms (Dagstuhl Seminar 02271) (2021) (0)
- Competitive Algorithms for Distributed Data Management (draft) (2007) (0)
- Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version). (1995) (0)
- On-line Algorithms (Dagstuhl Seminar 9626) (2021) (0)
- Competitive Equilibria with Unequal Budgets: Supporting Arbitrary Pareto Optimal Allocations (2021) (0)
- An $\alpha$-regret analysis of Adversarial Bilateral Trade (2022) (0)
- C-single crossing Interdependent valuations (2018) (0)
- Zero-Knowledge Mechanisms (2023) (0)
- Secure Exchange of Modifiable Data and Queries (2005) (0)
- The FedEx Problem ( Working Paper ) (2016) (0)
- Competitive Algorithms (Dagstuhl Seminar 99251) (2021) (0)
- Minimal Indices for Successor Search [ Full Version ] (2018) (0)
- The method, device and apparatus for identifying and sign. (1987) (0)
- Some Recent Results on Data Mining and Search (2001) (0)
- Carpooling in Social Networks (2016) (0)
- Provable Unlinkability Against Traffic Analysis with Low Message Overhead (2013) (0)
- Competitive Access Time via Dynamic Storage (1995) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Amos Fiat?
Amos Fiat is affiliated with the following schools:
