ABAmir M. Ben-Amram
Amir M. Ben-Amram
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Amir M. Ben-Amram has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Neil D. Jones
University of Copenhagen
2 shared publications - Holger Petersen
Universität Stuttgart
1 shared publication Zvi Galil
Computer Science, Room 450, Columbia University, New York, NY 10027, USA.
1 shared publication
Latest Publications
- 1 March 2002
- Published by Springer Nature in Algorithmica
- Vol. 32 (3) , 364-395
Lower Bounds for Dynamic Data Structures on Algebraic RAMs
- 1 March 2002
- Published by Springer Nature in Algorithmica
- Vol. 32 (3) , 364-395
Lower Bounds for Dynamic Data Structures on Algebraic RAMs
- 1 September 2000
- Published by Springer Nature in Acta Informatica
- Vol. 37 (2) , 83-120
Computational complexity via programming languages: constant factors do matter
- 1 September 2000
- Published by Springer Nature in Acta Informatica
- Vol. 37 (2) , 83-120
Computational complexity via programming languages: constant factors do matter
- 1 January 1999
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 38 (1,2) , 1-15
A Precise Version of a Time Hierarchy Theorem
Using a simple programming language as a computational model, Neil Jones has shown that a constant-factor time hierarchy exists: thus a constant-factor difference in time makes a difference in problem-solving power, unlike the situation with Turing m
- 1 January 1999
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 38 (1,2) , 1-15
A Precise Version of a Time Hierarchy Theorem
Using a simple programming language as a computational model, Neil Jones has shown that a constant-factor time hierarchy exists: thus a constant-factor difference in time makes a difference in problem-solving power, unlike the situation with Turing m