The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Amir M. Ben-Amram: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Amir M. Ben-Amram, Zvi Galil
    On the Power of the Shift Instruction [Citation Graph (1, 0)][DBLP]
    Inf. Comput., 1995, v:117, n:1, pp:19-36 [Journal]
  2. Amir M. Ben-Amram
    General Size-Change Termination and Lexicographic Descent. [Citation Graph (0, 0)][DBLP]
    The Essence of Computation, 2002, pp:3-17 [Conf]
  3. Amir M. Ben-Amram, Zvi Galil
    On Pointers versus Addresses (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:532-538 [Conf]
  4. Amir M. Ben-Amram, Zvi Galil
    Lower Bounds for Data Structure Problems on RAMs (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:622-631 [Conf]
  5. Amir M. Ben-Amram, Zvi Galil
    When can we sort in o(n log n) time? [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:538-546 [Conf]
  6. Amir M. Ben-Amram, Zvi Galil
    Lower Bounds on Algebraic Random Access Machines (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:360-371 [Conf]
  7. Amir M. Ben-Amram, Holger Petersen
    CONS-Free Programs with Tree Input (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:271-282 [Conf]
  8. Chin Soon Lee, Neil D. Jones, Amir M. Ben-Amram
    The size-change principle for program termination. [Citation Graph (0, 0)][DBLP]
    POPL, 2001, pp:81-92 [Conf]
  9. Amir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park
    The Subtree Max Gap Problem with Application to Parallel String Covering. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:501-510 [Conf]
  10. Stephen Alstrup, Amir M. Ben-Amram, Theis Rauhe
    Worst-Case and Amortised Optimality in Union-Find (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:499-506 [Conf]
  11. Amir M. Ben-Amram, Holger Petersen
    Backing Up in Singly Linked Lists. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:780-786 [Conf]
  12. Amir M. Ben-Amram, Omer Berkman, Holger Petersen
    Element distinctness on one-tape Turing machines: a complete solution. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2003, v:40, n:2, pp:81-94 [Journal]
  13. Amir M. Ben-Amram, Neil D. Jones
    Computational complexity via programming languages: constant factors do matter. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2000, v:37, n:2, pp:83-120 [Journal]
  14. Amir M. Ben-Amram, Zvi Galil
    A Generalization of a Lower Bound Technique due to Fredman and Saks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:1, pp:34-66 [Journal]
  15. Amir M. Ben-Amram, Zvi Galil
    Lower Bounds for Dynamic Data Structures on Algebraic RAMs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:3, pp:364-395 [Journal]
  16. Amir M. Ben-Amram
    Introducing: Reasonable Complete Programming Languages. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1998, v:64, n:, pp:- [Journal]
  17. Amir M. Ben-Amram, Zvi Galil
    On Data Structure Tradeoffs and an Application to Union-Find [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:62, pp:- [Journal]
  18. Amir M. Ben-Amram, Neil D. Jones
    A Precise Version of a Time Hierarchy Theorem. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:38, n:1-2, pp:1-15 [Journal]
  19. Amir M. Ben-Amram
    Tighter constant-factor time hierarchies. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:1, pp:39-44 [Journal]
  20. Amir M. Ben-Amram, Zvi Galil
    On Pointers versus Addresses. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:3, pp:617-648 [Journal]
  21. Amir M. Ben-Amram, Holger Petersen
    Backing up in singly linked lists. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:4, pp:681-705 [Journal]
  22. Amir M. Ben-Amram
    When Can We Sort in o(n log n) Time? [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:2, pp:345-370 [Journal]
  23. Amir M. Ben-Amram, Bryant A. Julstrom, Uri Zwick
    A Note on Busy Beavers and Other Creatures. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:4, pp:375-386 [Journal]
  24. Amir M. Ben-Amram, Holger Petersen
    Improved Bounds for Functions Related to Busy Beavers. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:1, pp:1-11 [Journal]
  25. Amir M. Ben-Amram, Zvi Galil
    Topological Lower Bounds on Algebraic Random Access Machines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:722-761 [Journal]
  26. Amir M. Ben-Amram
    Unit-Cost Pointers versus Logarithmic-Cost Addresses. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:132, n:2, pp:377-385 [Journal]
  27. Amir M. Ben-Amram, Chin Soon Lee
    Program termination analysis in polynomial time. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2007, v:29, n:1, pp:- [Journal]

  28. Size-Change Termination, Monotonicity Constraints and Ranking Functions. [Citation Graph (, )][DBLP]


  29. Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. [Citation Graph (, )][DBLP]


  30. A SAT-Based Approach to Size Change Termination with Global Ranking Functions. [Citation Graph (, )][DBLP]


  31. A complexity tradeoff in ranking-function termination proofs. [Citation Graph (, )][DBLP]


  32. Ranking Functions for Size-Change Termination II [Citation Graph (, )][DBLP]


  33. The Euler Path to Static Level-Ancestors [Citation Graph (, )][DBLP]


  34. Size-Change Termination, Monotonicity Constraints and Ranking Functions [Citation Graph (, )][DBLP]


  35. On Decidable Growth-Rate Properties of Imperative Programs [Citation Graph (, )][DBLP]


Search in 0.027secs, Finished in 0.029secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002