Special Issue "Symmetry in Theoretical Computer Science"
A special issue of Symmetry (ISSN 2073-8994).
Deadline for manuscript submissions: closed (28 February 2011).
Interests: theory of cryptography; randomness and computation; quantum computation; computational complexity
Symmetry is a basic concept even in Theoretical Computer Science. For the design and analysis of the algorithms, the symmetry plays an important role. The symmetry often makes the probabilistic analysis of randomized algorithms easier and simpler. Sometimes, the incorporation of elegant methods of symmetry- or tie- breaking into algorithms leads to the efficiency. Moreover, symmetric structures and patterns are omnipresent and the study of their algorithmic or computational aspects gives us an understanding of the nature of the symmetry.
Contributions are invited on all aspects of symmetry in theoretical computer science. Those that involve other fields are welcomed if they are discussed from the algorithmic or computational point of view.
Prof. Dr. Takeshi Koshiba
- randomized algorithm
- probabilistic analysis
- symmetric break / tie break
- distributed computing
- algorithmic game theory
- symmetric network
- symmetric structure / pattern