default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean Vuillemin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c38]Ehsan Aerabi, A. Elhadi Amirouche, Houda Ferradi, Rémi Géraud
, David Naccache, Jean Vuillemin:
The Conjoined Microprocessor. HOST 2016: 67-70- 2015
- [i2]Ehsan Aerabi, A. Elhadi Amirouche, Houda Ferradi, Rémi Géraud, David Naccache, Jean Vuillemin:
The Conjoined Microprocessor. IACR Cryptol. ePrint Arch. 2015: 974 (2015) - 2012
- [c37]Eric Brier, Quentin Fortier, Roman Korkikian, Khalid 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, Khalid W. Magld, David Naccache, Guilherme Ozari de Almeida, Adrien Pommellet, A. H. Ragab, Jean Vuillemin:
Defensive Leakage Camouflage. IACR Cryptol. ePrint Arch. 2012: 728 (2012)
2000 – 2009
- 2009
- [c36]Jean Vuillemin:
Efficient Data Structure and Algorithms for Sparse Integers, Sets and Predicates. IEEE Symposium on Computer Arithmetic 2009: 7-14 - [c35]Jean Vuillemin, Nicolas Gama:
Compact Normal Form for Regular Languages as Xor Automata. CIAA 2009: 24-33 - 2006
- [c34]Jean-Baptiste Note, Mark Shand, Jean Vuillemin:
Real-Time Video Pixel Matching. FPL 2006: 1-6 - 2004
- [c33]Jean Vuillemin, Frédéric Béal:
On the BDD of a Random Boolean Function. ASIAN 2004: 483-493 - 2003
- [c32]Jean Vuillemin:
Digital Algebra and Circuits. Verification: Theory and Practice 2003: 733-746 - 2000
- [c31]Jean Vuillemin:
Finite Digital Synchronous Circuits Are Characterized by 2-Algebraic Truth Tables. ASIAN 2000: 1-12
1990 – 1999
- 1999
- [c30]Alan Marshall, Tony Stansfield, Igor Kostarnov, Jean Vuillemin, Brad L. Hutchings:
A Reconfigurable Arithmetic Array for Multimedia Application. FPGA 1999: 135-143 - 1998
- [c29]Jean Vuillemin:
Reconfigurable Systems: Past and Next 10 Years. VECPAR 1998: 334-354 - 1996
- [j24]Jean Vuillemin, Patrice Bertin, Didier Roncin, Mark Shand, H. H. Touati, Philippe Boucard:
Programmable active memories: reconfigurable systems come of age. IEEE Trans. Very Large Scale Integr. Syst. 4(1): 56-69 (1996) - [j23]Laurent Moll, Jean Vuillemin, Philippe Boucard, Lars Lundheim:
Real-time high-energy physics applications on DECPeRLe-1 programmable active memory. J. VLSI Signal Process. 12(1): 21-33 (1996) - 1995
- [c28]Laurent Moll, Jean Vuillemin, Philippe Boucard:
High-Energy Physics on DECPeRLe-1 Programmable Active Memory. FPGA 1995: 47-52 - 1994
- [j22]Jean Vuillemin:
On Circuits and Numbers. IEEE Trans. Computers 43(8): 868-879 (1994) - [c27]Jean Vuillemin:
Fast linear Hough transform. ASAP 1994: 1-9 - [c26]Marc Daumas, Jean-Michel Muller, Jean Vuillemin:
Implementing On Line Arithmetic on PAM. FPL 1994: 196-207 - [c25]Jean Vuillemin:
On Computing Power. Programming Languages and System Architectures 1994: 69-86 - 1993
- [c24]Mark Shand, Jean Vuillemin:
Fast implementations of RSA cryptography. IEEE Symposium on Computer Arithmetic 1993: 252-259 - 1992
- [c23]Patrice Bertin, Didier Roncin, Jean Vuillemin:
Programmable Active Memories: A Performance Assessment. Heinz Nixdorf Symposium 1992: 119-130 - 1991
- [j21]Mark Shand, Patrice Bertin, Jean Vuillemin:
Hardware speedups in long integer multiplication. SIGARCH Comput. Archit. News 19(1): 106-113 (1991) - [c22]Jean Vuillemin:
Constant time arbitrary length synchronous binary counters. IEEE Symposium on Computer Arithmetic 1991: 180-183 - 1990
- [j20]Franco P. Preparata, Jean Vuillemin:
Practical Cellular Dividers. IEEE Trans. Computers 39(5): 605-614 (1990) - [j19]Jean Vuillemin:
Exact Real Computer Arithmetic with Continued Fractions. IEEE Trans. Computers 39(8): 1087-1105 (1990) - [c21]Mark Shand, Patrice Bertin, Jean Vuillemin:
Hardware Speedups in Long Integer Multiplication. SPAA 1990: 138-145
1980 – 1989
- 1988
- [c20]Jean Vuillemin:
Exact Real Computer Arithmetic with Continued Fractions. LISP and Functional Programming 1988: 14-27 - 1986
- [j18]Philippe Flajolet, Claude Puech, Jean Vuillemin:
The analysis of simple list structures. Inf. Sci. 38(2): 121-146 (1986) - 1983
- [j17]Jean Vuillemin:
A very fast multiplication algorithm for VLSI implementation. Integr. 1(1): 39-52 (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) - [c19]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) - [c18]Franco P. Preparata, Jean Vuillemin:
Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform. ICALP 1981: 29-40 - 1980
- [j13]Jean Vuillemin:
A Unifying Look at Data Structures. Commun. ACM 23(4): 229-239 (1980) - [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) - [c17]Jean Vuillemin:
A Combinatorial Limit to the Computing Power of V.L.S.I. Circuits (Extended Abstract). FOCS 1980: 294-300 - [c16]Jean-Claude Raoult, Jean Vuillemin:
Optimal Unbounded Search Strategies. ICALP 1980: 512-530
1970 – 1979
- 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) - [c15]Franco P. Preparata, Jean Vuillemin:
The Cube-Connected-Cycles: A Versatile Network for Parallel Computation (Extended Abstract). FOCS 1979: 140-147 - [c14]Philippe Flajolet, Jean Françon, Jean Vuillemin:
Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version). FOCS 1979: 183-195 - [c13]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) - [c12]Jean Françon, Gérard Viennot, Jean Vuillemin:
Description and Analysis of an Efficient Priority Queue Representation. FOCS 1978: 1-7 - [c11]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) - [c10]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
- [c9]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) - [c8]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 - [c7]Laurent Hyafil, F. Prusker, Jean Vuillemin:
Design of Optimal Merge on Direct Access Devices. IFIP Congress 1974: 979-982 - [c6]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 - [c5]Bruno Courcelle, Jean Vuillemin:
Semantics and Axiomatics of a Simple Recursive Language. STOC 1974: 13-26 - [c4]Laurent Hyafil, F. Prusker, Jean Vuillemin:
An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended Abstract). STOC 1974: 216-229 - 1973
- [b1]Jean Vuillemin:
Proof techniques for recursive programs. Stanford University, USA, 1973 - [j3]Maurice Schlumberger, Jean Vuillemin:
Optimal Disk Merge Patterns. Acta Informatica 3: 25-35 (1973) - [j2]Zohar Manna, Stephen Nes, Jean Vuillemin:
Inductive Methods for Proving Properties of Programs. Commun. ACM 16(8): 491-502 (1973) - [c3]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) - [c2]Zohar Manna, Jean Vuillemin:
Fixpoint Approach to the Theory of Computation. ICALP 1972: 273-291 - [c1]Zohar Manna, Stephen Nes, Jean Vuillemin:
Inductive methods for proving properties of programs. Proving Assertions About Programs 1972: 27-50
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
