Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: International Colloquium on Structural Information and Communication Complexity (view), Multiparty communication complexity (view)

searching for Communication complexity 35 found (88 total)

alternate case: communication complexity

Noam Nisan (556 words) [view diff] case mismatch in snippet view article find links to article

Dissertation Series, 1992), co-author with Eyal Kushilevitz of the book Communication Complexity (Cambridge University Press, 1997), and co-author with Shimon Schocken

Private information retrieval (2,184 words) [view diff] exact match in snippet view article find links to article

achieve communication complexity less than n {\displaystyle n} was created in 1997 by Kushilevitz and Ostrovsky and achieved communication complexity of n

Total variation distance of probability measures (785 words) [view diff] exact match in snippet view article find links to article

ISBN 978-0-387-94618-4. Harsha, Prahladh (September 23, 2011). "Lecture notes on communication complexity" (PDF). Villani, Cédric (2009). Optimal Transport, Old and New

Knuth Prize (781 words) [view diff] exact match in snippet view article find links to article

contributions to theoretical computer science in areas including communication complexity, pseudo-random number generators, interactive proofs, and algorithmic

Brenda McCowan (3,035 words) [view diff] no match in snippet view article find links to article

Brenda McCowan is a research behaviorist interested in evolutionary, biological, and ecological aspects of animal behavior and communication. Her work

Quantum foundations (2,888 words) [view diff] case mismatch in snippet view article find links to article

principles proposed so far include no-signalling, Non-Trivial Communication Complexity, No-Advantage for Nonlocal computation, Information Causality,

Ran Raz (449 words) [view diff] case mismatch in snippet view article find links to article

theory Institutions Princeton University Weizmann Institute Thesis Communication Complexity and Circuit Lower Bounds (1992) Doctoral advisor Avi Wigderson

Platform trial (1,583 words) [view diff] exact match in snippet view article find links to article

Monitoring and Safety Boards and operations leading to high cost and communication complexity. The long duration of platform trials may necessitate updates to

Jeff Edmonds (382 words) [view diff] exact match in snippet view article find links to article

Impagliazzo, Russell; Rudich, Steven; Sgall, Jiri Sgall (2001), "Communication complexity towards lower bounds on circuit depth", Computational Complexity

Oded Goldreich (1,378 words) [view diff] case mismatch in snippet view article find links to article

Unbiased Bits From Sources of Weak Randomness and Probabilistic Communication Complexity. SIAM J. Comp., Vol. 17, No. 2, April 1988, pages 230-261. Mihir

Richard Lipton (1,648 words) [view diff] exact match in snippet view article find links to article

arrive at a consensus on a predicate. They studied this model's communication complexity, defined as the number of bits broadcast among all the processes

Data synchronization (1,591 words) [view diff] exact match in snippet view article find links to article

Trachtenberg; Zippel, R. (2003). "Set reconciliation with nearly optimal communication complexity". IEEE Transactions on Information Theory. 49 (9): 2213–2218. CiteSeerX 10

Juhani Karhumäki (362 words) [view diff] case mismatch in snippet view article find links to article

Karhumäki, Juhani; Klauck, Hartmut; Schnitger, Georg (2002). "Communication Complexity Method for Measuring Nondeterminism in Finite Automata". Information

Hellinger distance (1,783 words) [view diff] exact match in snippet view article find links to article

ISBN 1-58488-600-5. Harsha, Prahladh (September 23, 2011). "Lecture notes on communication complexity" (PDF). Yang, Grace Lo; Le Cam, Lucien M. (2000). Asymptotics in

Moti Yung (1,628 words) [view diff] case mismatch in snippet view article find links to article

Model. CRYPTO 1987: 135-155 [5] Matthew K. Franklin, Moti Yung: Communication Complexity of Secure Computation (Extended Abstract). STOC 1992: 699-710 [6]

Envy-free item allocation (3,729 words) [view diff] exact match in snippet view article find links to article

there are more than two agents. When there are two agents, the communication complexity depends on specific combinations of parameters. Deciding whether

Machtey Award (179 words) [view diff] case mismatch in snippet view article find links to article

Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity" 1994 Rakesh K. Sinha, T.S. Jayram (Washington) "Efficient Oblivious

Self-verifying finite automaton (468 words) [view diff] case mismatch in snippet view article find links to article

Schnitger, Georg (2001). "On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata". Information and Computation. 169

