AAAAAA

   
Results: 1-11 |
Results: 11
TIGHT BOUNDS ON PARALLEL LIST MARKING
Authors: BHATT SN BILARDI G HERLEY KT PUCCI G RANADE A
Citation: Sn. Bhatt et al., TIGHT BOUNDS ON PARALLEL LIST MARKING, Journal of parallel and distributed computing (Print), 51(2), 1998, pp. 75-88
PROCESSOR-TIME TRADEOFFS UNDER BOUNDED-SPEED MESSAGE PROPAGATION .1. UPPER-BOUNDS
Authors: BILARDI G PREPARATA FP
Citation: G. Bilardi et Fp. Preparata, PROCESSOR-TIME TRADEOFFS UNDER BOUNDED-SPEED MESSAGE PROPAGATION .1. UPPER-BOUNDS, theory of computing systems, 30(6), 1997, pp. 523-546
OPTIMAL-CONTROL DEPENDENCE COMPUTATION AND THE ROMAN CHARIOTS PROBLEM
Authors: PINGALI K BILARDI G
Citation: K. Pingali et G. Bilardi, OPTIMAL-CONTROL DEPENDENCE COMPUTATION AND THE ROMAN CHARIOTS PROBLEM, ACM transactions on programming languages and systems, 19(3), 1997, pp. 462-491
A FRAMEWORK FOR GENERALIZED CONTROL DEPENDENCE
Authors: BILARDI G PINGALI K
Citation: G. Bilardi et K. Pingali, A FRAMEWORK FOR GENERALIZED CONTROL DEPENDENCE, ACM SIGPLAN NOTICES, 31(5), 1996, pp. 291-300
ON BUFFERLESS ROUTING OF VARIABLE-LENGTH MESSAGES IN LEVELED NETWORKS
Authors: BHATT SN BILARDI G PUCCI G RANADE A ROSENBERG AL SCHWABE EJ
Citation: Sn. Bhatt et al., ON BUFFERLESS ROUTING OF VARIABLE-LENGTH MESSAGES IN LEVELED NETWORKS, I.E.E.E. transactions on computers, 45(6), 1996, pp. 714-729
APT - A DATA STRUCTURE FOR OPTIMAL-CONTROL DEPENDENCE COMPUTATION
Authors: PINGALI K BILARDI G
Citation: K. Pingali et G. Bilardi, APT - A DATA STRUCTURE FOR OPTIMAL-CONTROL DEPENDENCE COMPUTATION, ACM SIGPLAN NOTICES, 30(6), 1995, pp. 32-46
HORIZONS OF PARALLEL COMPUTATION
Authors: BILARDI G PREPARATA FP
Citation: G. Bilardi et Fp. Preparata, HORIZONS OF PARALLEL COMPUTATION, Journal of parallel and distributed computing, 27(2), 1995, pp. 172-182
LANGUAGE-LEARNING WITHOUT OVERGENERALIZATION
Authors: KAPUR S BILARDI G
Citation: S. Kapur et G. Bilardi, LANGUAGE-LEARNING WITHOUT OVERGENERALIZATION, Theoretical computer science, 141(1-2), 1995, pp. 151-162
DETERMINISTIC ONLINE ROUTING ON AREA-UNIVERSAL NETWORKS
Authors: BAY P BILARDI G
Citation: P. Bay et G. Bilardi, DETERMINISTIC ONLINE ROUTING ON AREA-UNIVERSAL NETWORKS, Journal of the Association for Computing Machinery, 42(3), 1995, pp. 614-640
DETERMINISTIC SIMULATIONS OF PRAMS ON BOUNDED DEGREE NETWORKS
Authors: HERLEY KT BILARDI G
Citation: Kt. Herley et G. Bilardi, DETERMINISTIC SIMULATIONS OF PRAMS ON BOUNDED DEGREE NETWORKS, SIAM journal on computing, 23(2), 1994, pp. 276-292
A LOWER-BOUND FOR AREA-UNIVERSAL GRAPHS
Authors: BILARDI G CHAUDHURI S DUBHASHI D MEHLHORN K
Citation: G. Bilardi et al., A LOWER-BOUND FOR AREA-UNIVERSAL GRAPHS, Information processing letters, 51(2), 1994, pp. 101-105
Risultati: 1-11 |