AAAAAA

   
Results: 1-14 |
Results: 14
OPTIMAL BROADCAST WITH PARTIAL KNOWLEDGE
Authors: AWERBUCH B CIDON I KUTTEN S MANSOUR Y PELEG D
Citation: B. Awerbuch et al., OPTIMAL BROADCAST WITH PARTIAL KNOWLEDGE, SIAM journal on computing (Print), 28(2), 1999, pp. 512-525
NEW APPROXIMATION GUARANTEES FOR MINIMUM-WEIGHT K-TREES AND PRIZE-COLLECTING SALESMEN
Authors: AWERBUCH B AZAR Y BLUM A VEMPALA S
Citation: B. Awerbuch et al., NEW APPROXIMATION GUARANTEES FOR MINIMUM-WEIGHT K-TREES AND PRIZE-COLLECTING SALESMEN, SIAM journal on computing (Print), 28(1), 1999, pp. 254-262
NEAR-LINEAR TIME CONSTRUCTION OF SPARSE NEIGHBORHOOD COVERS
Authors: AWERBUCH B BERGER B COWEN L PELEG D
Citation: B. Awerbuch et al., NEAR-LINEAR TIME CONSTRUCTION OF SPARSE NEIGHBORHOOD COVERS, SIAM journal on computing (Print), 28(1), 1999, pp. 263-277
DISTRIBUTED PAGING FOR GENERAL NETWORKS
Authors: AWERBUCH B BARTAL Y FIAT A
Citation: B. Awerbuch et al., DISTRIBUTED PAGING FOR GENERAL NETWORKS, Journal of algorithms, 28(1), 1998, pp. 67-104
THE MAINTENANCE OF COMMON DATA IN A DISTRIBUTED SYSTEM
Authors: AWERBUCH B SCHULMAN LJ
Citation: B. Awerbuch et Lj. Schulman, THE MAINTENANCE OF COMMON DATA IN A DISTRIBUTED SYSTEM, Journal of the ACM, 44(1), 1997, pp. 86-103
SLIDE - THE KEY TO POLYNOMIAL END-TO-END COMMUNICATION
Authors: AFEK Y AWERBUCH B GAFNI E MANSOUR Y ROSEN A SHAVIT N
Citation: Y. Afek et al., SLIDE - THE KEY TO POLYNOMIAL END-TO-END COMMUNICATION, Journal of algorithms, 22(1), 1997, pp. 158-186
GLOBALIZING BUSINESS, EDUCATION, CULTURE THROUGH THE INTERNET
Authors: ADAM N AWERBUCH B SLONIM J WEGNER P YESHA Y
Citation: N. Adam et al., GLOBALIZING BUSINESS, EDUCATION, CULTURE THROUGH THE INTERNET, Communications of the ACM, 40(2), 1997, pp. 115-121
LOCAL-MANAGEMENT OF A GLOBAL RESOURCE IN A COMMUNICATION-NETWORK
Authors: AFEK Y AWERBUCH B PLOTKIN S SAKS M
Citation: Y. Afek et al., LOCAL-MANAGEMENT OF A GLOBAL RESOURCE IN A COMMUNICATION-NETWORK, Journal of the ACM, 43(1), 1996, pp. 1-19
FAST DISTRIBUTED NETWORK DECOMPOSITIONS AND COVERS
Authors: AWERBUCH B BERGER B COWEN L PELEG D
Citation: B. Awerbuch et al., FAST DISTRIBUTED NETWORK DECOMPOSITIONS AND COVERS, Journal of parallel and distributed computing, 39(2), 1996, pp. 105-114
23RD SYMPOSIUM ON THE THEORY OF COMPUTING MAY 6-8, 1991 - FOREWORD
Authors: HALPERN J AWERBUCH B BENOR M CHANDRA A FEIGENBAUM J VONZURGATHEN J GUIBAS L PITT L SAKS M SHMOYS D SLEATOR D UPFAL E VAZIRANI U YAO A
Citation: J. Halpern et al., 23RD SYMPOSIUM ON THE THEORY OF COMPUTING MAY 6-8, 1991 - FOREWORD, Journal of computer and system sciences, 50(2), 1995, pp. 189-189
ONLINE TRACKING OF MOBILE USERS
Authors: AWERBUCH B PELEG D
Citation: B. Awerbuch et D. Peleg, ONLINE TRACKING OF MOBILE USERS, Journal of the Association for Computing Machinery, 42(5), 1995, pp. 1021-1058
LOW-DIAMETER GRAPH DECOMPOSITION IS IN NC
Authors: AWERBUCH B BERGER B COWEN L PELEG D
Citation: B. Awerbuch et al., LOW-DIAMETER GRAPH DECOMPOSITION IS IN NC, Random structures & algorithms, 5(3), 1994, pp. 441-452
APPROXIMATE DISTRIBUTED BELLMAN-FORD ALGORITHMS
Authors: AWERBUCH B BARNOY A GOPAL M
Citation: B. Awerbuch et al., APPROXIMATE DISTRIBUTED BELLMAN-FORD ALGORITHMS, IEEE transactions on communications, 42(8), 1994, pp. 2515-2517
ON BUFFER-ECONOMICAL STORE-AND-FORWARD DEADLOCK PREVENTION
Authors: AWERBUCH B KUTTEN S PELEG D
Citation: B. Awerbuch et al., ON BUFFER-ECONOMICAL STORE-AND-FORWARD DEADLOCK PREVENTION, IEEE transactions on communications, 42(11), 1994, pp. 2934-2937
Risultati: 1-14 |