Search Results - "BEN-AMRAM, AMIR M."

TIGHT POLYNOMIAL WORST-CASE BOUNDS FOR LOOP PROGRAMS.

Authors: BEN-AMRAM, AMIR M. HAMILTON, GEOFF

Source: Logical Methods in Computer Science (LMCS); 2020, Vol. 16 Issue 2, p1-39, 39p

Computational complexity via programming languages: constant factors do matter.

Authors: Ben-Amram, Amir M. Jones, Neil D.

Source: Acta Informatica; 2000, Vol. 37 Issue 2, p83, 38p

Backing Up in Singly Linked Lists.

Authors: Ben-Amram, Amir M. Petersen, Holger

Source: Journal of the ACM; July 2006, Vol. 53 Issue 4, p681-705, 25p

Topological Lower Bounds on Algebraic Random Access Machines.

Authors: Ben-Amram, Amir M. Galil, Zvi

Source: SIAM Journal on Computing; 2001, Vol. 31 Issue 3, p722-761, 40p

Synthesis of ranking functions via DNN.

Authors: Tan, Wang Li, Yi

Source: Neural Computing & Applications; Aug2021, Vol. 33 Issue 16, p9939-9959, 21p

Ranking Functions for Linear-Constraint Loops.

Authors: BEN-AMRAM, AMIR M. GENAIM, SAMIR

Source: Journal of the ACM. Jul2014, Vol. 61 Issue 4, p26-2655. 55p.

On the Termination of Integer Loops.

Authors: BEN-AMRAM, AMIR M. GENAIM, SAMIR MASUD, ABU NASER

Source: ACM Transactions on Programming Languages & Systems; Dec2012, Vol. 34 Issue 4, p1-24, 24p

Monotonicity Constraints in Characterizations of PSPACE.

Authors: Ben-Amram, Amir M. Loff, Bruno Oitavem, Isabel

Source: Journal of Logic & Computation; Apr2012, Vol. 22 Issue 2, p179-195, 17p

Size-Change Termination with Difference Constraints.

Authors: Ben-Amram, Amir M.

Source: ACM Transactions on Programming Languages & Systems; May 2008, Vol. 30 Issue 3, p5-1-31