The following pages link to Ivan Rapaport (Q442250):
Displaying 21 items.
- Distributed computing of efficient routing schemes in generalized chordal graphs (Q442251) (← links)
- Traced communication complexity of cellular automata (Q549703) (← links)
- Communication complexity in number-conserving and monotone cellular automata (Q551188) (← links)
- Domino tilings and related models: Space of configurations of domains with holes (Q596048) (← links)
- Communication complexity and intrinsic universality in cellular automata (Q616488) (← links)
- (Q627514) (redirect page) (← links)
- On dissemination thresholds in regular and irregular graph classes (Q627518) (← links)
- Erratum to: ``Communication complexity and intrinsic universality in cellular automata'' (Q655427) (← links)
- The multiple traveling salesman problem on spiders (Q831830) (← links)
- Average long-lived binary consensus: quantifying the stabilizing role played by memory (Q962162) (← links)
- Minimal proper interval completions (Q963366) (← links)
- Tiling allowing rotations only (Q1292299) (← links)
- (Q1389653) (redirect page) (← links)
- Complexity of tile rotation problems (Q1389654) (← links)
- Tiling with bars under tomographic constraints. (Q1401161) (← links)
- Distributed testing of excluded subgraphs (Q1660944) (← links)
- Robust reconstruction of Barabási‐Albert networks in the broadcast congested clique model (Q4638586) (← links)
- (Q6065460) (← links)
- Communication complexity meets cellular automata: necessary conditions for intrinsic universality (Q6095497) (← links)
- A meta-theorem for distributed certification (Q6182681) (← links)
- Three notes on distributed property testing (Q6487486) (← links)
