( en | de | ru )

 

Disambiguation of "Boyar, Joan"

Author of the publication

copydeleteadd this publication to your clipboard
Advice Complexity of Priority Algorithms.

, , , and . WAOA, volume 11312 of Lecture Notes in Computer Science, page 69-86. Springer, (2018)

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.

Mykolar Boyar

Urania Joannou

Evgenia Boyarskaya

Franz-Ruthard Joans

Demetrios Joannou

 

Other publications of authors with the same name

Bounds for Scheduling Jobs on Grid Processors., and . Space-Efficient Data Structures, Streams, and Algorithms, volume 8066 of Lecture Notes in Computer Science, page 12-26. Springer, (2013)Tight Bounds for Restricted Grid Scheduling., and . Int. J. Found. Comput. Sci., 30 (3): 375-405 (2019)Relative Worst-order Analysis: A Survey., , and . ACM Comput. Surv., 54 (1): 8:1-8:21 (2022)A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs., , and . J. Cryptol., 2 (2): 63-76 (1990)Cancellation-free circuits in unbounded and bounded depth., and . Theor. Comput. Sci., (2015)Priority algorithms for graph optimization problems., , , and . Theor. Comput. Sci., 411 (1): 239-258 (2010)Advice complexity of adaptive priority algorithms., , and . Theor. Comput. Sci., (February 2024)Online Bin Covering with Advice., , , and . WADS, volume 11646 of Lecture Notes in Computer Science, page 225-238. Springer, (2019)Scheduling Jobs on Grid Processors., and . SWAT, volume 4059 of Lecture Notes in Computer Science, page 17-28. Springer, (2006)The Advice Complexity of a Class of Hard Online Problems., , , and . Theory Comput. Syst., 61 (4): 1128-1177 (2017)