Joan Boyar

Joan Boyar, Philip Matthews, René Peralta: Logic Minimization Techniques with Applications to Cryptology. J. Cryptology 26(2): 280-312 (2013)

Joan Boyar, Magnus Find, René Peralta: Four Measures of Nonlinearity. CIAC 2013: 61-72

Joan Boyar, György Dósa, Leah Epstein: On the absolute approximation ratio for First Fit and related results. Discrete Applied Mathematics 160(13-14): 1914-1923 (2012)

Joan Boyar, Lene M. Favrholdt: A new variable-sized bin packing problem. J. Scheduling 15(3): 273-287 (2012)

Joan Boyar, Kim S. Larsen, Abyayananda Maiti: A Comparison of Performance Measures via Online Search. FAW-AAIM 2012: 303-314

Joan Boyar, René Peralta: A Small Depth-16 Circuit for the AES S-Box. SEC 2012: 287-298

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

Joan Boyar, Sushmita Gupta, Kim S. Larsen: Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis. CoRR abs/1204.4047 (2012)

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

Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz: Online Bin Packing with Advice. CoRR abs/1212.4016 (2012)

Joan Boyar, Kim S. Larsen, Abyayananda Maiti: A Comparison of Performance Measures via Online Search. CoRR abs/1106.6136 (2011)

Joan Boyar, René Peralta: A depth-16 circuit for the AES S-box. IACR Cryptology ePrint Archive 2011: 332 (2011)

Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen: A theoretical comparison of LRU and LRU-K. Acta Inf. 47(7-8): 359-374 (2010)

Joan Boyar, Lene M. Favrholdt: Scheduling Jobs on Grid Processors. Algorithmica 57(4): 819-847 (2010)

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

Joan Boyar, Leah Epstein, Asaf Levin: Tight results for Next Fit and Worst Fit with resource augmentation. Theor. Comput. Sci. 411(26-28): 2572-2580 (2010)

Joan Boyar, René Peralta: A New Combinational Logic Minimization Technique with Applications to Cryptology. SEA 2010: 178-189

Joan Boyar, Sandy Irani, Kim S. Larsen: A Comparison of Performance Measures for Online Algorithms. WADS 2009: 119-130

Joan Boyar, René Peralta: New logic minimization techniques with applications to cryptology. IACR Cryptology ePrint Archive 2009: 191 (2009)

Joan Boyar, Paul Medvedev: The relative worst order ratio applied to seat reservation. ACM Transactions on Algorithms 4(4) (2008)

Joan Boyar, René Peralta: Tight bounds for the multiplicative complexity of symmetric functions. Theor. Comput. Sci. 396(1-3): 223-246 (2008)

Joan Boyar, Philip Matthews, René Peralta: On the Shortest Linear Straight-Line Program for Computing Linear Forms. MFCS 2008: 168-179

Joan Boyar, Sandy Irani, Kim S. Larsen: A Comparison of Performance Measures for Online Algorithms. CoRR abs/0806.0983 (2008)

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

Joan Boyar, Lene M. Favrholdt: The relative worst order ratio for online algorithms. ACM Transactions on Algorithms 3(2) (2007)

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

Joan Boyar, René Peralta: Concrete Multiplicative Complexity of Symmetric Functions. MFCS 2006: 179-189

Joan Boyar, Lene M. Favrholdt: Scheduling Jobs on Grid Processors. SWAT 2006: 17-28

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

Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk: The Maximum Resource Bin Packing Problem. FCT 2005: 397-408

Joan Boyar, Lene M. Favrholdt, Kim S. Larsen: The relative worst order ratio applied to paging. SODA 2005: 718-727

Joan Boyar, René Peralta: The Exact Multiplicative Complexity of the Hamming Weight Function. Electronic Colloquium on Computational Complexity (ECCC)(049) (2005)

Joan Boyar, Susan Krarup, Morten N. Nielsen: Seat reservation allowing seat changes. J. Algorithms 52(2): 169-192 (2004)

