External sorting

Formal sciences
Theoretical computer science
Algorithms and data structures
Analysis of algorithms

About
Privacy
Disclaimer

Graph Chatbot

Related publications (29)

Page 2 of 2

Clustering on Multi-Layer Graphs via Subspace Analysis on Grassmann Manifolds

Pascal Frossard, Pierre Vandergheynst, Xiaowen Dong

Relationships between entities in datasets are often of multiple types, which can naturally be modeled by a multi-layer graph; a common vertex set represents the entities and the edges on different layers capture different types of relationships between th ...

2013

Advantageous State Merging During Symbolic Analysis

George Candea, Johannes Kinder, Volodymyr Kuznetsov, Stefan Bucur

A determination is made regarding whether to merge two symbolic analysis states. A first state corresponds to a first path through a program to a program location and a second state corresponds to a second path through the program to the program location. ...

2013

The RADO approach to Quality-Driven Service Composition - Approximating the Pareto-Frontier in Polynomial Time

Boi Faltings, Immanuel Trummer

In Quality-Driven Service Composition, tasks from an ab- stract work ow are assigned to concrete services such that work ow QoS are optimized. The following three proper- ties are desirable for a corresponding algorithm. First, the run time is ideally boun ...

2012

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

Sorting Live Stem Cells Based on Sox2 mRNA Expression

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

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

A Hybrid HW-SW Approach for Intermittent Error Mitigation in Streaming-Based Embedded Systems

David Atienza Alonso

Recent advances in process technology augment the systems-on-chip (SoCs) functionality per unit area with the substantial decrease of device features. However, features abatement triggers new reliability issues such as the single-event multi-bit upset (SMU ...

ACM and IEEE Press2012

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

Separation of platelets from other blood cells in continuous-flow by dielectrophoresis field-flow-fractionation

Philippe Renaud, Niccolo Piacentini

We present a microfluidic device capable of separating platelets from other blood cells in continuous flow using dielectrophoresis field-flow-fractionation. The use of hydrodynamic focusing in combination with the application of a dielectrophoretic force a ...

American Institute of Physics2011

Sorting signed permutations by inversions in O(nlogn) time

Bernard Moret, Yu Lin, Krister Swenson, Vaibhav Rajan

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