Authors:
BEAME P
BORODIN A
RAGHAVAN P
RUZZO WL
TOMPA M
Citation: P. Beame et al., TIME-SPACE TRADEOFFS FOR UNDIRECTED GRAPH TRAVERSAL BY GRAPH AUTOMATA, Information and computation, 130(2), 1996, pp. 101-129
Citation: Dd. Chinn et al., MINIMAL ADAPTIVE ROUTING ON THE MESH WITH BOUNDED QUEUE SIZE, Journal of parallel and distributed computing, 34(2), 1996, pp. 154-170
Citation: J. Buss et M. Tompa, LOWER BOUNDS ON UNIVERSAL TRAVERSAL SEQUENCES BASED ON CHAINS OF LENGTH-5, Information and computation, 120(2), 1995, pp. 326-329
Citation: P. Tiwari et M. Tompa, A DIRECT VERSION OF SHAMIR AND SNIR LOWER BOUNDS ON MONOTONE CIRCUIT DEPTH, Information processing letters, 49(5), 1994, pp. 243-248