Loading Icon

Random access

Random access (more precisely and more generally called direct access) is the ability to access an arbitrary element of a sequence in equal time or any datum from a population of addressable elements roughly as easily and efficiently as any other, no matter how many elements may be in the set. In computer science it is typically contrasted to sequential access which requires data to be retrieved in the order it was stored.

Metrics Summary

Total Publications
Lifetime
13,433
Prior Five Years
3,376
Total Citations
Lifetime
153,019
Prior Five Years
15,908
Total Scholars
Lifetime
17,763
Prior Five Years
13,108

Publications and Citation History

Publications based on Disciplines

Scholars based on Disciplines

Publications based on Fields

Scholars based on Fields

Highly Ranked Scholars™

Lifetime
Prior Five Years

Highly Cited Publications

Lifetime