What is he best known for?
The fields of study he is best known for:
- Computer network
- Operating system
- The Internet
Dariusz R. Kowalski spends much of his time researching Upper and lower bounds, Node, Broadcasting, Combinatorics and Time complexity.
His Upper and lower bounds study frequently involves adjacent topics like Algorithm.
His work deals with themes such as Distributed algorithm and Enhanced Data Rates for GSM Evolution, which intersect with Node.
The Distributed algorithm study combines topics in areas such as Wireless ad hoc network and Wireless network.
His work carried out in the field of Broadcasting brings together such families of science as Theoretical computer science and Radio networks.
The study incorporates disciplines such as Binary logarithm, Network topology, Radio broadcasting and Randomized algorithm in addition to Time complexity.
His most cited work include:
- Deterministic Rendezvous in Graphs (158 citations)
- Broadcasting in undirected ad hoc radio networks (145 citations)
- Collective tree exploration (137 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of study are Computer network, Distributed algorithm, Upper and lower bounds, Distributed computing and Theoretical computer science.
His Computer network study combines topics in areas such as Wireless network and Wireless ad hoc network.
His studies in Distributed algorithm integrate themes in fields like Randomized algorithm and Asynchronous communication.
The concepts of his Upper and lower bounds study are interwoven with issues in Discrete mathematics, Algorithm, Time complexity, Combinatorics and Node.
His Distributed computing study combines topics from a wide range of disciplines, such as Gossip protocol, Cloud computing and Crash.
His study looks at the relationship between Theoretical computer science and topics such as Graph, which overlap with Approximation algorithm.
He most often published in these fields:
- Computer network (36.33%)
- Distributed algorithm (28.09%)
- Upper and lower bounds (25.09%)
What were the highlights of his more recent work (between 2016-2021)?
- Computer network (36.33%)
- Scheduling (20.60%)
- Distributed algorithm (28.09%)
In recent papers he was focusing on the following fields of study:
His primary areas of investigation include Computer network, Scheduling, Distributed algorithm, Network packet and Upper and lower bounds.
His biological study spans a wide range of topics, including Tree, Wireless network, Distributed computing and Communication channel.
His research in Scheduling intersects with topics in Fault tolerance, Workload, Base station and Preemption.
Within one scientific family, Dariusz R. Kowalski focuses on topics pertaining to Theoretical computer science under Distributed algorithm, and may sometimes address concerns connected to Theme.
Dariusz R. Kowalski has included themes like Adversarial system and Complex network in his Network packet study.
His Upper and lower bounds study combines topics in areas such as Discrete mathematics, Algorithm, Time complexity, Combinatorics and Bounded function.
Between 2016 and 2021, his most popular works were:
- Packet latency of deterministic broadcasting in adversarial multiple access channels (14 citations)
- Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations (7 citations)
- Optimizing mmWave Wireless Backhaul Scheduling (7 citations)
In his most recent research, the most cited papers focused on:
- Computer network
- Operating system
- Algorithm
His scientific interests lie mostly in Computer network, Distributed algorithm, Upper and lower bounds, Scheduling and Randomized algorithm.
His research in Computer network intersects with topics in Adversarial system, Distributed computing, Range and Wireless.
His Distributed algorithm research is multidisciplinary, incorporating perspectives in Queue and Queueing theory.
The Upper and lower bounds study combines topics in areas such as Time complexity, Algorithm, Bounded function and Communication channel.
The concepts of his Scheduling study are interwoven with issues in Burstiness, Online algorithm, Competitive analysis and Base station.
His Randomized algorithm study is concerned with the larger field of Combinatorics.
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.
