Changes

Jump to: navigation, search

Queue

190 bytes removed, 17:10, 3 June 2018
no edit summary
=Publications=
* [[Peter Sanders]] ('''1995'''). ''Fast priority queues for parallel branch-and-bound''. [http://www.informatik.uni-trier.de/~ley/db/conf/irregular/irregular95.html#HoppS95 IRREGULAR 1995]
* [http://www.research.ibm.com/people/m/michael/ Maged M. Michael], [http://www.cs.rochester.edu/~scott/ Michael L. Scott] ('''1996'''). ''Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms''. Department of Computer Science, [https://en.wikipedia.org/wiki/University_of_Rochester University of Rochester], [http://www.cs.rochester.edu/u/scott/papers/1996_PODC_queues.pdf pdf]
* [[Donald Knuth]] ('''1997'''). ''[http://www-cs-faculty.stanford.edu/~knuth/taocp.html The Art of Computer Programming]'', Volume 1: Fundamental Algorithms (Third Edition), Addison-Wesley, ISBN 0-201-89683-4, 2.2.1: Stacks, Queues, and Deques, pp. 238–243.
Retrieved from "https://www.chessprogramming.org/Special:MobileDiff/3589"

Navigation menu