Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

9781450307192

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Fault-tolerant spanners

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11 ◽

10.1145/1993806.1993830 ◽

2011 ◽

Cited By ~ 27

Author(s):

Michael Dinitz ◽

Robert Krauthgamer

Keyword(s):

Fault Tolerant

Download Full-text

Time bounds for shared objects in partially synchronous systems

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11 ◽

10.1145/1993806.1993877 ◽

2011 ◽

Cited By ~ 1

Author(s):

Jiaqi Wang ◽

Jennifer Welch ◽

Hyunyoung Lee

Keyword(s):

Synchronous Systems ◽

Shared Objects ◽

Time Bounds

Download Full-text

Tracking distributed aggregates over time-based sliding windows

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11 ◽

10.1145/1993806.1993839 ◽

2011 ◽

Cited By ~ 2

Author(s):

Graham Cormode ◽

Ke Yi

Keyword(s):

Sliding Windows ◽

Over Time

Download Full-text

Securing social networks

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11 ◽

10.1145/1993806.1993874 ◽

2011 ◽

Cited By ~ 3

Author(s):

Michael Backes ◽

Matteo Maffei ◽

Kim Pecina

Keyword(s):

Social Networks

Download Full-text

A tight unconditional lower bound on distributed randomwalk computation

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11 ◽

10.1145/1993806.1993853 ◽

2011 ◽

Cited By ~ 22

Author(s):

Danupon Nanongkai ◽

Atish Das Sarma ◽

Gopal Pandurangan

Keyword(s):

Lower Bound

Download Full-text

On the power of hardware transactional memory to simplify memory management

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11 ◽

10.1145/1993806.1993821 ◽

2011 ◽

Cited By ~ 37

Author(s):

Aleksandar Dragojević ◽

Maurice Herlihy ◽

Yossi Lev ◽

Mark Moir

Keyword(s):

Memory Management ◽

Transactional Memory ◽

Hardware Transactional Memory

Download Full-text

Tight bounds on information dissemination in sparse mobile networks

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11 ◽

10.1145/1993806.1993882 ◽

2011 ◽

Cited By ~ 23

Author(s):

Alberto Pettarin ◽

Andrea Pietracaprina ◽

Geppino Pucci ◽

Eli Upfal

Keyword(s):

Mobile Networks ◽

Information Dissemination

Download Full-text

B-neck

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11 ◽

10.1145/1993806.1993841 ◽

2011 ◽

Cited By ~ 1

Author(s):

Alberto Mozo ◽

Jose Luis López-Presa ◽

Antonio Fernández Anta

Download Full-text

Conflict on a communication channel

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11 ◽

10.1145/1993806.1993855 ◽

2011 ◽

Cited By ~ 10

Author(s):

Valerie King ◽

Jared Saia ◽

Maxwell Young

Keyword(s):

Communication Channel

Download Full-text

A complexity separation between the cache-coherent and distributed shared memory models

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11 ◽

10.1145/1993806.1993822 ◽

2011 ◽

Cited By ~ 2

Author(s):

Wojciech Golab

Keyword(s):

Shared Memory ◽

Distributed Shared Memory ◽

Memory Models

Download Full-text

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Fault-tolerant spanners

Time bounds for shared objects in partially synchronous systems

Tracking distributed aggregates over time-based sliding windows

Securing social networks

A tight unconditional lower bound on distributed randomwalk computation

On the power of hardware transactional memory to simplify memory management

Tight bounds on information dissemination in sparse mobile networks

B-neck

Conflict on a communication channel

A complexity separation between the cache-coherent and distributed shared memory models

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11
Latest Publications