Dorfman, Dani
12  Ergebnisse:
Personensuche X
?
9

Improved bounds for multipass pairing heaps and path-balanc..:

Dorfman, Dani ; Kaplan, Haim ; Kozma, László..
Dorfman , D , Kaplan , H , Kozma , L , Pettie , S & Zwick , U 2018 , Improved bounds for multipass pairing heaps and path-balanced binary search trees . in 26th European Symposium on Algorithms, ESA 2018 . , 24 , Schloss Dagstuhl - Leibniz-Zentrum für Informatik , Wadern , pp. 1-13 , 26th European Symposium on Algorithms, ESA 2018 , Helsinki , Finland , 20/08/18 . https://doi.org/10.4230/LIPIcs.ESA.2018.24.  , 2018
 
?
10

Pairing heaps:the forward variant:

Dorfman, Dani ; Kaplan, Haim ; Kozma, László.
Dorfman , D , Kaplan , H , Kozma , L & Zwick , U 2018 , Pairing heaps : the forward variant . in I Potapov , J Worrell & P Spirakis (eds) , 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018 . , 13 , Leibniz International Proceedings in Informatics (LIPIcs) , vol. 117 , Schloss Dagstuhl - Leibniz-Zentrum für Informatik , Wadern , 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018 , Liverpool , United Kingdom , 27/08/18 . https://doi.org/10.4230/LIPIcs.MFCS.2018.13.  , 2018
 
?
12

Model United Nations Mock Session:

Mireles, Nathan ; Dorfman, Sapphire ; Budhadhoki, Kranti...
https://digitalcommons.wou.edu/aes_event/2018/all/47.  , 2018
 
1-12