Pointer-based Representation

Pointer-Based Representation is a data structuring method in computer science that uses memory address references to link discrete nodes, distinguishing itself by enabling dynamic set union and find operations in disjoint set structures or sequential access in linked lists through explicit pointer connections between elements.

121

Publications

8.8K

Citations

277

Authors

116

Institutions

Publications per year

2017–2026

12

Authors

277

  1. MK
    Milind Kulkarni

    Purdue University West Lafayette, United States

    10 publications · 904 citations

    10

    h-index

  2. KP
    Keshav Pingali

    The University of Texas at Austin, United States

    8 publications · 934 citations

    8

    h-index

  3. SZ
    Steve Zdancewic

    University of Pennsylvania, United States

    6 publications · 314 citations

    6

    h-index

  4. LH
    Laurie Hendren

    McGill University, Canada

    6 publications · 814 citations

    6

    h-index

  5. MB
    Martin Burtscher

    Texas State University, United States

    5 publications · 367 citations

    5

    h-index

1–5 of 277

Venues

  1. ACM SIGPLAN Notices

    12 publications · 1.1K citations

    11

    h-index

  2. Communications of the ACM

    5 publications · 271 citations

    5

    h-index

  3. Proceedings of the ACM on Programming Languages

    PACMPL · 3 publications · 87 citations

    3

    h-index

  4. 2

    h-index

  5. Measurement

    3 publications · 101 citations

    2

    h-index

1–5