Joan Boyar, Paul Medvedev: The Relative Worst Order Ratio Applied to Seat Reservation. SWAT 2004: 90-101

Allan Borodin, Joan Boyar, Kim S. Larsen: Priority Algorithms for Graph Optimization Problems. WAOA 2004: 126-139

Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen: Extending the accommodating function. Acta Inf. 40(1): 3-35 (2003)

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

Joan Boyar, Lene M. Favrholdt: The Relative Worst Order Ratio for On-Line Algorithms. CIAC 2003: 58-69

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

Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen: Extending the Accommodating Function. COCOON 2002: 87-96

Joan Boyar, Susan Krarup, Morten N. Nielsen: Seat Reservation Allowing Seat Changes. Electr. Notes Theor. Comput. Sci. 50(1): 24-38 (2001)

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

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

Joan Boyar, Ivan Damgård, René Peralta: Short Non-Interactive Cryptographic Proofs. J. Cryptology 13(4): 449-472 (2000)

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

Eric Bach, Joan Boyar, Tao Jiang, Kim S. Larsen, Guo-Hui Lin: Better Bounds on the Accommodating Ratio for the Seat Reservation Problem. COCOON 2000: 221-231

Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen: Fair versus Unrestricted Bin Packing. SWAT 2000: 200-213

Joan Boyar, Kim S. Larsen: The Seat Reservation Problem. Algorithmica 25(4): 403-417 (1999)

Joan Boyar, Kim S. Larsen, Morten N. Nielsen: The Accommodating Function - A Generalization of the Competitive Ratio. WADS 1999: 74-79

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

Joan Boyar, René Peralta: Short Discrete Proofs. EUROCRYPT 1996: 131-142

Joan Boyar, Gilles Brassard, René Peralta: Subquadratic Zero-Knowledge. J. ACM 42(6): 1169-1193 (1995)

Joan Boyar, Rolf Fagerberg, Kim S. Larsen: Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. WADS 1995: 270-281

Joan Boyar, Faith E. Fich, Kim S. Larsen: Bounds on Certain Multiplications of Affine Combinations. Discrete Applied Mathematics 52(2): 155-167 (1994)

Joan Boyar, Kim S. Larsen: Efficient Rebalancing of Chromatic Search Trees. J. Comput. Syst. Sci. 49(3): 667-682 (1994)

Joan Boyar, Carsten Lund, René Peralta: On the Communication Complexity of Zero-Knowledge Proofs. J. Cryptology 6(2): 65-85 (1993)

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

Joan Boyar, Kim S. Larsen: Efficient Rebalancing of Chromatic Search Trees. SWAT 1992: 151-164

Joan Boyar, Katalin Friedl, Carsten Lund: Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. J. Cryptology 4(3): 185-206 (1991)

Joan Boyar, Gilles Brassard, René Peralta: Subquadratic Zero-Knowledge. FOCS 1991: 69-78

Joan Boyar, S. A. Kurtz, Mark W. Krentel: A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs. J. Cryptology 2(2): 63-76 (1990)

Joan Boyar, David Chaum, Ivan Damgård, Torben P. Pedersen: Convertible Undeniable Signatures. CRYPTO 1990: 189-205

Joan Boyar: Inferring sequences produced by pseudo-random number generators. J. ACM 36(1): 129-141 (1989)

Joan Boyar: Inferring Sequences Produced by a Linear Congruential Generator Missing Low-Order Bits. J. Cryptology 1(3): 177-184 (1989)

Joan Boyar, René Peralta: On the Concrete Complexity of Zero-Knowledge Proofs. CRYPTO 1989: 507-525

Joan Boyar, Katalin Friedl, Carsten Lund: Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. EUROCRYPT 1989: 155-172

Joan Boyar, Howard J. Karloff: Coloring Planar Graphs in Parallel. J. Algorithms 8(4): 470-479 (1987)

Joan B. Plumstead: Inferring a Sequence Produced by a Linear Congruence. CRYPTO 1982: 317-319

Joan B. Plumstead: Inferring a Sequence Generated by a Linear Congruence. FOCS 1982: 153-159