Obserwuj
Joan Boyar
Joan Boyar
Professor of Computer Science, University of Southern Denmark
Zweryfikowany adres z imada.sdu.dk - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Convertible undeniable signatures
J Boyar, D Chaum, I Damgård, T Pedersen
Conference on the Theory and Application of Cryptography, 189-205, 1990
2791990
Inferring sequences produced by pseudo-random number generators
J Boyar
Journal of the ACM (JACM) 36 (1), 129-141, 1989
1851989
A new combinational logic minimization technique with applications to cryptology
J Boyar, R Peralta
International Symposium on Experimental Algorithms, 178-189, 2010
1782010
Logic minimization techniques with applications to cryptology
J Boyar, P Matthews, R Peralta
Journal of Cryptology 26 (2), 280-312, 2013
1402013
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
1212000
A small depth-16 circuit for the AES S-Box
J Boyar, R Peralta
IFIP International Information Security Conference, 287-298, 2012
1062012
A discrete logarithm implementation of perfect zero-knowledge blobs
JF Boyar, SA Kurtz, MW Krentel
Journal of Cryptology 2 (2), 63-76, 1990
1051990
Inferring a sequence generated by a linear congruence
JB Plumstead
Foundations of Computer Science, 1982. FOCS '82. 23rd Annual Symposium on …, 1982
1011982
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
1002017
The accommodating function: A generalization of the competitive ratio
J Boyar, KS Larsen, MN Nielsen
SIAM Journal on Computing 31 (1), 233-258, 2001
802001
Practical zero-knowledge proofs: Giving hints and using deficiencies
J Boyar, K Friedl, C Lund
Journal of cryptology 4 (3), 185-206, 1991
751991
The relative worst order ratio for online algorithms
J Boyar, LM Favrholdt
ACM Transactions on Algorithms (TALG) 3 (2), 22-es, 2007
702007
Inferring sequences produced by a linear congruential generator missing low-order bits
J Boyar
Journal of Cryptology 1 (3), 177-184, 1989
701989
The seat reservation problem
J Boyar, KS Larsen
Algorithmica 25 (4), 403-417, 1999
671999
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
662007
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
632014
Efficient rebalancing of chromatic search trees
J Boyar, KS Larsen
Journal of Computer and System Sciences 49 (3), 667-682, 1994
591994
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
531997
A comparison of performance measures for online algorithms
J Boyar, S Irani, KS Larsen
Algorithmica 72 (4), 969-994, 2015
48*2015
On the shortest linear straight-line program for computing linear forms
J Boyar, P Matthews, R Peralta
International Symposium on Mathematical Foundations of Computer Science, 168-179, 2008
482008
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20