#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1965

2016

- This year (0)
- Last 5 years (8)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

While randomized online algorithms have access to a sequence of uniform random bits, deterministic online algorithms with advice have access to a sequence of advice bits, i.e., bits that are set by an all-powerful oracle prior to the processing of the request sequence. Advice bits are at least as helpful as random bits, but how helpful are they? In this… (More)

- Marc P. Renault, Adi Rosén
- Theory of Computing Systems
- 2011

We consider the model of online computation with advice (Emek et al., Theor. Comput. Sci. 412(24): 2642–2656, 2011). In particular, we study the k-server problem under this model. We prove three upper bounds for this problem. First, we show a $\lceil\frac{\lceil\log k\rceil}{b-2}\rceil$ -competitive online algorithm for general metric spaces with b bits of… (More)

- Marc P. Renault, Adi Rosén, Rob van Stee
- Theor. Comput. Sci.
- 2015

We consider the setting of online computation with advice and study the bin packing problem and a number of scheduling problems. We show that it is possible, for any of these problems, to arbitrarily approach a competitive ratio of 1 with only a constant number of bits of advice per request. For the bin packing problem, we give an online algorithm with… (More)

- Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee
- J. Scheduling
- 2013

In the reordering buffer management problem, a sequence of colored items arrives at a service station to be processed. Each color change between two consecutively processed items generates some cost. A reordering buffer of capacity k items can be used to preprocess the input sequence in order to decrease the number of color changes. The goal is to find a… (More)

In this paper, we study the advice complexity of the online bin packing problem. In this well-studied setting, the online algorithm is supplemented with some additional information concerning the input. We improve upon both known upper and lower bounds of online algorithms for this problem. On the positive side, we first provide a relatively simple… (More)

- Marc P. Renault
- 2016

This paper studies the problem of maximizing the number of items packed into n bins, known as the dual bin packing problem, in the advice per request model. In general, no online algorithm has a constant competitive ratio for this problem. An online algorithm with 1 bit of advice per request is shown to be 3/2-competitive. Next, for 0 < ε < 1/2, an online… (More)

- Emily Copeland, Nisa K E Renault, +7 authors Wenda L. Greer
- Journal of gastroenterology and hepatology
- 2013

BACKGROUND AND AIM
Our objective was to identify the molecular genetic basis of an Alagille-like condition not linked to JAG1 or NOTCH2 in two related sibships.
METHODS
Because of common ancestry, and an autosomal recessive mode of inheritance, it was hypothesized that all affected and no unaffected individuals would be homozygous for the same haplotype… (More)

- Alejandro López-Ortiz, Marc P. Renault, Adi Rosén
- STACS
- 2015

We consider the list update problem as defined in the seminal work on competitive analysis by Sleator and Tarjan [12]. In this problem, a sequence of requests, consisting of items to access in a linked list, is given. After an item is accessed it can be moved to any position forward in the list at no cost (free exchange), and, at any time, any two adjacent… (More)

- Nisa K E Renault, Marc P. Renault, Emily Copeland, Robin E Howell, Wenda L. Greer
- Journal of human genetics
- 2011

The gene dosage inequality between females with two X-chromosomes and males with one is compensated for by X-chromosome inactivation (XCI), which ensures the silencing of one X in every somatic cell of female mammals. XCI in humans results in a mosaic of two cell populations: those expressing the maternal X-chromosome and those expressing the paternal… (More)

- Marc P. Renault
- Revue de tuberculose et de pneumologie
- 1965