AAAAAA

   
Results: 1-11 |
Results: 11
PROCESSOR-RING COMMUNICATION - A TIGHT ASYMPTOTIC BOUND ON PACKET WAITING-TIMES
Authors: COFFMAN EG KHALE N LEIGHTON FT
Citation: Eg. Coffman et al., PROCESSOR-RING COMMUNICATION - A TIGHT ASYMPTOTIC BOUND ON PACKET WAITING-TIMES, SIAM journal on computing, 27(5), 1998, pp. 1221-1236
ON THE FAULT-TOLERANCE OF SOME POPULAR BOUNDED-DEGREE NETWORKS
Authors: LEIGHTON FT MAGGS BM SITARAMAN RK
Citation: Ft. Leighton et al., ON THE FAULT-TOLERANCE OF SOME POPULAR BOUNDED-DEGREE NETWORKS, SIAM journal on computing, 27(5), 1998, pp. 1303-1333
SECURE SPREAD-SPECTRUM WATERMARKING FOR MULTIMEDIA
Authors: COX IJ KILIAN J LEIGHTON FT SHAMOON T
Citation: Ij. Cox et al., SECURE SPREAD-SPECTRUM WATERMARKING FOR MULTIMEDIA, IEEE transactions on image processing, 6(12), 1997, pp. 1673-1687
WORK-PRESERVING EMULATIONS OF FIXED-CONNECTION NETWORKS
Authors: KOCH RR LEIGHTON FT MAGGS BM RAO SB ROSENBERG AL SCHWABE EJ
Citation: Rr. Koch et al., WORK-PRESERVING EMULATIONS OF FIXED-CONNECTION NETWORKS, Journal of the ACM, 44(1), 1997, pp. 104-147
ON OPTIMAL STRATEGIES FOR CYCLE-STEALING IN NETWORKS OF WORKSTATIONS
Authors: BHATT SN CHUNG FRK LEIGHTON FT ROSENBERG AL
Citation: Sn. Bhatt et al., ON OPTIMAL STRATEGIES FOR CYCLE-STEALING IN NETWORKS OF WORKSTATIONS, I.E.E.E. transactions on computers, 46(5), 1997, pp. 545-557
OPTIMAL EMULATIONS BY BUTTERFLY-LIKE NETWORKS
Authors: BHATT SN CHUNG FRK HONG JW LEIGHTON FT OBRENIC B ROSENBERG AL SCHWABE EJ
Citation: Sn. Bhatt et al., OPTIMAL EMULATIONS BY BUTTERFLY-LIKE NETWORKS, Journal of the ACM, 43(2), 1996, pp. 293-330
SCHEDULING TREE-DAGS USING FIFO QUEUES - A CONTROL-MEMORY TRADE-OFF
Authors: BHATT SN CHUNG FRK LEIGHTON FT ROSENBERG AL
Citation: Sn. Bhatt et al., SCHEDULING TREE-DAGS USING FIFO QUEUES - A CONTROL-MEMORY TRADE-OFF, Journal of parallel and distributed computing, 33(1), 1996, pp. 55-68
SALVAGE-EMBEDDINGS OF COMPLETE TREES
Authors: BHATT SN CHUNG FRK LEIGHTON FT ROSENBERG AL
Citation: Sn. Bhatt et al., SALVAGE-EMBEDDINGS OF COMPLETE TREES, SIAM journal on discrete mathematics, 8(4), 1995, pp. 617-637
PRECONDITIONED, ADAPTIVE, MULTIPOLE-ACCELERATED ITERATIVE METHODS FOR3-DIMENSIONAL 1ST-KIND INTEGRAL-EQUATIONS OF POTENTIAL-THEORY
Authors: NABORS K KORSMEYER FT LEIGHTON FT WHITE J
Citation: K. Nabors et al., PRECONDITIONED, ADAPTIVE, MULTIPOLE-ACCELERATED ITERATIVE METHODS FOR3-DIMENSIONAL 1ST-KIND INTEGRAL-EQUATIONS OF POTENTIAL-THEORY, SIAM journal on scientific computing, 15(3), 1994, pp. 713-735
RANDOMIZED ROUTING AND SORTING ON FIXED-CONNECTION NETWORKS
Authors: LEIGHTON FT MAGGS BM RANADE AG RAO SB
Citation: Ft. Leighton et al., RANDOMIZED ROUTING AND SORTING ON FIXED-CONNECTION NETWORKS, Journal of algorithms, 17(1), 1994, pp. 157-205
DRAWING GRAPHS IN THE PLANE WITH HIGH-RESOLUTION
Authors: FORMANN M HAGERUP T HARALAMBIDES J KAUFMANN M LEIGHTON FT SYMVONIS A WELZL E WOEGINGER G
Citation: M. Formann et al., DRAWING GRAPHS IN THE PLANE WITH HIGH-RESOLUTION, SIAM journal on computing, 22(5), 1993, pp. 1035-1052
Risultati: 1-11 |