Timing conditions for linearizability in uniform counting networks

Author： Lynch N.   Shavit N.   Shvartsman A.   Touitou D.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.220, Iss.1, 1999-06, pp. : 67-91

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Triangle counting in large networks: a review

By  

WILEY INTERDISCIPLINARY REVIEWS: DATA MINING AND KNOWLEDGE DISCOVERY (ELECTRONIC), Vol. 8, Iss. 2, 2018-03 ,pp. : n/a-n/a

John Wiley & Sons Inc

Access to resources Recommend Favorite

Proving linearizability with temporal logic

By Bäumler Simon  

Formal Aspects of Computing, Vol. 23, Iss. 1, 2011-01 ,pp. : 91-112

Springer Publishing Company

Access to resources Recommend Favorite

Sequentially consistent versus linearizable counting networks

By Mavronicolas Marios  

Distributed Computing, Vol. 21, Iss. 4, 2008-10 ,pp. : 249-269

Springer Publishing Company

Access to resources Recommend Favorite

Optimizing uniform non-Markov queueing networks

By Zadorozhnyi V.  

Automation and Remote Control, Vol. 71, Iss. 6, 2010-06 ,pp. : 1158-1168

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

MOCUS: moving object counting using ultrasonic sensor networks

By Chen Quanbin   Gao Min   Ma Jian   Zhang Dian   Ni Lionel M.   Liu Yunhao  

International Journal of Sensor Networks, Vol. 3, Iss. 1, 2007-12 ,pp. : 55-65

Inderscience Publishers

Access to resources Recommend Favorite