Inferring a Sequence Produced by a Linear Congruence. - Joan B. Plumstead (CRYPTO, 1982)

Inferring a Sequence Generated by a Linear Congruence - Joan B. Plumstead (FOCS, 1982)

Coloring Planar Graphs in Parallel. - Joan Boyar; Howard J. Karloff (J. Algorithms, 1987)

On the Concrete Complexity of Zero-Knowledge Proofs. - Joan Boyar; René Peralta 001 (CRYPTO, 1989)

Inferring sequences produced by pseudo-random number generators. - Joan Boyar (J. ACM, 1989)

Inferring Sequences Produced by a Linear Congruential Generator Missing Low-Order Bits. - Joan Boyar (J. Cryptol., 1989)

Convertible Undeniable Signatures. - Joan Boyar; David Chaum; Ivan Damgård; Torben P. Pedersen (CRYPTO, 1990)

A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs. - Joan Boyar; Stuart A. Kurtz; Mark W. Krentel (J. Cryptol., 1990)

Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. - Joan Boyar; Katalin Friedl; Carsten Lund (J. Cryptol., 1991)

An Arithmetic Model of Computation Equivalent to Threshold Circuits. - Joan Boyar; Gudmund Skovbjerg Frandsen; Carl Sturtivant (Theor. Comput. Sci., 1992)

On the Communication Complexity of Zero-Knowledge Proofs. - Joan Boyar; Carsten Lund; René Peralta 001 (J. Cryptol., 1993)

Bounds on Certain Multiplications of Affine Combinations. - Joan Boyar; Faith E. Fich; Kim S. Larsen (Discret. Appl. Math., 1994)

Efficient Rebalancing of Chromatic Search Trees. - Joan Boyar; Kim S. Larsen (J. Comput. Syst. Sci., 1994)

Subquadratic Zero-Knowledge. - Joan Boyar; Gilles Brassard; René Peralta 001 (J. ACM, 1995)

Short Discrete Proofs. - Joan Boyar; René Peralta 001 (EUROCRYPT, 1996)

Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. - Joan Boyar; Rolf Fagerberg; Kim S. Larsen (J. Comput. Syst. Sci., 1997)

The Seat Reservation Problem. - Joan Boyar; Kim S. Larsen (Algorithmica, 1999)

Better Bounds on the Accommodating Ratio for the Seat Reservation Problem. - Eric Bach 001; Joan Boyar; Tao Jiang 001; Kim S. Larsen; Guo-Hui Lin (COCOON, 2000)

Fair versus Unrestricted Bin Packing. - Yossi Azar; Joan Boyar; Lene M. Favrholdt; Kim S. Larsen; Morten N. Nielsen (SWAT, 2000)

Short Non-Interactive Cryptographic Proofs. - Joan Boyar; Ivan Damgård; René Peralta 001 (J. Cryptol., 2000)

On the multiplicative complexity of Boolean functions over the basis (cap, +, 1). - Joan Boyar; René Peralta 001; Denis Pochuev (Theor. Comput. Sci., 2000)

Seat Reservation Allowing Seat Changes. - Joan Boyar; Susan Krarup; Morten N. Nielsen (ATMOS, 2001)

The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences. - Joan Boyar; Lene M. Favrholdt; Kim S. Larsen; Morten N. Nielsen (Nord. J. Comput., 2001)

The Accommodating Function: A Generalization of the Competitive Ratio. - Joan Boyar; Kim S. Larsen; Morten N. Nielsen (SIAM J. Comput., 2001)

Fair versus Unrestricted Bin Packing. - Yossi Azar; Joan Boyar; Lene M. Favrholdt; Kim S. Larsen; Morten N. Nielsen; Leah Epstein (Algorithmica, 2002)

The Relative Worst Order Ratio for On-Line Algorithms. - Joan Boyar; Lene M. Favrholdt (CIAC, 2003)

Extending the accommodating function. - Joan Boyar; Lene M. Favrholdt; Kim S. Larsen; Morten N. Nielsen (Acta Informatica, 2003)

Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. - Eric Bach 001; Joan Boyar; Leah Epstein; Lene M. Favrholdt; Tao Jiang 001; Kim S. Larsen; Guo-Hui Lin; Rob van Stee (J. Sched., 2003)

Priority Algorithms for Graph Optimization Problems. - Allan Borodin; Joan Boyar; Kim S. Larsen (WAOA, 2004)

The Exact Multiplicative Complexity of the Hamming Weight Function - Joan Boyar; René Peralta 001 (Electron. Colloquium Comput. Complex., 2005)

Concrete Multiplicative Complexity of Symmetric Functions. - Joan Boyar; René Peralta 001 (MFCS, 2006)

Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem. - Joan Boyar; Martin R. Ehmsen; Kim S. Larsen (WAOA, 2006)

The maximum resource bin packing problem. - Joan Boyar; Leah Epstein; Lene M. Favrholdt; Jens S. Kohrt; Kim S. Larsen; Morten Monrad Pedersen; Sanne Wøhlk (Theor. Comput. Sci., 2006)

The relative worst-order ratio applied to paging. - Joan Boyar; Lene M. Favrholdt; Kim S. Larsen (J. Comput. Syst. Sci., 2007)

The relative worst order ratio for online algorithms. - Joan Boyar; Lene M. Favrholdt (ACM Trans. Algorithms, 2007)

On the Shortest Linear Straight-Line Program for Computing Linear Forms. - Joan Boyar; Philip Matthews; René Peralta 001 (MFCS, 2008)

The relative worst order ratio applied to seat reservation. - Joan Boyar; Paul Medvedev (ACM Trans. Algorithms, 2008)

Tight bounds for the multiplicative complexity of symmetric functions. - Joan Boyar; René Peralta 001 (Theor. Comput. Sci., 2008)

New logic minimization techniques with applications to cryptology. - Joan Boyar; René Peralta 001 (IACR Cryptol. ePrint Arch., 2009)

A New Combinational Logic Minimization Technique with Applications to Cryptology. - Joan Boyar; René Peralta 001 (SEA, 2010)

A theoretical comparison of LRU and LRU-K. - Joan Boyar; Martin R. Ehmsen; Jens S. Kohrt; Kim S. Larsen (Acta Informatica, 2010)

Scheduling Jobs on Grid Processors. - Joan Boyar; Lene M. Favrholdt (Algorithmica, 2010)

Priority algorithms for graph optimization problems. - Allan Borodin; Joan Boyar; Kim S. Larsen; Nazanin Mirmohammadi (Theor. Comput. Sci., 2010)

Tight results for Next Fit and Worst Fit with resource augmentation. - Joan Boyar; Leah Epstein; Asaf Levin (Theor. Comput. Sci., 2010)

A depth-16 circuit for the AES S-box. - Joan Boyar; René Peralta 001 (IACR Cryptol. ePrint Arch., 2011)

A Small Depth-16 Circuit for the AES S-Box. - Joan Boyar; René Peralta 001 (SEC, 2012)

Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis. - Joan Boyar; Sushmita Gupta; Kim S. Larsen (SWAT, 2012)

Cancellation-free circuits: An approach for proving superlinear lower bounds for linear Boolean operators - Joan Boyar; Magnus Find (CoRR, 2012)

On the absolute approximation ratio for First Fit and related results. - Joan Boyar; György Dósa; Leah Epstein (Discret. Appl. Math., 2012)

A new variable-sized bin packing problem. - Joan Boyar; Lene M. Favrholdt (J. Sched., 2012)

Bounds for Scheduling Jobs on Grid Processors. - Joan Boyar; Faith Ellen (Space-Efficient Data Structures, Streams, and Algorithms, 2013)

Four Measures of Nonlinearity. - Joan Boyar; Magnus Find; René Peralta 001 (IACR Cryptol. ePrint Arch., 2013)

Logic Minimization Techniques with Applications to Cryptology. - Joan Boyar; Philip Matthews; René Peralta 001 (J. Cryptol., 2013)

The Relationship between Multiplicative Complexity and Nonlinearity. - Joan Boyar; Magnus Gausdal Find (MFCS (2), 2014)

Tight Bounds for an Online Bin Packing Problem. - Joan Boyar; Faith Ellen (CoRR, 2014)

A comparison of performance measures via online search. - Joan Boyar; Kim S. Larsen; Abyayananda Maiti (Theor. Comput. Sci., 2014)

Constructive Relationships Between Algebraic Thickness and Normality. - Joan Boyar; Magnus Gausdal Find (FCT, 2015)

Adding Isolated Vertices Makes Some Online Algorithms Optimal. - Joan Boyar; Christian Kudahl (IWOCA, 2015)

Advice Complexity for a Class of Online Problems. - Joan Boyar; Lene M. Favrholdt; Christian Kudahl; Jesper W. Mikkelsen (STACS, 2015)

A Comparison of Performance Measures for Online Algorithms. - Joan Boyar; Sandy Irani; Kim S. Larsen (Algorithmica, 2015)

The Frequent Items Problem in Online Streaming Under Various Performance Measures. - Joan Boyar; Kim S. Larsen; Abyayananda Maiti (Int. J. Found. Comput. Sci., 2015)

Cancellation-free circuits in unbounded and bounded depth. - Joan Boyar; Magnus Gausdal Find (Theor. Comput. Sci., 2015)

Relative interval analysis of paging algorithms on access graphs. - Joan Boyar; Sushmita Gupta; Kim S. Larsen (Theor. Comput. Sci., 2015)

Online Bin Packing with Advice. - Joan Boyar; Shahin Kamali; Kim S. Larsen; Alejandro López-Ortiz (Algorithmica, 2016)

On various nonlinearity measures for boolean functions. - Joan Boyar; Magnus Gausdal Find; René Peralta 001 (Cryptogr. Commun., 2016)

Online Algorithms with Advice: A Survey. - Joan Boyar; Lene M. Favrholdt; Christian Kudahl; Kim S. Larsen; Jesper W. Mikkelsen (SIGACT News, 2016)

On the list update problem with advice. - Joan Boyar; Shahin Kamali; Kim S. Larsen; Alejandro López-Ortiz (Inf. Comput., 2017)

The Advice Complexity of a Class of Hard Online Problems. - Joan Boyar; Lene M. Favrholdt; Christian Kudahl; Jesper W. Mikkelsen (Theory Comput. Syst., 2017)

Batch Coloring of Graphs. - Joan Boyar; Leah Epstein; Lene M. Favrholdt; Kim S. Larsen; Asaf Levin (Algorithmica, 2018)

The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing. - Joan Boyar; Faith Ellen; Kim S. Larsen (CoRR, 2018)

Adding isolated vertices makes some greedy online algorithms optimal. - Joan Boyar; Christian Kudahl (Discret. Appl. Math., 2018)

Weighted Online Problems with Advice. - Joan Boyar; Lene M. Favrholdt; Christian Kudahl; Jesper W. Mikkelsen (Theory Comput. Syst., 2018)

Online-bounded analysis. - Joan Boyar; Leah Epstein; Lene M. Favrholdt; Kim S. Larsen; Asaf Levin (J. Sched., 2018)

Multiplicative complexity of vector valued Boolean functions. - Joan Boyar; Magnus Gausdal Find (Theor. Comput. Sci., 2018)

Online Dominating Set. - Joan Boyar; Stephan J. Eidenbenz; Lene M. Favrholdt; Michal Kotrbcík; Kim S. Larsen (Algorithmica, 2019)

Small low-depth circuits for cryptographic applications. - Joan Boyar; Magnus Gausdal Find; René Peralta 001 (Cryptogr. Commun., 2019)

Tight Bounds for Restricted Grid Scheduling. - Joan Boyar; Faith Ellen (Int. J. Found. Comput. Sci., 2019)

Randomized distributed online algorithms against adaptive offline adversaries. - Joan Boyar; Faith Ellen; Kim S. Larsen (Inf. Process. Lett., 2020)

Advice Complexity of Priority Algorithms. - Allan Borodin; Joan Boyar; Kim S. Larsen; Denis Pankratov (Theory Comput. Syst., 2020)

Online Bin Covering with Advice. - Joan Boyar; Lene M. Favrholdt; Shahin Kamali; Kim S. Larsen (Algorithmica, 2021)

Online Unit Profit Knapsack with Untrusted Predictions. - Joan Boyar; Lene M. Favrholdt; Kim S. Larsen (SWAT, 2022)

Relaxing the Irrevocability Requirement for Online Graph Algorithms. - Joan Boyar; Lene M. Favrholdt; Michal Kotrbcík; Kim S. Larsen (Algorithmica, 2022)

Relative Worst-order Analysis: A Survey. - Joan Boyar; Lene M. Favrholdt; Kim S. Larsen (ACM Comput. Surv., 2022)

Paging with Succinct Predictions. - Antonios Antoniadis 001; Joan Boyar; Marek Eliás 001; Lene Monrad Favrholdt; Ruben Hoeksma; Kim S. Larsen; Adam Polak 001; Bertrand Simon 001 (ICML, 2023)

Quotable Signatures for Authenticating Shared Quotes. - Joan Boyar; Simon Erfurth; Kim S. Larsen; Ruben Niederhagen (LATINCRYPT, 2023)

Online Algorithms with Predictions (Invited Talk). - Joan Boyar (MFCS, 2023)

Online Minimum Spanning Trees with Weight Predictions. - Magnus Berg; Joan Boyar; Lene M. Favrholdt; Kim S. Larsen (WADS, 2023)

Online Interval Scheduling with Predictions. - Joan Boyar; Lene M. Favrholdt; Shahin Kamali; Kim S. Larsen (WADS, 2023)

On the Online Weighted Non-Crossing Matching Problem. - Joan Boyar; Shahin Kamali; Kim S. Larsen; Ali Mohammad Lavasani; Yaqiao Li; Denis Pankratov (SWAT, 2024)

Folding Schemes with Privacy Preserving Selective Verification. - Joan Boyar; Simon Erfurth (IACR Commun. Cryptol., 2024)

Advice complexity of adaptive priority algorithms. - Joan Boyar; Kim S. Larsen; Denis Pankratov (Theor. Comput. Sci., 2024)

Online Unit Profit Knapsack with Predictions. - Joan Boyar; Lene M. Favrholdt; Kim S. Larsen (Algorithmica, 2024)

Complexity Classes for Online Problems with and Without Predictions. - Magnus Berg; Joan Boyar; Lene M. Favrholdt; Kim S. Larsen (IJTCS-FAW, 2025)

Brief Announcement: Distributed Graph Algorithms with Predictions. - Joan Boyar; Faith Ellen; Kim S. Larsen (PODC, 2025)

Distributed Graph Algorithms with Predictions. - Joan Boyar; Faith Ellen; Kim S. Larsen (CoRR, 2025)