Name Lookup Algorithms
Name Lookup Algorithms is a computational method within symbol table management that systematically resolves identifiers to their corresponding declarations by navigating scoping rules and binding structures in a programming language context.
36
Publications
1.4K
Citations
114
Authors
46
Institutions
Publications per year
2017–2026
8
Parents
36
Scalable Name Lookup in NDN Using Effective Name Component Encoding
Yi Wang, Keqiang He, Huichen Dai et al. · 2012 · 139 citations
Scalable NDN Forwarding: Concepts, Issues and Principles
Haowei Yuan, Tian Song, Patrick Crowley · 2012 · 139 citations · Full text
Allen L. Norrbom, L. E. Carroll, F. Christian Thompson et al. · Smithsonian Digital Repository (Smithsonian Institution) · 1999 · 138 citations
NameFilter: Achieving fast name lookup with low memory cost via applying two-stage Bloom filters
1–5 of 36
114
7
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 114
46
Tsinghua University
Beijing, China
8 h-index
42 publications
2.2K citations

Peking University
Beijing, China
3 h-index
8 publications
106 citations

Washington University in St. Louis
St Louis, United States
3 h-index
6 publications
428 citations
University of Arizona
Tucson, United States
3 h-index
5 publications
152 citations

Beijing University of Posts and Telecommunications
Beijing, China
2 h-index
7 publications
644 citations
IBM (United States)
Armonk, United States
2 h-index
3 publications
94 citations

Hunan University
Changsha, China
2 h-index
9 publications
122 citations
Clemson University
Clemson, United States
2 h-index
2 publications
37 citations
1–8 of 46
2 publications · 119 citations
2
h-index
2 publications · 28 citations
2
h-index
JACM · 1 publications · 40 citations
1
h-index
1 publications · 16 citations
1
h-index
TSE · 1 publications · 60 citations
1
h-index
1–5