output
20052011
most citeduFLIP: Understanding Flash IO Patterns

153 citations

20 papers

cs.SE201140 cited

Modelling and Simulation of Asynchronous Real-Time Systems using Timed Rebeca

Luca Aceto, Matteo Cimini, Anna Ingolfsdottir +3

In this paper we propose an extension of the Rebeca language that can be used to model distributed and asynchronous systems with timing constraints. We provide the formal semantics…

math.CO201114 cited

On the Representability of Line Graphs

Sergey Kitaev, Pavel Salimov, Christopher Severs +1

A graph G=(V,E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x,y) is in E for each x not equal to y. The m…

cs.NI20104 cited

Wireless Scheduling with Power Control

Magnus M. Halldorsson

We consider the scheduling of arbitrary wireless links in the physical model of interference to minimize the time for satisfying all requests. We study here the combined problem of…

cs.LO20101 cited

Proceedings Seventh Workshop on Structural Operational Semantics

Luca Aceto, Paweł Sobociński

Structural operational semantics (SOS) is a technique for defining operational semantics for programming and specification languages. Because of its intuitive appeal and flexibilit…

cs.DS2010

On a game theoretic approach to capacity maximization in wireless networks

Eyjólfur Ingi Ásgeirsson, Pradipta Mitra

We consider the capacity problem (or, the single slot scheduling problem) in wireless networks. Our goal is to maximize the number of successful connections in arbitrary wireless n…

cs.LO20099 cited

Characteristic Formulae for Fixed-Point Semantics: A General Framework

Luca Aceto, Anna Ingolfsdottir, Joshua Sack

The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems a…