Showing 1 - 4 results of 4 for search 'Ben-Amram, Amir M.', query time: 0.02s Refine Results
In addition to media from the THWS, media from other Bavarian libraries are also displayed.
These are marked with the "Interlibrary loan" label and can be ordered by clicking on them.
  1. 1
    "When can we sort in o (n log n) time?" revisited

    "When can we sort in o (n log n) time?" revisited by Ben-Amram, Amir M.

    Published 1995
    Book Interlibrary loan Place Request


    Saved in:
  2. 2
    CONS free programs with tree input

    CONS free programs with tree input by Ben-Amram, Amir M.

    Published 1996
    Book Interlibrary loan Place Request


    Saved in:
  3. 3
    Pointer machines and pointer algorithms an annotated bibliography

    Pointer machines and pointer algorithms an annotated bibliography by Ben-Amram, Amir M.

    Published 1995
    Book Interlibrary loan Place Request


    Saved in:
  4. 4
    Average case complexity of sorting on a RAM

    Average case complexity of sorting on a RAM by Ben-Amram, Amir M.

    Published 1995
    Book Interlibrary loan Place Request


    Saved in:

Search Tools: