What is he best known for?
The fields of study he is best known for:
- Programming language
- Algorithm
- Statistics
His scientific interests lie mostly in Discrete mathematics, Theoretical computer science, Markov decision process, Algorithm and Large Hadron Collider.
He has included themes like Combinatorics, Computational complexity theory, Stochastic game, Energy and Computation in his Discrete mathematics study.
His Theoretical computer science research incorporates elements of Graph and Polynomial.
His Markov decision process study incorporates themes from Mathematical optimization and Reachability.
Krishnendu Chatterjee interconnects Fixed point, Probabilistic logic and Perfect information in the investigation of issues within Algorithm.
Within one scientific family, he focuses on topics pertaining to Quark under Large Hadron Collider, and may sometimes address concerns connected to Phenomenology.
His most cited work include:
- Evolutionary dynamics of cancer in response to targeted combination therapy (443 citations)
- Search for dark matter, extra dimensions, and unparticles in monojet events in proton–proton collisions at √s = 8 TeV (397 citations)
- Study of the Mass and Spin-Parity of the Higgs Boson Candidate via Its Decays to Z Boson Pairs (294 citations)
What are the main themes of his work throughout his whole career to date?
Krishnendu Chatterjee mainly investigates Discrete mathematics, Markov decision process, Mathematical optimization, Theoretical computer science and Time complexity.
His research in Discrete mathematics is mostly concerned with Decidability.
His study in Markov decision process is interdisciplinary in nature, drawing from both Upper and lower bounds, Probabilistic logic, Reachability and Stochastic game.
In his study, which falls under the umbrella issue of Mathematical optimization, Computational complexity theory is strongly linked to Decision problem.
His Time complexity study is associated with Algorithm.
His Algorithm research is multidisciplinary, incorporating perspectives in Binary logarithm, Reactive system and Graph.
He most often published in these fields:
- Discrete mathematics (23.77%)
- Markov decision process (23.24%)
- Mathematical optimization (20.77%)
What were the highlights of his more recent work (between 2016-2021)?
- Probabilistic logic (17.78%)
- Theoretical computer science (20.60%)
- Algorithm (18.31%)
In recent papers he was focusing on the following fields of study:
His primary areas of investigation include Probabilistic logic, Theoretical computer science, Algorithm, Mathematical optimization and Time complexity.
The concepts of his Probabilistic logic study are interwoven with issues in Reachability, Expected value, Liveness, Bounded function and While loop.
His Theoretical computer science study integrates concerns from other disciplines, such as Program analysis, Static analysis and Extension.
His study in the field of Model checking is also linked to topics like Treewidth.
His work in Mathematical optimization addresses subjects such as Markov decision process, which are connected to disciplines such as Stochastic game, Markov chain and Benchmark.
As part of his Discrete mathematics and Combinatorics and Time complexity studies, Krishnendu Chatterjee is studying Time complexity.
Between 2016 and 2021, his most popular works were:
- Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer (193 citations)
- Reconstructing metastatic seeding patterns of human cancers. (79 citations)
- Evolution of cooperation in stochastic games (64 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algorithm
- Statistics
His primary scientific interests are in Probabilistic logic, Theoretical computer science, Algorithm, Time complexity and Mathematical optimization.
His work carried out in the field of Probabilistic logic brings together such families of science as Oracle, Liveness, Bounded function, Nondeterministic algorithm and Termination problem.
His Theoretical computer science research is multidisciplinary, relying on both Class, Program analysis, Reactive system and Extension.
Krishnendu Chatterjee has researched Algorithm in several fields, including Binary logarithm, Linear space and Evolutionary graph theory.
In Time complexity, Krishnendu Chatterjee works on issues like Ranking, which are connected to Random variable, Termination analysis and Lexicographical order.
His Mathematical optimization research includes elements of Markov decision process and Reachability.
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.
