Tag
communication-complexity
- Jun 5, 2024 Size-Depth Tradeoffs and the Block-Respecting Model How restricting a circuit to communicate only between fixed blocks of inputs turns depth into a measurable resource, and what the resulting bounds say about parity. computation theory
- Mar 24, 2023 Supersteps and Message Bounds: Why Distributed Parallelism Costs More How the BSP model charges for latency and bandwidth per round, what the h-relation says about all-to-all traffic, and why matrix multiplication needs more memory per processor to avoid moving data. algorithms