Joan Boyar

ORCID

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 52

Top Venues

Publications

Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li, Denis Pankratov
On the Online Weighted Non-Crossing Matching Problem. SWAT (2024)
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Complexity Classes for Online Problems with and without Predictions. CoRR (2024)
Joan Boyar, Kim S. Larsen, Denis Pankratov
Advice complexity of adaptive priority algorithms. Theor. Comput. Sci. 984 (2024)
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Online Minimum Spanning Trees with Weight Predictions. WADS (2023)
Joan Boyar
Online Algorithms with Predictions (Invited Talk). MFCS (2023)
Joan Boyar, Simon Erfurth, Kim S. Larsen, Ruben Niederhagen
Quotable Signatures for Authenticating Shared Quotes. LATINCRYPT (2023)
Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene Monrad Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon
Paging with Succinct Predictions. ICML (2023)
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Online Minimum Spanning Trees with Weight Predictions. CoRR (2023)
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
Online Interval Scheduling with Predictions. CoRR (2023)
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
Online Interval Scheduling with Predictions. WADS (2023)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Online Unit Profit Knapsack with Untrusted Predictions. CoRR (2022)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Online Unit Profit Knapsack with Untrusted Predictions. SWAT (2022)
Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Relaxing the Irrevocability Requirement for Online Graph Algorithms. Algorithmica 84 (7) (2022)
Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene M. Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon
Paging with Succinct Predictions. CoRR (2022)
Joan Boyar, Simon Erfurth, Kim S. Larsen, Ruben Niederhagen
Quotable Signatures for Authenticating Shared Quotes. CoRR (2022)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Relative Worst-order Analysis: A Survey. ACM Comput. Surv. 54 (1) (2021)
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
Online Bin Covering with Advice. Algorithmica 83 (3) (2021)
Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov
Advice Complexity of Priority Algorithms. Theory Comput. Syst. 64 (4) (2020)
Joan Boyar, Faith Ellen, Kim S. Larsen
Randomized distributed online algorithms against adaptive offline adversaries. Inf. Process. Lett. 161 (2020)
Joan Boyar, Magnus Gausdal Find, René Peralta
Small low-depth circuits for cryptographic applications. Cryptogr. Commun. 11 (1) (2019)
Joan Boyar, Kim S. Larsen, Denis Pankratov
Advice Complexity of Adaptive Priority Algorithms. CoRR (2019)
Zihao Wei, Siwei Sun, Lei Hu, Man Wei, Joan Boyar, René Peralta
Inverter - with Applications to AES, Camellia, and SM4. IACR Cryptol. ePrint Arch. 2019 (2019)
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
Online Bin Covering with Advice. CoRR (2019)
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
Online Bin Covering with Advice. WADS (2019)
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Online Dominating Set. Algorithmica 81 (5) (2019)
Joan Boyar, Faith Ellen
Tight Bounds for Restricted Grid Scheduling. Int. J. Found. Comput. Sci. 30 (3) (2019)
Joan Boyar, Christian Kudahl
Adding isolated vertices makes some greedy online algorithms optimal. Discret. Appl. Math. 246 (2018)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Relative Worst-Order Analysis: A Survey. Adventures Between Lower Bounds and Higher Altitudes (2018)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Online-bounded analysis. J. Sched. 21 (4) (2018)
Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov
Advice Complexity of Priority Algorithms. CoRR (2018)
Joan Boyar, Faith Ellen, Kim S. Larsen
The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing. CoRR (2018)
Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov
Advice Complexity of Priority Algorithms. WAOA (2018)
Joan Boyar, Magnus Gausdal Find
Multiplicative complexity of vector valued Boolean functions. Theor. Comput. Sci. 720 (2018)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
Weighted Online Problems with Advice. Theory Comput. Syst. 62 (6) (2018)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Batch Coloring of Graphs. Algorithmica 80 (11) (2018)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Relative Worst-Order Analysis: A Survey. CoRR (2018)
Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Relaxing the Irrevocability Requirement for Online Graph Algorithms. WADS (2017)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen
Online Algorithms with Advice: A Survey. ACM Comput. Surv. 50 (2) (2017)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Michal Kotrbcík
Relaxing the Irrevocability Requirement for Online Graph Algorithms. CoRR (2017)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
The Advice Complexity of a Class of Hard Online Problems. Theory Comput. Syst. 61 (4) (2017)
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
On the list update problem with advice. Inf. Comput. 253 (2017)
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
Online Bin Packing with Advice. Algorithmica 74 (1) (2016)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Online Bounded Analysis. CoRR (2016)
Joan Boyar, Magnus Gausdal Find, René Peralta
On various nonlinearity measures for boolean functions. Cryptogr. Commun. 8 (3) (2016)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
Weighted Online Problems with Advice. CoRR (2016)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Online Bounded Analysis. CSR (2016)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
Weighted Online Problems with Advice. IWOCA (2016)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Batch Coloring of Graphs. WAOA (2016)
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Online Dominating Set. CoRR (2016)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Batch Coloring of Graphs. CoRR (2016)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen
Online Algorithms with Advice: A Survey. SIGACT News 47 (3) (2016)
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Online Dominating Set. SWAT (2016)
Joan Boyar, Sandy Irani, Kim S. Larsen
A Comparison of Performance Measures for Online Algorithms. Algorithmica 72 (4) (2015)
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
The Frequent Items Problem in Online Streaming Under Various Performance Measures. Int. J. Found. Comput. Sci. 26 (4) (2015)
Joan Boyar, Magnus Gausdal Find
Cancellation-free circuits in unbounded and bounded depth. Theor. Comput. Sci. 590 (2015)
Joan Boyar, Sushmita Gupta, Kim S. Larsen
Relative interval analysis of paging algorithms on access graphs. Theor. Comput. Sci. 568 (2015)
Joan Boyar, Christian Kudahl
Adding Isolated Vertices Makes Some Online Algorithms Optimal. IWOCA (2015)
Joan Boyar, Christian Kudahl
Adding Isolated Vertices Makes some Online Algorithms Optimal. CoRR (2015)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
Advice Complexity for a Class of Online Problems. STACS (2015)
Joan Boyar, Magnus Gausdal Find
Constructive Relationships Between Algebraic Thickness and Normality. FCT (2015)
Joan Boyar, Magnus Gausdal Find
The Relationship between Multiplicative Complexity and Nonlinearity. MFCS (2) (2014)
Joan Boyar, Magnus Gausdal Find
Constructive Relationships Between Algebraic Thickness and Normality. CoRR (2014)
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
A comparison of performance measures via online search. Theor. Comput. Sci. 532 (2014)
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
Online Bin Packing with Advice. STACS (2014)
Joan Boyar, Faith Ellen
Tight Bounds for an Online Bin Packing Problem. CoRR (2014)
Joan Boyar, Magnus Gausdal Find
The Relationship Between Multiplicative Complexity and Nonlinearity. CoRR (2014)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
The Advice Complexity of a Class of Hard Online Problems. CoRR (2014)
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
On the List Update Problem with Advice. LATA (2014)
Joan Boyar, Faith Ellen
Bounds for Scheduling Jobs on Grid Processors. Space-Efficient Data Structures, Streams, and Algorithms (2013)
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
The Frequent Items Problem in Online Streaming under Various Performance Measures. FCT (2013)
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
The Frequent Items Problem in Online Streaming under Various Performance Measures. CoRR (2013)
Joan Boyar, Philip Matthews, René Peralta
Logic Minimization Techniques with Applications to Cryptology. J. Cryptol. 26 (2) (2013)
Joan Boyar, Magnus Gausdal Find
Cancellation-Free Circuits in Unbounded and Bounded Depth. FCT (2013)
Joan Boyar, Magnus Find, René Peralta
Four Measures of Nonlinearity. IACR Cryptol. ePrint Arch. 2013 (2013)
Joan Boyar, Sushmita Gupta, Kim S. Larsen
Relative Interval Analysis of Paging Algorithms on Access Graphs. WADS (2013)
Joan Boyar, Sushmita Gupta, Kim S. Larsen
Relative Interval Analysis of Paging Algorithms on Access Graphs CoRR (2013)
Joan Boyar, Magnus Find
Cancellation-Free Circuits in Unbounded and Bounded Depth CoRR (2013)
Joan Boyar, Magnus Find, René Peralta
Four Measures of Nonlinearity. CIAC (2013)
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
On the List Update Problem with Advice. CoRR (2013)
Joan Boyar, René Peralta
A Small Depth-16 Circuit for the AES S-Box. SEC (2012)
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
A Comparison of Performance Measures via Online Search. FAW-AAIM (2012)
Joan Boyar, Sushmita Gupta, Kim S. Larsen
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis CoRR (2012)
Joan Boyar, Lene M. Favrholdt
A new variable-sized bin packing problem. J. Sched. 15 (3) (2012)
Joan Boyar, György Dósa, Leah Epstein
On the absolute approximation ratio for First Fit and related results. Discret. Appl. Math. 160 (13-14) (2012)
Joan Boyar, Magnus Find
Cancellation-free circuits: An approach for proving superlinear lower bounds for linear Boolean operators CoRR (2012)
Joan Boyar, Sushmita Gupta, Kim S. Larsen
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis. SWAT (2012)
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
Online Bin Packing with Advice CoRR (2012)
Joan Boyar, René Peralta
A depth-16 circuit for the AES S-box. IACR Cryptol. ePrint Arch. 2011 (2011)
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
A Comparison of Performance Measures via Online Search CoRR (2011)
Allan Borodin, Joan Boyar, Kim S. Larsen, Nazanin Mirmohammadi
Priority algorithms for graph optimization problems. Theor. Comput. Sci. 411 (1) (2010)
Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen
A theoretical comparison of LRU and LRU-K. Acta Informatica 47 (7-8) (2010)
Joan Boyar, Leah Epstein, Asaf Levin
Tight results for Next Fit and Worst Fit with resource augmentation. Theor. Comput. Sci. 411 (26-28) (2010)
Joan Boyar, René Peralta
A New Combinational Logic Minimization Technique with Applications to Cryptology. SEA (2010)
Joan Boyar, Lene M. Favrholdt
Scheduling Jobs on Grid Processors. Algorithmica 57 (4) (2010)
Joan Boyar, René Peralta
New logic minimization techniques with applications to cryptology. IACR Cryptol. ePrint Arch. 2009 (2009)
Joan Boyar, Sandy Irani, Kim S. Larsen
A Comparison of Performance Measures for Online Algorithms. WADS (2009)
Joan Boyar, Sandy Irani, Kim S. Larsen
A Comparison of Performance Measures for Online Algorithms CoRR (2008)
Joan Boyar, René Peralta
Tight bounds for the multiplicative complexity of symmetric functions. Theor. Comput. Sci. 396 (1-3) (2008)
Joan Boyar, Paul Medvedev
The relative worst order ratio applied to seat reservation. ACM Trans. Algorithms 4 (4) (2008)
Joan Boyar, Philip Matthews, René Peralta
On the Shortest Linear Straight-Line Program for Computing Linear Forms. MFCS (2008)

Joan Boyar.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Joan Boyar