next up previous
Next: About this document ...

Curriculum Vitae

Alon Efrat

Personal
Place and date of birth: Haifa, Israel 1965
Marital status: Single
Citizenship: Israel

Address:
School of Mathematical Sciences
Ramat-Aviv 69978.
Tel-Aviv, P.O.Box 39040
Israel
Fax: 972-3-6729357
alone@math.tau.ac.il
Home phone: 972-3-6726796


Education
Currently: Ph.D. student in Computer Science, Tel-Aviv University -- will finish during 1997-8
  Subject of thesis: Optimal Geometric Location Problems
  Advisor: Prof. Micha Sharir
   
1991 M.Sc. in Computer Science, The Technion
  Subject of thesis: Maintaining the Smallest Enclosing Circle
  Adviser: Prof. Alon Itai and Dr. Reuven Bar-Yehuda
   
1988 B.Sc. in Applied Mathematics, Mathematics Department, The Technion.
   
Awards and Grants :

1998
Awarded the 1998 Rothschild fellowship.

1998
Awarded the 1998 Minerva fellowship.

1998
Awarded the 1998 Chateaubriand fellowship.
1996
The Maus prize and grant for distinguished graduate students,
Tel-Aviv University.










Teaching Experience References









List of Publications
A. Papers in Journals

1.
P. K. Agarwal, A. Efrat, M. Sharir and S. Toledo, Computing a segment-center for a planar point set, J. Algorithms 15 (1993), 314-323.
2.
A. Efrat, M. Sharir and G. Rote, On the union of fat wedges and separating a collection of segments by a line, Computational Geometry: Theory and Applications 3 (1994), 277-288.
3.
A. Efrat and C. Gotsman, Subpixel image registration using circular fiducials, International J. of Computational Geometry and Applications 4 (1994), 403-422.
4.
A. Efrat, M. Sharir and A. Ziv, Computing the smallest k-enclosing circle and related problems. Computational Geometry: Theory and Applications 4 (1995), 119-136.
5.
A. Efrat and M. Sharir, A near-linear algorithm for the planar segment center problem, Discrete and Computational Geometry 16 (1996), 239-257.
6.
P. K. Agarwal, A. Efrat and M. Sharir, Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications, SIAM J. Computing. To appear.
7.
A. Efrat and O. Schwarzkopf, Separating and shattering long line segments. Information Processing Letters. To appear.
8.
L.P. Chew, D. Dor, A. Efrat and K. Kedem, Geometric pattern matching in d-dimensional space. Discrete and Computational Geometry. To appear
B. Papers in Proceedings of Conferences

1.
R. Bar-Yehuda, A. Efrat and A. Itai, A simple algorithm for maintaining the center of a planar point-set, Proc. 5 $^{\mbox{\footnotesize th}}$ Canad. Conf. Comput. Geom., 1993, 252-257.
2.
A. Efrat, M. Lindenbaum and M. Sharir, Finding maximally consistent sets of halfspaces, Proc. 5 $^{\mbox{\footnotesize th}}$ Canad. Conf. Comput. Geom., 1993, 432-436.
3.
A. Efrat, M. Sharir and G. Rote, On the union of fat wedges and separating a collection of segments by a line, Proc. 5 $^{\mbox{\footnotesize th}}$ Canad. Conf. Comput. Geom., 1993, 115-120.
4.
A. Efrat, M. Sharir and A. Ziv, Computing the smallest k-enclosing circle and related problems. Proc. 3rd Workshop Algorithms Data Struct. Lecture Notes in Computer Science 1993, vol. 709, Springer-Verlag, New York-Berlin-Heidelberg, 325-336.
5.
A. Efrat and M. Sharir, near-linear algorithm for the planar segment center problem, Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, 1994, 87-97.
6.
P. K. Agarwal, A. Efrat and M. Sharir, Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications, Proc. 11 $^{\mbox{\footnotesize th}}$ Annual Symposium on Computational Geometry, 1995, 39-50.
7.
L.P. Chew, D. Dor, A. Efrat and K. Kedem, Geometric pattern matching in d-dimensional space, Third European Symposium on Algorithms (ESA), Lecture Notes in Computer Science 1995, vol. 979 (P. Spirakis ed.) Springer-Verlag, New York-Berlin-Heidelberg, 264-279.
8.
A. Efrat and A. Itai, Improvements on bottleneck matching and related problems, using geometry. Proc. 12 $^{\mbox{\footnotesize th}}$ Annual Symposium on Computational Geometry, 1996, 301-310.
9.
A. Efrat and M.J. Katz, Computing most-uniform and minimum deviation matchings in geometric settings. Proc. 7 $^{\mbox {\rm th}}$ Annual International Symposium on Algorithms and Computational (ISAAC), December 1996, Osaka, Japan, 115-125.
10.
A. Efrat and O. Schwarzkopf, Separating and shattering long line segments, Proc. 7 $^{\mbox {\rm th}}$ Annual International Symposium on Algorithms and Computational (ISAAC), December 1996, Osaka, Japan, 36-44.
11.
A. Efrat and M. Sharir, On the complexity of the union of fat objects in the plane, Proc. 13 $^{\mbox{\footnotesize th}}$ Annual Symposium on Computational Geometry, 1997 104-112.
12.
A. Efrat, M. J. Katz, F. Nielsen and M. Sharir, Dynamic data structures for fat objects and their applications. Proc. 5rd Workshop on Algorithms and Data Structures (WADS'97), 297-396.
13.
A. Efrat and M. Katz, On the union of $\alpha$-curved objects, Proc. 14 $^{\mbox{\footnotesize th}}$ Annual Symposium on Computational Geometry 1998. To appear.

14.
A. Efrat and S. Har-Peled, Fly Cheaply: On the Minimum Fuel-Consumption Problem, Proc. 14 $^{\mbox{\footnotesize th}}$ Annual Symposium on Computational Geometry 1998. To appear.

15.
B. Aronov, A. Efrat D. Halperin and M. Sharir, A subquadratic bound on the number of regular vertices of the union of Jordan regions. Proc. 6 $^{\mbox{\footnotesize th}}$Scand. Workshop on Algorithms Theory 1998. To appear.

C. Manuscripts

1.
N. Cohen, A Efrat and F. Bruckstein. On Ants Crickets and Frogs in circular pursuit. Report. CIS-9309. Faculty of Computer Science, Technion - IIT.
2.
A. Efrat, Finding approximate matching of points and segments under translation, manuscript 1995.
D. In Preparation

1.
A. Amir, A. Efrat and H. Samet. Dilation and quad-trees -- theoretical and practical results.
2.
A. Amir, A. Efrat and H. Samet. A note on quadtree, point location and approximate nearest neighbor queries.

 
next up previous
Next: About this document ...
Alon Efrat
1998-06-03