Concepedia

Memory Allocation For Linked Lists

Memory Allocation for Linked Lists is a method in computer science that specifies the dynamic assignment of memory space for nodes in a linked list structure, distinguishing itself from static allocation strategies by enabling on-demand, pointer-based memory binding during program execution.

4

Publications

114

Citations

13

Authors

5

Institutions

Publications per year

2017–2026

0

Parents

Publications

4

1–4 of 4

Authors

13

  1. PS
    Prokash Sinha

    1 publications · 13 citations

    1

    h-index

  2. ZX
    Zeping Xue

    Imperial College London, United Kingdom

    1 publications · 16 citations

    1

    h-index

  3. AK
    Alex Kogan

    Technion – Israel Institute of Technology, Israel

    1 publications · 58 citations

    1

    h-index

  4. JŠ
    Jiřı Šimša

    Carnegie Mellon University, United States

    1 publications · 27 citations

    1

    h-index

  5. AB
    Anastasia Braginsky

    Technion – Israel Institute of Technology, Israel

    1 publications · 58 citations

    1

    h-index

1–5 of 13

Institutions

5

  1. Carnegie Mellon University

    Pittsburgh, United States

    1 h-index

    2 publications

    54 citations

  2. Technion – Israel Institute of Technology

    Haifa, Israel

    1 h-index

    2 publications

    116 citations

  3. Imperial College London

    London, United Kingdom

    1 h-index

    2 publications

    32 citations

  4. Max Planck Institute for Software Systems

    Saarbrücken, Germany

    1 h-index

    2 publications

    54 citations

  5. Oracle (United States)

    Austin, United States

    1 h-index

    1 publications

    58 citations

1–5 of 5

Venues

  1. Linux journal

    LJ · 1 publications · 13 citations

    1

    h-index

1–1