EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 21 / No 3 (1987) RAIRO-Theor. Inf. Appl., 21 3 (1987) 223-244 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 21, Number 3, 1987
Page(s) 223 - 244
DOI https://doi.org/10.1051/ita/1987210302231
Published online 01 February 2017
  1. 1.B. AWERBUCH, A New Distributed Depth-First Search Algorithm, Inf. Proc. Letters, vol. 20, avril 1985, p. 147-150. [Zbl: 0573.68013] [Google Scholar]
  2. 2.P. A. BERNSTEINetM. GOODMAN, Concurrency Control in Distributed Data Base Systems, A.C.M., Computing Surveys, vol. 13, n° 2, juin 1981, p. 185-201. [MR: 642091] [Google Scholar]
  3. 3.K. M. CHANDYetJ. MISRA, Distributed Computing on Graphs: Shortest Paths Algorithms, Comm. A.C.M., vol. 25, n° 11, novembre 1982, p. 833-837. [MR: 691758] [Zbl: 0491.68064] [Google Scholar]
  4. 4.K. M. CHANDY, J. MISRAetJ. HAAS, Distributed Deadlock Detection, A.C.M. T.O.C.S., vol. 1, n° 2, mai 1983, p. 144-156. [Google Scholar]
  5. 5.E. J. CHANGetR. ROBERTS, An Improved Algorithm for Decentralized Extrema-Finding in Circular Configurations of Processors, Comm. A.C.M. vol. 22, n° 5, mai 1979, p. 281-283. [Zbl: 0394.68023] [Google Scholar]
  6. 6. T. CHEUNG, Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation, I.E.E.E. Trans. on soft. Eng., vol. SE9, n° 4, juillet 1983, p. 504-512. [Zbl: 0513.68066] [Google Scholar]
  7. 7. E. W. DIJKSTRA et C. S. SHOLTEN, Terminaison Detection for Diffusing Computations, Inf. Proc. Letters, vol. 11, n° 1, août 1980, p. 1-4. [Zbl: 0439.68039] [Google Scholar]
  8. 8. D. DOLEV, M. KLAWE et M. RODEH, An O (n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle, Journal of Algorithms, vol. 3, 1982, p. 245-260. [MR: 668088] [Zbl: 0493.68074] [Google Scholar]
  9. 9. N. FRANCEZ et M. RODEH, Achieving Distributed Terminaison Without Freezing, I.E.E.E. Trans, on Soft. Eng., vol. SE 8, n° 3, mai 1982, p. 287-292. [Zbl: 0478.68024] [Google Scholar]
  10. 10. W. R. FRANKLIN, On an Improved Algorithm for Decentralized Extrema-Finding in Circular Configurations of Processors, Comm. A.C.M. vol. 25, n° 5, mai 1982. p. 336-337. [Google Scholar]
  11. 11. H. GARCIA-MOLINA, Elections in a Distributed Computing System, I.E.E.E. Trans. on Computers, vol. C31, n° 1, janvier 1981, p. 48-59. [Google Scholar]
  12. 12. J. N. GRAY, Notes on Data Base Operating Systems, L.N.C.S., n° 68, Springer-Verlag, 1978, p. 393-481. [Google Scholar]
  13. 13. T. HERMAN et K. M. CHANDY, On Distributed Search, Inf. Processing Letters, vol. 21, 1985, p. 129-133. [MR: 812158] [Zbl: 0582.68037] [Google Scholar]
  14. 14. D. S. HIRSCHBERG et J. B. SINCLAIR, Decentralized Extrema Finding in Circular Configurations of Processors, Comm. A.C.M., vol. 23, n° 11, novembre 1980, p. 627-628. [MR: 593048] [Zbl: 0444.68022] [Google Scholar]
  15. 15. J. M. HELARY, A. MADDI et M. RAYNAL, Controlling Knowledge Transfers in Distributed Algorithms: Application to Deadlock Detection, Rapport de recherche I.N.R.I.A., n° 493, mars 1986, 28 p. [Google Scholar]
  16. 16. J. M. HELARY, A. MADDI et M. RAYNAL, Calcul distribué d'un extrêmum et du routage associé dans un réseau quelconque, Rapport de recherche I.N.R.I.A., n° 516, avril 1986, 36 p. A paraître dans Computer journal 1988. [Google Scholar]
  17. 17. J. M. HELARY, N. PLOUZEAU et M. RAYNAL, A Distributed Algorithm for Mutual Exclusion in an Arbitrary Network, Rapport de recherche I.N.R.I.A. n° 496, mars 1986, 15 p. [Zbl: 0648.68032] [Google Scholar]
  18. 18. C. JARD, J. F. MONIN et R. GROZ, VEDA: a Software Simulator for the Validation of Protocol Specifications, C.O.M.N.E.T., 1985, Hongrie, octobre 1985. [Google Scholar]
  19. 19. E. KORACH, S. MORAN et S. ZAKS, Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors, Proc. of the 3rd A.CM. conf. on principles of distributed Computing, août 1984, p. 199-207. [Google Scholar]
  20. 20. G. LE LANN, Distributed Systems: Towards a Formal Approach, I.F.I.P. Congres, Toronto, août 1977, p. 155-160. [Google Scholar]
  21. 21. J. MISRA et K. M. CHANDY, A Distributed Graph Algorithm: Knot Detection, A.C.M. T.O.P.L.A.S., vol. 4, n° 4, octobre 1982, p. 678-680. [Zbl: 0489.68061] [Google Scholar]
  22. 22. J. MISRA et K. M. CHANDY, Terminaison Detecting of Diffusing Computations in C.S.P., A.C.M. T.O.P.L.A.S., vol. 4, n° 1, janvier 1982, p. 37-43. [Zbl: 0479.68025] [Google Scholar]
  23. 23. J. A. PACHL, E. KORACH et D. ROTEM, Lower Bounds for Distributed Maximum Finding Algorithms, Journal of the A.C.M., vol. 31, n° 4, octobre 1984, p. 905-918. [MR: 819171] [Zbl: 0628.68046] [Google Scholar]
  24. 24. G. L. PETERSON, An O (n log n) Unidirectional Algorithm for the Circular Extrema Problem, A.C.M. T.O.P.L.A.S., vol. 4, n° 4, octobre 1982, p. 758-762. [Zbl: 0489.68040] [Google Scholar]
  25. 25. J. PETERSON et A. SILBERSCHATZ, Operating System Concepts, Addison Wesley, 1983, 548 p. [Zbl: 0758.68023] [Google Scholar]
  26. 26. M. RAYNAL, Algorithmes distribués et protocoles, Eyrolles, septembre 1985, 144 p. [Google Scholar]
  27. 27. F. D. SCHNEIDE, D. GRIES et R. SCHLICHTING, Fault Tolerant Broadcasts, Science of Programming, vol. 4, n° 1, 1984, p. 1-15. [MR: 747296] [Zbl: 0534.68019] [Google Scholar]
  28. 28. A. SEGALL, Distributed Network Protocols, I.E.E.E. Trans. on Inf. Theory, vol. IT29, 1, janvier 1983, p. 23-35. [MR: 711275] [Zbl: 0531.94026] [Google Scholar]
  29. 29. R. H. THOMAS, A Majority Consensus Approach to Concurrency Controlfor Multiple Copy Databases, A.C.M. Trans. on Database Systems, vol. 4, n° 2, juin 1979, p. 180-209. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.