Results 251 to 260 of about 619,805 (296)
Some of the next articles are maybe not open access.
Self-Organizing Doubly-Linked Lists
Journal of Algorithms, 1993Summary: We study the problem of maintaining a doubly-linked list (DLL) in approximately optimal order, with respect to the mean search time. We study two types of DLL reorganization strategies. Move-to-end (MTE) [\textit{D. Matthews}, \textit{D. Rotem}, and \textit{E. Bretholz}, Self-organizing doubly-linked lists, J. Comput. Math. Sect.
Radhakrishna S. Valiveti, B. John Oommen
openaire +1 more source
Backing up in singly linked lists
Journal of the ACM, 1999We show how to reduce the time overhead for implementing two-way movement on a singly linked list to O ( n ϵ ) per operation without modifying the list and without making use of storage other than a finite number of pointers into the list.
Amir M. Ben-Amram, Holger Petersen 0001
openaire +1 more source
Generalizing singly-linked list reorganizing heuristics for doubly-linked lists
1989The class of memoryless heuristics for maintaining a doubly-linked list in an approximately optimal order is studied. Initially the problem, its representation and the constraints on doubly linked lists are defined. Various mappings and theorems that relate singly-linked list and doubly linked list heuristics are presented, and a new heuristic referred
David T. H. Ng, B. John Oommen
openaire +1 more source
Checking Cleanness in Linked Lists
2000A new algorithm is presented that automatically uncovers memory errors such as NULL pointers dereference and memory leaks in C programs. The algorithm is conservative, i.e., it can never miss an error but may report “false alarms”. When applied to several intricate C programs manipulating singly linked lists, the new algorithm yields more accurate ...
Nurit Dor, Michael Rodeh, Shmuel Sagiv
openaire +1 more source
Maintaining order in a linked list
Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82, 1982We present a new representation for linked lists. This representation allows one to efficiently insert objects into the list and to quickly determine the order of list elements. The basic data structure, called an indexed 2-3 tree, allows one to do n inserts in O(nlogn) steps and to determine order in constant time.
openaire +1 more source
Maintaining order in a generalized linked list
Acta Informatica, 1984We give a representation for linked lists which allows to efficiently insert and delete objects in the list and to quickly determine the order of two list elements. The basic data structure, called an indexed BB[α]-tree, allows to do n insertions and deletions in O(n log n) steps and determine the order in constant time, assuming that the locations of ...
openaire +2 more sources
Property Testing on Linked Lists.
Electron. Colloquium Comput. Complex., 2013We define a new property testing model for algorithms that do not have arbitrary query access to the input, but must instead traverse it in a manner that respects the underlying data structure in which it is stored. In particular, we consider the case when the underlying data structure is a linked list, and the testing algorithm is allowed to either ...
Afshani, Peyman +2 more
openaire +2 more sources