On Pointers versus Addresses (Extended Abstract) - Amir M. Ben-Amram; Zvi Galil (FOCS, 1988)

Lower Bounds for Data Structure Problems on RAMs (Extended Abstract) - Amir M. Ben-Amram; Zvi Galil (FOCS, 1991)

Some notions on notations. - Amir M. Ben-Amram (SIGACT News, 1991)

On Pointers versus Addresses. - Amir M. Ben-Amram; Zvi Galil (J. ACM, 1992)

When can we sort in o(n log n) time? - Amir M. Ben-Amram; Zvi Galil (FOCS, 1993)

The Subtree Max Gap Problem with Application to Parallel String Covering. - Amir M. Ben-Amram; Omer Berkman; Costas S. Iliopoulos; Kunsoo Park (SODA, 1994)

Unit-Cost Pointers versus Logarithmic-Cost Addresses. - Amir M. Ben-Amram (Theor. Comput. Sci., 1994)

Lower Bounds on Algebraic Random Access Machines (Extended Abstract). - Amir M. Ben-Amram; Zvi Galil (ICALP, 1995)

On Data Structure Tradeoffs and an Application to Union-Find - Amir M. Ben-Amram; Zvi Galil (Electron. Colloquium Comput. Complex., 1995)

What is a "pointer machine"? - Amir M. Ben-Amram (SIGACT News, 1995)

On the power of random access machines - Amir M. Ben-Amram (1995)

On the Power of the Shift Instruction - Amir M. Ben-Amram; Zvi Galil (Inf. Comput., 1995)

A Note on Busy Beavers and Other Creatures. - Amir M. Ben-Amram; Bryant A. Julstrom; Uri Zwick (Math. Syst. Theory, 1996)

When Can We Sort in o(n log n) Time? - Amir M. Ben-Amram (J. Comput. Syst. Sci., 1997)

CONS-Free Programs with Tree Input (Extended Abstract). - Amir M. Ben-Amram; Holger Petersen 001 (ICALP, 1998)

Introducing: Reasonable Complete Programming Languages. - Amir M. Ben-Amram (Bull. EATCS, 1998)

Worst-Case and Amortised Optimality in Union-Find (Extended Abstract). - Stephen Alstrup; Amir M. Ben-Amram; Theis Rauhe (STOC, 1999)

A Precise Version of a Time Hierarchy Theorem. - Amir M. Ben-Amram; Neil D. Jones (Fundam. Informaticae, 1999)

Computational complexity via programming languages: constant factors do matter. - Amir M. Ben-Amram; Neil D. Jones (Acta Informatica, 2000)

The size-change principle for program termination. - Chin Soon Lee; Neil D. Jones; Amir M. Ben-Amram (POPL, 2001)

A Generalization of a Lower Bound Technique due to Fredman and Saks. - Amir M. Ben-Amram; Zvi Galil (Algorithmica, 2001)

Topological Lower Bounds on Algebraic Random Access Machines. - Amir M. Ben-Amram; Zvi Galil (SIAM J. Comput., 2001)

General Size-Change Termination and Lexicographic Descent. - Amir M. Ben-Amram (The Essence of Computation, 2002)

Lower Bounds for Dynamic Data Structures on Algebraic RAMs. - Amir M. Ben-Amram; Zvi Galil (Algorithmica, 2002)

Improved Bounds for Functions Related to Busy Beavers. - Amir M. Ben-Amram; Holger Petersen 001 (Theory Comput. Syst., 2002)

Element distinctness on one-tape Turing machines: a complete solution. - Amir M. Ben-Amram; Omer Berkman; Holger Petersen 001 (Acta Informatica, 2003)

Tighter constant-factor time hierarchies. - Amir M. Ben-Amram (Inf. Process. Lett., 2003)

A complexity-theoretic proof of a Recursion-Theoretic Theorem. - Amir M. Ben-Amram (SIGACT News, 2004)

The Church-Turing thesis and its look-alikes. - Amir M. Ben-Amram (SIGACT News, 2005)

Backing up in singly linked lists. - Amir M. Ben-Amram; Holger Petersen 001 (J. ACM, 2006)

Program termination analysis in polynomial time. - Amir M. Ben-Amram; Chin Soon Lee (ACM Trans. Program. Lang. Syst., 2007)

Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. - Amir M. Ben-Amram; Neil D. Jones; Lars Kristiansen (CiE, 2008)

A SAT-Based Approach to Size Change Termination with Global Ranking Functions. - Amir M. Ben-Amram; Michael Codish (TACAS, 2008)

