What is he best known for?
The fields of study he is best known for:
- Computer network
- The Internet
- Operating system
His primary areas of study are Combinatorial auction, Submodular set function, Routing protocol, Computer network and Approximation algorithm.
His work carried out in the field of Submodular set function brings together such families of science as Class, Mathematical economics and Common value auction.
His research in Class focuses on subjects like Incentive compatibility, which are connected to Mechanism design and Theoretical computer science.
His Routing protocol research is classified as research in Computer security.
His studies deal with areas such as Stability and Real-time computing as well as Computer network.
His studies deal with areas such as Upper and lower bounds, Maximization and Subadditivity as well as Approximation algorithm.
His most cited work include:
- An improved approximation algorithm for combinatorial auctions with submodular bidders (166 citations)
- Approximation algorithms for combinatorial auctions with complement-free bidders (161 citations)
- Bayesian Combinatorial Auctions (152 citations)
What are the main themes of his work throughout his whole career to date?
Michael Schapira spends much of his time researching Computer network, Distributed computing, The Internet, Routing and Computer security.
His work in Border Gateway Protocol, Routing protocol, Static routing, Default-free zone and Convergence is related to Computer network.
Michael Schapira has researched Distributed computing in several fields, including Network congestion, Theoretical computer science, Network topology, Asynchronous communication and Variety.
His The Internet research integrates issues from Telecommunications and Protocol.
The various areas that Michael Schapira examines in his Computer security study include Software deployment and Internet privacy.
His Algorithmic mechanism design research also works with subjects such as
- Job shop scheduling which connect with Mechanism design,
- Dimension and related Combinatorial auction.
He most often published in these fields:
- Computer network (33.55%)
- Distributed computing (23.87%)
- The Internet (21.94%)
What were the highlights of his more recent work (between 2016-2021)?
- Network congestion (14.19%)
- Computer network (33.55%)
- The Internet (21.94%)
In recent papers he was focusing on the following fields of study:
His primary areas of investigation include Network congestion, Computer network, The Internet, Distributed computing and Computer security.
Michael Schapira combines subjects such as Protocol design, Network model, Game theory and Reinforcement learning with his study of Network congestion.
His work on Network topology, Routing and Backward compatibility as part of general Computer network study is frequently connected to Network Time Protocol, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them.
His work on Static routing as part of general Routing research is frequently linked to Scale and Matching, bridging the gap between disciplines.
The concepts of his Distributed computing study are interwoven with issues in Formal verification, Traffic engineering, Protocol and Robustness.
His Computer security research incorporates elements of Economic model, Software deployment and Peering.
Between 2016 and 2021, his most popular works were:
- {PCC} Vivace: Online-Learning Congestion Control (87 citations)
- Learning to Route (65 citations)
- A Deep Reinforcement Learning Perspective on Internet Congestion Control (52 citations)
In his most recent research, the most cited papers focused on:
- Computer network
- The Internet
- Operating system
His primary areas of study are Computer network, Reinforcement learning, Network congestion, Routing and Network topology.
The Computer network study combines topics in areas such as Throughput, Cloud computing and The Internet.
His work in the fields of Peering overlaps with other areas such as Scale.
In the subject of general Routing, his work in Static routing is often linked to Matching and Task, thereby combining diverse domains of study.
His Network topology study integrates concerns from other disciplines, such as Distributed computing, Network packet, Delay-tolerant networking, Traffic engineering and Failover.
His Distributed computing study combines topics from a wide range of disciplines, such as Traffic flow, Approximation algorithm, Header and Clos network.
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.
