Добірка наукової літератури з теми "Round and communication complexity"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Round and communication complexity".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Round and communication complexity"
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.
Повний текст джерелаKremer, 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.
Повний текст джерелаPandurangan, 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.
Повний текст джерелаZhao, 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.
Повний текст джерелаApon, 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.
Повний текст джерелаTSE, 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.
Повний текст джерелаWagh, 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.
Повний текст джерелаZhang, 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.
Повний текст джерелаTse, 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.
Повний текст джерелаMagniez, 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.
Повний текст джерелаДисертації з теми "Round and communication complexity"
Pankratov, Denis. "Communication complexity and information complexity." Thesis, The University of Chicago, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3711791.
Повний текст джерелаInformation complexity enables the use of information-theoretic tools in communication complexity theory. Prior to the results presented in this thesis, information complexity was mainly used for proving lower bounds and direct-sum theorems in the setting of communication complexity. We present three results that demonstrate new connections between information complexity and communication complexity.
In the first contribution we thoroughly study the information complexity of the smallest nontrivial two-party function: the AND function. While computing the communication complexity of AND is trivial, computing its exact information complexity presents a major technical challenge. In overcoming this challenge, we reveal that information complexity gives rise to rich geometrical structures. Our analysis of information complexity relies on new analytic techniques and new characterizations of communication protocols. We also uncover a connection of information complexity to the theory of elliptic partial differential equations. Once we compute the exact information complexity of AND, we can compute exact communication complexity of several related functions on n-bit inputs with some additional technical work. Previous combinatorial and algebraic techniques could only prove bounds of the form Θ( n). Interestingly, this level of precision is typical in the area of information theory, so our result demonstrates that this meta-property of precise bounds carries over to information complexity and in certain cases even to communication complexity. Our result does not only strengthen the lower bound on communication complexity of disjointness by making it more exact, but it also shows that information complexity provides the exact upper bound on communication complexity. In fact, this result is more general and applies to a whole class of communication problems.
In the second contribution, we use self-reduction methods to prove strong lower bounds on the information complexity of two of the most studied functions in the communication complexity literature: Gap Hamming Distance (GHD) and Inner Product mod 2 (IP). In our first result we affirm the conjecture that the information complexity of GHD is linear even under the uniform distribution. This strengthens the Ω(n) bound shown by Kerenidis et al. (2012) and answers an open problem by Chakrabarti et al. (2012). We also prove that the information complexity of IP is arbitrarily close to the trivial upper bound n as the permitted error tends to zero, again strengthening the Ω(n) lower bound proved by Braverman and Weinstein (2011). More importantly, our proofs demonstrate that self-reducibility makes the connection between information complexity and communication complexity lower bounds a two-way connection. Whereas numerous results in the past used information complexity techniques to derive new communication complexity lower bounds, we explore a generic way, in which communication complexity lower bounds imply information complexity lower bounds in a black-box manner.
In the third contribution we consider the roles that private and public randomness play in the definition of information complexity. In communication complexity, private randomness can be trivially simulated by public randomness. Moreover, the communication cost of simulating public randomness with private randomness is well understood due to Newman's theorem (1991). In information complexity, the roles of public and private randomness are reversed: public randomness can be trivially simulated by private randomness. However, the information cost of simulating private randomness with public randomness is not understood. We show that protocols that use only public randomness admit a rather strong compression. In particular, efficient simulation of private randomness by public randomness would imply a version of a direct sum theorem in the setting of communication complexity. This establishes a yet another connection between the two areas. (Abstract shortened by UMI.)
Ada, Anil. "Communication complexity." Thesis, McGill University, 2014. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=121119.
Повний текст джерелаLa complexité de communication étudie combien de bits un groupe de joueurs donné doivent échanger entre eux pour calculer une function dont l'input est distribué parmi les joueurs. Bien que ce soit un domaine de recherche naturel basé sur des considérations pratiques, la motivation principale vient des nombreuses applications théoriques.Cette thèse comporte trois parties principales, étudiant trois aspects de la complexité de communication.1. La première partie discute le modèle 'number on the forehead' (NOF) dans la complexité de communication à plusieurs joueurs. Il s'agit d'un modèle fondamental en complexité de communication, avec des applications à la complexité des circuits, la complexité des preuves, les programmes de branchement et la théorie de Ramsey. Dans ce modèle, nous étudions les fonctions composeés f de g. Ces fonctions comprennent la plupart des fonctions bien connues qui sont étudiées dans la littérature de la complexité de communication. Un objectif majeur est de comprendre quelles combinaisons de f et g produisent des compositions qui sont difficiles du point de vue de la communication. En particulier, à cause de l'importance des applications aux circuits, il est intéressant de comprendre la puissance du modèle NOF quand le nombre de joueurs atteint ou dépasse log n. Motivé par ces objectifs nous montrons l'existence d'un protocole simultané efficace à k joueurs de coût O(log^3 n) pour sym de g lorsque k > 1 + log n, sym est une function symmétrique quelconque et g est une fonction arbitraire. Nous donnons aussi des applications de notre protocole efficace à la théorie de Ramsey.Dans le contexte où k < log n, nous étudions de plus près des fonctions de la forme majority de g, mod_m de g et nor de g, où les deux derniers cas sont des généralisations des fonctions bien connues et très étudiées Inner Product et Disjointness respectivement. Nous caractérisons la complexité de communication de ces fonctions par rapport au choix de g.2. La deuxième partie considère les applications de l'analyse de Fourier des fonctions symmétriques à la complexité de communication et autres domaines. La norme spectrale d'une function booléenne f:{0,1}^n -> {0,1} est la somme des valeurs absolues de ses coefficients de Fourier. Nous donnons une caractérisation combinatoire pour la norme spectrale des fonctions symmétriques. Nous montrons que le logarithme de la norme spectrale est du même ordre de grandeur que r(f)log(n/r(f)), avec r(f) = max(r_0,r_1) où r_0 et r_1 sont les entiers minimaux plus petits que n/2 pour lesquels f(x) ou f(x)parity(x) est constant pour tout x tel que x_1 + ... + x_n à [r_0,n-r_1]. Nous présentons quelques applications aux arbres de décision et à la complexité de communication des fonctions symmétriques.3. La troisième partie étudie la confidentialité dans le contexte de la complexité de communication: quelle quantité d'information est-ce que les joueurs révèlent sur leur input en suivant un protocole donné? L'inatteignabilité de la confidentialité parfaite pour plusieurs fonctions motivent l'étude de la confidentialité approximative. Feigenbaum et al. (Proceedings of the 11th Conference on Electronic Commerce, 167--178, 2010) ont défini des notions de confidentialité approximative dans le pire cas et dans le cas moyen, et ont présenté plusieurs bornes supérieures intéressantes ainsi que quelques questions ouvertes. Dans cette thèse, nous obtenons des bornes asymptotiques précises, pour le pire cas aussi bien que pour le cas moyen, sur l'échange entre la confidentialité approximative de protocoles et le coût de communication pour les enchères Vickrey Auction, qui constituent l'exemple canonique d'une enchère honnête. Nous démontrons aussi des bornes inférieures exponentielles sur la confidentialité approximative de protocoles calculant la function Intersection, indépendamment du coût de communication. Ceci résout une conjecture de Feigenbaum et al.
Chen, Lijie S. M. Massachusetts Institute of Technology. "Fine-grained complexity meets communication complexity." Thesis, Massachusetts Institute of Technology, 2019. https://hdl.handle.net/1721.1/122754.
Повний текст джерелаCataloged from PDF version of thesis.
Includes bibliographical references (pages 215-229).
Fine-grained complexity aims to understand the exact exponent of the running time of fundamental problems in P. Basing on several important conjectures such as Strong Exponential Time Hypothesis (SETH), All-Pair Shortest Path Conjecture, and the 3-Sum Conjecture, tight conditional lower bounds are proved for numerous exact problems from all fields of computer science, showing that many text-book algorithms are in fact optimal. For many natural problems, a fast approximation algorithm would be as important as fast exact algorithms. So it would be interesting to show hardness for approximation algorithms as well. But we had few techniques to prove tight hardness for approximation problems in P--In particular, the celebrated PCP Theorem, which proves similar approximation hardness in the world of NP-completeness, is not fine-grained enough to yield interesting conditional lower bounds for approximation problems in P.
In 2017, a breakthrough work of Abboud, Rubinstein and Williams [12] established a framework called "Distributed PCP", and applied that to show conditional hardness (under SETH) for several fundamental approximation problems in P. The most interesting aspect of their work is a connection between fine-grained complexity and communication complexity, which shows Merlin-Arther communication protocols can be utilized to give fine-grained reductions between exact and approximation problems. In this thesis, we further explore the connection between fine-grained complexity and communication complexity. More specifically, we have two sets of results. In the first set of results, we consider communication protocols other than Merlin-Arther protocols in [12] and show that they can be used to construct other fine-grained reductions between problems. [sigma]₂ Protocols and An Equivalence Class for Orthogonal Vectors (OV).
First, we observe that efficient [sigma]₂[superscripts cc] protocols for a function imply fine-grained reductions from a certain related problem to OV. Together with other techniques including locality-sensitive hashing, we establish an equivalence class for OV with O(log n) dimensions, including Max-IP/Min-IP, approximate Max-IP/Min-IP, and approximate bichromatic closest/further pair. · NP · UPP Protocols and Hardness for Computational Geometry Problems in 2⁰([superscript log*n]) Dimensions. Second, we consider NP · UPP protocols which are the relaxation of Merlin-Arther protocols such that Alice and Bob only need to be convinced with probability > 1/2 instead of > 2/3.
We observe that NP · UPP protocols are closely connected to Z-Max-IP problem in very small dimensions, and show that Z-Max-IP, l₂₋-Furthest Pair and Bichromatic l₂-Closest Pair in 2⁰[superscript (log* n)] dimensions requires n²⁻⁰[superscript (1)] time under SETH, by constructing an efficient NP - UPP protocol for the Set-Disjointness problem. This improves on the previous hardness result for these problems in w(log² log n) dimensions by Williams [172]. · IP Protocols and Hardness for Approximation Problems Under Stronger Conjectures. Third, building on the connection between IP[superscript cc] protocols and a certain alternating product problem observed by Abboud and Rubinstein [11] and the classical IP = PSPACE theorem [123, 155]. We show that several finegrained problems are hard under conjectures much stronger than SETH (e.g., the satisfiability of n⁰[superscript (1)]-depth circuits requires 2(¹⁻⁰[superscript (1)n] time).
In the second set of results, we utilize communication protocols to construct new algorithms. · BQP[superscript cc] Protocols and Approximate Counting Algorithms. Our first connection is that a fast BQP[superscript cc] protocol for a function f implies a fast deterministic additive approximate counting algorithm for a related pair counting problem. Applying known BQP[superscript cc] protocols, we get fast deterministic additive approximate counting algorithms for Count-OV (#OV), Sparse Count-OV and Formula of SYM circuits. · AM[superscript cc]/PH[superscript cc] Protocols and Efficient SAT Algorithms. Our second connection is that a fast AM[superscript cc] (or PH[superscript cc]) protocol for a function f implies a faster-than-bruteforce algorithm for a related problem.
In particular, we show that if the Longest Common Subsequence (LCS) problem admits a fast (computationally efficient) PH[superscript cc] protocol (polylog(n) complexity), then polynomial-size Formula-SAT admits a 2[superscript n-n][superscript 1-[delta]] time algorithm for any constant [delta] > 0, which is conjectured to be unlikely by a recent work of Abboud and Bringmann [6].
by Lijie Chen.
S.M.
S.M. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
Dam, Wim van. "Nonlocality and communication complexity." Thesis, University of Oxford, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.325982.
Повний текст джерелаLerays, Virginie. "Quantum nonlocality and communication complexity." Paris 7, 2014. http://www.theses.fr/2014PA077151.
Повний текст джерелаQuantum computing raises a lot of questions related to the foundations of computing. We study, in this thesis, a complexity model called communication complexity, where we study the amount of communication required to solve a distributed task. We study this model from the perspective of quantum information theory. This thesis introduces a new way of obtaining lower bounds on communication complexity, using ideas developed in the study of quantum nonlocality. These methods are compared to previously known lower-bound methods and allow us to define a new family of Bell inequalities. We also prove in this thesis that ail previously known lower bounds for communication complexity are also lower bounds on information complexity. This witnesses the potential equivalence between these two measures of complexity and allows us to obtain direct sum results on the communication complexity of very-well studied functions
Lacayo, Virginia. "Communicating Complexity: A Complexity Science Approach to Communication for Social Change." Ohio University / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1367522049.
Повний текст джерелаAngus, Simon Douglas Economics Australian School of Business UNSW. "Economic networks: communication, cooperation & complexity." Awarded by:University of New South Wales. Economics, 2007. http://handle.unsw.edu.au/1959.4/27005.
Повний текст джерелаMcGinty, Nigel, and nigel mcginty@defence gov au. "Reduced Complexity Equalization for Data Communication." The Australian National University. Research School of Information Sciences and Engineering, 1998. http://thesis.anu.edu.au./public/adt-ANU20050602.122741.
Повний текст джерелаTesson, Pascal. "An algebraic approach to communication complexity." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0026/MQ50894.pdf.
Повний текст джерелаDhulipala, Anand. "On communication complexity and universal compression." Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2007. http://wwwlib.umi.com/cr/ucsd/fullcit?p3284204.
Повний текст джерелаTitle from first page of PDF file (viewed January 10, 2008). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 93-95).
Книги з теми "Round and communication complexity"
Noam, Nisan, ed. Communication complexity. New York: Cambridge University Press, 1997.
Знайти повний текст джерелаHromkovič, Juraj. Communication complexity and parallel computing. Berlin: Springer, 1997.
Знайти повний текст джерелаHromkovič, Juraj. Communication Complexity and Parallel Computing. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997.
Знайти повний текст джерелаCommunication complexity and parallel computing. New York: Springer, 1997.
Знайти повний текст джерелаThe complexity of human communication. Cresskill, N.J: Hampton Press, 2008.
Знайти повний текст джерелаThe complexity of human communication. 2nd ed. New York: Hampton Press, 2013.
Знайти повний текст джерелаBarthelemy, Jean-Pierre. Algorithmic complexity and communication problems. London: UCL Press, 1996.
Знайти повний текст джерелаJurdziński, Tomasz, and Stefan Schmid, eds. Structural Information and Communication Complexity. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79527-6.
Повний текст джерелаParter, Merav, ed. Structural Information and Communication Complexity. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-09993-9.
Повний текст джерелаCensor-Hillel, Keren, and Michele Flammini, eds. Structural Information and Communication Complexity. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-24922-9.
Повний текст джерелаЧастини книг з теми "Round and communication complexity"
Kublenz, Simeon, Sebastian Siebertz, and Alexandre Vigny. "Constant Round Distributed Domination on Graph Classes with Bounded Expansion." In Structural Information and Communication Complexity, 334–51. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79527-6_19.
Повний текст джерелаKishore, Ravi, Ashutosh Kumar, Chiranjeevi Vanarasa, and Srinathan Kannan. "Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity." In Lecture Notes in Computer Science, 33–50. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17470-9_3.
Повний текст джерелаAlistarh, Dan, Hagit Attiya, Rachid Guerraoui, and Corentin Travers. "Early Deciding Synchronous Renaming in O( logf ) Rounds or Less." In Structural Information and Communication Complexity, 195–206. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31104-8_17.
Повний текст джерелаMontealegre, Pedro, Sebastian Perez-Salazar, Ivan Rapaport, and Ioan Todinca. "Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model." In Structural Information and Communication Complexity, 134–48. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-01325-7_15.
Повний текст джерелаBen-Basat, Ran, Guy Even, Ken-ichi Kawarabayashi, and Gregory Schwartzman. "A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in $$O(\log N\log \varDelta /\log ^2\log \varDelta )$$ Rounds." In Structural Information and Communication Complexity, 226–36. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-01325-7_21.
Повний текст джерелаdi Crescenzo, Giovanni, Kouichi Sakurai, and Moti Yung. "Zero-knowledge proofs of decision power: New protocols and optimal round-complexity." In Information and Communications Security, 17–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0028458.
Повний текст джерелаMowles, Chris. "Complex communication." In Complexity, 82–102. London: Routledge, 2021. http://dx.doi.org/10.4324/9781003002840-5.
Повний текст джерелаMowles, Chris. "Complex communication." In Complexity, 82–102. London: Routledge, 2021. http://dx.doi.org/10.4324/9781003002840-5.
Повний текст джерелаOrlitsky, A., and A. El Gamal. "Communication Complexity." In Complexity in Information Theory, 16–61. New York, NY: Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4612-3774-7_2.
Повний текст джерелаChakrabarti, Amit. "Communication Complexity." In Encyclopedia of Algorithms, 349–57. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_799.
Повний текст джерелаТези доповідей конференцій з теми "Round and communication complexity"
Kremer, Ilan, Noam Nisan, and Dana Ron. "On randomized one-round communication complexity." In the twenty-seventh annual ACM symposium. New York, New York, USA: ACM Press, 1995. http://dx.doi.org/10.1145/225058.225277.
Повний текст джерелаGanesh, Chaya, and Arpita Patra. "Broadcast Extensions with Optimal Communication and Round Complexity." In PODC '16: ACM Symposium on Principles of Distributed Computing. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2933057.2933082.
Повний текст джерелаWoodworth, Blake, Brian Bullins, Ohad Shamir, and Nathan Srebro. "The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication (Extended Abstract)." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/751.
Повний текст джерелаBrody, Joshua, and Amit Chakrabarti. "A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences." In 2009 24th Annual IEEE Conference on Computational Complexity (CCC). IEEE, 2009. http://dx.doi.org/10.1109/ccc.2009.31.
Повний текст джерелаBraverman, Mark, Ankit Garg, Young Kun Ko, Jieming Mao, and Dave Touchette. "Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness." In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2015. http://dx.doi.org/10.1109/focs.2015.53.
Повний текст джерелаJin Seek Choi, Mijeong Yang, and Tae Il Kim. "Complexity analysis of a dual round-robin iSLIP (DiSLIP) scheduling scheme." In 8th International Conference on Advanced Communication Technology. IEEE, 2006. http://dx.doi.org/10.1109/icact.2006.206406.
Повний текст джерелаNisan, Noam, and Avi Widgerson. "Rounds in communication complexity revisited." In the twenty-third annual ACM symposium. New York, New York, USA: ACM Press, 1991. http://dx.doi.org/10.1145/103418.103463.
Повний текст джерелаMendoza-Granada, Fabricio, and Marcos Villagra. "Number-On-Forehead Communication Complexity of Data Clustering with Sunflowers." In IV Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/etc.2019.6394.
Повний текст джерелаJain, Rahul, Attila Pereszlenyi, and Penghui Yao. "A Direct Product Theorem for the Two-Party Bounded-Round Public-Coin Communication Complexity." In 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2012. http://dx.doi.org/10.1109/focs.2012.42.
Повний текст джерелаPatt-Shamir, Boaz, and Marat Teplitsky. "The round complexity of distributed sorting." In the 30th annual ACM SIGACT-SIGOPS symposium. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1993806.1993851.
Повний текст джерелаЗвіти організацій з теми "Round and communication complexity"
Awerbuch, B., and R. G. Gallager. Communication Complexity of Distributed Shortest Path Algorithms. Fort Belvoir, VA: Defense Technical Information Center, June 1985. http://dx.doi.org/10.21236/ada156049.
Повний текст джерелаLuo, Zhi-Quan, and John N. Tsitsiklis. On the Communication Complexity of Distributed Algebraic Computation. Fort Belvoir, VA: Defense Technical Information Center, February 1989. http://dx.doi.org/10.21236/ada205784.
Повний текст джерелаLuo, Zhi-Quan, and John N. Tsitsiklis. On the Communication Complexity of Solving a Polynomial Equation. Fort Belvoir, VA: Defense Technical Information Center, July 1989. http://dx.doi.org/10.21236/ada211945.
Повний текст джерелаRose, Andrew M., Donna J. Mayo, and Janice C. Redish. Modeling the Speech Communication Effect on Performance: Message Complexity. Fort Belvoir, VA: Defense Technical Information Center, June 1991. http://dx.doi.org/10.21236/ada254711.
Повний текст джерелаTaylor, Karen, and Daniel Blitzer. The Influence of Communication on the Complexity of Connected Lighting Systems. Office of Scientific and Technical Information (OSTI), July 2021. http://dx.doi.org/10.2172/1814141.
Повний текст джерелаHahne, Ellen L., and Robert G. Gallager. Round Robin Scheduling for Fair Flow Control in Data Communication Networks. Fort Belvoir, VA: Defense Technical Information Center, March 1986. http://dx.doi.org/10.21236/ada166728.
Повний текст джерелаPerdigão, Rui A. P. Beyond Quantum Security with Emerging Pathways in Information Physics and Complexity. Synergistic Manifolds, June 2022. http://dx.doi.org/10.46337/220602.
Повний текст джерелаWillis, Craig, Will Hughes, and Sergiusz Bober. ECMI Minorities Blog. National and Linguistic Minorities in the Context of Professional Football across Europe: Five Examples from Non-kin State Situations. European Centre for Minority Issues, December 2022. http://dx.doi.org/10.53779/bvkl7633.
Повний текст джерелаPerdigão, Rui A. P. Information physics and quantum space technologies for natural hazard sensing, modelling and prediction. Meteoceanics, September 2021. http://dx.doi.org/10.46337/210930.
Повний текст джерелаPerdigão, Rui A. P. New Horizons of Predictability in Complex Dynamical Systems: From Fundamental Physics to Climate and Society. Meteoceanics, October 2021. http://dx.doi.org/10.46337/211021.
Повний текст джерела