Size-change termination with difference constraints. - Amir M. Ben-Amram (ACM Trans. Program. Lang. Syst., 2008)

A complexity tradeoff in ranking-function termination proofs. - Amir M. Ben-Amram (Acta Informatica, 2009)

Ranking Functions for Size-Change Termination II - Amir M. Ben-Amram; Chin Soon Lee (Log. Methods Comput. Sci., 2009)

The Euler Path to Static Level-Ancestors - Amir M. Ben-Amram (CoRR, 2009)

Size-Change Termination, Monotonicity Constraints and Ranking Functions - Amir M. Ben-Amram (Log. Methods Comput. Sci., 2010)

On Decidable Growth-Rate Properties of Imperative Programs - Amir M. Ben-Amram (DICE, 2010)

Monotonicity Constraints for Termination in the Integer Domain - Amir M. Ben-Amram (Log. Methods Comput. Sci., 2011)

A simple and efficient Union-Find-Delete algorithm. - Amir M. Ben-Amram; Simon Yoffe (Theor. Comput. Sci., 2011)

SAT-based termination analysis using monotonicity constraints over the integers. - Michael Codish; Igor Gonopolskiy; Amir M. Ben-Amram; Carsten Fuhs; Jürgen Giesl (Theory Pract. Log. Program., 2011)

Computational Models with No Linear Speedup. - Amir M. Ben-Amram; Niels H. Christensen; Jakob Grue Simonsen (Chic. J. Theor. Comput. Sci., 2012)

Bounded Termination of Monotonicity-Constraint Transition Systems - Amir M. Ben-Amram; Michael Vainer (CoRR, 2012)

On the Edge of Decidability in Complexity Analysis of Loop Programs. - Amir M. Ben-Amram; Lars Kristiansen (Int. J. Found. Comput. Sci., 2012)

Monotonicity Constraints in Characterizations of PSPACE. - Amir M. Ben-Amram; Bruno Loff; Isabel Oitavem (J. Log. Comput., 2012)

Corrigendum to "A simple and efficient Union-Find-Delete algorithm" [Theoret. Comput. Sci. 412(4-5) 487-492]. - Amir M. Ben-Amram; Simon Yoffe (Theor. Comput. Sci., 2012)

On the Termination of Integer Loops. - Amir M. Ben-Amram; Samir Genaim; Abu Naser Masud (ACM Trans. Program. Lang. Syst., 2012)

Ranking Functions for Linear-Constraint Loops. - Amir M. Ben-Amram (VPT@CAV, 2013)

On the linear ranking problem for integer linear-constraint loops. - Amir M. Ben-Amram; Samir Genaim (POPL, 2013)

Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract). - Amir M. Ben-Amram (STACS, 2013)

A Comment on Budach's Mouse-in-an-Octant Problem - Amir M. Ben-Amram (CoRR, 2013)

The Hardness of Finding Linear Ranking Functions for Lasso Programs. - Amir M. Ben-Amram (GandALF, 2014)

Ranking Functions for Linear-Constraint Loops. - Amir M. Ben-Amram; Samir Genaim (J. ACM, 2014)

Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions. - Amir M. Ben-Amram; Samir Genaim (CAV (2), 2015)

Mortality of iterated piecewise affine functions over the integers: Decidability and complexity. - Amir M. Ben-Amram (Comput., 2015)

Flowchart Programs, Regular Expressions, and Decidability of Polynomial Growth-Rate. - Amir M. Ben-Amram; Aviad Pineles (VPT@ETAPS, 2016)

On Multiphase-Linear Ranking Functions. - Amir M. Ben-Amram; Samir Genaim (CAV (2), 2017)

Tight Worst-Case Bounds for Polynomial Loop Programs. - Amir M. Ben-Amram; Geoff W. Hamilton (FoSSaCS, 2019)

Multiphase-Linear Ranking Functions and Their Relation to Recurrent Sets. - Amir M. Ben-Amram; Jesús J. Doménech; Samir Genaim (SAS, 2019)

Tight Polynomial Worst-Case Bounds for Loop Programs. - Amir M. Ben-Amram; Geoff W. Hamilton (Log. Methods Comput. Sci., 2020)

Tight Polynomial Bounds for Loop Programs in Polynomial Space. - Amir M. Ben-Amram; Geoff W. Hamilton (Log. Methods Comput. Sci., 2021)

On representations of real numbers and the computational complexity of converting between such representations. - Amir M. Ben-Amram; Lars Kristiansen; Jakob Grue Simonsen (CoRR, 2023)

A degree structure on representations of irrational numbers. - Amir M. Ben-Amram; Lars Kristiansen (J. Log. Anal., 2025)