Publication

Limitations of Partial Compaction: Towards Practical Bounds

Related publications (32)

Graph Chatbot

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.

Heterogeneous Gossip

Rachid Guerraoui, Anne-Marie Kermarrec, Maxime Monod, Davide Frey

Gossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. Load-balancing is inherent in these protocols as the dissemination work is evenly spread among all nodes. Yet, large-scale distribut ...

2009

Gossiping Capabilities

Rachid Guerraoui, Anne-Marie Kermarrec, Maxime Monod, Davide Frey

Gossip-based protocols are now acknowledged as a sound basis to implement collaborative high-bandwidth content dissemination: content location is disseminated through gossip, the actual contents being subsequently pulled. In this paper, we present HEAP, HE ...

2008

On the Role of Low-Energy CP Violation in Leptogenesis

Steve Blanchet

The link between low-energy CP violation and leptogenesis became more accessible with the understanding of flavor effects. However, a definite well-motivated model where such a link occurs was still lacking. Adjoint SU(5) is a simple grand unified theory w ...

2008

Structural properties of amorphous GeSe2

Alfredo Pasquarello

By using first-principles molecular dynamics within density functional theory, we study the structural properties of amorphous GeSe2 at T = 300 K. The amorphous configurations have been obtained via cooling from the liquid state followed by extensive relax ...

2007

Energy-efficient dynamic memory allocators at the middleware level of embedded systems

David Atienza Alonso

The next generation of embedded systems will be dominated by mobile devices, which are able to deliver communications and rich multimedia content anytime, anywhere. The major themes in these ubiquitous computing systems are applications with increased user ...

ACM2006

Fibonacci Heaps

Ali Chekir, Mohamed Slim Slama

Binomial heaps are data structures implemented as a collection of binomial trees, (A binomial tree of order K can be constructed from two trees of order (K-1)). They can implement several methods: Min, Insert, Union, ExtractMin, DecreaseKey and Delete. Fib ...

2006

Lazy Shape Analysis

Dirk Thilo Beyer, Grégory Théoduloz

Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is difficult to find adequate predicate abstractions for the heap. In contrast, shape analy ...

Springer2006

Theory of trapped polaritons in patterned microcavities

Vincenzo Savona, Davide Sarchi, Pierre Lugan

We consider the system of a quantum well embedded in a planar semiconductor microcavity with a shallow circular mesa patterned on top of the cavity spacer. For this system we develop the linear coupling theory of polaritons. We then compute polariton eigen ...

V C H PUBLISHERS, SUITE 909, 220 E 23RD ST, NEW YORK, NY 10010 USA2006

Spectral Methods

Alfio Quarteroni

Since the publication of "Spectral Methods in Fluid Dynamics" 1988, spectral methods have become firmly established as a mainstream tool for scientific and engineering computation. The authors of that book have incorporated into this new edition the many i ...

Springer2006

Anomalies in orbifold field theories

Claudio Scrucca

We study the constraints on models with extra dimensions arising from local anomaly cancellation. We consider a five-dimensional field theory with a U(I) gauge field and a charged fermion, compactified on the orbifold S-1/(Z(2) x Z(2)'). We show that, even ...

2002