What is he best known for?
The fields of study he is best known for:
- Algorithm
- Operating system
- Computer network
Sartaj Sahni mainly focuses on Parallel computing, Algorithm, Mathematical optimization, Parallel algorithm and Discrete mathematics.
His research in Parallel computing intersects with topics in Routing table, Connected component, Vertex and Sorting algorithm.
His primary area of study in Algorithm is in the field of Dynamic programming.
His Mathematical optimization research is multidisciplinary, incorporating elements of Time complexity and Flow shop scheduling.
His Parallel algorithm research is multidisciplinary, incorporating perspectives in Sorting, Random access, SIMD and Graph.
His biological study deals with issues like NP, which deal with fields such as P and Algebra.
His most cited work include:
- P-Complete Approximation Problems (1393 citations)
- Fundamentals of Computer Algorithms (1076 citations)
- Fundamentals of data structures (569 citations)
What are the main themes of his work throughout his whole career to date?
Sartaj Sahni mainly investigates Parallel computing, Algorithm, Parallel algorithm, Theoretical computer science and Time complexity.
His Parallel computing study typically links adjacent topics like Sorting.
The various areas that Sartaj Sahni examines in his Algorithm study include Routing, Mathematical optimization, Data structure and Router.
His study in Mathematical optimization focuses on Approximation algorithm in particular.
Research on Discrete mathematics and Combinatorics is a part of his Time complexity study.
The concepts of his Hypercube study are interwoven with issues in SIMD and MIMD.
He most often published in these fields:
- Parallel computing (29.01%)
- Algorithm (25.05%)
- Parallel algorithm (10.33%)
What were the highlights of his more recent work (between 2010-2020)?
- Parallel computing (29.01%)
- Speedup (5.27%)
- Algorithm (25.05%)
In recent papers he was focusing on the following fields of study:
His scientific interests lie mostly in Parallel computing, Speedup, Algorithm, CUDA and Cache.
His Parallel computing research includes elements of Energy consumption, String searching algorithm, Content-addressable memory and Network packet.
His biological study spans a wide range of topics, including Computational science, Instruction set, Single-core, Parallel algorithm and Multi-core processor.
The Parallel algorithm study combines topics in areas such as Software and Load balancing.
His Algorithm study frequently links to related topics such as Theoretical computer science.
His studies deal with areas such as Time complexity, Data aggregator, Scheduling and Topology as well as Approximation algorithm.
Between 2010 and 2020, his most popular works were:
- NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates (85 citations)
- Data Structures, Algorithms And Applications In C++ (61 citations)
- GPU-to-GPU and Host-to-Host Multipattern String Matching on a GPU (38 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Operating system
- Computer network
Sartaj Sahni focuses on Parallel computing, CUDA, Algorithm, Computer network and Theoretical computer science.
Sartaj Sahni combines subjects such as Network packet, Content-addressable memory, String searching algorithm, Efficient energy use and Automata theory with his study of Parallel computing.
His study in Algorithm focuses on Reduction in particular.
His study in Computer network is interdisciplinary in nature, drawing from both Distributed computing and Heuristics.
Mathematical optimization is closely connected to Upper and lower bounds in his research, which is encompassed under the umbrella topic of Heuristics.
His Theoretical computer science research incorporates themes from Preprocessor and Fast algorithm.
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.
