( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Two new methods for constructing double-ended priority queues from priority queues.

, , и . Computing, 83 (4): 193-204 (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Jyrki Alakuijala

Jyrki Syväri

Jyrki Lötjönen

 

Другие публикации лиц с тем же именем

Worst-Case-Efficient Dynamic Arrays in Practice.. SEA, том 9685 из Lecture Notes in Computer Science, стр. 167-183. Springer, (2016)An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams., , и . SWAT, том 318 из Lecture Notes in Computer Science, стр. 190-198. Springer, (1988)Performance Tuning an Algorithm for Compressing Relational Tables., и . SWAT, том 2368 из Lecture Notes in Computer Science, стр. 398-407. Springer, (2002)Asymptotically Efficient In-Place Merging., , и . MFCS, том 969 из Lecture Notes in Computer Science, стр. 211-220. Springer, (1995)In-Place Binary Counters., и . MFCS, том 8087 из Lecture Notes in Computer Science, стр. 349-360. Springer, (2013)Practical in-place mergesort, , и . Nordic J. of Computing, 3 (1): 27--40 (марта 1996)Performance Engineering Case Study: Heap Construction., , и . WAE, том 1668 из Lecture Notes in Computer Science, стр. 302-316. Springer, (1999)Space-Efficient Construction of Optimal Prefix Codes., , и . Data Compression Conference, стр. 192-201. IEEE Computer Society, (1995)A Linear Expected-Time Algorithm for Computing Planar Relative Neighbourhood Graphs., , и . Inf. Process. Lett., 25 (2): 77-86 (1987)Strengthened Lazy Heaps: Surpassing the Lower Bounds for Binary Heaps., , и . CoRR, (2014)