The following pages link to Communication Complexity (Q4875692):
Displaying 28 items.
- Preface (Q5965467) (← links)
- On pure space vs catalytic space (Q5970816) (← links)
- On (simple) decision tree rank (Q6050134) (← links)
- Around the log-rank conjecture (Q6050267) (← links)
- Communication costs in a geometric communication network (Q6052702) (← links)
- Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond (Q6062144) (← links)
- (Q6065460) (← links)
- Distributed Testing of Graph Isomorphism in the CONGEST Model. (Q6084362) (← links)
- (Q6087214) (← links)
- Communication complexity meets cellular automata: necessary conditions for intrinsic universality (Q6095497) (← links)
- Almost optimal query algorithm for hitting set using a subset query (Q6113278) (← links)
- Inductive definitions in logic versus programs of real-time cellular automata (Q6122593) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)
- Asynchronous communicating cellular automata: formalization, robustness and equivalence (Q6154787) (← links)
- Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols (Q6163951) (← links)
- Error-Free Affine, Unitary, and Probabilistic OBDDs (Q6169903) (← links)
- Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams (Q6185609) (← links)
- Forty years of frequent items (Q6198649) (← links)
- Communication and information complexity (Q6200329) (← links)
- Improved hardness of approximation of diameter in the CONGEST model (Q6535016) (← links)
- Exact distributed quantum algorithm for generalized Simon's problem (Q6541034) (← links)
- The hardness of local certification of finite-state dynamics (Q6547916) (← links)
- Combinatorially homomorphic encryption (Q6582175) (← links)
- Generalized coloring of permutations (Q6582372) (← links)
- Depth-3 circuits for inner product (Q6614883) (← links)
- Upper bounds on communication in terms of approximate rank (Q6635689) (← links)
- Information causality, the Tsirelson bound, and the `being-thus' of things (Q6642634) (← links)
- Perspective on complexity measures targeting read-once branching programs (Q6647765) (← links)
