Concept

Sorting network

Related publications (32)

Calibration method and system

The present invention concerns a method for calibrating an array of receivers (ri), each receiver being configured for receiving a signal transmitted by at least one transmitter (si), and echoes of the transmitted signal as reflected by one or more reflect ...

2014

Tight Bounds for Asynchronous Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

This article presents the first tight bounds on the time complexity of shared-memory renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct identifiers from a small namespace. We first prove an individual ...

Association for Computing Machinery2014

Cracking The Complexity Of Fixed-Point Refinement In Complex Wireless Systems

Paolo Ienne, David Novo Bruna

Fixed-point arithmetic leads to efficient implementations. However, the optimization process required to size each of the implementation signals can be prohibitively complex. In this paper, we introduce a new divide-and-conquer method that is able to appro ...

Ieee2013

Randomized versus Deterministic Implementations of Concurrent Data Structures

Dan Alistarh

One of the key trends in computing over the past two decades has been increased distribution, both at the processor level, where multi-core architectures are now the norm, and at the system level, where many key services are currently distributed overmulti ...

EPFL2012

Phosphoinositides in Golgi Complex Function

The Golgi complex is a ribbon-like organelle composed of stacks of flat cisternae interconnected by tubular junctions. It occupies a central position in the endomembrane system as proteins and lipids that are synthesized in the endoplasmic reticulum (ER) p ...

2012

Sorting Live Stem Cells Based on Sox2 mRNA Expression

Matthias Lütolf, Peter Frey, Jeffrey Alan Hubbell, Hans Mattias Larsson, Seung Tae Lee

While cell sorting usually relies on cell-surface protein markers, molecular beacons (MBs) offer the potential to sort cells based on the presence of any expressed mRNA and in principle could be extremely useful to sort rare cell populations from primary i ...

Public Library of Science2012

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

We give two new randomized algorithms for tight renaming, both of which work against an adaptive adversary. The first uses repeated sampling over a sequence of arrays of decreasing size to assign unique names to each of

n

processes with step complexity $ ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

Sorting signed permutations by inversions in O(nlogn) time

Bernard Moret, Yu Lin, Vaibhav Rajan, Krister Swenson

The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nearly 20 years. After the initial breakthrough of Hannenhalli and Pevzner, who gave the first polynomial-time algorithm for sorting signed permutations by inv ...

2010

Cell sorting by dielectrophoresis for evaluation of lysis efficiency in continuous flow

Philippe Renaud, Niccolo Piacentini

This paper reports on a device capable of electrical cell lysis and evaluation of lysis efficiency in continuous flow using dielectrophoretic cell sorting. The device uses an innovative design, called liquid electrodes, to perform both cell lysis and cell ...

2010

A Weighting Scheme for Enhancing Community Detection in Networks

Martin Hasler, Alireza Khadivi

Many algorithms have recently been proposed for finding communities in networks. By definition, a community is a subset of vertices with a high number of connections among the vertices, but only few connections with other vertices. The worst drawback of mo ...

IEEE2010

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.

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

n

processes with step complexity $ ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011