( en | de | ru )

 

Disambiguation of "Ben-Amram, Amir M."

Author of the publication

copydeleteadd this publication to your clipboard
The Subtree Max Gap Problem with Application to Parallel String Covering.

, , , and . SODA, page 501-510. ACM/SIAM, (1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Amir M Nia

Amir M Edalatpour

Manutschehr Amirfeyz

Iradj Amirzadeh-Asl

Mahmud Amirian-Khaffadjeh

 

Other publications of authors with the same name

Tighter constant-factor time hierarchies.. Inf. Process. Lett., 87 (1): 39-44 (2003)Tight Polynomial Bounds for Loop Programs in Polynomial Space., and . Log. Methods Comput. Sci., (2021)Lower Bounds on Algebraic Random Access Machines (Extended Abstract)., and . ICALP, volume 944 of Lecture Notes in Computer Science, page 360-371. Springer, (1995)Tight Worst-Case Bounds for Polynomial Loop Programs., and . FoSSaCS, volume 11425 of Lecture Notes in Computer Science, page 80-97. Springer, (2019)A SAT-Based Approach to Size Change Termination with Global Ranking Functions., and . TACAS, volume 4963 of Lecture Notes in Computer Science, page 218-232. Springer, (2008)Worst-Case and Amortised Optimality in Union-Find (Extended Abstract)., , and . STOC, page 499-506. ACM, (1999)The Euler Path to Static Level-Ancestors. CoRR, (2009)A Comment on Budach's Mouse-in-an-Octant Problem. CoRR, (2013)Bounded Termination of Monotonicity-Constraint Transition Systems, and . CoRR, (2012)Size-Change Termination, Monotonicity Constraints and Ranking Functions.. CAV, volume 5643 of Lecture Notes in Computer Science, page 109-123. Springer, (2009)