Skip to main content
padlock icon - secure page this page is secure

Publisher: Elsevier

Volume 68, Number 7, 2008

Editorial Board
pp. IFC-IFC(1)

Favourites:
ADD

Optimal broadcast for fully connected processor-node networks
pp. 887-901(15)
Authors: Träff, J. L.; Ripke, A.

Favourites:
ADD

Decomposable algorithms for nearest neighbor computing
pp. 902-912(11)
Authors: Khedr, A. M.; Salim, A.

Favourites:
ADD

Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
pp. 922-938(17)
Authors: Sinha, K.; Ghose, S.; Srimani, P. K.

Favourites:
ADD

Approximating the traffic grooming problem in tree and star networks
pp. 939-948(10)
Authors: Flammini, M.; Monaco, G.; Moscardelli, L.; Shalom, M.; Zaks, S.

Favourites:
ADD
Favourites:
ADD

Squid: Enabling search in DHT-based systems
pp. 962-975(14)
Authors: Schmidt, C.; Parashar, M.

Favourites:
ADD

Computing all the best swap edges distributively
pp. 976-983(8)
Authors: Flocchini, P.; Pagli, L.; Prencipe, G.; Santoro, N.; Widmayer, P.

Favourites:
ADD

Using asynchrony and zero degradation to speed up indulgent consensus protocols
pp. 984-996(13)
Authors: Wu, W.; Cao, J.; Yang, J.; Raynal, M.

Favourites:
ADD
Favourites:
ADD

Lock-free deques and doubly linked lists
pp. 1008-1020(13)
Authors: Sundell, H. x.; Tsigas, P.

Favourites:
ADD

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more