| 2006 |
|---|
| 52 | EE | Jean-Baptiste Note,
Mark Shand,
Jean Vuillemin:
Real-Time Video Pixel Matching.
FPL 2006: 1-6 |
| 2004 |
|---|
| 51 | EE | Jean Vuillemin,
Frédéric Béal:
On the BDD of a Random Boolean Function.
ASIAN 2004: 483-493 |
| 2003 |
|---|
| 50 | EE | Jean Vuillemin:
Digital Algebra and Circuits.
Verification: Theory and Practice 2003: 733-746 |
| 2000 |
|---|
| 49 | EE | Jean Vuillemin:
Finite Digital Synchronous Circuits Are Characterized by 2-Algebraic Truth Tables.
ASIAN 2000: 1-12 |
| 1999 |
|---|
| 48 | EE | Alan Marshall,
Tony Stansfield,
Igor Kostarnov,
Jean Vuillemin,
Brad L. Hutchings:
A Reconfigurable Arithmetic Array for Multimedia Application.
FPGA 1999: 135-143 |
| 1998 |
|---|
| 47 | | Jean Vuillemin:
Reconfigurable Systems: Past and Next 10 Years.
VECPAR 1998: 334-354 |
| 1996 |
|---|
| 46 | EE | Jean Vuillemin,
Patrice Bertin,
Didier Roncin,
Mark Shand,
H. H. Touati,
Philippe Boucard:
Programmable active memories: reconfigurable systems come of age.
IEEE Trans. VLSI Syst. 4(1): 56-69 (1996) |
| 45 | EE | Laurent Moll,
Jean Vuillemin,
Philippe Boucard,
Lars Lundheim:
Real-time high-energy physics applications on DECPeRLe-1 programmable active memory.
VLSI Signal Processing 12(1): 21-33 (1996) |
| 1995 |
|---|
| 44 | EE | Laurent Moll,
Jean Vuillemin,
Philippe Boucard:
High-Energy Physics on DECPeRLe-1 Programmable Active Memory.
FPGA 1995: 47-52 |
| 1994 |
|---|
| 43 | | Marc Daumas,
Jean-Michel Muller,
Jean Vuillemin:
Implementing On Line Arithmetic on PAM.
FPL 1994: 196-207 |
| 42 | | Jean Vuillemin:
On Computing Power.
Programming Languages and System Architectures 1994: 69-86 |
| 41 | | Jean Vuillemin:
On Circuits and Numbers.
IEEE Trans. Computers 43(8): 868-879 (1994) |
| 1993 |
|---|
| 40 | EE | Mark Shand,
Jean Vuillemin:
Fast implementations of RSA cryptography.
IEEE Symposium on Computer Arithmetic 1993: 252-259 |
| 1992 |
|---|
| 39 | | Patrice Bertin,
Didier Roncin,
Jean Vuillemin:
Programmable Active Memories: A Performance Assessment.
Heinz Nixdorf Symposium 1992: 119-130 |
| 1990 |
|---|
| 38 | EE | Mark Shand,
Patrice Bertin,
Jean Vuillemin:
Hardware Speedups in Long Integer Multiplication.
SPAA 1990: 138-145 |
| 37 | | Franco P. Preparata,
Jean Vuillemin:
Practical Cellular Dividers.
IEEE Trans. Computers 39(5): 605-614 (1990) |
| 36 | | Jean Vuillemin:
Exact Real Computer Arithmetic with Continued Fractions.
IEEE Trans. Computers 39(8): 1087-1105 (1990) |
| 1988 |
|---|
| 35 | EE | Jean Vuillemin:
Exact Real Computer Arithmetic with Continued Fractions.
LISP and Functional Programming 1988: 14-27 |
| 1986 |
|---|
| 34 | EE | Philippe Flajolet,
Claude Puech,
Jean Vuillemin:
The analysis of simple list structures.
Inf. Sci. 38(2): 121-146 (1986) |
| 1983 |
|---|
| 33 | | Jean Vuillemin:
A Combinatorial Limit to the Computing Power of VLSI Circuits.
IEEE Trans. Computers 32(3): 294-300 (1983) |
| 32 | | Gérard M. Baudet,
Franco P. Preparata,
Jean Vuillemin:
Area-Time Optimal VLSI Circuits for Convolution.
IEEE Trans. Computers 32(7): 684-688 (1983) |
| 1981 |
|---|
| 31 | | Franco P. Preparata,
Jean Vuillemin:
Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform.
ICALP 1981: 29-40 |
| 30 | | Franco P. Preparata,
Jean Vuillemin:
The Cube-Connected Cycles: A Versatile Network for Parallel Computation.
Commun. ACM 24(5): 300-309 (1981) |
| 1980 |
|---|
| 29 | | Jean Vuillemin:
A Combinatorial Limit to the Computing Power of V.L.S.I. Circuits (Extended Abstract)
FOCS 1980: 294-300 |
| 28 | | Jean-Claude Raoult,
Jean Vuillemin:
Optimal Unbounded Search Strategies.
ICALP 1980: 512-530 |
| 27 | | Jean Vuillemin:
A Unifying Look at Data Structures.
Commun. ACM 23(4): 229-239 (1980) |
| 26 | | Franco P. Preparata,
Jean Vuillemin:
Area-Time Optimal VLSI Networks for Multiplying Matrices.
Inf. Process. Lett. 11(2): 77-80 (1980) |
| 25 | EE | Jean-Claude Raoult,
Jean Vuillemin:
Operational and Semantic Equivalence Between Recursive Programs.
J. ACM 27(4): 772-796 (1980) |
| 24 | | Philippe Flajolet,
Jean Françon,
Jean Vuillemin:
Sequence of Operations Analysis for Dynamic Data Structures.
J. Algorithms 1(2): 111-141 (1980) |
| 1979 |
|---|
| 23 | | Franco P. Preparata,
Jean Vuillemin:
The Cube-Connected-Cycles: A Versatile Network for Parallel Computation (Extended Abstract)
FOCS 1979: 140-147 |
| 22 | | Philippe Flajolet,
Jean Françon,
Jean Vuillemin:
Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version)
FOCS 1979: 183-195 |
| 21 | | Philippe Flajolet,
Jean Françon,
Jean Vuillemin:
Computing Integrated Costs of Sequences of Operations with Application to Dictionaries
STOC 1979: 49-61 |
| 20 | | Philippe Flajolet,
Jean-Claude Raoult,
Jean Vuillemin:
The Number of Registers Required for Evaluating Arithmetic Expressions.
Theor. Comput. Sci. 9: 99-125 (1979) |
| 1978 |
|---|
| 19 | | Jean Françon,
G. Viennot,
Jean Vuillemin:
Description and Analysis of an Efficient Priority Queue Representation
FOCS 1978: 1-7 |
| 18 | | Jean-Claude Raoult,
Jean Vuillemin:
Operational and Semantic Equivalence between Recursive Programs
STOC 1978: 75-85 |
| 17 | | Jean Vuillemin:
A Data Structure for Manipulating Priority Queues.
Commun. ACM 21(4): 309-315 (1978) |
| 1977 |
|---|
| 16 | | Philippe Flajolet,
Jean-Claude Raoult,
Jean Vuillemin:
On the Average Number of Registers Required for Evaluating Arithmetic Expressions
FOCS 1977: 196-205 |
| 15 | | Jean Vuillemin:
Comment Verifier l'Associativite d'une Table de Groupe.
Theor. Comput. Sci. 4(1): 77-82 (1977) |
| 1976 |
|---|
| 14 | | Bruno Courcelle,
Jean Vuillemin:
Completeness Results for the Equivalence of Recursive Schemas.
J. Comput. Syst. Sci. 12(2): 179-197 (1976) |
| 13 | | Ronald L. Rivest,
Jean Vuillemin:
On Recognizing Graph Properties from Adjacency Matrices.
Theor. Comput. Sci. 3(3): 371-384 (1976) |
| 1975 |
|---|
| 12 | | Ronald L. Rivest,
Jean Vuillemin:
A Generalization and Proof of the Aanderaa-Rosenberg Conjecture
STOC 1975: 6-11 |
| 1974 |
|---|
| 11 | | Bruno Courcelle,
Gilles Kahn,
Jean Vuillemin:
Algorithmes d'equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples.
ICALP 1974: 200-213 |
| 10 | | Laurent Hyafil,
F. Prusker,
Jean Vuillemin:
Design of Optimal Merge on Direct Access Devices.
IFIP Congress 1974: 979-982 |
| 9 | | Bruno Courcelle,
Jean Vuillemin:
Semantics and Axiomatics of a Simple Recursive Language
STOC 1974: 13-26 |
| 8 | | Laurent Hyafil,
F. Prusker,
Jean Vuillemin:
An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended Abstract)
STOC 1974: 216-229 |
| 7 | | Bruno Courcelle,
Jean Vuillemin:
Complétude d'un système formel pour prouver l'équivalence de certains schémas récursifs monadiques.
Symposium on Programming 1974: 234-252 |
| 6 | | Jean Vuillemin:
Correct and Optimal Implementations of Recursion in a Simple Programming Language.
J. Comput. Syst. Sci. 9(3): 332-354 (1974) |
| 1973 |
|---|
| 5 | | Jean Vuillemin:
Correct and Optimal Implementations of Recursion in a Simple Programming Language
STOC 1973: 224-239 |
| 4 | | Maurice Schlumberger,
Jean Vuillemin:
Optimal Disk Merge Patterns
Acta Inf. 3: 25-35 (1973) |
| 3 | | Zohar Manna,
Stephen Nes,
Jean Vuillemin:
Inductive Methods for Proving Properties of Programs.
Commun. ACM 16(8): 491-502 (1973) |
| 1972 |
|---|
| 2 | | Zohar Manna,
Jean Vuillemin:
Fixpoint Approach to the Theory of Computation.
ICALP 1972: 273-291 |
| 1 | | Zohar Manna,
Jean Vuillemin:
Fix Point Approach to the Theory of Computation.
Commun. ACM 15(7): 528-536 (1972) |
