Dr. Yochai Twitto
Yochai is a faculty member at the Department of Software Engineering at Shamoon College of Engineering, Beer Sheva. He holds a PHD in Computer Science from Ben-Gurion University of the Negev. Yochai’s research interests are Boolean Satisfiability and Domination Analysis. His research in Boolean Satisfiability focuses on the design, analysis, implementation, and experimental evaluation of algorithms for the Maximum Satisfiability problem, as well as harnessing them to solve real-world problems. His research in Domination Analysis focuses on analytical analysis of the Domination Number of algorithms and heuristics for combinatorial optimization problems
Be'er ShevaG11 Katsir(50)
Personal siteGoogle Scholar
2020 Ben-Gurion University. PHD degree .
PHD degree at the department of Computer Science . Specialization: probability-based characterization and algorithms for the Maximum Satisfiability problem.
2006 Ben-Gurion University. MSC degree .
MSC degree with distinction at the department of Computer Science .
Specialization: analysis of approximation algorithms.
2002 Ben-Gurion University. BSC degree .
BSC degree with distinction at the department of Computer Science .
Combinatorial Dominance Guarantees for Heuristic Algorithms. D Berend, S. Skiena and Y. Twitto. In: Proceedings of the International Conference on Analysis of Algorithms (AofA), Juan-les-Pins, France, June 2007. DMTCS proc. AH, 2007, 73-88.
Combinatorial Dominance Guarantees for Problems with Infeasible Solutions. D. Berend, S. Skiena and Y. Twitto. ACM Transactions on Algorithms, 5(1):1-29, 2008.
Dominance guarantees for above-average solutions. Y. Twitto. Discrete Optimization, 5(3):563-568, 2008.
The Normalized Autocorrelation Length of Random Max r-Sat Converges in Probability to (1−1/2^r)/r. D. Berend and Y. Twitto. In: Proceedings of the 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016), Bordeaux, France, July 5-8, 2016. Lecture Notes in Computer Science, vol. 9710. Springer, Cham.
Dominance Certificates for Combinatorial Optimization Problems. D. Berend, S. Skiena and Y. Twitto. In: Optimization Problems in Graph Theory, 107-122. Springer, 2018.
Effect of Initial Assignment on Local Search Performance for Max Sat. D. Berend and Y. Twitto. In: 18th International Symposium on Experimental Algorithms (SEA 2020), Catania, Italy, 16-18 Jun 2020.
Probabilistic Characterization of Random Max r-Sat. D. Berend and Y. Twitto. Discrete Optimization, 40 (2021): 100630.
Introduction to Computer Science
Logic and Discrete Topics 1