{"id":2,"date":"2021-10-21T18:41:18","date_gmt":"2021-10-21T22:41:18","guid":{"rendered":"https:\/\/sites.miamioh.edu\/khodakhast-bibaks-homepage\/?page_id=2"},"modified":"2024-07-10T17:49:26","modified_gmt":"2024-07-10T21:49:26","slug":"publications","status":"publish","type":"page","link":"https:\/\/sites.miamioh.edu\/khodakhast-bibaks-homepage\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"\n<p class=\"wp-block-paragraph\"><\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong><span class=\"has-inline-color has-vivid-cyan-blue-color\">Books<\/span><\/strong><\/h2>\n\n\n\n<ol class=\"wp-block-list\">\n<li>(B. Zolfaghari, H. Nemati, N. Yanai, K. Bibak), <em><a href=\"https:\/\/doi.org\/10.1007\/978-3-031-44807-2\">Crypto and AI: From Coevolution to Quantum Revolution<\/a><\/em>, <strong>Springer<\/strong>, 2023, 242 pages.<\/li>\n\n\n\n<li>(B.&nbsp;Zolfaghari, K.&nbsp;Bibak) <em><a href=\"https:\/\/link.springer.com\/book\/10.1007\/978-3-031-13191-2\">Perfect Secrecy in IoT: A Hybrid Combinatorial-Boolean Approach<\/a><\/em>, <strong>Springer<\/strong>, 2022, 128 pages.<\/li>\n\n\n\n<li>(B.&nbsp;Zolfaghari, K.&nbsp;Bibak, T.&nbsp;Koshiba, H. Nemati, P. Mitra)&nbsp;<em><a href=\"https:\/\/www.routledge.com\/Statistical-Trend-Analysis-of-Physically-Unclonable-Functions-An-Approach\/Zolfaghari-Bibak-Koshiba-Nemati-Mitra\/p\/book\/9780367754556\">Statistical Trend Analysis of Physically Unclonable Functions: An Approach via Text Mining<\/a><\/em>,&nbsp;<strong>CRC Press<\/strong>, 2021, 160 pages.\n<ul class=\"wp-block-list\">\n<li>#1 in <a href=\"https:\/\/bookauthority.org\/books\/best-cryptographic-hardware-ebooks\">6 Best Cryptographic Hardware eBooks of All Time<\/a><\/li>\n\n\n\n<li>#5 in <a href=\"https:\/\/bookauthority.org\/books\/best-text-mining-books\">45 Best Text Mining Books of All Time<\/a><\/li>\n<\/ul>\n<\/li>\n\n\n\n<li>(K.&nbsp;Bibak)&nbsp;<em><a href=\"https:\/\/www.routledge.com\/Restricted-Congruences-in-Computing\/Bibak\/p\/book\/9780367496036\">Restricted Congruences in Computing<\/a><\/em>,&nbsp;<strong>CRC Press<\/strong>, 2020, 157 pages.<\/li>\n<\/ol>\n\n\n\n<h2 class=\"wp-block-heading\"><strong><span class=\"has-inline-color has-vivid-cyan-blue-color\">Book Chapters<\/span><\/strong><\/h2>\n\n\n\n<ol class=\"wp-block-list\">\n<li>(K.&nbsp;Bibak) Additive combinatorics with a view towards computer science and cryptography,&nbsp;<strong><em><a href=\"http:\/\/www.springer.com\/mathematics\/numbers\/book\/978-1-4614-6641-3\">Number Theory and Related Fields: In Memory of Alf van der&nbsp;Poorten<\/a><\/em><\/strong>&nbsp;(J. M.&nbsp;Borwein, I. E.&nbsp;Shparlinski&nbsp;and W.&nbsp;Zudilin, eds.), Springer Proceedings in Mathematics &amp; Statistics, Vol. 43, Springer, New York, 2013, pp. 99-128; [<a href=\"http:\/\/arxiv.org\/abs\/1108.3790\">arXiv<\/a>], [<a href=\"http:\/\/dx.doi.org\/10.1007\/978-1-4614-6642-0_4\">chapter<\/a>]. (<strong><a href=\"http:\/\/www.bookmetrix.com\/detail\/chapter\/1680824a-4c71-4f5e-b532-112cca1a7b71#downloads\">The most downloaded Chapter of the Book<\/a><\/strong>.)<\/li>\n<\/ol>\n\n\n\n<h2 class=\"wp-block-heading\"><strong><span class=\"has-inline-color has-vivid-cyan-blue-color\">Journal Papers<\/span><\/strong><\/h2>\n\n\n\n<ol class=\"wp-block-list\">\n<li>(B. Zolfaghari, M. Abbasmollaei, F. Hajizadeh, N. Yanai, K. Bibak) Secure UAV (drone) and the great promise of AI, <strong><em>ACM Computing Surveys<\/em><\/strong> 56 (2024), 286:1-286:37; [<a href=\"https:\/\/doi.org\/10.1145\/3673225\">journal<\/a>]. <\/li>\n\n\n\n<li>(B. Zolfaghari, M. Abbasmollaei, F. Hajizadeh, N. Yanai, K. Bibak) Supplementary material for: Secure UAV (drone) and the great promise of AI, <strong><em>ACM Computing Surveys<\/em><\/strong> 56 (2024), 286:1-286:19; [<a href=\"https:\/\/dl.acm.org\/action\/downloadSupplement?doi=10.1145%2F3673225&amp;file=3673225-supp.pdf\">journal<\/a>]. <\/li>\n\n\n\n<li>(B. Zolfaghari, L. Mirsadeghi, K. Bibak, K. Kavousi) Cancer prognosis and diagnosis methods based on ensemble learning, <strong><em>ACM Computing Surveys<\/em><\/strong> 55 (2023), 262:1-262:34; [<a href=\"https:\/\/doi.org\/10.1145\/3580218\">journal<\/a>].<\/li>\n\n\n\n<li>(B. Zolfaghari, L. Mirsadeghi, K. Bibak, K. Kavousi) Supplementary materials for: Cancer prognosis and diagnosis methods based on ensemble learning,&nbsp;<strong><em>ACM Computing Surveys<\/em><\/strong>&nbsp;55 (2023), 262:1-262:18; [<a href=\"https:\/\/dl.acm.org\/action\/downloadSupplement?doi=10.1145%2F3580218&amp;file=3580218.supp.pdf\">journal<\/a>].<\/li>\n\n\n\n<li>(T. Koshiba, B. Zolfaghari, K. Bibak) A tradeoff paradigm shift in cryptographically-secure pseudorandom number generation based on discrete logarithm, <strong><em>Journal of Information Security and Applications<\/em><\/strong> 73 (2023), 103430; [<a href=\"https:\/\/doi.org\/10.1016\/j.jisa.2023.103430\">journal<\/a>].<\/li>\n\n\n\n<li>(K. Bibak, B. Zolfaghari) The Modular Subset-Sum Problem and the size of deletion correcting codes, <strong><em>Designs, Codes and Cryptography<\/em><\/strong> 90 (2022), 1721-1734; [<a href=\"https:\/\/doi.org\/10.1007\/s10623-022-01073-9\">journal<\/a>].<\/li>\n\n\n\n<li>(K. Bibak) Quantum key distribution using universal hash functions over finite fields, <strong><em>Quantum Information Processing<\/em><\/strong> 21 (2022), 121; [<a href=\"https:\/\/doi.org\/10.1007\/s11128-022-03468-y\">journal<\/a>].<\/li>\n\n\n\n<li>(B. Zolfaghari, K. Bibak, T. Koshiba) From random numbers to random objects, <strong><em>Entropy<\/em><\/strong> 24 (2022), 928; [<a href=\"https:\/\/doi.org\/10.3390\/e24070928\">journal<\/a>].<\/li>\n\n\n\n<li>(B. Zolfaghari, K. Bibak, T. Koshiba) The odyssey of entropy: cryptography, <strong><em>Entropy<\/em><\/strong> 24 (2022), 266; [<a href=\"https:\/\/doi.org\/10.3390\/e24020266\" data-type=\"URL\" data-id=\"https:\/\/doi.org\/10.3390\/e24020266\">journal<\/a>].<\/li>\n\n\n\n<li>(K. Bibak, B. Kapron, V. Srinivasan) Authentication of variable length messages in quantum key distribution, <strong><em>EPJ Quantum Technology<\/em><\/strong> 9 (2022), 8; [<a href=\"https:\/\/doi.org\/10.1140\/epjqt\/s40507-022-00127-0\">journal<\/a>].<\/li>\n\n\n\n<li>(R. Ritchie, K.&nbsp;Bibak) DOTMIX-Pro: Faster and more efficient variants of DOTMIX for dynamic-multithreading platforms,&nbsp;<strong><em>The Journal of Supercomputing<\/em><\/strong> 78 (2022), 945-961; [<a href=\"https:\/\/doi.org\/10.1007\/s11227-021-03904-3\">journal<\/a>].<\/li>\n\n\n\n<li>(K.&nbsp;Bibak, R. Ritchie, B.&nbsp;Zolfaghari) Everlasting security of quantum key distribution with 1K-DWCDM and quadratic hash,&nbsp;<strong><em>Quantum Information &amp; Computation<\/em><\/strong>&nbsp;21 (2021), 181-202; [<a href=\"https:\/\/doi.org\/10.26421\/QIC21.3-4-1\">journal<\/a>].<\/li>\n\n\n\n<li>(K.&nbsp;Bibak, R. Ritchie) Quantum key distribution with&nbsp;PRF(Hash, Nonce) achieves everlasting security,&nbsp;<strong><em>Quantum Information Processing<\/em><\/strong>&nbsp;20 (2021), 228; [<a href=\"https:\/\/doi.org\/10.1007\/s11128-021-03164-3\">journal<\/a>].<\/li>\n\n\n\n<li>(B. Zolfaghari, V. Singh, B. Rai, K. Bibak, T. Koshiba) Cryptography in hierarchical coded caching: system model and cost analysis, <strong><em>Entropy<\/em><\/strong> 23 (2021), 1459; [<a href=\"https:\/\/doi.org\/10.3390\/e23111459\">journal<\/a>].<\/li>\n\n\n\n<li>(B.&nbsp;Zolfaghari, V. Singh, S. Reddy, B. Rai, K.&nbsp;Bibak, A.&nbsp;Dehghantanha) Lower bounds on bandwidth requirements of regenerating code parameter scaling in distributed storage systems,&nbsp;<strong><em>IEEE Communications Letters<\/em><\/strong>&nbsp;25 (2021), 1477-1481; [<a href=\"https:\/\/doi.org\/10.1109\/LCOMM.2021.3049188\">journal<\/a>].<\/li>\n\n\n\n<li>(K.&nbsp;Bibak) Deletion correcting codes meet the Littlewood-Offord problem,&nbsp;<strong><em>Designs, Codes and Cryptography<\/em><\/strong>&nbsp;88 (2020), 2387-2396; [<a href=\"https:\/\/doi.org\/10.1007\/s10623-020-00787-y\">journal<\/a>].<\/li>\n\n\n\n<li>(B.&nbsp;Zolfaghari, G. Srivastava, S. Roy, H. Nemati, F.&nbsp;Afghah, T.&nbsp;Koshiba, A. Razi, K.&nbsp;Bibak, P. Mitra, B. Rai) Content delivery networks: state of the art, trends and future roadmap,&nbsp;<strong><em>ACM Computing Surveys<\/em><\/strong>&nbsp;53 (2020), 34:1-34:34; [<a href=\"https:\/\/doi.org\/10.1145\/3380613\">journal<\/a>].<\/li>\n\n\n\n<li>(V. Singh, B.&nbsp;Zolfaghari, C. Kumar, B. Rai, K.&nbsp;Bibak, G. Srivastava, S. Roy, T.&nbsp;Koshiba) Generalized&nbsp;<em>M<sub>m,r<\/sub><\/em>-network: A case for fixed message dimensions,&nbsp;<strong><em>IEEE Communications Letters<\/em><\/strong>&nbsp;24 (2020), 38-42; [<a href=\"https:\/\/doi.org\/10.1109\/LCOMM.2019.2950193\">journal<\/a>].<\/li>\n\n\n\n<li>(K.&nbsp;Bibak) Order-restricted linear congruences,&nbsp;<strong><em>Discrete Mathematics<\/em><\/strong>&nbsp;343 (2020), 111690; [<a href=\"https:\/\/doi.org\/10.1016\/j.disc.2019.111690\">journal<\/a>]. <mark class=\"has-inline-color has-vivid-cyan-blue-color\"><strong>Selected as&nbsp;Editors\u2019 Choice<\/strong><\/mark><\/li>\n\n\n\n<li>(K.&nbsp;Bibak,&nbsp;<a href=\"http:\/\/publish.illinois.edu\/milenkovic\">O.&nbsp;Milenkovic<\/a>) Explicit formulas for the weight enumerators of some classes of deletion correcting codes,&nbsp;<strong><em>IEEE Transactions on Communications<\/em><\/strong>&nbsp;67 (2019), 1809-1816; [<a href=\"https:\/\/arxiv.org\/abs\/1812.09627\">arXiv<\/a>], [<a href=\"https:\/\/doi.org\/10.1109\/TCOMM.2018.2886354\">journal<\/a>].<\/li>\n\n\n\n<li>(K.&nbsp;Bibak,&nbsp;<a href=\"http:\/\/webhome.cs.uvic.ca\/~bmkapron\">B.&nbsp;Kapron<\/a>,&nbsp;<a href=\"http:\/\/webhome.cs.uvic.ca\/~venkat\">V. Srinivasan<\/a>) A generalization of&nbsp;Schonemann&#8217;s&nbsp;theorem via a graph theoretic method,&nbsp;<strong><em>Discrete Mathematics<\/em><\/strong>&nbsp;342 (2019), 3057-3061; [<a href=\"https:\/\/arxiv.org\/abs\/1712.06770\">arXiv<\/a>], [<a href=\"https:\/\/doi.org\/10.1016\/j.disc.2019.06.016\">journal<\/a>].<\/li>\n\n\n\n<li>(K.&nbsp;Bibak,&nbsp;<a href=\"http:\/\/webhome.cs.uvic.ca\/~bmkapron\">B.&nbsp;Kapron<\/a>,&nbsp;<a href=\"http:\/\/webhome.cs.uvic.ca\/~venkat\">V. Srinivasan<\/a>) Unweighted linear congruences with distinct coordinates and the&nbsp;Varshamov-Tenengolts&nbsp;codes,&nbsp;<strong><em>Designs, Codes and Cryptography<\/em><\/strong>&nbsp;86 (2018), 1893-1904; [<a href=\"https:\/\/doi.org\/10.1007\/s10623-017-0428-3\">journal<\/a>].<\/li>\n\n\n\n<li>(K.&nbsp;Bibak,&nbsp;<a href=\"http:\/\/webhome.cs.uvic.ca\/~bmkapron\">B. M.&nbsp;Kapron<\/a>,&nbsp;<a href=\"http:\/\/webhome.cs.uvic.ca\/~venkat\">V. Srinivasan<\/a>,&nbsp;<a href=\"http:\/\/ttk.pte.hu\/matek\/ltoth\/Homepage%20Laszlo%20Toth\/Homepage%20Laszlo%20Toth.htm\">L. Toth<\/a>) On an almost-universal hash function family with applications to authentication and secrecy codes,&nbsp;<strong><em>International Journal of Foundations of Computer Science<\/em><\/strong>&nbsp;29 (2018), 357-375; [<a href=\"http:\/\/arxiv.org\/abs\/1507.02331\">arXiv<\/a>], [<a href=\"https:\/\/eprint.iacr.org\/2015\/1187\">IACR<\/a>], [<a href=\"https:\/\/doi.org\/10.1142\/S0129054118500089\">journal<\/a>].<\/li>\n\n\n\n<li>(K.&nbsp;Bibak,&nbsp;<a href=\"http:\/\/webhome.cs.uvic.ca\/~bmkapron\">B.&nbsp;Kapron<\/a>,&nbsp;<a href=\"http:\/\/webhome.cs.uvic.ca\/~venkat\">V. Srinivasan<\/a>,&nbsp;<a href=\"http:\/\/www.mat.uniroma2.it\/~tauraso\">R.&nbsp;Tauraso<\/a>,&nbsp;<a href=\"http:\/\/ttk.pte.hu\/matek\/ltoth\/Homepage%20Laszlo%20Toth\/Homepage%20Laszlo%20Toth.htm\">L. Toth<\/a>) Restricted linear congruences,&nbsp;<strong><em>Journal of Number Theory<\/em><\/strong>&nbsp;171 (2017), 128-144; [<a href=\"http:\/\/arxiv.org\/abs\/1503.01806\">arXiv<\/a>], [<a href=\"https:\/\/eprint.iacr.org\/2015\/1186\">IACR<\/a>], [<a href=\"http:\/\/dx.doi.org\/10.1016\/j.jnt.2016.07.018\">journal<\/a>].<\/li>\n\n\n\n<li>(K.&nbsp;Bibak,&nbsp;<a href=\"http:\/\/webhome.cs.uvic.ca\/~bmkapron\">B.&nbsp;Kapron<\/a>,&nbsp;<a href=\"http:\/\/webhome.cs.uvic.ca\/~venkat\">V. Srinivasan<\/a>) Counting surface-kernel epimorphisms from a co-compact Fuchsian group to a cyclic group with motivations from string theory and QFT,&nbsp;<strong><em>Nuclear Physics B<\/em><\/strong>&nbsp;910 (2016), 712-723; [<a href=\"http:\/\/arxiv.org\/abs\/1603.02154\">arXiv<\/a>], [<a href=\"http:\/\/dx.doi.org\/10.1016\/j.nuclphysb.2016.07.028\">journal<\/a>].<\/li>\n\n\n\n<li>(K.&nbsp;Bibak,&nbsp;<a href=\"http:\/\/webhome.cs.uvic.ca\/~bmkapron\">B.&nbsp;Kapron<\/a>,&nbsp;<a href=\"http:\/\/webhome.cs.uvic.ca\/~venkat\">V. Srinivasan<\/a>) The Cayley graphs associated with some quasi-perfect Lee codes are Ramanujan graphs,&nbsp;<strong><em>IEEE Transactions on Information Theory<\/em><\/strong>&nbsp;62 (2016), 6355-6358; [<a href=\"http:\/\/dx.doi.org\/10.1109\/TIT.2016.2595778\">journal<\/a>].<\/li>\n\n\n\n<li>(K.&nbsp;Bibak,&nbsp;<a href=\"http:\/\/webhome.cs.uvic.ca\/~bmkapron\">B.&nbsp;Kapron<\/a>,&nbsp;<a href=\"http:\/\/webhome.cs.uvic.ca\/~venkat\">V. Srinivasan<\/a>) MMH* with arbitrary modulus is always almost-universal,&nbsp;<strong><em>Information Processing Letters<\/em><\/strong>&nbsp;116 (2016), 481-483; [<a href=\"http:\/\/dx.doi.org\/10.1016\/j.ipl.2016.03.009\">journal<\/a>].<\/li>\n\n\n\n<li>(K.&nbsp;Bibak,&nbsp;<a href=\"http:\/\/webhome.cs.uvic.ca\/~bmkapron\">B.&nbsp;Kapron<\/a>,&nbsp;<a href=\"http:\/\/webhome.cs.uvic.ca\/~venkat\">V. Srinivasan<\/a>) On a restricted linear congruence,&nbsp;<strong><em>International Journal of Number Theory<\/em><\/strong>&nbsp;12 (2016), 2167-2171; [<a href=\"https:\/\/arxiv.org\/abs\/1610.07776\">arXiv<\/a>], [<a href=\"http:\/\/dx.doi.org\/10.1142\/S179304211650130X\">journal<\/a>].<\/li>\n\n\n\n<li>(P. Salehi&nbsp;Nowbandegani,&nbsp;<a href=\"http:\/\/www.cs.umd.edu\/~hossein\">H. Esfandiari<\/a>,&nbsp;<a href=\"http:\/\/sess.shirazu.ac.ir\/sess\/3614558264818\">M. H.&nbsp;Shirdareh&nbsp;Haghighi<\/a>, K.&nbsp;Bibak) On the&nbsp;Erd\u0151s-Gyarfas&nbsp;conjecture in claw-free graphs,&nbsp;<strong><em>Discussiones&nbsp;Mathematicae&nbsp;Graph Theory<\/em><\/strong>&nbsp;34 (2014), 635-640; [<a href=\"http:\/\/arxiv.org\/abs\/1109.5398\">arXiv<\/a>], [<a href=\"https:\/\/www.degruyter.com\/dg\/viewarticle\/j$002fdmgt.2014.34.issue-3$002fdmgt.1732$002fdmgt.1732.xml\">journal<\/a>].<\/li>\n\n\n\n<li>(K.&nbsp;Bibak) The number of spanning trees in an (<em>r<\/em>,<em>s<\/em>)-semiregular graph and its line graph,&nbsp;<strong><em>International Journal of Quantum Chemistry<\/em><\/strong>&nbsp;113 (2013), 1209-1212; [<a href=\"http:\/\/dx.doi.org\/10.1002\/qua.24252\">journal<\/a>]. <strong><mark class=\"has-inline-color has-vivid-cyan-blue-color\">Featured&nbsp;on the cover of the&nbsp;<a href=\"https:\/\/onlinelibrary.wiley.com\/toc\/1097461x\/2013\/113\/8\">Journal<\/a><\/mark><\/strong><\/li>\n\n\n\n<li>(K.&nbsp;Bibak,&nbsp;<a href=\"http:\/\/www.mat.uniroma2.it\/~tauraso\">R.&nbsp;Tauraso<\/a>) Determinants of grids, tori, cylinders and Mobius ladders,&nbsp;<strong><em>Discrete Mathematics<\/em><\/strong>&nbsp;313 (2013), 1436-1440; [<a href=\"http:\/\/arxiv.org\/abs\/1212.4816\">arXiv<\/a>], [<a href=\"http:\/\/dx.doi.org\/10.1016\/j.disc.2013.03.011\">journal<\/a>].<\/li>\n\n\n\n<li>(K.&nbsp;Bibak) On the determinant of bipartite graphs,&nbsp;<strong><em>Discrete Mathematics<\/em><\/strong>&nbsp;313 (2013), 2446-2450; [<a href=\"http:\/\/dx.doi.org\/10.1016\/j.disc.2013.07.006\">journal<\/a>].<\/li>\n\n\n\n<li>(<a href=\"http:\/\/sess.shirazu.ac.ir\/sess\/3614558264818\">M. H.&nbsp;Shirdareh&nbsp;Haghighi<\/a>, K.&nbsp;Bibak) The number of spanning trees in some classes of graphs,&nbsp;<strong><em>Rocky Mountain Journal of Mathematics<\/em><\/strong>&nbsp;42 (2012), 1183-1195; [<a href=\"http:\/\/dx.doi.org\/10.1216\/RMJ-2012-42-4-1183\">journal<\/a>].<\/li>\n\n\n\n<li>(K.&nbsp;Bibak,&nbsp;<a href=\"http:\/\/web.maths.unsw.edu.au\/~igorshparlinski\">I. E.&nbsp;Shparlinski<\/a>) On fully split lacunary polynomials in finite fields,&nbsp;<strong><em>Bulletin of the Polish Academy of Sciences, Mathematics<\/em><\/strong>&nbsp;59 (2011), 197-202; [<a href=\"http:\/\/arxiv.org\/abs\/1111.4023\">arXiv<\/a>], [<a href=\"http:\/\/dx.doi.org\/10.4064\/ba59-3-1\">journal<\/a>].<\/li>\n\n\n\n<li>(K.&nbsp;Bibak,&nbsp;<a href=\"http:\/\/sess.shirazu.ac.ir\/sess\/3614558264818\">M. H.&nbsp;Shirdareh&nbsp;Haghighi<\/a>) Degree-equipartite&nbsp;graphs,&nbsp;<strong><em>Discrete Mathematics<\/em><\/strong>&nbsp;311 (2011), 888-891; [<a href=\"http:\/\/arxiv.org\/abs\/1108.1606\">arXiv<\/a>], [<a href=\"http:\/\/dx.doi.org\/10.1016\/j.disc.2011.02.018\">journal<\/a>].<\/li>\n\n\n\n<li>(K.&nbsp;Bibak,&nbsp;<a href=\"http:\/\/sess.shirazu.ac.ir\/sess\/3614558264818\">M. H.&nbsp;Shirdareh&nbsp;Haghighi<\/a>) Some trigonometric identities involving Fibonacci and Lucas numbers,&nbsp;<strong><em>Journal of Integer Sequences<\/em><\/strong>&nbsp;12 (2009), Article 09.8.4; [<a href=\"http:\/\/www.cs.uwaterloo.ca\/journals\/JIS\/VOL12\/Bibak\/bibak4.html\">journal<\/a>].<\/li>\n\n\n\n<li>(<a href=\"http:\/\/sess.shirazu.ac.ir\/sess\/3614558264818\">M. H.&nbsp;Shirdareh&nbsp;Haghighi<\/a>, K.&nbsp;Bibak) Recursive relations for the number of spanning trees,&nbsp;<strong><em>Applied Mathematical Sciences<\/em><\/strong>&nbsp;3 (2009), 2263-2269.<\/li>\n<\/ol>\n\n\n\n<h2 class=\"wp-block-heading\"><strong><span class=\"has-inline-color has-vivid-cyan-blue-color\">Conference Papers<\/span><\/strong><\/h2>\n\n\n\n<ol class=\"wp-block-list\">\n<li>(R. Ritchie, K.&nbsp;Bibak) SQUAREMIX: A faster pseudorandom number generator for dynamic-multithreading platforms, In Proceedings of the&nbsp;<strong><em>2020 Data Compression Conference (DCC 2020)<\/em><\/strong>, Snowbird, Utah, USA, March 24-27, 2020; [<a href=\"https:\/\/doi.org\/10.1109\/DCC47342.2020.00061\">conference<\/a>].<\/li>\n\n\n\n<li>(K.&nbsp;Bibak,&nbsp;<a href=\"http:\/\/publish.illinois.edu\/milenkovic\">O.&nbsp;Milenkovic<\/a>) Weight enumerators of some classes of deletion correcting codes, In Proceedings of the&nbsp;<strong><em>2018 IEEE International Symposium on Information Theory (ISIT 2018)<\/em><\/strong>, Vail, Colorado, USA, Jun. 17-22, 2018, pp. 431-435; [<a href=\"https:\/\/doi.org\/10.1109\/ISIT.2018.8437121\">conference<\/a>].<\/li>\n\n\n\n<li>(K.&nbsp;Bibak,&nbsp;<a href=\"http:\/\/webhome.cs.uvic.ca\/~bmkapron\">B.&nbsp;Kapron<\/a>,&nbsp;<a href=\"http:\/\/webhome.cs.uvic.ca\/~venkat\">V. Srinivasan<\/a>,&nbsp;<a href=\"http:\/\/ttk.pte.hu\/matek\/ltoth\/Homepage%20Laszlo%20Toth\/Homepage%20Laszlo%20Toth.htm\">L. Toth<\/a>) On a variant of multilinear modular hashing with applications to authentication and secrecy codes, In Proceedings of the&nbsp;<strong><em>International Symposium on Information Theory and Its Applications<\/em>&nbsp;(<em>ISITA 2016)<\/em><\/strong>, Monterey, California, USA, Oct. 30 &#8212; Nov. 2, 2016, pp. 320-324; [<a href=\"http:\/\/ieeexplore.ieee.org\/abstract\/document\/7840438\/?reload=true\">conference<\/a>].<\/li>\n\n\n\n<li>(<a href=\"http:\/\/sess.shirazu.ac.ir\/sess\/3614558264818\">M. H.&nbsp;Shirdareh&nbsp;Haghighi<\/a>, K.&nbsp;Bibak) Distribution of cycle lengths in graphs with minimum degree at least three, In Proceedings of the<em>&nbsp;<strong>39th Annual Iranian Mathematics Conference<\/strong><\/em>, Shahid&nbsp;Bahonar&nbsp;University of Kerman, Kerman, Iran, Aug. 24-27, 2008.<\/li>\n<\/ol>\n\n\n\n<h2 class=\"wp-block-heading\"><strong><span class=\"has-inline-color has-vivid-cyan-blue-color\">Problems<\/span><\/strong><\/h2>\n\n\n\n<ol class=\"wp-block-list\">\n<li><strong>(<\/strong>K.&nbsp;Bibak)&nbsp;<a href=\"http:\/\/dx.doi.org\/doi:10.4169\/math.mag.84.5.386\">Problem # 1884<\/a>,&nbsp;<strong><em>Mathematics Magazine<\/em><\/strong>, Vol. 84, No. 5, December 2011. [The published solution is&nbsp;<a href=\"http:\/\/dx.doi.org\/10.4169\/math.mag.85.5.384\">here<\/a>.]<\/li>\n\n\n\n<li>(K.&nbsp;Bibak)&nbsp;<a href=\"http:\/\/dx.doi.org\/10.4169\/amer.math.monthly.118.07.653\">Problem # 11590<\/a>,&nbsp;<strong><em>American Mathematical Monthly<\/em><\/strong>, Vol. 118, No. 7, August-September 2011. [The published solution is&nbsp;<a href=\"http:\/\/dx.doi.org\/10.4169\/amer.math.monthly.120.08.754\">here<\/a>.]<\/li>\n<\/ol>\n\n\n\n<h2 class=\"wp-block-heading\"><strong><span class=\"has-inline-color has-vivid-cyan-blue-color\">Theses<\/span><\/strong><\/h2>\n\n\n\n<ol class=\"wp-block-list\">\n<li>(K.&nbsp;Bibak)&nbsp;<a href=\"https:\/\/dspace.library.uvic.ca\/handle\/1828\/7911\">Number theoretic methods and their significance in computer science, information theory, combinatorics, and geometry<\/a>, PhD thesis, Department of Computer Science, University of Victoria, 2017.<\/li>\n\n\n\n<li>(K.&nbsp;Bibak)&nbsp;<a href=\"https:\/\/uwspace.uwaterloo.ca\/handle\/10012\/7177\">Contributions at the interface between algebra and graph theory<\/a>, Master&#8217;s thesis, Department of Combinatorics and Optimization, University of Waterloo, 2013.<\/li>\n<\/ol>\n\n\n\n<h2 class=\"wp-block-heading\"><strong><span class=\"has-inline-color has-vivid-cyan-blue-color\">Technical Reports<\/span><\/strong><\/h2>\n\n\n\n<ol class=\"wp-block-list\">\n<li>(K.&nbsp;Bibak, C. Liu, H.&nbsp;Vosoughpour, G. Yao, Z.&nbsp;AlMeraj, A.&nbsp;Pytel,&nbsp;<a href=\"http:\/\/www.cgl.uwaterloo.ca\/~wmcowan\">W. Cowan<\/a>,&nbsp;<a href=\"http:\/\/www.cgl.uwaterloo.ca\/~smann\">S. Mann<\/a>)&nbsp;<a href=\"https:\/\/cs.uwaterloo.ca\/sites\/ca.computer-science\/files\/uploads\/files\/cs-2013-08.pdf\">Implicit surfaces seminar, Spring 2012<\/a>, Technical Report CS-2013-08, David R. Cheriton School of Computer Science, University of Waterloo, 2013 (40 pages).<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"<p>Books Book Chapters Journal Papers Conference Papers Problems Theses Technical Reports<\/p>\n","protected":false},"author":5819,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0,"footnotes":""},"class_list":["post-2","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/sites.miamioh.edu\/khodakhast-bibaks-homepage\/wp-json\/wp\/v2\/pages\/2","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/sites.miamioh.edu\/khodakhast-bibaks-homepage\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/sites.miamioh.edu\/khodakhast-bibaks-homepage\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/sites.miamioh.edu\/khodakhast-bibaks-homepage\/wp-json\/wp\/v2\/users\/5819"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.miamioh.edu\/khodakhast-bibaks-homepage\/wp-json\/wp\/v2\/comments?post=2"}],"version-history":[{"count":0,"href":"https:\/\/sites.miamioh.edu\/khodakhast-bibaks-homepage\/wp-json\/wp\/v2\/pages\/2\/revisions"}],"wp:attachment":[{"href":"https:\/\/sites.miamioh.edu\/khodakhast-bibaks-homepage\/wp-json\/wp\/v2\/media?parent=2"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}