Sequentially consistent versus linearizable counting networks

ISSN： 0178-2770

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

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

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

Timing conditions for linearizability in uniform counting networks

By Lynch N. Shavit N. Shvartsman A. Touitou D.

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

Elsevier

Access to resources Recommend Favorite

On extracting consistent graphs in wireless sensor networks

By Jadliwala Murtuza Duan Qi Xu Jinhui Upadhyaya Shambhu

International Journal of Sensor Networks, Vol. 2, Iss. 3-4, 2007-04 ,pp. : 149-162

Inderscience Publishers

Access to resources Recommend Favorite

Linearizable read/write objects

By Mavronicolas M. Roth D.

Theoretical Computer Science, Vol. 220, Iss. 1, 1999-06 ,pp. : 267-319

Elsevier

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