Artículos de revistas sobre el tema "Round Complexity"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores artículos de revistas para su investigación sobre el tema "Round Complexity".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore artículos de revistas sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Zhang, Feng, Feng Li y Wenzheng Zhang. "Differential-Linear Cryptanalsis on SIMECK32/64 and SIMON32/64". Journal of Physics: Conference Series 2504, n.º 1 (1 de mayo de 2023): 012068. http://dx.doi.org/10.1088/1742-6596/2504/1/012068.
Texto completoZhang, Kai, Xuejia Lai, Lei Wang, Jie Guan, Bin Hu, Senpeng Wang y Tairong Shi. "Related-Key Multiple Impossible Differential Cryptanalysis on Full-Round LiCi-2 Designed for IoT". Security and Communication Networks 2022 (25 de mayo de 2022): 1–11. http://dx.doi.org/10.1155/2022/3611840.
Texto completoGrošek, Otokar, Peter Horák y Pavol Zajac. "On complexity of round transformations". Discrete Mathematics 309, n.º 18 (septiembre de 2009): 5527–34. http://dx.doi.org/10.1016/j.disc.2008.03.020.
Texto completoPandurangan, Gopal, Peter Robinson y Michele Scquizzato. "On the Distributed Complexity of Large-Scale Graph Computations". ACM Transactions on Parallel Computing 8, n.º 2 (30 de junio de 2021): 1–28. http://dx.doi.org/10.1145/3460900.
Texto completoXing, Zhaohui, Wenying Zhang y Guoyong Han. "Improved Conditional Differential Analysis on NLFSR-Based Block Cipher KATAN32 with MILP". Wireless Communications and Mobile Computing 2020 (23 de noviembre de 2020): 1–14. http://dx.doi.org/10.1155/2020/8883557.
Texto completoMagniez, Frédéric y Ashwin Nayak. "Quantum Distributed Complexity of Set Disjointness on a Line". ACM Transactions on Computation Theory 14, n.º 1 (31 de marzo de 2022): 1–22. http://dx.doi.org/10.1145/3512751.
Texto completoWeng, Tianling, Tingting Cui, Ting Yang y Yinghua Guo. "Related-Key Differential Attacks on Reduced-Round LBlock". Security and Communication Networks 2022 (16 de septiembre de 2022): 1–15. http://dx.doi.org/10.1155/2022/8464960.
Texto completoKremer, I., N. Nisan y D. Ron. "On Randomized One-round Communication Complexity". Computational Complexity 8, n.º 1 (1 de junio de 1999): 21–49. http://dx.doi.org/10.1007/s000370050018.
Texto completoSong, Junghwan, Kwanhyung Lee y Hwanjin Lee. "Biclique Cryptanalysis on the Full Crypton-256 and mCrypton-128". Journal of Applied Mathematics 2014 (2014): 1–10. http://dx.doi.org/10.1155/2014/529736.
Texto completoLacko-Bartošová, Lucia. "Linear and differential cryptanalysis of reduced-round AES". Tatra Mountains Mathematical Publications 50, n.º 1 (1 de diciembre de 2011): 51–61. http://dx.doi.org/10.2478/v10127-011-0036-y.
Texto completoLiu, Wenhao y Yang Yang. "The 7-Round Subspace Trail-Based Impossible Differential Distinguisher of Midori-64". Security and Communication Networks 2021 (9 de noviembre de 2021): 1–15. http://dx.doi.org/10.1155/2021/6269604.
Texto completoTse, Savio S. H. "Belated Analyses of Three Credit-Based Adaptive Polling Algorithms". International Journal of Foundations of Computer Science 27, n.º 05 (agosto de 2016): 579–94. http://dx.doi.org/10.1142/s0129054116500179.
Texto completoZhao, Bo, Zhihong Chen, Hai Lin y XiangMin Ji. "A Constant Round Write-Only ORAM". Applied Sciences 10, n.º 15 (3 de agosto de 2020): 5366. http://dx.doi.org/10.3390/app10155366.
Texto completoSanghvi, Saurabh y Salil Vadhan. "The Round Complexity of Two-Party Random Selection". SIAM Journal on Computing 38, n.º 2 (enero de 2008): 523–50. http://dx.doi.org/10.1137/050641715.
Texto completoKremer, Ilan, Noam Nisan y Dana Ron. "Errata for: "On randomized one-round communication complexity"". Computational Complexity 10, n.º 4 (1 de diciembre de 2001): 314–15. http://dx.doi.org/10.1007/s000370100003.
Texto completoLiu, Yu, Xiaolei Liu y Yanmin Zhao. "Security Cryptanalysis of NUX for the Internet of Things". Security and Communication Networks 2019 (12 de junio de 2019): 1–12. http://dx.doi.org/10.1155/2019/2062697.
Texto completoTSE, SAVIO S. H. y FRANCIS C. M. LAU. "ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS". International Journal of Foundations of Computer Science 10, n.º 02 (junio de 1999): 211–23. http://dx.doi.org/10.1142/s0129054199000150.
Texto completoFan, Ruya, Ting Cui, Shiwei Chen, Chenhui Jin y Haoran Zheng. "Multiset Structural Attack on Generalized Feistel Networks". Mathematical Problems in Engineering 2019 (14 de abril de 2019): 1–7. http://dx.doi.org/10.1155/2019/2390462.
Texto completoHan, Guoyong y Wenying Zhang. "Improved Biclique Cryptanalysis of the Lightweight Block Cipher Piccolo". Security and Communication Networks 2017 (2017): 1–12. http://dx.doi.org/10.1155/2017/7589306.
Texto completoSaikia, Parikshit y Sushanta Karmakar. "Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE". International Journal of Foundations of Computer Science 31, n.º 07 (noviembre de 2020): 941–68. http://dx.doi.org/10.1142/s0129054120500367.
Texto completoWagh, Sameer. "Pika: Secure Computation using Function Secret Sharing over Rings". Proceedings on Privacy Enhancing Technologies 2022, n.º 4 (octubre de 2022): 351–77. http://dx.doi.org/10.56553/popets-2022-0113.
Texto completoBurden, Marisha, Lauren McBeth y Angela Keniston. "Salient Measures of Hospitalist Workload". JAMA Network Open 6, n.º 8 (10 de agosto de 2023): e2328165. http://dx.doi.org/10.1001/jamanetworkopen.2023.28165.
Texto completoCucker, Felipe y Steve Smale. "Complexity estimates depending on condition and round-off error". Journal of the ACM 46, n.º 1 (enero de 1999): 113–84. http://dx.doi.org/10.1145/300515.300519.
Texto completoApon, Daniel, Jonathan Katz y Alex J. Malozemoff. "One-round multi-party communication complexity of distinguishing sums". Theoretical Computer Science 501 (agosto de 2013): 101–8. http://dx.doi.org/10.1016/j.tcs.2013.07.026.
Texto completoEnright, Helen Patricia y Amy Gray. "Unpacking the learning on consultant-led ward rounds: Lessons from ethnography in paediatrics". Focus on Health Professional Education: A Multi-Professional Journal 21, n.º 3 (1 de diciembre de 2020): 30–43. http://dx.doi.org/10.11157/fohpe.v21i3.336.
Texto completoZajac, Pavol y Michal Ondroš. "ROTATIONAL CRYPTANALYSIS OF GOST WITH IDENTICAL S-BOXES". Tatra Mountains Mathematical Publications 57, n.º 1 (1 de noviembre de 2013): 1–19. http://dx.doi.org/10.2478/tmmp-2013-0032.
Texto completoYang, Fan, Xinyu Chen, Dafa Zhao, Shijie Wei, Jingwei Wen, Hefeng Wang, Tao Xin y Guilu Long. "Quantum Multi-Round Resonant Transition Algorithm". Entropy 25, n.º 1 (28 de diciembre de 2022): 61. http://dx.doi.org/10.3390/e25010061.
Texto completoGąsecki, Arkadiusz. "LOW DATA COMPLEXITY DIFFERENTIAL - ALGEBRAIC ATTACK ON REDUCED ROUND DES". Tatra Mountains Mathematical Publications 57, n.º 1 (1 de noviembre de 2013): 35–43. http://dx.doi.org/10.2478/tmmp-2013-0034.
Texto completoXie, Xiaofeng y Tian Tian. "A Low-Complexity Key-Recovery Attack on 6-Round Midori64". Journal of Systems Science and Complexity 36, n.º 4 (agosto de 2023): 1738–56. http://dx.doi.org/10.1007/s11424-023-1452-1.
Texto completoShi, Guanwen, Simin Yu y Qianxue Wang. "Security Analysis of the Image Encryption Algorithm Based on a Two-Dimensional Infinite Collapse Map". Entropy 24, n.º 8 (25 de julio de 2022): 1023. http://dx.doi.org/10.3390/e24081023.
Texto completoAl-Mekhlafi, Muneer Abdullah Saeed y Nashwan Nagi Saleh Al-Marbe. "Lower and Upper Quartiles Enhanced Round Robin Algorithm for Scheduling of Outlier Tasks in Cloud Computing". Journal of Engineering and Technological Sciences - JOEATS 1, n.º 1 (20 de marzo de 2023): 67–87. http://dx.doi.org/10.59421/joeats.v1i1.1420.
Texto completoBadanidiyuru, Ashwinkumar, Arpita Patra, Ashish Choudhury, Kannan Srinathan y C. Pandu Rangan. "On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission". Journal of the ACM 59, n.º 5 (octubre de 2012): 1–35. http://dx.doi.org/10.1145/2371656.2371657.
Texto completoHosseini Beghaeiraveri, Seyed Amir, Mohammad Izadi y Mohsen Rezvani. "Broadcast Complexity and Adaptive Adversaries in Verifiable Secret Sharing". Security and Communication Networks 2020 (1 de agosto de 2020): 1–10. http://dx.doi.org/10.1155/2020/9428457.
Texto completoAghaji, Ada, Helen E. D. Burchett, Wanjiku Mathenge, Hannah Bassey Faal, Rich Umeh, Felix Ezepue, Sunday Isiyaku et al. "Technical capacities needed to implement the WHO’s primary eye care package for Africa: results of a Delphi process". BMJ Open 11, n.º 3 (marzo de 2021): e042979. http://dx.doi.org/10.1136/bmjopen-2020-042979.
Texto completoApplebaum, Benny, Dariusz R. Kowalski, Boaz Patt-Shamir y Adi Rosén. "Clique Here: On the Distributed Complexity in Fully-Connected Networks". Parallel Processing Letters 26, n.º 01 (marzo de 2016): 1650004. http://dx.doi.org/10.1142/s0129626416500043.
Texto completoWang, Huijiao, Jiapeng Tian, Xin Zhang, Yongzhuang Wei y Hua Jiang. "Multiple Differential Distinguisher of SIMECK32/64 Based on Deep Learning". Security and Communication Networks 2022 (14 de septiembre de 2022): 1–12. http://dx.doi.org/10.1155/2022/7564678.
Texto completoWeiss, Mor. "Shielding Probabilistically Checkable Proofs: Zero-Knowledge PCPs from Leakage Resilience". Entropy 24, n.º 7 (13 de julio de 2022): 970. http://dx.doi.org/10.3390/e24070970.
Texto completoLian, Ji Hong y Kai Chen. "Implementation of DES Encryption Algorithm Based on FPGA and Performance Analysis". Applied Mechanics and Materials 130-134 (octubre de 2011): 2953–56. http://dx.doi.org/10.4028/www.scientific.net/amm.130-134.2953.
Texto completoPrice, Jonathan, Alison Rushton, Vasileios Tyros y Nicola R. Heneghan. "Expert consensus on the important chronic non-specific neck pain motor control and segmental exercise and dosage variables: An international e-Delphi study". PLOS ONE 16, n.º 7 (1 de julio de 2021): e0253523. http://dx.doi.org/10.1371/journal.pone.0253523.
Texto completoKatz, Jonathan, Chiu-Yuen Koo y Ranjit Kumaresan. "Improving the round complexity of VSS in point-to-point networks". Information and Computation 207, n.º 8 (agosto de 2009): 889–99. http://dx.doi.org/10.1016/j.ic.2009.03.007.
Texto completoOkun, Michael. "On the round complexity of Byzantine agreement without initial set-up". Information and Computation 207, n.º 12 (diciembre de 2009): 1351–68. http://dx.doi.org/10.1016/j.ic.2009.07.002.
Texto completoVaya, Shailesh. "Round complexity of leader election and gossiping in bidirectional radio networks". Information Processing Letters 113, n.º 9 (mayo de 2013): 307–12. http://dx.doi.org/10.1016/j.ipl.2013.02.001.
Texto completoBiran, Ofer, Shlomo Moran y Shmuel Zaks. "Tight bounds on the round complexity of distributed 1-solvable tasks". Theoretical Computer Science 145, n.º 1-2 (julio de 1995): 271–90. http://dx.doi.org/10.1016/0304-3975(94)00157-e.
Texto completoZhang, Silan, Jianhua Chen, Jingbo Xia y Xiaochuan Ai. "An XTR-Based Constant Round Key Agreement Scheme". Mathematical Problems in Engineering 2013 (2013): 1–9. http://dx.doi.org/10.1155/2013/596868.
Texto completoMichail, Othon, George Skretas y Paul G. Spirakis. "Distributed computation and reconfiguration in actively dynamic networks". Distributed Computing 35, n.º 2 (19 de diciembre de 2021): 185–206. http://dx.doi.org/10.1007/s00446-021-00415-5.
Texto completoHe, Yong, Lei Gao, Gui Kai Liu y Yu Zhen Liu. "A Dynamic Round-Robin Packet Scheduling Algorithm". Applied Mechanics and Materials 347-350 (agosto de 2013): 2203–7. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.2203.
Texto completoSjöstedt, Gunnar. "NGOs in WTO Talks: Patterns of Performance and What They Mean". International Negotiation 17, n.º 1 (2012): 91–114. http://dx.doi.org/10.1163/157180612x630947.
Texto completoKim, Eunkyung, Hyang-Sook Lee y Jeongeun Park. "Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS". International Journal of Foundations of Computer Science 31, n.º 02 (febrero de 2020): 157–74. http://dx.doi.org/10.1142/s012905412050001x.
Texto completoCourtois, Nicolas T., Jerzy A. Gawinecki y Guangyan Song. "Contradiction Immunity and Guess-Then-Determine Attacks on Gost". Tatra Mountains Mathematical Publications 53, n.º 1 (1 de diciembre de 2012): 65–79. http://dx.doi.org/10.2478/v10127-012-0039-3.
Texto completoGONCHENKO, S. V., O. V. STEN’KIN y D. V. TURAEV. "COMPLEXITY OF HOMOCLINIC BIFURCATIONS AND Ω-MODULI". International Journal of Bifurcation and Chaos 06, n.º 06 (junio de 1996): 969–89. http://dx.doi.org/10.1142/s0218127496000539.
Texto completo