( en | de | ru )

 

Disambiguation of "Moruz, Gabriel"

Author of the publication

copydeleteadd this publication to your clipboard
On the adaptiveness of Quicksort.

, , and . ACM Journal of Experimental Algorithmics, (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. You can also use the button next to the name to display some publications already assigned to the person.

Ursula Gabriel

Volker Gabriel

Elmar Gabriel

Gabriel Mayer

Gerhard Gabriel

 

Other publications of authors with the same name

Cache-Aware and Cache-Oblivious Adaptive Sorting., , and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 576-588. Springer, (2005)Priority Queues Resilient to Memory Faults., , and . WADS, volume 4619 of Lecture Notes in Computer Science, page 127-138. Springer, (2007)Engineering Efficient Paging Algorithms., , , and . SEA, volume 7276 of Lecture Notes in Computer Science, page 320-331. Springer, (2012)The optimal structure of algorithms for α-paging., , , and . Inf. Process. Lett., 115 (12): 932-938 (2015)Skewed Binary Search Trees., and . ESA, volume 4168 of Lecture Notes in Computer Science, page 708-719. Springer, (2006)Client-Server P Systems in Modeling Molecular Interaction., , , , and . WMC-CdeA, volume 2597 of Lecture Notes in Computer Science, page 203-218. Springer, (2002)Engineering Efficient Paging Algorithms., , , and . ACM Journal of Experimental Algorithmics, (2014)Adapting parallel algorithms to the W-Stream model, with applications to graph problems., , , and . Theor. Comput. Sci., 411 (44-46): 3994-4004 (2010)OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm., , and . Theory Comput. Syst., 56 (1): 22-40 (2015)OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm., , and . WAOA, volume 7164 of Lecture Notes in Computer Science, page 164-175. Springer, (2011)