The linked list representation of n LIFO-stacks and/or FIFO-queues in the single-level memory

Authors:
A. V. Sokolov;A. V. Drac
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
2013

Citing 3
Cited 0

The evolution of two stacks in bounded space and random walks in a triangle

Proceedings of the 12th symposium on Mathematical foundations of computer science 1986
Random walks, heat equation and distributed algorithms

Journal of Computational and Applied Mathematics
Study of a Non-Markovian Stack Management Model in a Two-Level Memory

Programming and Computing Software

Quantified Score

Hi-index	0.89

Visualization

Abstract

In many applications there is a problem of representation of multiple LIFO-stacks and/or FIFO-queues in the single-level memory. This paper concerns issues related to building mathematical model of process of working with them in the case of linked list representation. This model was constructed as n-dimensional random walk on the integer lattice in some regions of n-dimensional space.