| The size-change principle for program termination CS Lee, ND Jones, AM Ben-Amram Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of …, 2001 | 567 | 2001 |
| Ranking functions for linear-constraint loops AM Ben-Amram, S Genaim Journal of the ACM (JACM) 61 (4), 1-55, 2014 | 90 | 2014 |
| On the linear ranking problem for integer linear-constraint loops AM Ben-Amram, S Genaim ACM SIGPLAN Notices 48 (1), 51-62, 2013 | 85 | 2013 |
| On pointers versus addresses AM Ben-Amram, Z Galil Journal of the ACM (JACM) 39 (3), 617-648, 1992 | 74* | 1992 |
| What is a “pointer machine”? AM Ben-Amram ACM SIGACT News 26 (2), 88-95, 1995 | 69 | 1995 |
| On the termination of integer loops AM Ben-Amram, S Genaim, AN Masud ACM Transactions on Programming Languages and Systems (TOPLAS) 34 (4), 1-24, 2012 | 63 | 2012 |
| On multiphase-linear ranking functions AM Ben-Amram, S Genaim International Conference on Computer Aided Verification, 601-620, 2017 | 57 | 2017 |
| Program termination analysis in polynomial time AM Ben-Amram, CS Lee ACM Transactions on Programming Languages and Systems (TOPLAS) 29 (1), 1-37, 2007 | 48 | 2007 |
| Linear, polynomial or exponential? Complexity inference in polynomial time AM Ben-Amram, ND Jones, L Kristiansen Logic and Theory of Algorithms: 4th Conference on Computability in Europe …, 2008 | 46 | 2008 |
| Size-change termination, monotonicity constraints and ranking functions AM Ben-Amram Logical Methods in Computer Science 6, 2010 | 45 | 2010 |
| A SAT-based approach to size change termination with global ranking functions AM Ben-Amram, M Codish International Conference on Tools and Algorithms for the Construction and …, 2008 | 40 | 2008 |
| Multiphase-linear ranking functions and their relation to recurrent sets AM Ben-Amram, JJ Doménech, S Genaim International Static Analysis Symposium, 459-480, 2019 | 38 | 2019 |
| Size-change termination with difference constraints AM Ben-Amram ACM Transactions on Programming Languages and Systems (TOPLAS) 30 (3), 1-31, 2008 | 36 | 2008 |
| Worst-case and amortised optimality in union-find S Alstrup, AM Ben-Amram, T Rauhe Proceedings of the thirty-first annual ACM Symposium on Theory of Computing …, 1999 | 34 | 1999 |
| Monotonicity constraints for termination in the integer domain AM Ben-Amram Logical Methods in Computer Science 7 (3), 2011 | 28 | 2011 |
| The Church-Turing thesis and its look-alikes AM Ben-Amram ACM SIGACT News 36 (3), 113-114, 2005 | 28 | 2005 |
| Computational complexity via programming languages: constant factors do matter AM Ben-Amram, ND Jones Acta Informatica 37, 83-120, 2000 | 25 | 2000 |
| What can we sort in o (nlog n) time? AM Ben-Amram, Z Galil Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium …, 1993 | 24* | 1993 |
| Mortality of iterated piecewise affine functions over the integers: Decidability and complexity AM Ben-Amram Computability 4 (1), 19-56, 2015 | 23 | 2015 |
| The subtree max gap problem with application to parallel string covering AM Ben-Amram, O Berkman, CS Iliopoulos, K Park Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms …, 1994 | 23 | 1994 |
Samir GenaimUniversidad Complutense de MadridGeverifieerd e-mailadres voor fdi.ucm.es
