- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c35 |      | Eric Brier, Quentin Fortier, Roman Korkikian, K. W. Magld, David Naccache, Guilherme Ozari de Almeida, Adrien Pommellet, A. H. Ragab, Jean Vuillemin: Defensive Leakage Camouflage. CARDIS 2012: 277-295 |
| i1 | | Eric Brier, Quentin Fortier, Roman Korkikian, K. W. Magld, David Naccache, Guilherme Ozari de Almeida, Adrien Pommellet, A. H. Ragab, Jean Vuillemin: Defensive Leakage Camouflage. IACR Cryptology ePrint Archive 2012: 728 (2012) |
| 2009 | ||
| c34 | | Jean Vuillemin: Efficient Data Structure and Algorithms for Sparse Integers, Sets and Predicates. IEEE Symposium on Computer Arithmetic 2009: 7-14 |
| c33 | | Jean Vuillemin, Nicolas Gama: Compact Normal Form for Regular Languages as Xor Automata. CIAA 2009: 24-33 |
| 2006 | ||
| c32 | | |
| 2004 | ||
| c31 | | |
| 2003 | ||
| c30 | | |
| 2000 | ||
| c29 | | Jean Vuillemin: Finite Digital Synchronous Circuits Are Characterized by 2-Algebraic Truth Tables. ASIAN 2000: 1-12 |
| 1999 | ||
| c28 | | Alan Marshall, Tony Stansfield, Igor Kostarnov, Jean Vuillemin, Brad L. Hutchings: A Reconfigurable Arithmetic Array for Multimedia Application. FPGA 1999: 135-143 |
| 1998 | ||
| c27 | | |
| 1996 | ||
| j22 | | 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) |
| j21 | | 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 | ||
| c26 | | Laurent Moll, Jean Vuillemin, Philippe Boucard: High-Energy Physics on DECPeRLe-1 Programmable Active Memory. FPGA 1995: 47-52 |
| 1994 | ||
| j20 | | |
| c25 | | Marc Daumas, Jean-Michel Muller, Jean Vuillemin: Implementing On Line Arithmetic on PAM. FPL 1994: 196-207 |
| c24 | | |
| 1993 | ||
| c23 | | Mark Shand, Jean Vuillemin: Fast implementations of RSA cryptography. IEEE Symposium on Computer Arithmetic 1993: 252-259 |
| 1992 | ||
| c22 | | Patrice Bertin, Didier Roncin, Jean Vuillemin: Programmable Active Memories: A Performance Assessment. Heinz Nixdorf Symposium 1992: 119-130 |
| 1991 | ||
| c21 | | Jean Vuillemin: Constant time arbitrary length synchronous binary counters. IEEE Symposium on Computer Arithmetic 1991: 180-183 |
| 1990 | ||
| j19 | | Franco P. Preparata, Jean Vuillemin: Practical Cellular Dividers. IEEE Trans. Computers 39(5): 605-614 (1990) |
| j18 | | Jean Vuillemin: Exact Real Computer Arithmetic with Continued Fractions. IEEE Trans. Computers 39(8): 1087-1105 (1990) |
| c20 | | Mark Shand, Patrice Bertin, Jean Vuillemin: Hardware Speedups in Long Integer Multiplication. SPAA 1990: 138-145 |
| 1988 | ||
| c19 | | Jean Vuillemin: Exact Real Computer Arithmetic with Continued Fractions. LISP and Functional Programming 1988: 14-27 |
| 1986 | ||
| j17 | | Philippe Flajolet, Claude Puech, Jean Vuillemin: The analysis of simple list structures. Inf. Sci. 38(2): 121-146 (1986) |
| 1983 | ||
| j16 | | Jean Vuillemin: A Combinatorial Limit to the Computing Power of VLSI Circuits. IEEE Trans. Computers 32(3): 294-300 (1983) |
| j15 | | Gérard M. Baudet, Franco P. Preparata, Jean Vuillemin: Area-Time Optimal VLSI Circuits for Convolution. IEEE Trans. Computers 32(7): 684-688 (1983) |
| c18 | | Leonidas J. Guibas, Jean Vuillemin: On fast binary addition in MDS Technologies. IEEE Symposium on Computer Arithmetic 1983: 22 |
| 1981 | ||
| j14 | | Franco P. Preparata, Jean Vuillemin: The Cube-Connected Cycles: A Versatile Network for Parallel Computation. Commun. ACM 24(5): 300-309 (1981) |
| c17 | | Franco P. Preparata, Jean Vuillemin: Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform. ICALP 1981: 29-40 |
| 1980 | ||
| j13 | | |
| j12 | | Franco P. Preparata, Jean Vuillemin: Area-Time Optimal VLSI Networks for Multiplying Matrices. Inf. Process. Lett. 11(2): 77-80 (1980) |
| j11 | | Jean-Claude Raoult, Jean Vuillemin: Operational and Semantic Equivalence Between Recursive Programs. J. ACM 27(4): 772-796 (1980) |
| j10 | | Philippe Flajolet, Jean Françon, Jean Vuillemin: Sequence of Operations Analysis for Dynamic Data Structures. J. Algorithms 1(2): 111-141 (1980) |
| c16 | | Jean Vuillemin: A Combinatorial Limit to the Computing Power of V.L.S.I. Circuits (Extended Abstract). FOCS 1980: 294-300 |
| c15 | | |
| 1979 | ||
| j9 | | Philippe Flajolet, Jean-Claude Raoult, Jean Vuillemin: The Number of Registers Required for Evaluating Arithmetic Expressions. Theor. Comput. Sci. 9: 99-125 (1979) |
| c14 | | Franco P. Preparata, Jean Vuillemin: The Cube-Connected-Cycles: A Versatile Network for Parallel Computation (Extended Abstract). FOCS 1979: 140-147 |
| c13 | | Philippe Flajolet, Jean Françon, Jean Vuillemin: Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version). FOCS 1979: 183-195 |
| c12 | | Philippe Flajolet, Jean Françon, Jean Vuillemin: Computing Integrated Costs of Sequences of Operations with Application to Dictionaries. STOC 1979: 49-61 |
| 1978 | ||
| j8 | | Jean Vuillemin: A Data Structure for Manipulating Priority Queues. Commun. ACM 21(4): 309-315 (1978) |
| c11 | | Jean Françon, G. Viennot, Jean Vuillemin: Description and Analysis of an Efficient Priority Queue Representation. FOCS 1978: 1-7 |
| c10 | | Jean-Claude Raoult, Jean Vuillemin: Operational and Semantic Equivalence between Recursive Programs. STOC 1978: 75-85 |
| 1977 | ||
| j7 | | Jean Vuillemin: Comment Verifier l'Associativite d'une Table de Groupe. Theor. Comput. Sci. 4(1): 77-82 (1977) |
| c9 | | Philippe Flajolet, Jean-Claude Raoult, Jean Vuillemin: On the Average Number of Registers Required for Evaluating Arithmetic Expressions. FOCS 1977: 196-205 |
| 1976 | ||
| j6 | | Bruno Courcelle, Jean Vuillemin: Completeness Results for the Equivalence of Recursive Schemas. J. Comput. Syst. Sci. 12(2): 179-197 (1976) |
| j5 | | Ronald L. Rivest, Jean Vuillemin: On Recognizing Graph Properties from Adjacency Matrices. Theor. Comput. Sci. 3(3): 371-384 (1976) |
| 1975 | ||
| c8 | | Ronald L. Rivest, Jean Vuillemin: A Generalization and Proof of the Aanderaa-Rosenberg Conjecture. STOC 1975: 6-11 |
| 1974 | ||
| j4 | | Jean Vuillemin: Correct and Optimal Implementations of Recursion in a Simple Programming Language. J. Comput. Syst. Sci. 9(3): 332-354 (1974) |
| c7 | | 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 |
| c6 |  | Laurent Hyafil, F. Prusker, Jean Vuillemin: Design of Optimal Merge on Direct Access Devices. IFIP Congress 1974: 979-982 |
| c5 | | 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 |
| c4 | | Bruno Courcelle, Jean Vuillemin: Semantics and Axiomatics of a Simple Recursive Language. STOC 1974: 13-26 |
| c3 | | Laurent Hyafil, F. Prusker, Jean Vuillemin: An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended Abstract). STOC 1974: 216-229 |
| 1973 | ||
| j3 | | |
| j2 | | Zohar Manna, Stephen Nes, Jean Vuillemin: Inductive Methods for Proving Properties of Programs. Commun. ACM 16(8): 491-502 (1973) |
| c2 | | Jean Vuillemin: Correct and Optimal Implementations of Recursion in a Simple Programming Language. STOC 1973: 224-239 |
| 1972 | ||
| j1 | | Zohar Manna, Jean Vuillemin: Fix Point Approach to the Theory of Computation. Commun. ACM 15(7): 528-536 (1972) |
| c1 | | |
Colors in the list of coauthors
Last update Fri May 24 17:50:26 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page