Kodialam et al (2008) Advances in Oblivious Routing of Internet Traffic (SIGMETRIC)
This is a survey paper on oblivious routing.
[more]
LaTeX package: qbordermatrix
In plain TeX, there is a macro \bordermatrix but I am not very satisfied with it. The problem of that is, the “border” is always at the leftmost and topmost, but not any other combinations. For some unknown reason, I am surprised that no one has any problem with it...
[more]
Bansal and Modha (2004) CAR: Clock with Adaptive Replacement (FAST)
This is an improvement over ARC by combining ARC with Clock (second-chance) cache replacement algorithm. Like ARC, there are two LRU queues and each queue is separated from cache (\(T\)) and directory (\(T+B\)). But instead of a simple queue, the LRU are now implemented in a circular queue with a...
[more]
Megiddo and Modha (2004) Outperforming LRU with an Adaptive Replacement Cache Algorithm (IEEE Computer)
Also as “ARC: A Self-Tuning, Low Overhead Replacement Cache” by the same authors. In Proceedings of 2nd USENIX Conference on File and Storage Technologies (FAST), pp.115–130, San Francisco CA, Mar 31–Apr 2 2003.
[more]
Fredman and Tarjan (1987) Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms (JACM)
This is the paper that proposed Fibonacci Heap (aka F-heap). Detail is also found on http://en.wikipedia.org/wiki/Fibonacci_heap and also chapter 20 of Introduction to Algorithms 2/e.
[more]