Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. P. Beame, M. Kutyłowski, and M. Kik, Information Broadcasting by exclusive-read PRAMs, Parallel Processing Letters 1 & 2 (1994) 159–169.
2. G. Belting, Untere Schranken für die Berechnung von Booleschen Funktionen in vollständigen Prozessornetzwerken im Telefon-und Telegraf-Modus, Diplomarbeit, Universität-Gesamthochschule-Paderborn, Paderborn, 1994.
3. S. Cook, C. Dwork, and R. Reischuk, Upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM J. Comput. 15 (1986) 87–97.
4. M. Dietzfelbinger, Gossiping and broadcasting versus computing functions in networks, ECCC (http://www.eccc.uni-trier.de/eccc/), Report TR96-052, 1996.
5. M. Dietzfelbinger, M. Kutyłowski, and R. Reischuk, Exact time bounds for computing Boolean functions on PRAMs without simultaneous writes, in: Proc. 2nd Annual ACM Symp. on Parallel Algorithms and Architectures, 1990, pp. 125–135.