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
121
Space-efficient static trees and graphs
G. Jacobson · 1989 · 649 citations
Optimistic parallelism requires abstractions
Milind Kulkarni, Keshav Pingali, Bruce Walter et al. · 2007 · 447 citations
Analysis of pointers and structures
David Chase, Mark N. Wegman, F. K. Zadeck · ACM SIGPLAN Notices · 2004 · 437 citations
1–5 of 121
277
10
h-index
8
h-index
6
h-index
6
h-index
5
h-index
1–5 of 277
116
The University of Texas at Austin
Austin, United States
8 h-index
25 publications
2.5K citations
Carnegie Mellon University
Pittsburgh, United States
6 h-index
11 publications
1.2K citations
Stanford University
Stanford, United States
5 h-index
7 publications
608 citations
IBM (United States)
Armonk, United States
5 h-index
5 publications
997 citations
Purdue University West Lafayette
West Lafayette, United States
5 h-index
11 publications
275 citations

McGill University
Montreal, Canada
5 h-index
10 publications
2.2K citations
University of Illinois Urbana-Champaign
Urbana, United States
5 h-index
15 publications
495 citations
University of Pennsylvania
Philadelphia, United States
4 h-index
12 publications
774 citations
1–8 of 116
12 publications · 1.1K citations
11
h-index
5 publications · 271 citations
5
h-index
PACMPL · 3 publications · 87 citations
3
h-index
2 publications · 192 citations
2
h-index
3 publications · 101 citations
2
h-index
1–5