Journal articles on the topic 'Round and communication complexity'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Round and communication complexity.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
Kremer, I., N. Nisan, and D. Ron. "On Randomized One-round Communication Complexity." Computational Complexity 8, no. 1 (June 1, 1999): 21–49. http://dx.doi.org/10.1007/s000370050018.
Full textKremer, Ilan, Noam Nisan, and Dana Ron. "Errata for: "On randomized one-round communication complexity"." Computational Complexity 10, no. 4 (December 1, 2001): 314–15. http://dx.doi.org/10.1007/s000370100003.
Full textPandurangan, Gopal, Peter Robinson, and Michele Scquizzato. "On the Distributed Complexity of Large-Scale Graph Computations." ACM Transactions on Parallel Computing 8, no. 2 (June 30, 2021): 1–28. http://dx.doi.org/10.1145/3460900.
Full textZhao, Bo, Zhihong Chen, Hai Lin, and XiangMin Ji. "A Constant Round Write-Only ORAM." Applied Sciences 10, no. 15 (August 3, 2020): 5366. http://dx.doi.org/10.3390/app10155366.
Full textApon, Daniel, Jonathan Katz, and Alex J. Malozemoff. "One-round multi-party communication complexity of distinguishing sums." Theoretical Computer Science 501 (August 2013): 101–8. http://dx.doi.org/10.1016/j.tcs.2013.07.026.
Full textTSE, SAVIO S. H., and FRANCIS C. M. LAU. "ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS." International Journal of Foundations of Computer Science 10, no. 02 (June 1999): 211–23. http://dx.doi.org/10.1142/s0129054199000150.
Full textWagh, Sameer. "Pika: Secure Computation using Function Secret Sharing over Rings." Proceedings on Privacy Enhancing Technologies 2022, no. 4 (October 2022): 351–77. http://dx.doi.org/10.56553/popets-2022-0113.
Full textZhang, Kai, Xuejia Lai, Lei Wang, Jie Guan, Bin Hu, Senpeng Wang, and Tairong Shi. "Related-Key Multiple Impossible Differential Cryptanalysis on Full-Round LiCi-2 Designed for IoT." Security and Communication Networks 2022 (May 25, 2022): 1–11. http://dx.doi.org/10.1155/2022/3611840.
Full textTse, Savio S. H. "Belated Analyses of Three Credit-Based Adaptive Polling Algorithms." International Journal of Foundations of Computer Science 27, no. 05 (August 2016): 579–94. http://dx.doi.org/10.1142/s0129054116500179.
Full textMagniez, Frédéric, and Ashwin Nayak. "Quantum Distributed Complexity of Set Disjointness on a Line." ACM Transactions on Computation Theory 14, no. 1 (March 31, 2022): 1–22. http://dx.doi.org/10.1145/3512751.
Full textNisan, Noam, and Avi Wigderson. "Rounds in Communication Complexity Revisited." SIAM Journal on Computing 22, no. 1 (February 1993): 211–19. http://dx.doi.org/10.1137/0222016.
Full textBadanidiyuru, Ashwinkumar, Arpita Patra, Ashish Choudhury, Kannan Srinathan, and C. Pandu Rangan. "On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission." Journal of the ACM 59, no. 5 (October 2012): 1–35. http://dx.doi.org/10.1145/2371656.2371657.
Full textBraverman, Mark, Ankit Garg, Young Kun Ko, Jieming Mao, and Dave Touchette. "Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness." SIAM Journal on Computing 47, no. 6 (January 2018): 2277–314. http://dx.doi.org/10.1137/16m1061400.
Full textXing, Zhaohui, Wenying Zhang, and Guoyong Han. "Improved Conditional Differential Analysis on NLFSR-Based Block Cipher KATAN32 with MILP." Wireless Communications and Mobile Computing 2020 (November 23, 2020): 1–14. http://dx.doi.org/10.1155/2020/8883557.
Full textWeng, Tianling, Tingting Cui, Ting Yang, and Yinghua Guo. "Related-Key Differential Attacks on Reduced-Round LBlock." Security and Communication Networks 2022 (September 16, 2022): 1–15. http://dx.doi.org/10.1155/2022/8464960.
Full textGao, Hongchang, An Xu, and Heng Huang. "On the Convergence of Communication-Efficient Local SGD for Federated Learning." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 9 (May 18, 2021): 7510–18. http://dx.doi.org/10.1609/aaai.v35i9.16920.
Full textJain, Rahul, Attila Pereszlényi, and Penghui Yao. "A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity." Algorithmica 76, no. 3 (December 18, 2015): 720–48. http://dx.doi.org/10.1007/s00453-015-0100-0.
Full textBlumrosen, L., N. Nisan, and I. Segal. "Auctions with Severely Bounded Communication." Journal of Artificial Intelligence Research 28 (March 8, 2007): 233–66. http://dx.doi.org/10.1613/jair.2081.
Full textMichail, Othon, George Skretas, and Paul G. Spirakis. "Distributed computation and reconfiguration in actively dynamic networks." Distributed Computing 35, no. 2 (December 19, 2021): 185–206. http://dx.doi.org/10.1007/s00446-021-00415-5.
Full textLiu, Wenhao, and Yang Yang. "The 7-Round Subspace Trail-Based Impossible Differential Distinguisher of Midori-64." Security and Communication Networks 2021 (November 9, 2021): 1–15. http://dx.doi.org/10.1155/2021/6269604.
Full textEnright, Helen Patricia, and 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, no. 3 (December 1, 2020): 30–43. http://dx.doi.org/10.11157/fohpe.v21i3.336.
Full textLiu, Yu, Xiaolei Liu, and Yanmin Zhao. "Security Cryptanalysis of NUX for the Internet of Things." Security and Communication Networks 2019 (June 12, 2019): 1–12. http://dx.doi.org/10.1155/2019/2062697.
Full textRao, Ch Koteswara, Kunwar Singh, and Anoop Kumar. "Oblivious stable sorting protocol and oblivious binary search protocol for secure multi-party computation." Journal of High Speed Networks 27, no. 1 (March 29, 2021): 67–82. http://dx.doi.org/10.3233/jhs-210652.
Full textBriet, Jop, and Jeroen Zuiddam. "On the orthogonal rank and impossibility of quantum round elimination." Quantum Information and Computation 17, no. 1&2 (January 2017): 106–16. http://dx.doi.org/10.26421/qic17.1-2-6.
Full textLuo, Siqiang. "Distributed PageRank Computation: An Improved Theoretical Study." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 4496–503. http://dx.doi.org/10.1609/aaai.v33i01.33014496.
Full textHaddad, Mohammed, Colette Johnen, and Sven Köhler. "Polynomial Silent Self-Stabilizing p-Star Decomposition†." Computer Journal 63, no. 2 (November 17, 2019): 253–66. http://dx.doi.org/10.1093/comjnl/bxz102.
Full textKovalev, I. V., N. A. Testoyedov, D. I. Kovalev, and S. G. Efa. "Analysis of the influence of natural and climatic conditions in the Arctic and the Far North on the stability of air traffic." IOP Conference Series: Earth and Environmental Science 981, no. 3 (February 1, 2022): 032044. http://dx.doi.org/10.1088/1755-1315/981/3/032044.
Full textBaggaley, Martin, Gary Inglis, and Andrea Malizia. "The writing is on the wall: use of an LCD projector to aid communication at the ward round." Psychiatric Bulletin 29, no. 5 (May 2005): 180–81. http://dx.doi.org/10.1192/pb.29.5.180.
Full textHosseini Beghaeiraveri, Seyed Amir, Mohammad Izadi, and Mohsen Rezvani. "Broadcast Complexity and Adaptive Adversaries in Verifiable Secret Sharing." Security and Communication Networks 2020 (August 1, 2020): 1–10. http://dx.doi.org/10.1155/2020/9428457.
Full textLeermakers, Daan, and Boris Skoric. "Quantum Alice and silent Bob: Qubit-based Quantum Key Recycling with almost no classical communication." Quantum Information and Computation 21, no. 1&2 (February 2021): 0001–18. http://dx.doi.org/10.26421/qic21.1-2-1.
Full textJones, Helene Markham, Ffion Curtis, Graham Law, Christopher Bridle, Dorothy Boyle, and Tanweer Ahmed. "Evaluating follow-up and complexity in cancer clinical trials (EFACCT): an eDelphi study of research professionals’ perspectives." BMJ Open 10, no. 2 (February 2020): e034269. http://dx.doi.org/10.1136/bmjopen-2019-034269.
Full textWang, Huijiao, Jiapeng Tian, Xin Zhang, Yongzhuang Wei, and Hua Jiang. "Multiple Differential Distinguisher of SIMECK32/64 Based on Deep Learning." Security and Communication Networks 2022 (September 14, 2022): 1–12. http://dx.doi.org/10.1155/2022/7564678.
Full textZhang, Kai, Xuejia Lai, Lei Wang, Jie Guan, and Bin Hu. "Slide Attack on Full-Round ULC Lightweight Block Cipher Designed for IoT." Security and Communication Networks 2022 (April 23, 2022): 1–8. http://dx.doi.org/10.1155/2022/4291000.
Full textFRIEDMAN, ROY, ACHOUR MOSTEFAOUI, and MICHEL RAYNAL. "$\diamondsuit {\mathcal P}_{mute}$-BASED CONSENSUS for ASYNCHRONOUS BYZANTINE SYSTEMS." Parallel Processing Letters 15, no. 01n02 (March 2005): 169–82. http://dx.doi.org/10.1142/s0129626405002131.
Full textSEHYR, ZED SEVCIKOVA, BRENDA NICODEMUS, JENNIFER PETRICH, and KAREN EMMOREY. "Referring strategies in American Sign Language and English (with co-speech gesture): The role of modality in referring to non-nameable objects." Applied Psycholinguistics 39, no. 5 (April 17, 2018): 961–87. http://dx.doi.org/10.1017/s0142716418000061.
Full textBagchi, Susmit, Hafizur Rahaman, and Purnendu Das. "MDVM System Concept, Paging Latency and Round-2 Randomized Leader Election Algorithm in SG." Journal of Advanced Computational Intelligence and Intelligent Informatics 10, no. 5 (September 20, 2006): 752–60. http://dx.doi.org/10.20965/jaciii.2006.p0752.
Full textCadilhac, Michael. "Review of Communication Complexity and Applications by Anup Rao and Amir Yehudayoff." ACM SIGACT News 52, no. 3 (October 17, 2021): 11–13. http://dx.doi.org/10.1145/3494656.3494660.
Full textAldawsari, Layla S., and Tom Altman. "Naming in Multichannel with Beeps in the Strong Model." Applied Sciences 10, no. 20 (October 14, 2020): 7164. http://dx.doi.org/10.3390/app10207164.
Full textHao, Xiang Ning, Xue Min Wang, and Li Qiong Deng. "A New Protocol for Secure Distributed Multiplication of Two Polynomial Shared Values." Advanced Materials Research 1042 (October 2014): 110–16. http://dx.doi.org/10.4028/www.scientific.net/amr.1042.110.
Full textLenzini, L., E. Mingozzi, and G. Stea. "Tradeoffs Between Low Complexity, Low Latency, and Fairness With Deficit Round-Robin Schedulers." IEEE/ACM Transactions on Networking 12, no. 4 (August 2004): 681–93. http://dx.doi.org/10.1109/tnet.2004.833131.
Full textLabao, Alfonso, and Henry Adorna. "Cryptographic Rational Secret Sharing Schemes over General Networks." Cryptography 6, no. 4 (October 1, 2022): 50. http://dx.doi.org/10.3390/cryptography6040050.
Full textJiang, Zilong, and Chenhui Jin. "Multiple Impossible Differential Attacks for ForkAES." Security and Communication Networks 2022 (June 29, 2022): 1–11. http://dx.doi.org/10.1155/2022/5360032.
Full textPeng, Ningduo, Guangchun Luo, Ke Qin, and Aiguo Chen. "Query-Biased Preview over Outsourced and Encrypted Data." Scientific World Journal 2013 (2013): 1–13. http://dx.doi.org/10.1155/2013/860621.
Full textAlwazani, Hibatallah, and Anas Chaaban. "IRS-Enabled Ultra-Low-Power Wireless Sensor Networks: Scheduling and Transmission Schemes." Sensors 22, no. 23 (November 27, 2022): 9229. http://dx.doi.org/10.3390/s22239229.
Full textBravyi, S., D. P. DiVincenzo, R. Oliveira, and B. M. Terhal. "The complexity of stoquastic local Hamiltonian problems." Quantum Information and Computation 8, no. 5 (May 2008): 361–85. http://dx.doi.org/10.26421/qic8.5-1.
Full textGupta, Kanav, Deepak Kumaraswamy, Nishanth Chandran, and Divya Gupta. "LLAMA: A Low Latency Math Library for Secure Inference." Proceedings on Privacy Enhancing Technologies 2022, no. 4 (October 2022): 274–94. http://dx.doi.org/10.56553/popets-2022-0109.
Full textBraun, Lennart, Daniel Demmler, Thomas Schneider, and Oleksandr Tkachenko. "MOTION – A Framework for Mixed-Protocol Multi-Party Computation." ACM Transactions on Privacy and Security 25, no. 2 (May 31, 2022): 1–35. http://dx.doi.org/10.1145/3490390.
Full textQiu, Xueying, Yongzhuang Wei, Samir Hodzic, and Enes Pasalic. "Integral Distinguishers of the Full-Round Lightweight Block Cipher SAT_Jo." Security and Communication Networks 2021 (September 18, 2021): 1–9. http://dx.doi.org/10.1155/2021/5310545.
Full textZheng, Qiuhua, Yinhao Hu, Tao Pei, Shengwang Xu, Junzhe Yu, Ting Wu, Yanzhao Shen, Yingpei Zeng, and Tingting Cui. "Improved Single-Key Attacks on 2-GOST." Security and Communication Networks 2020 (October 15, 2020): 1–10. http://dx.doi.org/10.1155/2020/8886032.
Full textHung, Yung, Sophie Hieke, Klaus Grunert, and Wim Verbeke. "Setting Policy Priorities for Front-of-Pack Health Claims and Symbols in the European Union: Expert Consensus Built by Using a Delphi Method." Nutrients 11, no. 2 (February 14, 2019): 403. http://dx.doi.org/10.3390/nu11020403.
Full text