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

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

TIGHT POLYNOMIAL BOUNDS FOR LOOP PROGRAMS IN POLYNOMIAL SPACE.

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

Source: Logical Methods in Computer Science (LMCS); 2021, Vol. 17 Issue 4, p1-51, 51p

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

Program Termination Analysis in Polynomial Time.

Authors: Ben-Amram, Amir M. Lee, Chin Soon

Source: ACM Transactions on Programming Languages & Systems; January 2007, Vol. 29 Issue 1, p1D-37D, 37p

On pointers versus addresses.

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

Source: Journal of the ACM; July 1992, Vol. 39, p617-648, 32p

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

Element distinctness on one-tape Turing machines: a complete solution.

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

Source: Acta Informatica; Oct2003, Vol. 40 Issue 2, p81-94, 14p

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

A Precise Version of a Time Hierarchy Theorem.

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

Source: Fundamenta Informaticae. 1999, Vol. 38 Issue 1-2, p1-15. 15p.

Subjects: Integral theorems, Universal algebra, Mathematical constants, Factors (Algebra), Problem solving, Turing machines, Machine theory

ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS.

Authors: BEN-AMRAM, AMIR M. KRISTIANSEN, LARS

Source: International Journal of Foundations of Computer Science. Nov2012, Vol. 23 Issue 7, p1451-1464. 14p.

Subjects: Computational complexity, Feasibility studies, Computer systems, Computer programming, Polynomials, Programming languages, Mathematical models

Tighter constant-factor time hierarchies

Authors: Ben-Amram, Amir M.¹ amirben@server.mta.ac.il

Source: Information Processing Letters. Jul2003, Vol. 87 Issue 1, p39. 6p.

Subjects: Computational complexity, Turing machines

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

SAT-based termination analysis using monotonicity constraints over the integers.

Authors: CODISH, MICHAEL GONOPOLSKIY, IGOR BEN-AMRAM, AMIR M. et al.

Source: Theory & Practice of Logic Programming; Jul2011, Vol. 11 Issue 4/5, p503-520, 18p

Corrigendum to “A simple and efficient Union–Find–Delete algorithm” [Theoret. Comput. Sci. 412 (4–5) 487–492]

Authors: Ben-Amram, Amir M. Yoffe, Simon

Source: Theoretical Computer Science. Mar2012, Vol. 423, p75-75. 1p.