Haim Kaplan mainly investigates Combinatorics, Discrete mathematics, Algorithm, Data structure and Theoretical computer science. His Combinatorics research includes themes of Dynamic programming and Algebraic number. The concepts of his Discrete mathematics study are interwoven with issues in Rounding and Floyd–Warshall algorithm.
His work carried out in the field of Algorithm brings together such families of science as Euclidean shortest path, Constrained Shortest Path First, Shortest path problem, K shortest path routing and Yen's algorithm. His Data structure study combines topics from a wide range of disciplines, such as Permutation, Time complexity, Sorting, Simple and Metric space. His Theoretical computer science research is multidisciplinary, incorporating perspectives in Structure, XML, Node and Binary tree.
Haim Kaplan spends much of his time researching Combinatorics, Discrete mathematics, Algorithm, Data structure and Set. His studies in Combinatorics integrate themes in fields like Point and Upper and lower bounds. Point and Plane are commonly linked in his work.
His Discrete mathematics and Interval graph, Pathwidth, Disjoint sets, Chordal graph and Indifference graph investigations all form part of his Discrete mathematics research activities. His study in Set is interdisciplinary in nature, drawing from both Sampling and Simple. His Binary logarithm study frequently draws connections to adjacent fields such as Directed graph.
His primary scientific interests are in Combinatorics, Algorithm, Upper and lower bounds, Discrete mathematics and Theoretical computer science. His specific area of interest is Combinatorics, where he studies Binary logarithm. His work in the fields of Algorithm, such as Synthetic data, intersects with other areas such as Generalization.
His Upper and lower bounds research integrates issues from Shortest path problem, Star and Reinforcement learning. Many of his research projects under Discrete mathematics are closely connected to Sample complexity with Sample complexity, tying the diverse disciplines of science together. His Theoretical computer science research incorporates elements of Training set, Assignment problem, Value, Streaming algorithm and Optimal matching.
Haim Kaplan focuses on Combinatorics, Upper and lower bounds, Algorithm, Differential privacy and Apprenticeship learning. His Combinatorics research incorporates themes from Discrete mathematics and State. His State research includes elements of Shortest path problem, Rectangle, Bounded function, Regret and Perimeter.
He interconnects Submodular set function, Set, Reachability and Reinforcement learning in the investigation of issues within Upper and lower bounds. His Algorithm research is multidisciplinary, incorporating elements of Transformation and Convex function. His Differential privacy research includes elements of Connection, Data stream, Point and Streaming 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.
Reachability and Distance Queries via 2-Hop Labels
Edith Cohen;Eran Halperin;Haim Kaplan;Uri Zwick.
SIAM Journal on Computing (2003)
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
Haim Kaplan;Ron Shamir;Robert E. Tarjan.
SIAM Journal on Computing (1999)
Labeling Dynamic XML Trees
Edith Cohen;Haim Kaplan;Tova Milo.
SIAM Journal on Computing (2010)
Reach for A : efficient point-to-point shortest path algorithms
Andrew V. Goldberg;Haim Kaplan;Renato F. Werneck.
algorithm engineering and experimentation (2006)
Associative search in peer to peer networks: harnessing latent semantics
Edith Cohen;Amos Fiat;Haim Kaplan.
international conference on computer communications (2003)
Optimal oblivious routing in polynomial time
Yossi Azar;Edith Cohen;Amos Fiat;Haim Kaplan.
symposium on the theory of computing (2003)
Graph sandwich problems
Martin Charles Golumbic;Haim Kaplan;Ron Shamir.
Journal of Algorithms (1995)
Compact labeling schemes for ancestor queries
Serge Abiteboul;Haim Kaplan;Tova Milo.
symposium on discrete algorithms (2001)
Compact Labeling Scheme for Ancestor Queries
Serge Abiteboul;Stephen Alstrup;Haim Kaplan;Tova Milo.
SIAM Journal on Computing (2006)
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Haim Kaplan;Moshe Lewenstein;Nira Shafrir;Maxim Sviridenko.
Journal of the ACM (2005)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: