Wang tilings and distributed verification on anonymous torus networks

Theory of Computing Systems

Volumn 30, Issue 2, 1997, Pages 145-163

  Syrotiuk, V R ^a   Colbourn, C J ^b   Pachl, J ^b  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

PERMUTATION GROUP; TORUS NETWORKS; VERIFICATION ALGORITHMS; VERIFICATION PROBLEMS; WANG TILES; WANG TILINGS;

EQUIVALENCE CLASSES;

EID: 0031081934     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF02679446     Document Type: Article

References (17)

1. Attiya, H., Snir, M., Warmuth, M., Computing on an Anonymous Ring, Journal of the ACM, Vol. 35, No. 4 (1988), pp. 845-875.
2. Beame, P. W., Bodlaender, H. L., Computing on Transitive Networks: The Torus, in Monien, B., Cori, R., editors, Proceedings of the Sixth Annual Symposium on Theoretical Aspects of Computer Science, (1989), pp. 294-303.
3. F. J. Budden, The Fascination of Groups, Cambridge University Press, Cambridge, 1972.
4. Grünbaum, B., Shephard, G. C., Tilings and Patterns, Freeman, San Francisco, CA, 1987.
5. Harary, F., Wilcox, G. W., Boolean Operations on Graphs, Mathematica Scandinavica, Vol. 20 (1967), pp. 41-51.
6. Korach, E., Moran, S., Zaks, S., Tight Upper and Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors, Technical Report TR-423, Department of Computer Science, Technion, July 1986.
7. Kranakis, E., Krizanc, D., Distributed Computing on Anonymous Hypercube Networks, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing (1991), pp. 722-729.
8. Norris, N., Universal Covers of Edge-Labelled Digraphs: Isomorphism to Depth n - 1 Implies Isomorphism to all Depths, Discrete Applied Mathematics, Vol. 56, No. 1 (January 1995), pp. 61-74.
9. Peterson, G. L., Efficient Algorithms for Elections in Meshes and Complete Networks, Technical Report TR-140, Department of Computer Science, University of Rochester, July 1985.
10. Raymond, D. R., Wood, D., Grail: Engineering Automata in C++, Technical Report CS-93-01, Department of Computer Science, University of Waterloo, January 1993.
11. Santoro, N., Sense of Direction, Topological Awareness and Communication Complexity, SIGACT News, Vol. 16, No. 2 (Summer 1984), pp. 50-56.
12. Syrotiuk, V. R., Wang Tilings and Distributed Orientation on Anonymous Torus Networks, Ph.D. Thesis, Department of Computer Science, University of Waterloo, 1992.
13. Syrotiuk, V. R., Colbourn, C. J., Pachl, J., Wang Tilings and Distributed Orientation on Anonymous Torus Networks, Proceedings of the Seventh International Workshop on Distributed Algorithms (1993), pp. 264-278.
14. Syrotiuk, V. R., Colbourn, C. J., Klarner, D. A., Pachl, J., Characterizing Tilings Using Finite Automata, Proceedings of the Third International Workshop on Polyominoes and Tilings (1994), pp. 11-30.
15. Tel, G., Network Orientation, Technical Report RUU-CS-91-8, Department of Computer Science, Utrecht University, March 1991.
16. Wang, H., Notes on a Class of Tiling Problems, Fundamenta Mathematicae, Vol. 82 (1975), pp. 295-305.
17. Yamashita, M., Kameda, T., Computing on an Anonymous Network: Part I - Characterizing the Solvable Cases. Part II - Decision and Membership Problems. IEEE Transactions on Parallel and Distributed Systems, Vol. 7, No. 1 (January 1996), pp. 69-96.