His primary areas of study are Combinatorics, Plane, Computer network, Approximation algorithm and Point. His Combinatorics study combines topics from a wide range of disciplines, such as Discrete mathematics, Line segment, Intersection and Simple polygon. His research in Discrete mathematics intersects with topics in Exact algorithm and Outerplanar graph.
His Plane research integrates issues from Matching and Translation. In the subject of general Computer network, his work in Telecommunications network is often linked to Event, thereby combining diverse domains of study. His Point research includes elements of Wireless sensor network, Key distribution in wireless sensor networks, Brooks–Iyengar algorithm, Real-time computing and Mathematical optimization.
His primary scientific interests are in Combinatorics, Discrete mathematics, Approximation algorithm, Computer network and Plane. His Combinatorics research includes themes of Matching, Point and Regular polygon. Alon Efrat has included themes like Similarity, Euclidean geometry and Hausdorff distance in his Matching study.
Alon Efrat has researched Approximation algorithm in several fields, including Path, Line segment and Steiner tree problem. His Computer network research is multidisciplinary, relying on both Wireless, Wireless network and Distributed computing. His Plane study integrates concerns from other disciplines, such as Planar, Translation and Bipartite graph.
His primary areas of investigation include Combinatorics, Approximation algorithm, Steiner tree problem, Computer network and Encryption. Alon Efrat mostly deals with Vertex in his studies of Combinatorics. He usually deals with Approximation algorithm and limits it to topics linked to Path and Range.
His Steiner tree problem research includes elements of Connectivity, Greedy algorithm and Tree. Within one scientific family, he focuses on topics pertaining to Distributed computing under Computer network, and may sometimes address concerns connected to Maximum flow problem, Exact algorithm and Line segment. His Encryption study incorporates themes from Matching, Information privacy, Inference and Database.
Alon Efrat mainly focuses on Wireless sensor network, Combinatorics, Distributed computing, Credit card and Jamming. Many of his studies on Combinatorics involve topics that are commonly interrelated, such as Point. His work in Point covers topics such as Probabilistic framework which are related to areas like Range.
His Range research is multidisciplinary, incorporating elements of Discrete mathematics, Path, Steiner point and Vertex cover. Alon Efrat has researched Path in several fields, including Approximation algorithm and Steiner tree problem. The Distributed computing study combines topics in areas such as Scalability, Maximum flow problem, Secure communication, Encryption and Optimization problem.
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.
Matching planar maps
Helmut Alt;Alon Efrat;Günter Rote;Carola Wenk.
Journal of Algorithms (2003)
The resilience of WDM networks to probabilistic geographical failures
Pankaj K. Agarwal;Alon Efrat;Shashidhara K. Ganjugunte;David Hay.
IEEE ACM Transactions on Networking (2013)
Using and determining location in a context-sensitive tour guide
N. Davies;K. Cheverst;K. Mitchell;A. Efrat.
IEEE Computer (2001)
Approximation algorithms for two optimal location problems in sensor networks
A. Efrat;S. Har-Peled;J.S.B. Mitchell.
broadband communications, networks and systems (2005)
Geometry helps in bottleneck matching and related problems
Alon Efrat;Alon Itai;Matthew J. Katz.
Curve Matching, Time Warping, and Light Fields: New Algorithms for Computing Similarity between Curves
Alon Efrat;Quanfu Fan;Suresh Venkatasubramanian.
Journal of Mathematical Imaging and Vision (2007)
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
Pankaj K. Agarwal;Alon Efrat;Micha Sharir;Micha Sharir.
SIAM Journal on Computing (1999)
System and method for detecting proximity between mobile device users
Arnon Amir;Alon Efrat.
Touring a sequence of polygons
Moshe Dror;Alon Efrat;Anna Lubiw;Joseph S. B. Mitchell.
symposium on the theory of computing (2003)
On simultaneous planar graph embeddings
Peter Brass;Eowyn Cenek;Cristian A. Duncan;Alon Efrat.
Computational Geometry: Theory and Applications (2007)
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: