What is he best known for?
The fields of study he is best known for:
- Computer network
- Algorithm
- Combinatorics
His scientific interests lie mostly in Theoretical computer science, Broadcasting, Upper and lower bounds, Computer network and Combinatorics.
His Theoretical computer science research incorporates themes from Graph, Probabilistic logic, Theory of computation, Information retrieval and Interactivity.
His Broadcasting study combines topics in areas such as Radio broadcasting, Algorithm, Advice, Radio networks and Distributed algorithm.
The various areas that Andrzej Pelc examines in his Upper and lower bounds study include Binary logarithm, Connectivity and Bounded function.
His research in Broadcasting, Telecommunications network and Node are components of Computer network.
In Combinatorics, Andrzej Pelc works on issues like Discrete mathematics, which are connected to Sequential decision.
His most cited work include:
- Power consumption in packet radio networks (406 citations)
- Deterministic Rendezvous in Graphs (200 citations)
- Searching games with errors---fifty years of coping with liars (171 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of investigation include Node, Combinatorics, Upper and lower bounds, Computer network and Discrete mathematics.
His research in Node intersects with topics in Theoretical computer science, Deterministic algorithm, Enhanced Data Rates for GSM Evolution, Task and Topology.
Andrzej Pelc works mostly in the field of Theoretical computer science, limiting it down to topics relating to Asynchronous communication and, in certain cases, Robot, as a part of the same area of interest.
His research is interdisciplinary, bridging the disciplines of Constant and Combinatorics.
His Upper and lower bounds research is multidisciplinary, incorporating elements of Leader election, Time complexity, Algorithm and Tree.
His research integrates issues of Transmission and Distributed computing in his study of Computer network.
He most often published in these fields:
- Node (23.28%)
- Combinatorics (21.62%)
- Upper and lower bounds (21.14%)
What were the highlights of his more recent work (between 2013-2021)?
- Deterministic algorithm (14.96%)
- Node (23.28%)
- Upper and lower bounds (21.14%)
In recent papers he was focusing on the following fields of study:
Andrzej Pelc mostly deals with Deterministic algorithm, Node, Upper and lower bounds, Leader election and Discrete mathematics.
His study in Deterministic algorithm is interdisciplinary in nature, drawing from both Graph, Time complexity, Collision detection, Constant and Polynomial.
His Node research entails a greater understanding of Computer network.
His Upper and lower bounds research focuses on Advice and how it connects with Sequence.
His work deals with themes such as Path, Combinatorics and Symmetry, which intersect with Leader election.
His Discrete mathematics study combines topics from a wide range of disciplines, such as Carry, Robot and Deterministic finite automaton, Automaton.
Between 2013 and 2021, his most popular works were:
- Gathering Despite Mischief (64 citations)
- How to Meet Asynchronously at Polynomial Cost (40 citations)
- Anonymous Meeting in Networks (31 citations)
In his most recent research, the most cited papers focused on:
- Computer network
- Algorithm
- Artificial intelligence
Andrzej Pelc mainly investigates Deterministic algorithm, Node, Distributed computing, Upper and lower bounds and Mobile agent.
The study incorporates disciplines such as Graph, Time complexity, Enhanced Data Rates for GSM Evolution, Mathematical optimization and Computer network in addition to Deterministic algorithm.
As part of his studies on Distributed computing, Andrzej Pelc often connects relevant subjects like Theory of computation.
His Upper and lower bounds research incorporates elements of Leader election and Advice.
Andrzej Pelc interconnects Algorithm and Combinatorics in the investigation of issues within Leader election.
His Mobile agent research integrates issues from Measure, Plane and Bounded function.
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.
