Jean Vuillemin, Ph.D - Publications
Affiliations: | Computer Science | Paris Diderot University | |
1973 | Stanford University, Palo Alto, CA |
Year | Citation | Score | |||
---|---|---|---|---|---|
1986 | Flajolet P, Puech C, Vuillemin J. The analysis of simple list structures Information Sciences. 38: 121-146. DOI: 10.1016/0020-0255(86)90016-2 | 0.351 | |||
1983 | Vuillemin J. A very fast multiplication algorithm for VLSI implementation Integration. 1: 39-52. DOI: 10.1016/0167-9260(83)90005-6 | 0.303 | |||
1981 | Preparata FP, Vuillemin J. The Cube-Connected Cycles: A Versatile Network for Parallel Computation Communications of the Acm. 24: 300-309. DOI: 10.1145/358645.358660 | 0.377 | |||
1980 | Raoult J, Vuillemin J. Operational and Semantic Equivalence Between Recursive Programs Journal of the Acm. 27: 772-796. DOI: 10.1145/322217.322229 | 0.406 | |||
1980 | Flajolet P, Françon J, Vuillemin J. Sequence of Operations Analysis for Dynamic Data Structures Journal of Algorithms. 1: 111-141. DOI: 10.1016/0196-6774(80)90020-6 | 0.353 | |||
1979 | Flajolet P, Raoult J, Vuillemin J. The number of registers required for evaluating arithmetic expressions Theoretical Computer Science. 9: 99-125. DOI: 10.1016/0304-3975(79)90009-4 | 0.303 | |||
1976 | Courcelle B, Vuillemin J. Completeness results for the equivalence of recursive schemas Journal of Computer and System Sciences. 12: 179-197. DOI: 10.1016/S0022-0000(76)80036-0 | 0.311 | |||
1974 | Vuillemin J. Correct and optimal implementations of recursion in a simple programming language Journal of Computer and System Sciences. 9: 332-354. DOI: 10.1016/S0022-0000(74)80048-6 | 0.416 | |||
1973 | Manna Z, Ness S, Vuillemin J. Inductive Methods for Proving Properties of Programs Communications of the Acm. 16: 491-502. DOI: 10.1145/355609.362336 | 0.545 | |||
1972 | Manna Z, Vuillemin J. Fixpoint Approach to the Theory of Computation Communications of the Acm. 15: 528-536. DOI: 10.1145/361454.361460 | 0.54 | |||
Show low-probability matches. |