Random number generators: good ones are hard to find
Communications of the ACM
Coding the Lehmer pseudo-random number generator
Communications of the ACM
Communications of the ACM - Special issue on simulation
The synchronization of periodic routing messages
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Diffracting trees (preliminary version)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
The synchronization of periodic routing messages
IEEE/ACM Transactions on Networking (TON)
A steady state analysis of diffracting trees (extended abstract)
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Continuous profiling: where have all the cycles gone?
ACM Transactions on Computer Systems (TOCS)
Continuous profiling: where have all the cycles gone?
Proceedings of the sixteenth ACM symposium on Operating systems principles
Using name-based mappings to increase hit rates
IEEE/ACM Transactions on Networking (TON)
Communications of the ACM - Special issue on computer augmented environments: back to the real world
Journal of Functional Programming
Lottery scheduling: flexible proportional-share resource management
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
Overrun handling approaches for overload-prone soft real-time systems
Advances in Engineering Software
Design of high speed routers using RED algorithm
Proceedings of the 2011 International Conference on Communication, Computing & Security
Universal homophonic coding scheme using differential encoding and interleaving
Information Processing Letters
Hi-index | 48.22 |
Although superficially time-consuming, on 32-bit computers the minimal standard random number generator can be implemented with surprising economy.