The following pages link to Ivan Rapaport (Q442250):
Displaying 50 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)
- Two rounds are enough for reconstructing any graph (class) in the congested clique model (Q1713905) (← links)
- AT-free graphs: Linear bounds for the oriented diameter (Q1827858) (← links)
- Cellular automata and communication complexity (Q1885923) (← links)
- Letting Alice and Bob choose which problem to solve: implications to the study of cellular automata (Q1935782) (← links)
- Compact distributed certification of planar graphs (Q2037111) (← links)
- The role of randomness in the broadcast congested clique model (Q2051760) (← links)
- Connectivity and connected components in the number-in-hand computation model (Q2086717) (← links)
- A meta-theorem for distributed certification (Q2097341) (← links)
- Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← links)
- Local certification of graphs with bounded genus (Q2104916) (← links)
- Graph reconstruction in the congested clique (Q2186818) (← links)
- The impact of locality on the detection of cycles in the broadcast congested clique model (Q2294684) (← links)
- On distributed Merlin-Arthur decision protocols (Q2303292) (← links)
- Allowing each node to communicate only once in a distributed system: shared whiteboard models (Q2355326) (← links)
- Solving the density classification problem with a large diffusion and small amplification cellular automaton (Q2443098) (← links)
- (Q2741458) (← links)
- Brief Announcement (Q2796253) (← links)
- The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model (Q2817860) (← links)
- (Q3044329) (← links)
- Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs (Q3408176) (← links)
- Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model (Q3460729) (← links)
- Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory (Q3511388) (← links)
- Minimal Proper Interval Completions (Q3522959) (← links)
- Small Alliances in Graphs (Q3525571) (← links)
- Average Long-Lived Memoryless Consensus: The Three-Value Case (Q3569120) (← links)
- Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol (Q3596753) (← links)
- (Q4407708) (← links)
- (Q4414499) (← links)
- Complexity of approximating the oriented diameter of chordal graphs (Q4459604) (← links)
- Robust reconstruction of Barabási‐Albert networks in the broadcast congested clique model (Q4638586) (← links)
- (Q4828960) (← links)
- (Q5145151) (← links)
- The Impact of Locality in the Broadcast Congested Clique Model (Q5220411) (← links)
- Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time (Q5385972) (← links)
