On Sorting, Heaps, and Minimum Spanning TreesNAVARRO, Gonzalo; PAREDES, Rodrigo.Algorithmica. 2010, Vol 57, Num 4, pp 585-620, issn 0178-4617, 36 p.Article

Analysis of asymmetric single-buffer polling and priority systems without switchover timesTAKINE, T; TAKAGI, H; TAKAHASHI, Y et al.Performance evaluation. 1990, Vol 11, Num 4, pp 253-264, issn 0166-5316, 12 p.Article

A Dual-Bound Algorithm for Very Fast and Exact Template MatchingSCHWEITZER, Haim; RUI DENG; FINIS ANDERSON, Robert et al.IEEE transactions on pattern analysis and machine intelligence. 2011, Vol 33, Num 3, pp 459-470, issn 0162-8828, 12 p.Article

Heavy traffic response times for a priority queue with linear prioritiesNELSON, R. D.Operations research. 1990, Vol 38, Num 3, pp 560-563, issn 0030-364X, 4 p.Article

Priority queueing involving orientation and the problems of their software implementationMISHKOY, G. K.Computers & mathematics with applications (1987). 1990, Vol 19, Num 1, pp 109-113, issn 0898-1221, 5 p.Article

Delay analysis of discrete-time priority queue with structured inputsTAKAHASHI, Y; HASHIDA, O.Queueing systems. 1991, Vol 8, Num 2, pp 149-163, issn 0257-0130Article

Strong approximations for priority queues; head-of-the-line-first disciplineHAN-QIN ZHANG; GUANG-HUI HSU.Queueing systems. 1992, Vol 10, Num 3, pp 213-234, issn 0257-0130Article

An N server cutoff priority queue where arriving customers request a random number of serversSCHAACK, C; LARSON, R. C.Management science. 1989, Vol 36, Num 5, pp 614-634, issn 0025-1909, 21 p.Article

O(N) implementation of the fast marching algorithmYATZIV, Liron; BARTESAGHI, Alberto; SAPIRO, Guillermo et al.Journal of computational physics (Print). 2006, Vol 212, Num 2, pp 393-399, issn 0021-9991, 7 p.Article

The preempt-resume M/G/1 queue with feedback and clocked schedulesKEILSON, J; SERVI, L. D.Performance evaluation. 1989, Vol 9, Num 3, pp 191-208, issn 0166-5316, 18 p.Article

Kinetic hangerDA FONSECA, Guilherme D; DE FIGUEIREDO, Celina M. H; CARVALHO, Paulo C. P et al.Information processing letters. 2004, Vol 89, Num 3, pp 151-157, issn 0020-0190, 7 p.Article

A performance comparison of event calendar algorithms: an empirical approachKEHSIUNG CHUNG; JANCHE SANG; VERNON REGO et al.Software, practice & experience. 1993, Vol 23, Num 10, pp 1107-1138, issn 0038-0644Article

The distributional form of Little's law and the Fuhrmann-Cooper decompositionKEILSON, J; SERVI, L. D.Operations research letters. 1990, Vol 9, Num 4, pp 239-247, issn 0167-6377, 9 p.Article

A note on the construction of the data structure «deap»CARLSSON, S; JINGSEN CHEN; STROTHOTTE, T et al.Information processing letters. 1989, Vol 31, Num 6, pp 315-317, issn 0020-0190Article

First in Line Waiting Times as a Tool for Analysing Queueing SystemsKOOLE, G. M; NIELSEN, B. F; NIELSEN, T. B et al.Operations research. 2012, Vol 60, Num 5, pp 1258-1266, issn 0030-364X, 9 p.Article

Etude et mise en œuvre de structures de données pour la recherche d'arbres dans les graphes valués = Study and implementation of data-structures for finding trees in weighted graphsROTTEMBOURG, Benoît; MINOUX, Michel.1993, 250 p.Thesis

Recursive computation of steady-state probabilities in priority queuesCIDON, I; SIDI, M.Operations research letters. 1990, Vol 9, Num 4, pp 249-256, issn 0167-6377, 8 p.Article

Parallel priority queue and list contraction : The BSP approachGERBESSIOTIS, Alexandros V; SINIOLAKIS, Constantinos J; TISKIN, Alexandre et al.Computing and informatics. 2002, Vol 21, Num 1, pp 59-90, issn 1335-9150Article

On the additional delay in an M/G/1 queue with generalized vacations and exhaustive serviceLEUNG, K. K.Operations research. 1992, Vol 40, pp S272-S283, issn 0030-364X, SUP2Article

Buckets, heaps, lists, and monotone priority queuesCHERKASSKY, B. V; GOLDBERG, A. V; SILVERSTEIN, C et al.SIAM journal on computing (Print). 1999, Vol 28, Num 4, pp 1326-1346, issn 0097-5397Article

A generalization of binomial queuesFAGERBERG, R.Information processing letters. 1996, Vol 57, Num 2, pp 109-114, issn 0020-0190Article

Transforming binary sequences using priority queuesATKINSON, M. D.Order (Dordrecht). 1993, Vol 10, Num 1, pp 31-36, issn 0167-8094Article

Approximate analysis of an M/G/1 priority queue with priority changes due to impatienceDE WAAL, P.Report - Department of Operations Research, Statistics, and System Theory. 1992, Num 2, pp 1-14, issn 0924-0659Article

Two-level heaps: a new priority queue structure with applications to the single source shortest path problemSUBRAMANI, K; MADDURI, Kamesh.Computing (Wien. Print). 2010, Vol 90, Num 3-4, pp 113-130, issn 0010-485X, 18 p.Article

A preemptive priority queue with balkingDREKIC, Steve; WOOLFORD, Douglas G.European journal of operational research. 2005, Vol 164, Num 2, pp 387-401, issn 0377-2217, 15 p.Article