Jean Vuillemin

According to our database1, Jean Vuillemin
  • authored at least 63 papers between 1972 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
The Conjoined Microprocessor.
Proceedings of the 2016 IEEE International Symposium on Hardware Oriented Security and Trust, 2016

2015
The Conjoined Microprocessor.
IACR Cryptology ePrint Archive, 2015

2012
Defensive Leakage Camouflage.
IACR Cryptology ePrint Archive, 2012

Defensive Leakage Camouflage.
Proceedings of the Smart Card Research and Advanced Applications, 2012

2009
Compact Normal Form for Regular Languages as Xor Automata.
Proceedings of the Implementation and Application of Automata, 2009

Efficient Data Structure and Algorithms for Sparse Integers, Sets and Predicates.
Proceedings of the 19th IEEE Symposium on Computer Arithmetic, 2009

2006
Real-Time Video Pixel Matching.
Proceedings of the 2006 International Conference on Field Programmable Logic and Applications (FPL), 2006

2004
On the BDD of a Random Boolean Function.
Proceedings of the Advances in Computer Science, 2004

2003
Digital Algebra and Circuits.
Proceedings of the Verification: Theory and Practice, 2003

2000
Finite Digital Synchronous Circuits Are Characterized by 2-Algebraic Truth Tables.
Proceedings of the Advances in Computing Science, 2000

1999
A Reconfigurable Arithmetic Array for Multimedia Application.
Proceedings of the 1999 ACM/SIGDA Seventh International Symposium on Field Programmable Gate Arrays, 1999

1998
Reconfigurable Systems: Past and Next 10 Years.
Proceedings of the Vector and Parallel Processing, 1998

1996
Real-time high-energy physics applications on DECPeRLe-1 programmable active memory.
VLSI Signal Processing, 1996

Programmable active memories: reconfigurable systems come of age.
IEEE Trans. VLSI Syst., 1996

1995
High-Energy Physics on DECPeRLe-1 Programmable Active Memory.
Proceedings of the Third International ACM Symposium on Field-Programmable Gate Arrays, 1995

1994
On Circuits and Numbers.
IEEE Trans. Computers, 1994

On Computing Power.
Proceedings of the Programming Languages and System Architectures, 1994

Implementing On Line Arithmetic on PAM.
Proceedings of the Field-Programmable Logic, 1994

Fast linear Hough transform.
Proceedings of the International Conference on Application Specific Array Processors, 1994

1993
Fast implementations of RSA cryptography.
Proceedings of the 11th Symposium on Computer Arithmetic, 29 June, 1993

1992
Programmable Active Memories: A Performance Assessment.
Proceedings of the Parallel Architectures and Their Efficient Use, 1992

1991
Hardware speedups in long integer multiplication.
SIGARCH Computer Architecture News, 1991

Constant time arbitrary length synchronous binary counters.
Proceedings of the 10th IEEE Symposium on Computer Arithmetic, 1991

1990
Exact Real Computer Arithmetic with Continued Fractions.
IEEE Trans. Computers, 1990

Practical Cellular Dividers.
IEEE Trans. Computers, 1990

Hardware Speedups in Long Integer Multiplication.
SPAA, 1990

1988
Exact Real Computer Arithmetic with Continued Fractions.
LISP and Functional Programming, 1988

1986
The analysis of simple list structures.
Inf. Sci., 1986

1983
A Combinatorial Limit to the Computing Power of VLSI Circuits.
IEEE Trans. Computers, 1983

Area-Time Optimal VLSI Circuits for Convolution.
IEEE Trans. Computers, 1983

A very fast multiplication algorithm for VLSI implementation.
Integration, 1983

On fast binary addition in MDS Technologies.
Proceedings of the 6th IEEE Symposium on Computer Arithmetic, 1983

1981
The Cube-Connected Cycles: A Versatile Network for Parallel Computation.
Commun. ACM, 1981

Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform.
Proceedings of the Automata, 1981

1980
Sequence of Operations Analysis for Dynamic Data Structures.
J. Algorithms, 1980

Operational and Semantic Equivalence Between Recursive Programs.
J. ACM, 1980

Area-Time Optimal VLSI Networks for Multiplying Matrices.
Inf. Process. Lett., 1980

A Unifying Look at Data Structures.
Commun. ACM, 1980

Optimal Unbounded Search Strategies.
Proceedings of the Automata, 1980

A Combinatorial Limit to the Computing Power of V.L.S.I. Circuits (Extended Abstract)
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979
The Number of Registers Required for Evaluating Arithmetic Expressions.
Theor. Comput. Sci., 1979

Computing Integrated Costs of Sequences of Operations with Application to Dictionaries
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

The Cube-Connected-Cycles: A Versatile Network for Parallel Computation (Extended Abstract)
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version)
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978
A Data Structure for Manipulating Priority Queues.
Commun. ACM, 1978

Operational and Semantic Equivalence between Recursive Programs
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

Description and Analysis of an Efficient Priority Queue Representation
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

1977
Comment Verifier l'Associativite d'une Table de Groupe.
Theor. Comput. Sci., 1977

On the Average Number of Registers Required for Evaluating Arithmetic Expressions
Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1976
On Recognizing Graph Properties from Adjacency Matrices.
Theor. Comput. Sci., 1976

Completeness Results for the Equivalence of Recursive Schemas.
J. Comput. Syst. Sci., 1976

1975
A Generalization and Proof of the Aanderaa-Rosenberg Conjecture
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

1974
Correct and Optimal Implementations of Recursion in a Simple Programming Language.
J. Comput. Syst. Sci., 1974

An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended Abstract)
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

Semantics and Axiomatics of a Simple Recursive Language
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

Complétude d'un système formel pour prouver l'équivalence de certains schémas récursifs monadiques.
Proceedings of the Programming Symposium, 1974

Design of Optimal Merge on Direct Access Devices.
IFIP Congress, 1974

Algorithmes d'equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples.
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, July 29, 1974

1973
Inductive Methods for Proving Properties of Programs.
Commun. ACM, 1973

Optimal Disk Merge Patterns.
Acta Inf., 1973

Correct and Optimal Implementations of Recursion in a Simple Programming Language
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30, 1973

1972
Fix Point Approach to the Theory of Computation.
Commun. ACM, 1972

Fixpoint Approach to the Theory of Computation.
ICALP, 1972


  Loading...