The following pages link to Jean E. Vuillemin (Q1145671):
Displaying 34 items.
- (Q1067774) (redirect page) (← links)
- The analysis of simple list structures (Q1067775) (← links)
- Area-time optimal VLSI networks for multiplying matrices (Q1145672) (← links)
- Completeness results for the equivalence of recursive schemas (Q1232171) (← links)
- On recognizing graph properties from adjacency matrices (Q1238421) (← links)
- Comment verifier l'associativite d'une table de groupe (Q1239383) (← links)
- The number of registers required for evaluating arithmetic expressions (Q1258177) (← links)
- Optimal disk merge patterns (Q2264546) (← links)
- (Q2766510) (← links)
- (Q3400629) (← links)
- Compact Normal Form for Regular Languages as Xor Automata (Q3637338) (← links)
- Area—Time Optimal VLSI Circuits for Convolution (Q3659695) (← links)
- A unifying look at data structures (Q3873557) (← links)
- (Q3888540) (← links)
- Sequence of operations analysis for dynamic data structures (Q3890114) (← links)
- Operational and Semantic Equivalence Between Recursive Programs (Q3893265) (← links)
- (Q4050160) (← links)
- (Q4057634) (← links)
- (Q4061934) (← links)
- (Q4092932) (← links)
- (Q4130957) (← links)
- (Q4131017) (← links)
- (Q4133137) (← links)
- (Q4134964) (← links)
- A data structure for manipulating priority queues (Q4147586) (← links)
- Contribution à la résolution numérique des équations de Laplace et de la chaleur (Q4278043) (← links)
- Inductive methods for proving properties of programs (Q4404415) (← links)
- On circuits and numbers (Q4419740) (← links)
- (Q4766020) (← links)
- (Q4772711) (← links)
- Verification: Theory and Practice (Q5305664) (← links)
- Operational and semantic equivalence between recursive programs. (Q5402543) (← links)
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making (Q5463959) (← links)
- Fixpoint approach to the theory of computation (Q5657655) (← links)