Beta skeleton (1,887 words) [view diff] exact match in snippet view article find links to article

and in wireless ad hoc networks as a mechanism for controlling communication complexity by choosing a subset of the pairs of wireless stations that can

Kalai Prize (283 words) [view diff] case mismatch in snippet view article find links to article

of the Price of Anarchy 2021 Yakov Babichenko Aviad Rubinstein Communication Complexity of Approximate Nash Equilibria 2024 Ioannis Caragiannis David Kurokawa

Secret sharing (3,790 words) [view diff] exact match in snippet view article find links to article

Usenix FAST'11. Franklin, Matthew; Yung, Moti (4 May 1992). "Communication complexity of secure computation (Extended abstract)". Proceedings of the

Quantum cryptography (9,073 words) [view diff] exact match in snippet view article find links to article

at least in principle, be realized with today's technology. The communication complexity is only a constant factor larger than the bound Q on the adversary's

Quantum entanglement (13,888 words) [view diff] case mismatch in snippet view article find links to article

Cited in Hobson, M. P.; et al. (1998). "Quantum Entanglement and Communication Complexity". SIAM J. Comput. 30 (6): 1829–1841. CiteSeerX 10.1.1.20.8324.)

Maynard (broadcaster) (2,184 words) [view diff] case mismatch in snippet view article

1971. (cited in M. P. Hobson; et al. "Quantum Entanglement and Communication Complexity (1998)": 1/13. CiteSeerX 10.1.1.20.8324. Einstein used the German

C. Pandu Rangan (1,223 words) [view diff] case mismatch in snippet view article find links to article

Kannan Srinathan, N. R. Prasad, C. Pandu Rangan: On the Optimal Communication Complexity of Multiphase Protocols for Perfect Communication. 2007 IEEE Symposium

Unambiguous finite automaton (1,220 words) [view diff] case mismatch in snippet view article find links to article

Yuan, Weiqiang (2022). "Lower Bounds for Unambiguous Automata via Communication Complexity". DROPS-IDN/V2/Document/10.4230/LIPIcs.ICALP.2022.126. Schloss-Dagstuhl

TC0 (4,889 words) [view diff] case mismatch in snippet view article find links to article

Ramesh; Vinay, V.; Mukund, Madhavan (eds.), "Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity", FST TCS 2001:

Communication-avoiding algorithm (1,680 words) [view diff] exact match in snippet view article find links to article

m,m\times k,n\times k} , then A B + C {\displaystyle AB+C} has communication complexity Ω ( max ( m k n / M 1 / 2 , m k + k n + m k ) ) {\displaystyle

Zhi-Quan Tom Luo (707 words) [view diff] exact match in snippet view article find links to article

math.ndsu.nodak.edu. Retrieved 2020-03-12. Luo, Zhi-Quan (1989). Communication complexity of some problems in distributed computation (Thesis thesis). Massachusetts

Complementation of automata (232 words) [view diff] case mismatch in snippet view article find links to article

(12 February 2022). "Lower Bounds for Unambiguous Automata via Communication Complexity". arXiv:2109.09155 [cs.FL]. Geffert, Viliam; Mereghetti, Carlo;

State complexity (3,375 words) [view diff] case mismatch in snippet view article find links to article

(12 February 2022). "Lower Bounds for Unambiguous Automata via Communication Complexity". arXiv:2109.09155 [cs.FL]. Jirásek, Jozef; Jirásková, Galina;

List of University of California, Berkeley faculty (15,295 words) [view diff] exact match in snippet view article find links to article

complexity-based theory of pseudorandom number generation, cryptography, and communication complexity" Mark Berger, B.A. 1964 – recipient of four Academy Awards for

Amnesiac flooding (765 words) [view diff] case mismatch in snippet view article find links to article

Werneck; Scheideler, Christian (eds.). Structural Information and Communication Complexity. Lecture Notes in Computer Science. Vol. 12156. Cham: Springer

University of Illinois Center for Supercomputing Research and Development (6,992 words) [view diff] case mismatch in snippet view article find links to article

November 1983. H. Lawrie and A. H. Sameh. “The Computation and Communication Complexity of a Parallel Banded System Solver”. ACM Transactions on Mathematical

Glossary of logic (30,237 words) [view diff] exact match in snippet view article find links to article

Scientific. p. 99. ISBN 978-1-908978-24-0. Kamath, Pritish (2015). Communication complexity of permutation-invariant functions (Thesis thesis). Massachusetts