What is he best known for?
The fields of study he is best known for:
- Algorithm
- Time complexity
- Combinatorics
His main research concerns Combinatorics, Algorithm, Discrete mathematics, String searching algorithm and Time complexity.
He performs multidisciplinary study in the fields of Combinatorics and Exponent via his papers.
His work on Directed graph as part of general Discrete mathematics research is frequently linked to Absolute value, bridging the gap between disciplines.
His work carried out in the field of String searching algorithm brings together such families of science as Approximate string matching and Data structure.
The study incorporates disciplines such as Dependency, Propositional calculus, Set and Constant in addition to Time complexity.
He interconnects Heap, Vertex, Amortized analysis, Minimum spanning tree and Spanning tree in the investigation of issues within Graph theory.
His most cited work include:
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (420 citations)
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (420 citations)
- Efficient algorithms for finding maximum matching in graphs (349 citations)
What are the main themes of his work throughout his whole career to date?
Zvi Galil mostly deals with Discrete mathematics, Combinatorics, Algorithm, String searching algorithm and Time complexity.
His work on Upper and lower bounds expands to the thematically related Discrete mathematics.
His Combinatorics study combines topics from a wide range of disciplines, such as Matching, Parallel algorithm and Data structure.
Many of his research projects under Algorithm are closely connected to Palindrome with Palindrome, tying the diverse disciplines of science together.
The String searching algorithm study which covers Constant that intersects with Function.
The Graph theory study combines topics in areas such as Priority queue, Minimum spanning tree and Spanning tree.
He most often published in these fields:
- Discrete mathematics (49.73%)
- Combinatorics (45.99%)
- Algorithm (36.90%)
What were the highlights of his more recent work (between 1993-2010)?
- Discrete mathematics (49.73%)
- Combinatorics (45.99%)
- String searching algorithm (26.74%)
In recent papers he was focusing on the following fields of study:
The scientist’s investigation covers issues in Discrete mathematics, Combinatorics, String searching algorithm, Pattern matching and Data structure.
Zvi Galil does research in Discrete mathematics, focusing on Real number specifically.
His work deals with themes such as Efficient algorithm and Constant, which intersect with Combinatorics.
His String searching algorithm research is under the purview of String.
His Pattern matching study combines topics in areas such as Algorithm, Computation and Pattern recognition.
His Data structure study integrates concerns from other disciplines, such as Model of computation, Theory of computation, Mathematical optimization, Prefix sum and Upper and lower bounds.
Between 1993 and 2010, his most popular works were:
- Pattern matching algorithms (270 citations)
- Sparsification—a technique for speeding up dynamic graph algorithms (220 citations)
- Dynamic graph algorithms (180 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Programming language
- Time complexity
Zvi Galil focuses on Combinatorics, Discrete mathematics, Matrix multiplication, Theoretical computer science and Time complexity.
His Combinatorics research is multidisciplinary, incorporating elements of Matching, Algorithm, Data structure and String searching algorithm.
His research integrates issues of Sequence and Set in his study of Algorithm.
His studies in Discrete mathematics integrate themes in fields like Approximate string matching and Suffix tree.
The concepts of his Matrix multiplication study are interwoven with issues in Closure, Parallel algorithm and Integer.
His Theoretical computer science research incorporates elements of Dependency, Dynamic programming, Message passing and Sequential computation.
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.
