Lecturers Page Dr. Amir Sapir

Dr. Amir Sapir

1981 - B.Sc Ben-Gurion University, Mathematics & Computer Science

Thesis: Project: LOGO for personal computers (AI)

Advisor: Yossef Regev

 

2000 - M.Sc Ben-Gurion University, Computer Science

Thesis: Dynamic Relationships and their Propagation Values in Object Oriented Data Bases

Advisor: Prof. Ehud Gudes

 

2006 - Ph.D in Computer Science Ben-Gurion University, Computer Science

Thesis: The Tower of Hanoi for General Graphs

Advisor: Prof. Daniel Berend

Areas of interest and Teaching

Areas of interest

  • Combinatorics
  • Numeration Systems
  • Efficiency of Numerical Methods
  • Data Bases

Teaching

In current lective year:
  • Discrete Mathematics
  • Introduction to Complexity and Computability
  • Error Correcting Codes
  • Logic and Set Theory
  • Algebra 2
  • Introduction to Models of Computation

Research

My research is combined of several fields of interest:

  1. Combinatorics in general, and, focusing on various versions of the Tower of Hanoi problem.
  2. Numeration Systems: representation of integers in number systems based on algebraic non-rational numbers.
  3. Data Bases - from the theoretical aspect.
  4. Iterative Numerical Methods - devising new methods and comparting their efficiency to other known methods.

Awards

Publications

Below is a list of selected publications.

 

Articles

T. Kogan, A. Sapir, L. Sapir, A. Sapir, To the Question of Efficiency of Iterative Methods, Applied Mathematics Letters, 66 : 40 – 46, Elsevier, April 2017.

D. Berend, A. Sapir, Exponential vs. Subexponential Tower of Hanoi Variants, J. of Graph Algorithms and Applications, 20(2) : 461 – 479. [F5], 2016.

T. Kogan, A. Sapir, L. Sapir, A. Sapir, The Fibonacci Family of Iterative Processes for Solving Nonlinear Equations, Applied Numerical Mathematics, 110 : 148 – 158, Elsevier, December 2016.

A. Sapir. On Consistent Inconsistencies. Inroads, 4(1):52 - 56, ACM, March 2013.

D. Berend, A. Sapir, S. Solomon. The Tower of Hanoi Problem on Pathâ‚• Graphs. Discrete Applied Mathematics, 160(10 - 11), Elsevier, July 2012.

D. Berend, L. Sapir, A. Sapir. A Decision-Making Approach to the Spam Problem. INFOR, 49(1):1 - 13, University of Toronto Press, September 2011.

T. Kogan, L. Sapir, A. Sapir. A Nonstationary Iterative Second-Order Method for Solving Nonlinear Equations. Applied Mathematics and Computation, 188(1):75 - 82, Elsevier, May 2007.

D. Berend, A. Sapir. The Diameter of Hanoi Graphs. Information Processing Letters, 98(2):79 - 85, Elsevier, April 2006.

D. Berend, A. Sapir. The Cyclic Multi-Peg Tower of Hanoi. Transactions on Algorithms, 2(3):297-317, ACM, July 2006.

A. Sapir. The Tower of Hanoi with Forbidden Moves. The Computer Journal, pages 20-24, Oxford, January 2004.
 

Conference Articles

E. Birnbaum, A. Sapir, N. Voloch. Generating error-correcting codes based on tower of Hanoi configuration graphs. In 2014 IEEE 28th Convention of Electrical & Electronics Engineers in Israel (IEEEI), pages 1 - 4, IEEE, December 2014.

D. Berend, A. Sapir. Which Multi-peg Tower of Hanoi Problems Are Exponential?. In Graph-Theoretic Concepts in Computer Science, Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern editor, vol. 7551 of LNCS, 81 - 90, Springer, June 2012.

J.-P. Allouche and A. Sapir, Restricted Towers of Hanoi and Morphisms, Lecture Notes in Computer Science 3572, 1–-10, Springer, 2005.

E. Gudes, A. Sapir. Dynamic Relationships and their Propagation Attributes in Object-Oriented Databases. In DEXA9 Proceedings, pages 967 –- 974, IEEE, 1998.

 

Presentations

Links to