- Home
- Best Scientists - Computer Science
- Amos Fiat

Discipline name
H-index
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
51
Citations
21,830
104
World Ranking
2692
National Ranking
49

2016 - ACM Paris Kanellakis Theory and Practice Award For ground-breaking contributions to broadcast encryption and piracy tracking, laying the foundations for modern copyright protection of blue-ray discs and other broadcast media.

- Algorithm
- Computer network
- Statistics

His scientific interests lie mostly in Mathematical optimization, Competitive analysis, Distributed computing, Computer network and Theoretical computer science. His Mathematical optimization research includes themes of Time complexity, Call control, Calculus and Nonpreemptive multitasking. His research in Competitive analysis intersects with topics in Distributed algorithm, Algorithm, Online algorithm, Scheduling and Load balancing.

His Distributed computing study combines topics in areas such as Optimization problem, Hash table, Information retrieval and Virtual circuit routing. In his study, which falls under the umbrella issue of Computer network, EdDSA, Strong RSA assumption, Undeniable signature and Ring signature is strongly linked to Smart card. His research integrates issues of Zero-knowledge proof, Metrical task system, Paging and Identification in his study of Theoretical computer science.

- How to prove yourself: practical solutions to identification and signature problems (2844 citations)
- Broadcast encryption (1292 citations)
- Untraceable Electronic Cash (997 citations)

Amos Fiat mainly investigates Competitive analysis, Combinatorics, Mathematical optimization, Algorithm and Mathematical economics. His work deals with themes such as Load balancing, Distributed computing, Logarithm, Randomized algorithm and Online algorithm, which intersect with Competitive analysis. His study in Distributed computing is interdisciplinary in nature, drawing from both Sequence and Computer network.

His Mathematical optimization research integrates issues from Upper and lower bounds and Job shop scheduling. His Algorithm research also works with subjects such as

- Theoretical computer science, which have a strong connection to Paging,
- Metric space and related Server. His work investigates the relationship between Mathematical economics and topics such as Common value auction that intersect with problems in Incentive compatibility.

- Competitive analysis (17.46%)
- Combinatorics (16.93%)
- Mathematical optimization (15.34%)

- Mathematical optimization (15.34%)
- Mathematical economics (11.64%)
- Combinatorics (16.93%)

Amos Fiat mainly focuses on Mathematical optimization, Mathematical economics, Combinatorics, Online algorithm and Common value auction. His Mathematical optimization research is multidisciplinary, incorporating elements of Upper and lower bounds, Scheduling, Deterministic algorithm and Metric space. When carried out as part of a general Combinatorics research project, his work on Parameterized complexity is frequently linked to work in Fusion tree, therefore connecting diverse disciplines of study.

His studies deal with areas such as Competitive analysis, Strategic dominance and Dynamic pricing as well as Online algorithm. The study incorporates disciplines such as Generalization and Independent set in addition to Common value auction. His Constant research incorporates elements of Discrete mathematics and Algorithm.

- On Voting and Facility Location (63 citations)
- Highway Dimension and Provably Efficient Shortest Path Algorithms (41 citations)
- The Invisible Hand of Dynamic Market Pricing (26 citations)

- Algorithm
- Computer network
- Statistics

Amos Fiat spends much of his time researching Mathematical economics, Mechanism design, Discrete mathematics, Shortest path problem and Common value auction. His Mathematical economics study integrates concerns from other disciplines, such as Stability, Hash function and Symmetric equilibrium. His research investigates the connection with Discrete mathematics and areas like Constant which intersect with concerns in Algorithm and Upper and lower bounds.

Many of his studies on Algorithm involve topics that are commonly interrelated, such as Competitive analysis. Amos Fiat interconnects Theoretical computer science, Graph, Graph size, Preprocessor and Speedup in the investigation of issues within Shortest path problem. His work in Common value auction tackles topics such as Matching which are related to areas like Microeconomics.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

How to prove yourself: practical solutions to identification and signature problems

Amos Fiat;Adi Shamir.

international cryptology conference **(1987)**

4377 Citations

Broadcast encryption

Amos Fiat;Moni Naor.

international cryptology conference **(1993)**

1882 Citations

Untraceable Electronic Cash

David Chaum;Amos Fiat;Moni Naor.

international cryptology conference **(1990)**

1878 Citations

Zero-knowledge proofs of identity

U. Feige;A. Fiat;A. Shamir.

Journal of Cryptology **(1988)**

1576 Citations

Tracing traitors

B. Chor;A. Fiat;M. Naor;B. Pinkas.

IEEE Transactions on Information Theory **(2000)**

928 Citations

Tracing Traitors

Benny Chor;Amos Fiat;Moni Naor.

international cryptology conference **(1994)**

845 Citations

Competitive paging algorithms

Amos Fiat;Richard M. Karp;Michael Luby;Lyle A. McGeoch.

Journal of Algorithms **(1991)**

516 Citations

Online algorithms : The state of the art

Amos Fiat;Gerhard J. Woeginger.

Lecture Notes in Computer Science **(1998)**

486 Citations

Method, apparatus and article for identification and signature

Adi Shamir;Amos Fiat.

**(1987)**

363 Citations

Spectral analysis of data

Yossi Azar;Amos Fiat;Anna Karlin;Frank McSherry.

symposium on the theory of computing **(2001)**

357 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Tel Aviv University

Tel Aviv University

Weizmann Institute of Science

The University of Texas at Dallas

University of Washington

Hebrew University of Jerusalem

Tel Aviv University

Weizmann Institute of Science

Johns Hopkins University

Tel Aviv University

Something went wrong. Please try again later.