Dynamic initial allocation and local reallocation procedures for multiple stacks
Communications of the ACM
A provably efficient algorithm for dynamic storage allocation
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Animated graphical interfaces using temporal constraints
CHI '86 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
ACM Computing Surveys (CSUR)
Tenuring policies for generation-based storage reclamation
OOPSLA '88 Conference proceedings on Object-oriented programming systems, languages and applications
An Efficient Digital Search Algorithm by Using a Double-Array Structure
IEEE Transactions on Software Engineering
A Framework for the Automated Drawing of Data Structure Diagrams
IEEE Transactions on Software Engineering
Using binary search on a linked list
ACM SIGCSE Bulletin
A compendium of key search references
ACM SIGIR Forum
An extension of manifold boundary representations to the r-sets
ACM Transactions on Graphics (TOG)
An adaptive tenuring policy for generation scavengers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time distribution analysis for binary search of a linked list
ACM SIGCSE Bulletin
Empirical measurements of six allocation-intensive C programs
ACM SIGPLAN Notices
PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
Improving the cache locality of memory allocation
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
A general data dependence test for dynamic, pointer-based data structures
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Static and dynamic partitioning of pointers as links and threads
Proceedings of the first ACM SIGPLAN international conference on Functional programming
The memory fragmentation problem: solved?
Proceedings of the 1st international symposium on Memory management
Garbage collecting the Internet: a survey of distributed garbage collection
ACM Computing Surveys (CSUR)
Effective jump-pointer prefetching for linked data structures
ISCA '99 Proceedings of the 26th annual international symposium on Computer architecture
Quicksort algorithms with an early exit for sorted subfiles
CSC '87 Proceedings of the 15th annual conference on Computer Science
Using simulation to teach recursion and binary tree traversals
SIGCSE '85 Proceedings of the sixteenth SIGCSE technical symposium on Computer science education
Optimal parallel encoding and decoding algorithms for trees
CSC '91 Proceedings of the 19th annual conference on Computer Science
Some Techniques for Solving Recurrences
ACM Computing Surveys (CSUR)
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
Communications of the ACM
A constructive approach to the design of algorithms and their data structures
Communications of the ACM
A multiple-stack manipulation procedure
Communications of the ACM
Balancing binary trees by internal path reduction
Communications of the ACM
A dynamic storage allocation technique based on memory residence time
Communications of the ACM
Derivation of efficient DAG marking algorithms
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Trie Compaction Algorithm for a Large Set of Keys
IEEE Transactions on Knowledge and Data Engineering
A Dynamic Hash File for Random and Sequential Accessing
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Distributed dynamic hash tables using IBM LAPI
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Extending the relational database data model for design applications
DAC '84 Proceedings of the 21st Design Automation Conference
Data sharing in an FFP machine
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Characterization of VAX Macsyma
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Generation Scavenging: A non-disruptive high performance storage reclamation algorithm
SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
An algorithm with constant execution time for dynamic storage allocation
RTCSA '95 Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications
An improvement key deletion method for double-array structure using single-nodes
Information Processing and Management: an International Journal
Chinese string searching using the KMP algorithm
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
A compression algorithm using integrated record information for translation dictionaries
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Informatics and computer science intelligent systems applications
On the size of the search space of join optimization
Journal of Computing Sciences in Colleges
The slab allocator: an object-caching kernel memory allocator
USTC'94 Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1
Fuzzy Sets and Systems
Custom memory allocation for free
LCPC'06 Proceedings of the 19th international conference on Languages and compilers for parallel computing
On some simple single server models of dynamic storage
Proceedings of the 6th International Conference on Queueing Theory and Network Applications
A simulation environment for vehicle-to-grid integration studies
Proceedings of the 2011 Summer Computer Simulation Conference
Chunked extendible dense arrays for scientific data storage
Parallel Computing
| Hi-index | 0.09 |