Graph searching is one of the simplest and most widely used tools in graph algorithms. Every search method defined using some particular selection rule, analysis corresponding vertex orderings can aid greatly devising algorithms, writing proofs correctness, or recognition various families.

While standard message authentication codes (MACs) guarantee authenticity of messages, they do not, in general, guarantee the anonymity of the sender and recipient. For example it may be easy for an observer to determine whether or not two authenticated messages were sent by the same party even without any information about the secret key used. However preserving any uncertainty an attacker may...

Nearly all spatial reasoning problems in­ volve uncertainty of one sort or another. Uncertainty arises due to the inaccuracies of sensors used in measuring distances and angles. We refer to this as directional un­ certainty. Uncertainty also arises in com­ bining spatial information when one loca­ tion is mistakenly identified with another. We refer to this as recognition uncertainty. Most prob...

In an anonymous ring of n processors, all processors are totally indistinguishable except for their input values. These values are not necessarily distinct, i.e., they form a multiset, and this makes many problems particularly difficult. We consider the problem of distributively sorting such a multiset on the ring, and we give a complete characterization of the relationship with the problems of...