#### Filter Results:

- Full text PDF available (11)

#### Publication Year

1988

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jean Duprat, Jean-Michel Muller
- IEEE Trans. Computers
- 1993

After a brief survey on the CORDIC algorithm, we give some new results which enable fast and easy signeddigit implementation of CORDIC, without modifying the basic iteration step. A slight modification would make it possible to use carry save representation of numbers, instead of signed-digit one. Our method, called branching CORDIC method, consists of… (More)

To determine the mechanisms governing the last deglaciation and the sequence of events that lead to deglaciation, it is important to obtain a temporal framework that applies to both continental and marine climate records. Radiocarbon dating has been widely used to derive calendar dates for marine sediments, but it rests on the assumption that the 'apparent… (More)

- Jean-Claude Bajard, Jean Duprat, Sylvanus Kla, Jean-Michel Muller
- J. Parallel Distrib. Comput.
- 1994

- Jean Duprat, E . Dobrica, +8 authors François Robert
- Science
- 2010

Primitive interplanetary dust is expected to contain the earliest solar system components, including minerals and organic matter. We have recovered, from central Antarctic snow, ultracarbonaceous micrometeorites whose organic matter contains extreme deuterium (D) excesses (10 to 30 times terrestrial values), extending over hundreds of square micrometers. We… (More)

- Luc Moreau, Jean Duprat
- Acta Informatica
- 2001

Distributed reference counting is a general purpose technique, which may be used, e.g., to detect termination of distributed programs or to implement distributed garbage collection. We present a distributed reference counting algorithm and a mechanical proof of correctness carried out using the proof assistant Coq. The algorithm is formalised by an abstract… (More)

- Michel Cosnard, Jean Duprat, Afonso Ferreira
- Theor. Comput. Sci.
- 1989

- Jean Duprat, Yvan Herreros, Sylvanus Kla
- IEEE Symposium on Computer Arithmetic
- 1991

- Jean Duprat, Yvan Herreros, Jean-Michel Muller
- IEEE Symposium on Computer Arithmetic
- 1989

- Jean Duprat, Jean-Michel Muller
- J. Parallel Distrib. Comput.
- 1988

- Michel Cosnard, Jean Duprat, Afonso Ferreira
- Inf. Process. Lett.
- 1990

Bounds on sorting and selection in a matrix A = X + Y have been studied for the case where X and Y are two sorted n-vectors of reals. In this paper we construct a special family of such matrices to prove a lower bound of Q(n) for the problem of searching in X+ Y. As an O(n) algorithm for searching exists in the literature, we conclude that the complexity of… (More)