default search action

combined dblp search
author search
venue search
publication search

ask others

Amir M. Ben-Amram

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Neil D. Jones

> Home > Persons > Amir M. Ben-Amram

Publications

2008
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/cie/Ben-AmramJK08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cie/Ben-AmramJK08
Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen:
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. CiE 2008: 67-76
2001
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/popl/LeeJB01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/popl/LeeJB01
Chin Soon Lee, Neil D. Jones, Amir M. Ben-Amram:
The size-change principle for program termination. POPL 2001: 81-92
2000
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/acta/Ben-AmramJ00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/acta/Ben-AmramJ00
Amir M. Ben-Amram, Neil D. Jones:
Computational complexity via programming languages: constant factors do matter. Acta Informatica 37(2): 83-120 (2000)
1999
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/fuin/Ben-AmramJ99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fuin/Ben-AmramJ99
Amir M. Ben-Amram, Neil D. Jones:
A Precise Version of a Time Hierarchy Theorem. Fundam. Informaticae 38(1-2): 1-15 (1999)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.