A data structure for dynamic trees
Journal of Computer and System Sciences
About polynomial-time “unpredictable” generators
WSC '89 Proceedings of the 21st conference on Winter simulation
Complexity models for incremental computation
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
Randomized dynamic graph algorithms with polylogarithmic time per operation
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
ISCA '96 Proceedings of the 23rd annual international symposium on Computer architecture
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
Streamlining inter-operation memory communication via data dependence prediction
MICRO 30 Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture
A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Memory dependence prediction using store sets
Proceedings of the 25th annual international symposium on Computer architecture
Sampling to provide or to bound: with applications to fully dynamic graph algorithms
Proceedings of the workshop on Randomized algorithms and computation
A practical secure physical random bit generator
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
An empirical study of dynamic graph algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The Alpha 21264 Microprocessor
IEEE Micro
Cryptographic Randomness from Air Turbulence in Disk Drives
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Data structures for on-line updating of minimum spanning trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
IEEE Communications Magazine
Stateless key distribution for secure intra and inter-group multicast in mobile wireless network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Implementing true random number generators by generating crosstalk effects in FPGA chips
Proceedings of the 6th FPGAworld Conference
Maintaining dynamic minimum spanning trees: An experimental study
Discrete Applied Mathematics
Stream ciphers using a random update function: study of the entropy of the inner state
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Algorithms and theory of computation handbook
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
A secure migration process for mobile agents
Software—Practice & Experience
Improved maintenance of molecular surfaces using dynamic graph connectivity
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
| Hi-index | 0.00 |
We present an experimental study of different variants of theamortized O(log2 n)-time fully-dynamicconnectivity algorithm of Holm, de Lichtenberg, and Thorup(STOC'98). The experiments build upon experiments provided byAlberts, Cattaneo, and Italiano (SODA'96) on the randomizedamortized O(log3 n) fully-dynamicconnectivity algorithm of Henzinger and King (STOC'95). Ourexperiments shed light upon similarities and differences betweenthe two algorithms. We also present a slightly modified version ofthe Henzinger-King algorithm that runs in O(log2n) time, which resulted from our experiments.