Joan Boyar
Joan Boyar
Professor Emerita of Computer Science, University of Southern Denmark
Verified email at - Homepage
Cited by
Cited by
Convertible undeniable signatures
J Boyar, D Chaum, I Damgård, T Pedersen
Advances in Cryptology-CRYPTO’90: Proceedings 10, 189-205, 1991
Inferring sequences produced by pseudo-random number generators
J Boyar
Journal of the ACM (JACM) 36 (1), 129-141, 1989
A new combinational logic minimization technique with applications to cryptology
J Boyar, R Peralta
Experimental Algorithms: 9th International Symposium, SEA 2010, Ischia …, 2010
Logic minimization techniques with applications to cryptology
J Boyar, P Matthews, R Peralta
Journal of Cryptology 26, 280-312, 2013
Online algorithms with advice: A survey
J Boyar, LM Favrholdt, C Kudahl, KS Larsen, JW Mikkelsen
ACM Computing Surveys (CSUR) 50 (2), 1-34, 2017
A small depth-16 circuit for the AES S-box
J Boyar, R Peralta
IFIP International Information Security Conference, 287-298, 2012
On the multiplicative complexity of boolean functions over the basis (∧,⊕, 1)
J Boyar, R Peralta, D Pochuev
Theoretical Computer Science 235 (1), 43-57, 2000
A discrete logarithm implementation of perfect zero-knowledge blobs
JF Boyar, SA Kurtz, MW Krentel
Journal of Cryptology 2, 63-76, 1990
Inferring a sequence generated by a linear congruence
JB Plumstead
Foundations of Computer Science, 1982. FOCS '82. 23rd Annual Symposium on …, 1982
Practical zero-knowledge proofs: Giving hints and using deficiencies
J Boyar, K Friedl, C Lund
Journal of cryptology 4, 185-206, 1991
The accommodating function: A generalization of the competitive ratio
J Boyar, KS Larsen, MN Nielsen
SIAM Journal on Computing 31 (1), 233-258, 2001
Inferring sequences produced by a linear congruential generator missing low-order bits
J Boyar
Journal of Cryptology 1 (3), 177-184, 1989
Efficient rebalancing of chromatic search trees
J Boyar, KS Larsen
Journal of Computer and System Sciences 49 (3), 667-682, 1994
The relative worst order ratio for online algorithms
J Boyar, LM Favrholdt
ACM Transactions on Algorithms (TALG) 3 (2), 22-es, 2007
Online Bin Packing with Advice
J Boyar, S Kamali, KS Larsen, A López-Ortiz
31st International Symposium on Theoretical Aspects of Computer Science …, 2014
The seat reservation problem
J Boyar, KS Larsen
Algorithmica 25, 403-417, 1999
The relative worst-order ratio applied to paging
J Boyar, LM Favrholdt, KS Larsen
Journal of Computer and System Sciences 73 (5), 818-843, 2007
On the shortest linear straight-line program for computing linear forms
J Boyar, P Matthews, R Peralta
Mathematical Foundations of Computer Science 2008: 33rd International …, 2008
Amortization results for chromatic search trees, with an application to priority queues
J Boyar, R Fagerberg, KS Larsen
Journal of Computer and System Sciences 55 (3), 504-521, 1997
A comparison of performance measures for online algorithms
J Boyar, S Irani, KS Larsen
Algorithmica 72, 969-994, 2015
The system can't perform the operation now. Try again later.
Articles 1–20