H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 34 Citations 4,299 165 World Ranking 6339 National Ranking 3101

Overview

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.

Top Publications

Broadcasting in undirected ad hoc radio networks

Dariusz R. Kowalski;Andrzej Pelc.
Distributed Computing (2005)

202 Citations

How to meet in anonymous network

Dariusz R. Kowalski;Adam Malinowski.
international conference on structural information and communication complexity (2006)

164 Citations

Deterministic Rendezvous in Graphs

Anders Dessmark;Pierre Fraigniaud;Dariusz R. Kowalski;Andrzej Pelc.
Algorithmica (2006)

160 Citations

Collective tree exploration

Pierre Fraigniaud;Leszek Gąsieniec;Dariusz R. Kowalski;Andrzej Pelc.
Networks (2006)

154 Citations

Optimal deterministic broadcasting in known topology radio networks

Dariusz R. Kowalski;Andrzej Pelc.
Distributed Computing (2007)

125 Citations

On selection problem in radio networks

Dariusz R. Kowalski.
principles of distributed computing (2005)

115 Citations

Collective tree exploration

Pierre Fraigniaud;Leszek Gasieniec;Dariusz R. Kowalski;Dariusz R. Kowalski;Andrzej Pelc.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004)

108 Citations

Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks

Alex Kesselman;Dariusz R. Kowalski.
wireless on demand network systems and service (2005)

99 Citations

The Wake-Up Problem in MultiHop Radio Networks

Marek Chrobak;Leszek Ga¸sieniec;Dariusz R. Kowalski.
SIAM Journal on Computing (2006)

98 Citations

A better wake-up in radio networks

Bogdan S. Chlebus;Dariusz R. Kowalski.
principles of distributed computing (2004)

81 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing Dariusz R. Kowalski

Andrzej Pelc

Andrzej Pelc

Université du Québec en Outaouais

Publications: 150

Nicola Santoro

Nicola Santoro

Carleton University

Publications: 45

Paola Flocchini

Paola Flocchini

University of Ottawa

Publications: 42

Nancy Lynch

Nancy Lynch

MIT

Publications: 30

Fabian Kuhn

Fabian Kuhn

University of Freiburg

Publications: 23

Roger Wattenhofer

Roger Wattenhofer

ETH Zurich

Publications: 21

Christian Scheideler

Christian Scheideler

University of Paderborn

Publications: 19

Magnús M. Halldórsson

Magnús M. Halldórsson

Reykjavík University

Publications: 19

David Peleg

David Peleg

Weizmann Institute of Science

Publications: 18

Evangelos Kranakis

Evangelos Kranakis

Carleton University

Publications: 18

Francis Chung-Ming Lau

Francis Chung-Ming Lau

Hong Kong Polytechnic University

Publications: 17

Andréa W. Richa

Andréa W. Richa

Arizona State University

Publications: 16

Leszek A Gąsieniec

Leszek A Gąsieniec

University of Liverpool

Publications: 15

Jiguo Yu

Jiguo Yu

Qilu University of Technology

Publications: 14

Michael A. Bender

Michael A. Bender

Stony Brook University

Publications: 14

Something went wrong. Please try again later.