Efficient distributed algorithms by using the archimedean time assumption
Paul Spirakis, Basil Tampakas (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “A proof of protocol correctness”
Efficient distributed algorithms by using the archimedean time assumption
A partially persistent data structure for the set-union problem
C. Gaibisso, G. Gambosi, M. Talamo (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
An application of -ary trees to the design of data structures for geometric searching problems
M. Talamo, G. Gambosi (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Relational data base design using refinement rules
C. Batini, A. d'Atri (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
An Overview of Some Truth Maintenance Systems
Mladen Stanojević, Dušan Velašević (1995)
The Yugoslav Journal of Operations Research
Similarity:
A Distributed Power Management Design Based on MOST Networks
Yushan Jin, Ruikai Liu, Xingran He, Yongping Huang (2011)
Computer Science and Information Systems
Similarity:
A heuristic method for the estimation of the project duration in a stochastic network scheduling
A. C. Garavelli, P. Pontrandolfo (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
An Improved Node Localization Algorithm Based on DV-Hop for Wireless Sensor Networks
Qingji Qian, Xuanjing Shen, Haipeng Chen (2011)
Computer Science and Information Systems
Similarity:
Implementing term rewriting by jungle evaluation
Berthold Hoffmann, Detlef Plump (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: