Publications related to Internet censorship circumvention

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

On the liveness of transactional memory

Rachid Guerraoui, Michal Kapalka, Victor Bushkov

Despite the large amount of work on Transactional Memory (TM), little is known about how much liveness it could provide. This paper presents the first formal treatment of the question. We prove that no TM implementation can ensure local progress, the analo ...

ACM Press2012

On the Liveness of Transactional Memory

Rachid Guerraoui, Michal Kapalka, Victor Bushkov

2011

Enhancement of Geomatics Education by Using Internet Based Techniques

Pierre-Yves Gilliéron, Bertrand Merminod, Arnaud Deshogues

The Swiss Federal Institute of Technology in Lausanne (EPFL) has introduced the Moodle Learning Management System (LMS) in 2005. Since then, the number of teachers and users has increased rapidly. With more than 350 active courses hosted on Moodle for this ...

2010

Storing and Indexing Spatial Data in P2P Systems

The peer-to-peer (P2P) paradigm has become very popular for storing and sharing information in a totally decentralized manner. At first, research focused on P2P systems that host 1D data. Nowadays, the need for P2P applications with multidimensional data h ...

Institute of Electrical and Electronics Engineers2009

Self-organized fault-tolerant routing in peer-to-peer overlays

Karl Aberer, Wojciech Galuba, Zoran Despotovic

In sufficiently large heterogeneous overlays message loss and delays are likely to occur. This has a significant impact on overlay routing, especially on longer paths. The existing solutions to this problem rely on message redundancy to mask the loss and d ...

IEEE2009

Scalable Peer-to-Peer Web Retrieval with Highly Discriminative Keys

Karl Aberer, Martin Rajman, Vinh Toan Luu, Ivana Podnar, Fabius Klemm

The suitability of peer-to-peer (P2P) approaches for full-text Web retrieval has recently been questioned because of the claimed unacceptable bandwidth consumption induced by retrieval from very large document collections. In this contribution we formalize ...

IEEE2007

Efficient and Adjustable Recipient Anonymity in Mobile Ad Hoc Networks

Panagiotis Papadimitratos, Reza Shokri, Amir Nayyeri

The privacy of users of mobile devices has been at stake, with emerging systems based on the mobile ad hoc networking technology raising additional concerns. The establishment of a connection between two nodes could readily reveal information to an eavesdr ...

2007

Message Passing in Semantic Peer-to-Peer Overlay Networks

Karl Aberer, Philippe Cudré-Mauroux

Peer-to-Peer (P2P) systems rely on machine-to-machine ad-hoc communications to offer services to a community. Contrary to the classical client-server architecture, P2P systems consider all peers, i.e., all nodes participating in the network, as being equal ...

2007

Internet censorship circumvention

Graph Chatbot

Chat with Graph Search

On the liveness of transactional memory

On the Liveness of Transactional Memory

Enhancement of Geomatics Education by Using Internet Based Techniques

Verifiable Network-Performance Measurements

Verifiable Network-Performance Measurements

Storing and Indexing Spatial Data in P2P Systems

Self-organized fault-tolerant routing in peer-to-peer overlays

Scalable Peer-to-Peer Web Retrieval with Highly Discriminative Keys

Efficient and Adjustable Recipient Anonymity in Mobile Ad Hoc Networks

Message Passing in Semantic Peer-to-Peer Overlay Networks

Enhancement of Geomatics Education by Using Internet Based Techniques

Verifiable Network-Performance Measurements

Scalable Peer-to-Peer Web Retrieval with Highly Discriminative Keys

Storing and Indexing Spatial Data in P2P Systems

Self-organized fault-tolerant routing in peer-to-peer overlays

On the Liveness of Transactional Memory

Message Passing in Semantic Peer-to-Peer Overlay Networks

On the liveness of transactional memory

Verifiable Network-Performance Measurements

Efficient and Adjustable Recipient Anonymity in Mobile Ad Hoc Networks