What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- How to prove yourself: practical solutions to identification and signature problems (2844 citations)
- Broadcast encryption (1292 citations)
- Untraceable Electronic Cash (997 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Competitive analysis (17.46%)
- Combinatorics (16.93%)
- Mathematical optimization (15.34%)
What were the highlights of his more recent work (between 2012-2021)?
- Mathematical optimization (15.34%)
- Mathematical economics (11.64%)
- Combinatorics (16.93%)
In recent papers he was focusing on the following fields of study:
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.
Between 2012 and 2021, his most popular works were:
- 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)
In his most recent research, the most cited papers focused on:
- 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.
