What is he best known for?
The fields of study he is best known for:
- Computer network
- Operating system
- The Internet
His main research concerns Computer network, Distributed computing, Scalability, The Internet and Server.
His studies in Computer network integrate themes in fields like Wireless network, Cloud computing and Throughput.
When carried out as part of a general Distributed computing research project, his work on Distributed algorithm is frequently linked to work in Rekeying, therefore connecting diverse disciplines of study.
His Scalability research includes elements of Upload, File sharing, Virtual network, Algorithm and Clustering coefficient.
His The Internet study combines topics in areas such as Shapley value, Markov process and Quality of service.
His research in Server intersects with topics in Workload, Piggybacking, Virtual machine and Type of service.
His most cited work include:
- Challenges, design and analysis of a large-scale p2p-vod system (541 citations)
- Performance Analysis of Disk Arrays under Failure (221 citations)
- Defending against distributed denial-of-service attacks with max-min fair server-centric router throttles (214 citations)
What are the main themes of his work throughout his whole career to date?
His scientific interests lie mostly in Computer network, Distributed computing, The Internet, Server and Computer security.
His work carried out in the field of Computer network brings together such families of science as Wireless network and Scalability.
Wireless network is frequently linked to Throughput in his study.
His research on Distributed computing frequently links to adjacent areas such as Scheduling.
His study of Peering is a part of The Internet.
Computer security connects with themes related to Android in his study.
He most often published in these fields:
- Computer network (34.15%)
- Distributed computing (20.84%)
- The Internet (14.19%)
What were the highlights of his more recent work (between 2018-2021)?
- Regret (3.77%)
- Distributed computing (20.84%)
- Theoretical computer science (9.53%)
In recent papers he was focusing on the following fields of study:
The scientist’s investigation covers issues in Regret, Distributed computing, Theoretical computer science, Algorithm and Artificial intelligence.
John C. S. Lui has researched Regret in several fields, including Upper and lower bounds and Mathematical optimization, Time horizon.
His work deals with themes such as Scheduling, Edge computing and Data transmission, which intersect with Distributed computing.
His Theoretical computer science research focuses on Graph and how it connects with Sampling.
His studies deal with areas such as Sketch and Nearest neighbor search as well as Algorithm.
His study in Computer network extends to Cloud computing with its themes.
Between 2018 and 2021, his most popular works were:
- Understanding Ethereum via Graph Analysis (15 citations)
- Conversational Contextual Bandit: Algorithm and Application (9 citations)
- Walking with Perception: Efficient Random Walk Sampling via Common Neighbor Awareness (8 citations)
In his most recent research, the most cited papers focused on:
- Computer network
- Operating system
- The Internet
John C. S. Lui mainly focuses on Theoretical computer science, Graph, Random walk, Sampling and Regret.
His research integrates issues of Transaction data and Power graph analysis in his study of Theoretical computer science.
His Graph research integrates issues from Graph and Network embedding.
John C. S. Lui combines subjects such as Optimization problem and Scalability with his study of Random walk.
John C. S. Lui interconnects Sample and Data mining in the investigation of issues within Sampling.
Adversarial system is closely connected to Upper and lower bounds in his research, which is encompassed under the umbrella topic of Regret.
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.
