| 2019 | FOSSACS | Tight Worst-Case Bounds for Polynomial Loop Programs. | Amir M. Ben-Amram, Geoff W. Hamilton |
| 2019 | SAS | Multiphase-Linear Ranking Functions and Their Relation to Recurrent Sets. | Amir M. Ben-Amram, Jess J. Domnech, Samir Genaim |
| 2017 | CAV | On Multiphase-Linear Ranking Functions. | Amir M. Ben-Amram, Samir Genaim |
| 2015 | CAV | Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions. | Amir M. Ben-Amram, Samir Genaim |
| 2013 | CAV | Ranking Functions for Linear-Constraint Loops. | Amir M. Ben-Amram |
| 2013 | POPL | On the linear ranking problem for integer linear-constraint loops. | Amir M. Ben-Amram, Samir Genaim |
| 2013 | STACS | Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract). | Amir M. Ben-Amram |
| 2012 | VMCAI | On the Termination of Integer Loops. | Amir M. Ben-Amram, Samir Genaim, Abu Naser Masud |
| 2009 | CAV | Size-Change Termination, Monotonicity Constraints and Ranking Functions. | Amir M. Ben-Amram |
| 2008 | CiE | Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. | Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen |
| 2008 | TACAS | A SAT-Based Approach to Size Change Termination with Global Ranking Functions. | Amir M. Ben-Amram, Michael Codish |
| 2001 | POPL | The size-change principle for program termination. | Chin Soon Lee, Neil D. Jones, Amir M. Ben-Amram |
| 1999 | STOC | Worst-Case and Amortised Optimality in Union-Find (Extended Abstract). | Stephen Alstrup, Amir M. Ben-Amram, Theis Rauhe |
| 1999 | STOC | Backing Up in Singly Linked Lists. | Amir M. Ben-Amram, Holger Petersen |
| 1998 | ICALP | CONS-Free Programs with Tree Input (Extended Abstract). | Amir M. Ben-Amram, Holger Petersen |
| 1995 | ICALP | Lower Bounds on Algebraic Random Access Machines (Extended Abstract). | Amir M. Ben-Amram, Zvi Galil |
| 1994 | SODA | The Subtree Max Gap Problem with Application to Parallel String Covering. | Amir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park |
| 1993 | FOCS | When can we sort in o(n log n) time? | Amir M. Ben-Amram, Zvi Galil |
| 1991 | FOCS | Lower Bounds for Data Structure Problems on RAMs (Extended Abstract) | Amir M. Ben-Amram, Zvi Galil |
| 1988 | FOCS | On Pointers versus Addresses (Extended Abstract) | Amir M. Ben-Amram, Zvi Galil |