Fishspear: A Priority Queue Algorithm (Extended Abstract)

Cached

Download Links

by Michael J. Fischer , Michael S. Paterson
Citations:11 - 1 self

Documents Related by Co-Citation

8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
86 A data structure for manipulating priority queues – J Vuillemin - 1978
2452 The Design and Analysis of Computer Algorithms – A V Aho, J E Hopcroft, J D Ullman - 1974
39 Implementation and analysis of binomial queue algorithms – M R Brown - 1978
501 Sorting networks and their applications – K. E. Batcher - 1968
29 P.V.: An implicit binomial queue with constant insertion time – S Carlsson, J I Munro, Poblete - 1988
151 The buffer tree: A new technique for optimal I/O-algorithms – Lars Arge - 1995
377 Self-adjusting binary search trees – D D Sleator, R E Tarjan - 1985
104 Faster algorithms for the shortest path problem – Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert E. Tarjan - 1990
86 An empirical comparison of priority-queue and event-set implementations – D W Jones - 1986
546 The input/output complexity of sorting and related problems – A Aggarwal, J S Vitter - 1988
255 Organization and maintenance of large ordered indexes – R Bayer, E McCreight - 1972
177 An algorithm for the organization of information – G Adelson-Velskii, E M Landis - 1962
6 On the complexity of negationlimited Boolean networks (preliminary version – Keisuke Tanaka, Tetsuro Nishino - 1994
4 Synthesis of networks with a minimum number of negative gates – T Ibaraki, S Muroga - 1971
2 An efficient message-forwarding algorithm using sequential storage. Unpublished – Michael J Fischer, Michael S Paterson, Nicholas Pippenger - 1982
2 Boolean Function Complexity, volume 169 – Michael S Paterson, editor - 1992
2 Berechungen in partiellen Algebren endlichen Typs – Volker Strassen - 1973
6 The complexityof negation-limited networks—a brief survey – M J Fischer - 1974