- On dissemination thresholds in regular and irregular graph classes
- Reconstruire un graphe en une ronde F. Becker1, M. Matamala2,3, N. Nisse4, I. Rapaport2,3, K. Suchan5,6,
- Domino tilings and related models: space of configurations of domains with holes
- Understanding a Non-Trivial Cellular Automaton by Finding its Simplest Underlying
- Average Binary Long-Lived Consensus and the Stabilizing Role Played by Memory
- Distributed computing of efficient routing schemes in generalized chordal graphs
- Small Alliances in Graphs Rodolfo Carvajal1
- Communications in cellular automata1 E. Golesa,b
- Reconstruire un graphe en une ronde F. Becker1, M. Matamala2,3, N. Nisse4, I. Rapaport2,3, K. Suchan5,6,
- Traced communication complexity of cellular automata
- Self-assemblying classes of shapes with a minimum number of tiles, and in optimal time
- Minimal Proper Interval Completions Ivan Rapaport1
- Theoretical Computer Science
- Communication Complexity and Intrinsic Universality
- Theoretical Computer Science 412 (2011) 36163628 Contents lists available at ScienceDirect
- arXiv:cs.DS/9903020v328Sep2001 Tiling with bars under tomographic constraints
- Tiling groups for Wang tiles Cristopher Moore
- Average Long-Lived Memoryless Consensus: The Three-Value Case
- Adding a referee to an interconnection network: What can(not) be computed in one round.
- BioMed Central Page 1 of 13
