Jean Vuillemin

IACR Cryptol. ePrint Arch., 2012

2009

Compact Normal Form for Regular Languages as Xor Automata.

[BibT_eX]

[DOI]

Nicolas Gama

Proceedings of the Implementation and Application of Automata, 2009

Efficient Data Structure and Algorithms for Sparse Integers, Sets and Predicates.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE Symposium on Computer Arithmetic, 2009

2006

Real-Time Video Pixel Matching.

[BibT_eX]

[DOI]

Jean-Baptiste Note

Mark Shand

Proceedings of the 2006 International Conference on Field Programmable Logic and Applications (FPL), 2006

2004

On the BDD of a Random Boolean Function.

[BibT_eX]

[DOI]

Frédéric Béal

Proceedings of the Advances in Computer Science, 2004

2003

Digital Algebra and Circuits.

[BibT_eX]

[DOI]

Proceedings of the Verification: Theory and Practice, 2003

2000

Finite Digital Synchronous Circuits Are Characterized by 2-Algebraic Truth Tables.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing Science, 2000

1999

A Reconfigurable Arithmetic Array for Multimedia Application.

[BibT_eX]

[DOI]

Proceedings of the 1999 ACM/SIGDA Seventh International Symposium on Field Programmable Gate Arrays, 1999

1998

Reconfigurable Systems: Past and Next 10 Years.

[BibT_eX]

[DOI]

Proceedings of the Vector and Parallel Processing, 1998

1996

Real-time high-energy physics applications on DECPeRLe-1 programmable active memory.

[BibT_eX]

[DOI]

J. VLSI Signal Process., 1996

Programmable active memories: reconfigurable systems come of age.

[BibT_eX]

[DOI]

IEEE Trans. Very Large Scale Integr. Syst., 1996

1995

High-Energy Physics on DECPeRLe-1 Programmable Active Memory.

[BibT_eX]

[DOI]

Laurent Moll

Philippe Boucard

Proceedings of the Third International ACM Symposium on Field-Programmable Gate Arrays, 1995

1994

On Circuits and Numbers.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1994

On Computing Power.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and System Architectures, 1994

Implementing On Line Arithmetic on PAM.

[BibT_eX]

[DOI]

Marc Daumas

Jean-Michel Muller

Proceedings of the Field-Programmable Logic, 1994

Fast linear Hough transform.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Application Specific Array Processors, 1994

1993

Fast implementations of RSA cryptography.

[BibT_eX]

[DOI]

Mark Shand

Proceedings of the 11th Symposium on Computer Arithmetic, 29 June, 1993

1992

Programmable Active Memories: A Performance Assessment.

[BibT_eX]

[DOI]

Patrice Bertin

Didier Roncin

Proceedings of the Parallel Architectures and Their Efficient Use, 1992

1991

Hardware speedups in long integer multiplication.

[BibT_eX]

[DOI]

Mark Shand

Patrice Bertin

SIGARCH Comput. Archit. News, 1991

Constant time arbitrary length synchronous binary counters.

[BibT_eX]

[DOI]

Proceedings of the 10th IEEE Symposium on Computer Arithmetic, 1991

1990

Exact Real Computer Arithmetic with Continued Fractions.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1990

Practical Cellular Dividers.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1990

1986

The analysis of simple list structures.

[BibT_eX]

[DOI]

Claude Puech

Inf. Sci., 1986

1983

A Combinatorial Limit to the Computing Power of VLSI Circuits.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1983

Area-Time Optimal VLSI Circuits for Convolution.

[BibT_eX]

[DOI]

Gérard M. Baudet

IEEE Trans. Computers, 1983

A very fast multiplication algorithm for VLSI implementation.

[BibT_eX]

[DOI]

Integr., 1983

On fast binary addition in MDS Technologies.

[BibT_eX]

[DOI]

Leonidas J. Guibas

Proceedings of the 6th IEEE Symposium on Computer Arithmetic, 1983

1981

The Cube-Connected Cycles: A Versatile Network for Parallel Computation.

[BibT_eX]

[DOI]

Commun. ACM, 1981

Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1981

1980

Sequence of Operations Analysis for Dynamic Data Structures.

[BibT_eX]

[DOI]

J. Algorithms, 1980

Operational and Semantic Equivalence Between Recursive Programs.

[BibT_eX]

[DOI]

J. ACM, 1980

Area-Time Optimal VLSI Networks for Multiplying Matrices.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1980

A Unifying Look at Data Structures.

[BibT_eX]

[DOI]

Commun. ACM, 1980

Optimal Unbounded Search Strategies.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1980

A Combinatorial Limit to the Computing Power of V.L.S.I. Circuits (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979

The Number of Registers Required for Evaluating Arithmetic Expressions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1979

Computing Integrated Costs of Sequences of Operations with Application to Dictionaries

[BibT_eX]

[DOI]

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)

[BibT_eX]

[DOI]

Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978

A Data Structure for Manipulating Priority Queues.

[BibT_eX]

[DOI]

Commun. ACM, 1978

Description and Analysis of an Efficient Priority Queue Representation

[BibT_eX]

[DOI]

Gérard Viennot

Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

1977

Comment Verifier l'Associativite d'une Table de Groupe.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1977

On the Average Number of Registers Required for Evaluating Arithmetic Expressions

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Ronald L. Rivest

Theor. Comput. Sci., 1976

Completeness Results for the Equivalence of Recursive Schemas.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1976

1975

A Generalization and Proof of the Aanderaa-Rosenberg Conjecture

[BibT_eX]

[DOI]

Ronald L. Rivest

Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

1974

Correct and Optimal Implementations of Recursion in a Simple Programming Language.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1974

An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended Abstract)

[BibT_eX]

[DOI]

Laurent Hyafil

F. Prusker

Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

Semantics and Axiomatics of a Simple Recursive Language

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Programming Symposium, 1974

Design of Optimal Merge on Direct Access Devices.

[BibT_eX]

Laurent Hyafil

F. Prusker

Proceedings of the Information Processing, 1974

Algorithmes d'equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples.

[BibT_eX]

[DOI]

Gilles Kahn

Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

1973

Proof techniques for recursive programs.

[BibT_eX]

[DOI]

PhD thesis, 1973

Inductive Methods for Proving Properties of Programs.

[BibT_eX]

[DOI]

Zohar Manna

Stephen Nes

Commun. ACM, 1973

Optimal Disk Merge Patterns.

[BibT_eX]

[DOI]

Maurice Schlumberger

Acta Informatica, 1973

1972

Fix Point Approach to the Theory of Computation.

[BibT_eX]

[DOI]

Zohar Manna

Commun. ACM, 1972

Fixpoint Approach to the Theory of Computation.

[BibT_eX]

Zohar Manna