Symbol Table Data Structures
Symbol Table Data Structures is a formal computational framework that organizes and manages identifiers and their associated attributes within a compiler or interpreter, distinguished by its structured representation and efficient lookup mechanisms for programming language symbols.
26
Publications
1.5K
Citations
49
Authors
32
Institutions
Publications per year
2017–2026
4
Parents
26
Abstract data types and the development of data structures
John V. Guttag · Communications of the ACM · 1977 · 462 citations · Full text
Efficient access mechanisms for tabled logic programs
I. V. Ramakrishnan, Prasad Rao, Konstantinos Sagonas et al. · The Journal of Logic Programming · 1999 · 103 citations · Full text
Abstract data types and the development of data structures
John V. Guttag · 1976 · 41 citations
1–5 of 26
49
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 49
32
University of Southern California
Los Angeles, United States
3 h-index
3 publications
515 citations
RWTH Aachen University
Aachen, Germany
3 h-index
5 publications
375 citations

University of St Andrews
St Andrews, United Kingdom
3 h-index
6 publications
414 citations

The University of Melbourne
Melbourne, Australia
2 h-index
2 publications
40 citations
Heidelberg University
Heidelberg, Germany
2 h-index
4 publications
684 citations
Laboratoire de Physique des Lasers, Atomes et Molécules
Villeneuve-d'Ascq, France
1 h-index
2 publications
42 citations
Institute of Mathematics and Informatics
Sofia, Bulgaria
1 h-index
1 publications
24 citations
Princeton University
Princeton, United States
1 h-index
2 publications
48 citations
1–8 of 32
4 publications · 271 citations
4
h-index
2 publications · 342 citations
2
h-index
2 publications · 472 citations
2
h-index
Repository · 2 publications · 44 citations
2
h-index
1 publications · 11 citations
1
h-index
1–5