Literatura académica sobre el tema "Round Complexity"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas 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.
Artículos de revistas sobre el tema "Round Complexity"
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 completoTesis sobre el tema "Round Complexity"
Ravi, Divya. "On the Round Complexity Landscape of Secure Multi-party Computation". Thesis, 2020. https://etd.iisc.ac.in/handle/2005/4809.
Texto completoLin, Kun-Xuan y 林琨絢. "Low Complexity Packet Scheduling Algorithm: Adaptive Fair Queuing with Round-Robin". Thesis, 2006. http://ndltd.ncl.edu.tw/handle/58810698448679516700.
Texto completo國立雲林科技大學
電子與資訊工程研究所
94
The rapid growths of Internet bandwidth and Internet user have increased the complexity of network management. At the same time the contents of transmission in Internet trends to be pluralistic. It is not enough of only relying on the original best-effort IP protocol to support the required quality of service (QoS) for each application. In order to offer steady communication environment and QoS, the moderately bandwidth management is considered in network design. In general, the network bandwidth management can be classified into two parts of packet buffer management and packet scheduling. In this thesis, we target on the design of packet scheduling for the network bandwidth management and propose an Adaptive Fair Queuing with Round Robin (AFQRR) scheme. Based on Round Robin technique, the AFQRR has the properties of lower complexity and higher accuracy. According to the assigning weight of flows, the AFQRR can fairly to allocate the corresponding bandwidth for each flow. In the part of complexity, the computation of both the amount of allowing transmission for each flow and the next transmission flow selection are all of O(1). With the NS2 simulation tool, the simulation results reveal that the AFQRR scheduling algorithm has a better performance in the part of fair bandwidth allocation and of packet delay.
FRIOLO, DANIELE. "New perspectives in multi-party computation: low round complexity from new assumptions, financial fairness and public verifiability". Doctoral thesis, 2021. http://hdl.handle.net/11573/1566920.
Texto completoLapointe, Rébecca. "Complexité de la communication sur un canal avec délai". Thèse, 2014. http://hdl.handle.net/1866/10686.
Texto completoWe introduce a new communication complexity model in which we want to determine how much time of communication is needed by two players in order to execute arbitrary tasks on a channel with delay d. We establish a few basic lower and upper bounds and compare this new model to existing models such as the classical and quantum two-party models of communication. We show that the standard communication complexity of a function, modulo a factor of d/ lg d, constitutes an upper bound to its communication complexity on a delayed channel. We introduce a few examples on which a clever strategy depending on the delay procures a significant advantage over the naïve implementation of an optimal communication protocol. We then show that a delayed channel can be used to implement a cryptographic bit swap, but is insufficient on its own to implement an oblivious transfer scheme.
Libros sobre el tema "Round Complexity"
Round Table on Law and Semiotics (6th 1992 Penn State University--Berks). Flux, complexity, and illusion: Sixth Round Table on Law and Semiotics. New York: P. Lang, 1993.
Buscar texto completoCole, Richard. The APRAM -- the rounds complexity measure and the explicit costs of synchronization. New York: Courant Institute of Mathematical Sciences, New York University, 1991.
Buscar texto completoFlux, Complexity, and Illusion: Sixth Round Table on Law and Semiotics (Semiotics and the Human Sciences). Peter Lang Publishing, 1993.
Buscar texto completovan Es, Bart. 5. Character. Oxford University Press, 2016. http://dx.doi.org/10.1093/actrade/9780198723356.003.0006.
Texto completoZajicek, Ofer y Richard Cole. APRAM -- the Rounds Complexity Measure and the Explicit Costs of Synchronization. Creative Media Partners, LLC, 2018.
Buscar texto completoMarat, Erica. The Politics of Police Reform. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190861490.001.0001.
Texto completoJohansen, Bruce y Adebowale Akande, eds. Nationalism: Past as Prologue. Nova Science Publishers, Inc., 2021. http://dx.doi.org/10.52305/aief3847.
Texto completoCapítulos de libros sobre el tema "Round Complexity"
Farley, Thomas. "Unraveling the Complexity of Market Structure". En Equity Trading Round-Up, 117–30. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-51015-2_8.
Texto completoGarg, Sanjam, Pratyay Mukherjee, Omkant Pandey y Antigoni Polychroniadou. "The Exact Round Complexity of Secure Computation". En Advances in Cryptology – EUROCRYPT 2016, 448–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-49896-5_16.
Texto completoCohen, Tzafrir, Joe Kilian y Erez Petrank. "Responsive Round Complexity and Concurrent Zero-Knowledge". En Advances in Cryptology — ASIACRYPT 2001, 422–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45682-1_25.
Texto completoChardouvelis, Orestis y Giulio Malavolta. "The Round Complexity of Quantum Zero-Knowledge". En Theory of Cryptography, 121–48. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-90459-3_5.
Texto completoGarg, Sanjam, Mohammad Mahmoody, Daniel Masny y Izaak Meckler. "On the Round Complexity of OT Extension". En Lecture Notes in Computer Science, 545–74. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96878-0_19.
Texto completoKublenz, Simeon, Sebastian Siebertz y Alexandre Vigny. "Constant Round Distributed Domination on Graph Classes with Bounded Expansion". En Structural Information and Communication Complexity, 334–51. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79527-6_19.
Texto completoPatra, Arpita, Ashish Choudhary, Tal Rabin y C. Pandu Rangan. "The Round Complexity of Verifiable Secret Sharing Revisited". En Advances in Cryptology - CRYPTO 2009, 487–504. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03356-8_29.
Texto completoChoudhury, Ashish, Kaoru Kurosawa y Arpita Patra. "The Round Complexity of Perfectly Secure General VSS". En Lecture Notes in Computer Science, 143–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20728-0_14.
Texto completoKiayias, Aggelos y Serdar Pehlivanoglu. "Improving the Round Complexity of Traitor Tracing Schemes". En Applied Cryptography and Network Security, 273–90. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13708-2_17.
Texto completoKozachinskiy, Alexander. "Making Randomness Public in Unbounded-Round Information Complexity". En Lecture Notes in Computer Science, 296–309. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-20297-6_19.
Texto completoActas de conferencias sobre el tema "Round Complexity"
Patt-Shamir, Boaz y Marat Teplitsky. "The round complexity of distributed sorting". En the 30th annual ACM SIGACT-SIGOPS symposium. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1993806.1993851.
Texto completoBeaver, D., S. Micali y P. Rogaway. "The round complexity of secure protocols". En the twenty-second annual ACM symposium. New York, New York, USA: ACM Press, 1990. http://dx.doi.org/10.1145/100216.100287.
Texto completoKremer, Ilan, Noam Nisan y Dana Ron. "On randomized one-round communication complexity". En the twenty-seventh annual ACM symposium. New York, New York, USA: ACM Press, 1995. http://dx.doi.org/10.1145/225058.225277.
Texto completoGoyal, Vipul y Abhishek Jain. "On the round complexity of covert computation". En the 42nd ACM symposium. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1806689.1806717.
Texto completoSanghvi, Saurabh y Salil Vadhan. "The round complexity of two-party random selection". En the thirty-seventh annual ACM symposium. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1060590.1060641.
Texto completoGanesh, Chaya y Arpita Patra. "Broadcast Extensions with Optimal Communication and Round Complexity". En PODC '16: ACM Symposium on Principles of Distributed Computing. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2933057.2933082.
Texto completoApplebaum, Benny, Eliran Kachlon y Arpita Patra. "The Round Complexity of Statistical MPC with Optimal Resiliency". En STOC '23: 55th Annual ACM Symposium on Theory of Computing. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3564246.3585228.
Texto completoGaray, Juan A., Jonathan Katz, Chiu-Yuen Koo y Rafail Ostrovsky. "Round Complexity of Authenticated Broadcast with a Dishonest Majority". En 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). IEEE, 2007. http://dx.doi.org/10.1109/focs.2007.4389534.
Texto completoGaray, Juan A., Jonathan Katz, Chiu-Yuen Koo y Rafail Ostrovsky. "Round Complexity of Authenticated Broadcast with a Dishonest Majority". En 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). IEEE, 2007. http://dx.doi.org/10.1109/focs.2007.44.
Texto completoIto, Tsuyoshi, Hirotada Kobayashi y Keiji Matsumoto. "Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies". En 2009 24th Annual IEEE Conference on Computational Complexity (CCC). IEEE, 2009. http://dx.doi.org/10.1109/ccc.2009.22.
Texto completoInformes sobre el tema "Round Complexity"
Eiber. L51786 Development of Optimized Nondestructive Inspection Methods for Hot Tap Branch Connection Welds. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), enero de 1998. http://dx.doi.org/10.55274/r0010388.
Texto completoLeis, Brian y Xian-Kui Zhu. PR-003-063509-R01 Models for Predicting Delayed Fatigue Failure of Pipelines at Mechanical Damage. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), mayo de 2018. http://dx.doi.org/10.55274/r0011489.
Texto completo