What is he best known for?
The fields of study he is best known for:
- Computer network
- Algorithm
- Artificial intelligence
Amotz Bar-Noy mostly deals with Computer network, Algorithm, Distributed computing, Mathematical optimization and Approximation algorithm.
His Computer network study combines topics in areas such as Wireless and Wireless network.
His Wireless network study integrates concerns from other disciplines, such as Markov process and Topology.
The various areas that Amotz Bar-Noy examines in his Distributed computing study include Telecommunications network, Assignment problem and Task.
The concepts of his Mathematical optimization study are interwoven with issues in Routing, Upper and lower bounds, Randomized algorithm and Fair-share scheduling.
His work carried out in the field of Approximation algorithm brings together such families of science as Time complexity, Greedy algorithm, Heterogeneous network, Multicast and Linear programming.
His most cited work include:
- Mobile users: to update or not to update? (524 citations)
- Sharing memory robustly in message-passing systems (461 citations)
- A lower bound for radio broadcast (354 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of study are Computer network, Distributed computing, Combinatorics, Mathematical optimization and Wireless sensor network.
His study in Computer network is interdisciplinary in nature, drawing from both Wireless, Wireless network and Communication channel.
Amotz Bar-Noy has researched Distributed computing in several fields, including Assignment problem, Key distribution in wireless sensor networks and Telecommunications network.
His research in Combinatorics intersects with topics in Discrete mathematics and Upper and lower bounds.
His Upper and lower bounds research is multidisciplinary, incorporating perspectives in Algorithm and Randomized algorithm.
Amotz Bar-Noy combines subjects such as Scheduling, Job shop scheduling and Fair-share scheduling with his study of Mathematical optimization.
He most often published in these fields:
- Computer network (22.04%)
- Distributed computing (21.09%)
- Combinatorics (18.53%)
What were the highlights of his more recent work (between 2013-2021)?
- Combinatorics (18.53%)
- Wireless sensor network (14.70%)
- Approximation algorithm (12.78%)
In recent papers he was focusing on the following fields of study:
Amotz Bar-Noy mainly investigates Combinatorics, Wireless sensor network, Approximation algorithm, Graph and Discrete mathematics.
His research in the fields of Degree and Binary logarithm overlaps with other disciplines such as Interval Sequence and Value.
His studies in Wireless sensor network integrate themes in fields like Data modeling, Cover, Radius and Mathematical optimization.
His work deals with themes such as Function, Upper and lower bounds, Aggregate and Statistical assumption, which intersect with Mathematical optimization.
His Approximation algorithm research is multidisciplinary, incorporating elements of Assignment problem, Generalized assignment problem, Wireless network, Simulation and Star.
Amotz Bar-Noy brings together Information needs and Distributed computing to produce work in his papers.
Between 2013 and 2021, his most popular works were:
- On Maximizing Quality of Information for the Internet of Things: A Real-Time Scheduling Perspective (Invited Paper) (24 citations)
- Dynamic Shortest Path Algorithms for Hypergraphs (23 citations)
- Data Extrapolation in Social Sensing for Disaster Response (22 citations)
In his most recent research, the most cited papers focused on:
- Computer network
- Artificial intelligence
- Algorithm
His scientific interests lie mostly in Wireless sensor network, Scheduling, Combinatorics, Mathematical optimization and Data mining.
His studies deal with areas such as Reliability, Base, Greedy algorithm, Function and Statistical assumption as well as Wireless sensor network.
His Scheduling research incorporates themes from Operations research, Bottleneck, Real-time computing and Key.
His work on Graph, Vertex and Interval as part of general Combinatorics research is frequently linked to Integer and Interval Sequence, thereby connecting diverse disciplines of science.
His Graph study combines topics from a wide range of disciplines, such as Disjoint sets, Realizability, Partition and Approximation algorithm.
His Mathematical optimization research includes themes of Wireless network, Transmission and Aggregate.
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.
