Lively linear Lisp: “look ma, no garbage!”
ACM SIGPLAN Notices
The Boyer Benchmark at warp speed
ACM SIGPLAN Lisp Pointers
ACM SIGPLAN Lisp Pointers
ALPHA—An Automatic Programming System of High Efficiency
Journal of the ACM (JACM)
Efficient Computation of Expressions with Common Subexpressions
Journal of the ACM (JACM)
Instruction Sets for Evaluating Arithmetic Expressions
Journal of the ACM (JACM)
Retargetable Compiler Code Generation
ACM Computing Surveys (CSUR)
Some effects of the 6600 computer on language structures
Communications of the ACM
A visit to computation centers in the Soviet Union
Communications of the ACM
A portable compiler: theory and practice
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Efficient computation of expressions with common subexpressions
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A unified approach to global program optimization
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Code-generation for machines with multiregister operations
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
IEEE Annals of the History of Computing
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Efficient Interprocedural Data Placement Optimisation in a Parallel Library
LCR '98 Selected Papers from the 4th International Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers
A unified approach to the analysis of Horton-Strahler parameters of binary tree structures
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
An efficient static analysis algorithm to detect redundant memory operations
Proceedings of the 2002 workshop on Memory system performance
On the expressivity and complexity of quantitative branching-time temporal logics
Theoretical Computer Science - Latin American theoretical informatics
A comparison of instruction sets for stack machines
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The scientific works of Rainer Kemp (1949-2004)
Theoretical Computer Science
Type-safe modular hash-consing
Proceedings of the 2006 workshop on ML
The register function for t-ary trees
ACM Transactions on Algorithms (TALG)
Function memoization and unique object representation for ACL2 functions
ACL2 '06 Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications
Analysis and reduction of memory inefficiencies in Java strings
Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Redundancy elimination revisited
Proceedings of the 17th international conference on Parallel architectures and compilation techniques
What Is a Real-World SAT Instance?
Proceedings of the 2007 conference on Artificial Intelligence Research and Development
Measuring the hardness of SAT instances
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Electronic Notes in Theoretical Computer Science (ENTCS)
Sawja: static analysis workshop for java
FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
Building and using pluggable type-checkers
Proceedings of the 33rd International Conference on Software Engineering
Dynamics for ML using Meta-Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Treegraph-based Instruction Scheduling for Stack-based Virtual Machines
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient tabling of structured data with enhanced hash-consing
Theory and Practice of Logic Programming
| Hi-index | 48.27 |
The concepts used without explanation are taken from [1].