Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarJoan Boyar
Joan B. Plumstead
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j53]Allan Borodin, Joan Boyar, Kim S. Larsen
, Denis Pankratov:
Advice Complexity of Priority Algorithms. Theory Comput. Syst. 64(4): 593-625 (2020)
2010 – 2019
- 2019
- [j52]Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen:
Online Dominating Set. Algorithmica 81(5): 1938-1964 (2019) - [j51]Joan Boyar, Magnus Gausdal Find, René Peralta:
Small low-depth circuits for cryptographic applications. Cryptogr. Commun. 11(1): 109-127 (2019) - [j50]Joan Boyar, Faith Ellen:
Tight Bounds for Restricted Grid Scheduling. Int. J. Found. Comput. Sci. 30(3): 375-405 (2019) - [c46]Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen:
Online Bin Covering with Advice. WADS 2019: 225-238 - [i29]Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen:
Online Bin Covering with Advice. CoRR abs/1905.00066 (2019) - [i28]Joan Boyar, Kim S. Larsen, Denis Pankratov:
Advice Complexity of Adaptive Priority Algorithms. CoRR abs/1910.00868 (2019) - [i27]Zihao Wei, Siwei Sun, Lei Hu, Man Wei, Joan Boyar, René Peralta:
Scrutinizing the Tower Field Implementation of the 픽28 Inverter - with Applications to AES, Camellia, and SM4. IACR Cryptol. ePrint Arch. 2019: 738 (2019) - 2018
- [j49]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Batch Coloring of Graphs. Algorithmica 80(11): 3293-3315 (2018) - [j48]Joan Boyar, Christian Kudahl:
Adding isolated vertices makes some greedy online algorithms optimal. Discret. Appl. Math. 246: 12-21 (2018) - [j47]Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen:
Weighted Online Problems with Advice. Theory Comput. Syst. 62(6): 1443-1469 (2018) - [j46]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Online-bounded analysis. J. Sched. 21(4): 429-441 (2018) - [j45]Joan Boyar, Magnus Gausdal Find:
Multiplicative complexity of vector valued Boolean functions. Theor. Comput. Sci. 720: 36-46 (2018) - [c45]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
Relative Worst-Order Analysis: A Survey. Adventures Between Lower Bounds and Higher Altitudes 2018: 216-230 - [c44]Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov:
Advice Complexity of Priority Algorithms. WAOA 2018: 69-86 - [i26]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
Relative Worst-Order Analysis: A Survey. CoRR abs/1802.07080 (2018) - [i25]Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov:
Advice Complexity of Priority Algorithms. CoRR abs/1806.06223 (2018) - [i24]Joan Boyar, Faith Ellen, Kim S. Larsen:
The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing. CoRR abs/1807.06820 (2018) - 2017
- [j44]Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen:
Online Algorithms with Advice: A Survey. ACM Comput. Surv. 50(2): 19:1-19:34 (2017) - [j43]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
On the list update problem with advice. Inf. Comput. 253: 411-423 (2017) - [j42]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): 1128-1177 (2017) - [c43]Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen:
Relaxing the Irrevocability Requirement for Online Graph Algorithms. WADS 2017: 217-228 - [i23]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Michal Kotrbcík:
Relaxing the Irrevocability Requirement for Online Graph Algorithms. CoRR abs/1704.08835 (2017) - 2016
- [j41]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
Online Bin Packing with Advice. Algorithmica 74(1): 507-527 (2016) - [j40]Joan Boyar, Magnus Gausdal Find, René Peralta:
On various nonlinearity measures for boolean functions. Cryptogr. Commun. 8(3): 313-330 (2016) - [j39]Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen:
Online Algorithms with Advice: A Survey. SIGACT News 47(3): 93-129 (2016) - [c42]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Online Bounded Analysis. CSR 2016: 131-145 - [c41]Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen:
Weighted Online Problems with Advice. IWOCA 2016: 179-190 - [c40]Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen:
Online Dominating Set. SWAT 2016: 21:1-21:15 - [c39]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Batch Coloring of Graphs. WAOA 2016: 52-64 - [i22]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Online Bounded Analysis. CoRR abs/1602.06708 (2016) - [i21]Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen:
Online Dominating Set. CoRR abs/1604.05172 (2016) - [i20]Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen:
Weighted Online Problems with Advice. CoRR abs/1606.05210 (2016) - [i19]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Batch Coloring of Graphs. CoRR abs/1610.02997 (2016) - 2015
- [j38]Joan Boyar, Sandy Irani, Kim S. Larsen:
A Comparison of Performance Measures for Online Algorithms. Algorithmica 72(4): 969-994 (2015) - [j37]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): 413-440 (2015) - [j36]Joan Boyar, Sushmita Gupta, Kim S. Larsen:
Relative interval analysis of paging algorithms on access graphs. Theor. Comput. Sci. 568: 28-48 (2015) - [j35]Joan Boyar, Magnus Gausdal Find:
Cancellation-free circuits in unbounded and bounded depth. Theor. Comput. Sci. 590: 17-26 (2015) - [c38]Joan Boyar, Magnus Gausdal Find:
Constructive Relationships Between Algebraic Thickness and Normality. FCT 2015: 106-117 - [c37]Joan Boyar, Christian Kudahl:
Adding Isolated Vertices Makes Some Online Algorithms Optimal. IWOCA 2015: 65-76 - [c36]Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen:
Advice Complexity for a Class of Online Problems. STACS 2015: 116-129 - [i18]Joan Boyar, Christian Kudahl:
Adding Isolated Vertices Makes some Online Algorithms Optimal. CoRR abs/1506.08592 (2015) - 2014
- [j34]Joan Boyar, Kim S. Larsen, Abyayananda Maiti:
A comparison of performance measures via online search. Theor. Comput. Sci. 532: 2-13 (2014) - [c35]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
On the List Update Problem with Advice. LATA 2014: 210-221 - [c34]Joan Boyar, Magnus Gausdal Find:
The Relationship between Multiplicative Complexity and Nonlinearity. MFCS (2) 2014: 130-140 - [c33]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
Online Bin Packing with Advice. STACS 2014: 174-186 - [i17]Joan Boyar, Faith Ellen:
Tight Bounds for an Online Bin Packing Problem. CoRR abs/1404.7325 (2014) - [i16]Joan Boyar, Magnus Gausdal Find:
The Relationship Between Multiplicative Complexity and Nonlinearity. CoRR abs/1407.6169 (2014) - [i15]Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen:
The Advice Complexity of a Class of Hard Online Problems. CoRR abs/1408.7033 (2014) - [i14]Joan Boyar, Magnus Gausdal Find:
Constructive Relationships Between Algebraic Thickness and Normality. CoRR abs/1410.1318 (2014) - 2013
- [j33]Joan Boyar, Philip Matthews, René Peralta:
Logic Minimization Techniques with Applications to Cryptology. J. Cryptology 26(2): 280-312 (2013) - [c32]Joan Boyar, Faith Ellen:
Bounds for Scheduling Jobs on Grid Processors. Space-Efficient Data Structures, Streams, and Algorithms 2013: 12-26 - [c31]Joan Boyar, Magnus Find, René Peralta:
Four Measures of Nonlinearity. CIAC 2013: 61-72 - [c30]Joan Boyar, Kim S. Larsen, Abyayananda Maiti:
The Frequent Items Problem in Online Streaming under Various Performance Measures. FCT 2013: 60-71 - [c29]Joan Boyar, Magnus Gausdal Find:
Cancellation-Free Circuits in Unbounded and Bounded Depth. FCT 2013: 159-170 - [c28]Joan Boyar, Sushmita Gupta, Kim S. Larsen:
Relative Interval Analysis of Paging Algorithms on Access Graphs. WADS 2013: 195-206 - [i13]Joan Boyar, Sushmita Gupta, Kim S. Larsen:
Relative Interval Analysis of Paging Algorithms on Access Graphs. CoRR abs/1305.0669 (2013) - [i12]Joan Boyar, Magnus Find:
Cancellation-Free Circuits in Unbounded and Bounded Depth. CoRR abs/1305.3041 (2013) - [i11]Joan Boyar, Kim S. Larsen, Abyayananda Maiti:
The Frequent Items Problem in Online Streaming under Various Performance Measures. CoRR abs/1306.0771 (2013) - [i10]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
On the List Update Problem with Advice. CoRR abs/1311.7357 (2013) - [i9]Joan Boyar, Magnus Find, René Peralta:
Four Measures of Nonlinearity. IACR Cryptol. ePrint Arch. 2013: 633 (2013) - 2012
- [j32]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): 1914-1923 (2012) - [j31]Joan Boyar, Lene M. Favrholdt:
A new variable-sized bin packing problem. J. Sched. 15(3): 273-287 (2012) - [c27]Joan Boyar, Kim S. Larsen, Abyayananda Maiti:
A Comparison of Performance Measures via Online Search. FAW-AAIM 2012: 303-314 - [c26]Joan Boyar, René Peralta:
A Small Depth-16 Circuit for the AES S-Box. SEC 2012: 287-298 - [c25]Joan Boyar, Sushmita Gupta, Kim S. Larsen:
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis. SWAT 2012: 328-339 - [i8]Joan Boyar, Sushmita Gupta, Kim S. Larsen:
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis. CoRR abs/1204.4047 (2012) - [i7]Joan Boyar, Magnus Find:
Cancellation-free circuits: An approach for proving superlinear lower bounds for linear Boolean operators. CoRR abs/1207.5321 (2012) - [i6]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
Online Bin Packing with Advice. CoRR abs/1212.4016 (2012) - 2011
- [i5]Joan Boyar, Kim S. Larsen, Abyayananda Maiti:
A Comparison of Performance Measures via Online Search. CoRR abs/1106.6136 (2011) - [i4]Joan Boyar, René Peralta:
A depth-16 circuit for the AES S-box. IACR Cryptol. ePrint Arch. 2011: 332 (2011) - 2010
- [j30]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) - [j29]Joan Boyar, Lene M. Favrholdt:
Scheduling Jobs on Grid Processors. Algorithmica 57(4): 819-847 (2010) - [j28]Allan Borodin, Joan Boyar, Kim S. Larsen, Nazanin Mirmohammadi:
Priority algorithms for graph optimization problems. Theor. Comput. Sci. 411(1): 239-258 (2010) - [j27]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) - [c24]Joan Boyar, René Peralta:
A New Combinational Logic Minimization Technique with Applications to Cryptology. SEA 2010: 178-189
2000 – 2009
- 2009
- [c23]Joan Boyar, Sandy Irani, Kim S. Larsen:
A Comparison of Performance Measures for Online Algorithms. WADS 2009: 119-130 - [i3]Joan Boyar, René Peralta:
New logic minimization techniques with applications to cryptology. IACR Cryptol. ePrint Arch. 2009: 191 (2009) - 2008
- [j26]Joan Boyar, Paul Medvedev:
The relative worst order ratio applied to seat reservation. ACM Trans. Algorithms 4(4): 48:1-48:22 (2008) - [j25]Joan Boyar, René Peralta:
Tight bounds for the multiplicative complexity of symmetric functions. Theor. Comput. Sci. 396(1-3): 223-246 (2008) - [c22]Joan Boyar, Philip Matthews, René Peralta:
On the Shortest Linear Straight-Line Program for Computing Linear Forms. MFCS 2008: 168-179 - [i2]Joan Boyar, Sandy Irani, Kim S. Larsen:
A Comparison of Performance Measures for Online Algorithms. CoRR abs/0806.0983 (2008) - 2007
- [j24]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) - [j23]Joan Boyar, Lene M. Favrholdt:
The relative worst order ratio for online algorithms. ACM Trans. Algorithms 3(2): 22 (2007) - 2006
- [j22]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) - [c21]Joan Boyar, René Peralta:
Concrete Multiplicative Complexity of Symmetric Functions. MFCS 2006: 179-189 - [c20]Joan Boyar, Lene M. Favrholdt:
Scheduling Jobs on Grid Processors. SWAT 2006: 17-28 - [c19]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 - 2005
- [c18]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 - [c17]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
The relative worst order ratio applied to paging. SODA 2005: 718-727 - [i1]Joan Boyar, René Peralta:
The Exact Multiplicative Complexity of the Hamming Weight Function. Electronic Colloquium on Computational Complexity (ECCC)(049) (2005) - 2004
- [j21]Joan Boyar, Susan Krarup, Morten N. Nielsen:
Seat reservation allowing seat changes. J. Algorithms 52(2): 169-192 (2004) - [c16]Joan Boyar, Paul Medvedev:
The Relative Worst Order Ratio Applied to Seat Reservation. SWAT 2004: 90-101 - [c15]Allan Borodin, Joan Boyar, Kim S. Larsen:
Priority Algorithms for Graph Optimization Problems. WAOA 2004: 126-139 - 2003
- [j20]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen:
Extending the accommodating function. Acta Inf. 40(1): 3-35 (2003) - [j19]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. Sched. 6(2): 131-147 (2003) - [c14]Joan Boyar, Lene M. Favrholdt:
The Relative Worst Order Ratio for On-Line Algorithms. CIAC 2003: 58-69 - 2002
- [j18]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) - [c13]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen:
Extending the Accommodating Function. COCOON 2002: 87-96 - 2001
- [j17]Joan Boyar, Susan Krarup, Morten N. Nielsen:
Seat Reservation Allowing Seat Changes. Electron. Notes Theor. Comput. Sci. 50(1): 24-38 (2001) - [j16]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) - [j15]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) - 2000
- [j14]Joan Boyar, Ivan Damgård, René Peralta:
Short Non-Interactive Cryptographic Proofs. J. Cryptology 13(4): 449-472 (2000) - [j13]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) - [c12]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 - [c11]Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen:
Fair versus Unrestricted Bin Packing. SWAT 2000: 200-213
1990 – 1999
- 1999
- [j12]Joan Boyar, Kim S. Larsen:
The Seat Reservation Problem. Algorithmica 25(4): 403-417 (1999) - [c10]Joan Boyar, Kim S. Larsen, Morten N. Nielsen:
The Accommodating Function - A Generalization of the Competitive Ratio. WADS 1999: 74-79 - 1997
- [j11]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) - 1996
- [c9]Joan Boyar, René Peralta:
Short Discrete Proofs. EUROCRYPT 1996: 131-142 - 1995
- [j10]Joan Boyar, Gilles Brassard, René Peralta:
Subquadratic Zero-Knowledge. J. ACM 42(6): 1169-1193 (1995) - [c8]Joan Boyar, Rolf Fagerberg, Kim S. Larsen:
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. WADS 1995: 270-281 - 1994
- [j9]Joan Boyar, Faith E. Fich, Kim S. Larsen:
Bounds on Certain Multiplications of Affine Combinations. Discret. Appl. Math. 52(2): 155-167 (1994) - [j8]Joan Boyar, Kim S. Larsen:
Efficient Rebalancing of Chromatic Search Trees. J. Comput. Syst. Sci. 49(3): 667-682 (1994) - 1993
- [j7]Joan Boyar, Carsten Lund, René Peralta:
On the Communication Complexity of Zero-Knowledge Proofs. J. Cryptology 6(2): 65-85 (1993) - 1992
- [j6]Joan Boyar, Gudmund Skovbjerg Frandsen, Carl Sturtivant:
An Arithmetic Model of Computation Equivalent to Threshold Circuits. Theor. Comput. Sci. 93(2): 303-319 (1992) - [c7]Joan Boyar, Kim S. Larsen:
Efficient Rebalancing of Chromatic Search Trees. SWAT 1992: 151-164 - 1991
- [j5]Joan Boyar, Katalin Friedl, Carsten Lund:
Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. J. Cryptology 4(3): 185-206 (1991) - [c6]Joan Boyar, Gilles Brassard, René Peralta:
Subquadratic Zero-Knowledge. FOCS 1991: 69-78 - 1990
- [j4]Joan Boyar, S. A. Kurtz, Mark W. Krentel:
A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs. J. Cryptology 2(2): 63-76 (1990) - [c5]Joan Boyar, David Chaum, Ivan Damgård, Torben P. Pedersen:
Convertible Undeniable Signatures. CRYPTO 1990: 189-205
1980 – 1989
- 1989
- [j3]Joan Boyar:
Inferring sequences produced by pseudo-random number generators. J. ACM 36(1): 129-141 (1989) - [j2]Joan Boyar:
Inferring Sequences Produced by a Linear Congruential Generator Missing Low-Order Bits. J. Cryptology 1(3): 177-184 (1989) - [c4]Joan Boyar, René Peralta:
On the Concrete Complexity of Zero-Knowledge Proofs. CRYPTO 1989: 507-525 - [c3]Joan Boyar, Katalin Friedl, Carsten Lund:
Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. EUROCRYPT 1989: 155-172 - 1987
- [j1]Joan Boyar, Howard J. Karloff:
Coloring Planar Graphs in Parallel. J. Algorithms 8(4): 470-479 (1987) - 1982