Hi all,

Sorry for the web interface; I'm sending this from my BlackBerry.

A quick google of the term "calendar queue" comes up with mostly results of papers one needs to pay for, and my ACM student membership just expired. I was wondering if anyone had any free links to analysis/info of that data structure, or barring that could give me a rundown of how it works. I know it's a priority queue with amortized O(1) insert and remove head complexity that uses buckets, and that's about it. Any help would be appreciated.

Thanks,
Robert

seen this one
http://www.isi.edu/nsnam/ns/doc/node35.html

Ty Tower Wrote:

> seen this one
> http://www.isi.edu/nsnam/ns/doc/node35.html
and here is its use

http://www.cise.ufl.edu/~fishwick/CPUDisk/queuing_code.html

Ty Tower wrote:
> Ty Tower Wrote:
> 
>> seen this one
>> http://www.isi.edu/nsnam/ns/doc/node35.html
> and here is its use
> 
> http://www.cise.ufl.edu/~fishwick/CPUDisk/queuing_code.html

Thanks, Ty! Yeah, I saw those, but neither contains a detailed description & analysis.