The following pages link to Amir M. Ben-Amram (Q418007):
Displaying 28 items.
- (Q203735) (redirect page) (← links)
- Corrigendum to ``A simple and efficient union-find-delete algorithm'' (Q418009) (← links)
- (Q620967) (redirect page) (← links)
- A simple and efficient union-find-delete algorithm (Q620968) (← links)
- A complexity tradeoff in ranking-function termination proofs (Q1006896) (← links)
- Tighter constant-factor time hierarchies (Q1014389) (← links)
- Unit-cost pointers versus logarithmic-cost addresses (Q1334674) (← links)
- Lower bounds for dynamic data structures on algebraic RAMs (Q1348938) (← links)
- When can we sort in \(o(n\log n)\) time? (Q1356890) (← links)
- Computational complexity via programming languages: Constant factors do matter (Q1587302) (← links)
- Improved bounds for functions related to busy beavers (Q1597757) (← links)
- Complexity of Bradley-Manna-Sipma lexicographic ranking functions (Q1702898) (← links)
- Element distinctness on one-tape Turing machines: a complete solution (Q1889761) (← links)
- On the power of the shift instruction (Q1891160) (← links)
- On multiphase-linear ranking functions (Q2164261) (← links)
- Tight worst-case bounds for polynomial loop programs (Q2289065) (← links)
- Topological Lower Bounds on Algebraic Random Access Machines (Q2784478) (← links)
- Worst-case and amortised optimality in union-find (extended abstract) (Q2819582) (← links)
- Monotonicity Constraints in Characterizations of PSPACE (Q2882555) (← links)
- On the Termination of Integer Loops (Q2891402) (← links)
- On the linear ranking problem for integer linear-constraint loops (Q2931783) (← links)
- Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract) (Q2957912) (← links)
- SAT-based termination analysis using monotonicity constraints over the integers (Q3087439) (← links)
- (Q3128912) (← links)
- Monotonicity Constraints for Termination in the Integer Domain (Q3224670) (← links)
- Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time (Q3507419) (← links)
- Ranking Functions for Size-Change Termination II (Q3636808) (← links)
- (Q5414602) (← links)
