References
- Bayer , R. 1972 . Symmetric binary B-trees: data structures and maintenance algorithms . Acta Informat , 1 : 290 – 306 .
- Black , J. R.J. , Martel , C. U. and Qi , H. 20–22 August 1998 . Graph and hashing algorithms for modern architectures: design and performance , 20–22 August , 87 – 48 . Proceedings of WAE, Saarbrücken, Germany .
- Boccaletti , S. 2006 . Complex networks: structure and dynamics . Phys. Rep , 424 : 175 – 308 .
- Briggs , K. 2005 . Graphlib . software available at http://keithbriggs.info/graphlib.html (accessed 12 September 2007)
- Cantin , J. and Hill , M. 2001 . Cache performance for selected SPEC CPU2000 benchmarks . ACM SIGARCH Comp. Archit. News , 29 : 13 – 18 .
- Celis , P. , Larson , P. A. and Munro , J. Robin Hood hashing, Proceedings of the 26th IEEE Symposium on the Foundations of Computer Science . pp. 281 – 288 . Loas Alamitos, , CA : IEEE Computer Society Press .
- Csardi , G. 2007 . IGraph, 2007; , software available at http://cneurocvs.rmki.kfki.hu/igraph/ (accessed 12 September
- Dorogovtsev , S. and Mendes , J. 2002 . Evolution of networks . Adv. Phys , 51 : 1079 – 1187 .
- GNOME . 2007 . GLib, 2007 . software available at http://library.gnome.org/devel/glib/stable/ (accessed 12 September
- Janson , S. 2005 . Individual displacements for linear probing hashing with different isertion policies . ACM Trans. Algorithms , 1 : 177 – 213 .
- Knuth , D. E. 1993 . The Stanford GraphBase: A Platform for Combinatorial Computing , Reading, MA : Addison Wesley .
- Knuth , D. E. 1998 . The Art of Computer Programming, 2nd ed. Sorting and Searching , Vol. 3 , Reading, MA : Addison Wesley .
- Knuth , D. and Amble , O. 1974 . Ordered hash tables . Comput. J , 17 : 35 – 142 .
- Lea , D. 2007 . A Memory Allocator . 2000 Available at http://gee.cs.oswego.edu/dl/html/malloc.html (accessed 30 May
- Musser , D. R. , Derge , G. J. and Saini , A. 2001 . STL Tutorial and Reference Guide , Redwood City, CA : Addison Wesley .
- Newman , M. 2003 . The structure and function of complex networks . SIAM Rev , 45 : 167 – 256 .
- Onnela , J. P. 2007 . Structure and tie strengths in mobile communication networks . Proc. Nat. Acad. Sci. USA , 104 : 7332
- Onnela , J. P. 2007 . Analysis of a large-scale weighted network of one-to-one human communication . New J. Phys , 9 : 179
- Patterson , D. and Hennessy , J. April 2004 . Computer Organization and Design: The Hardware/Software Interface, , 3 , April , San Francisco, CA : Morgan Kaufman .
- Ross , K. Amortized computational complexity . April 2007 . Efficient hash probes on modern processors , Vol. 6 , pp. 306 – 318 . Proceedings of the 2007 DBRank Workshop .
- Tarjan , R. E. SIAM J. Algebra. Discr. Methods , 214 – 242 .
- Viola , A. 2005 . Exact distribution of individual displacements in linear probing hashing . ACM Trans. Algorithms , 1 : 214 – 242 .