Learn More
K e y w o r d s : c o m p u t a t i o n a l and s t r u c t u r a l complexi ty , Las Vegas, d e t e r m i n ism, c o m m u n i c a t i o n complexi ty , a u t o m a t a * The work of this author has been supported by DFG Project HR 14/3-1. Reischuk, Morvan (Eds.): STACS'97 Proceedings, LNCS 1200 (~) Sprlnger-Verlag Berlin Heidelberg 1997 118 P. Duri~, J.(More)
As part of a follow-up study to our previous investigation of the catecholaminergic neurosecretory cells in the brain of adult female locusts (Locusta migratoria migratorioides) by means of the formaldehyde-induced fluorescence method, we have attempted to specify the identity of the amines present in these cells by an immunohistological technique. Using a(More)
It is known that k tapes are no better than two tapes for nondeterministic machines. We show here that two tapes are better than one. In fact, we show that two pushdown stores are better than one tape. Also, k tapes are no better than two for nondeterministic reversal-bounded machines. We show here that two tapes are better than one for such machines. In(More)
We introduce new techniques for deriving lower bounds on the message complexity in asynchronous distributed computation. These techniques combine the choice of specific patterns of communication delays and crossing sequence arguments with consideration of the speed of propagation of messages, together with careful counting of messages in different parts of(More)