The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jean Vuillemin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bruno Courcelle, Gilles Kahn, Jean Vuillemin
    Algorithmes d'equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples. [Citation Graph (1, 0)][DBLP]
    ICALP, 1974, pp:200-213 [Conf]
  2. Laurent Hyafil, F. Prusker, Jean Vuillemin
    Design of Optimal Merge on Direct Access Devices. [Citation Graph (1, 0)][DBLP]
    IFIP Congress, 1974, pp:979-982 [Conf]
  3. Zohar Manna, Jean Vuillemin
    Fix Point Approach to the Theory of Computation. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1972, v:15, n:7, pp:528-536 [Journal]
  4. Franco P. Preparata, Jean Vuillemin
    The Cube-Connected Cycles: A Versatile Network for Parallel Computation. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1981, v:24, n:5, pp:300-309 [Journal]
  5. Jean Vuillemin
    A Unifying Look at Data Structures. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1980, v:23, n:4, pp:229-239 [Journal]
  6. Jean Vuillemin
    Finite Digital Synchronous Circuits Are Characterized by 2-Algebraic Truth Tables. [Citation Graph (0, 0)][DBLP]
    ASIAN, 2000, pp:1-12 [Conf]
  7. Jean Vuillemin, Frédéric Béal
    On the BDD of a Random Boolean Function. [Citation Graph (0, 0)][DBLP]
    ASIAN, 2004, pp:483-493 [Conf]
  8. Jean Vuillemin
    Digital Algebra and Circuits. [Citation Graph (0, 0)][DBLP]
    Verification: Theory and Practice, 2003, pp:733-746 [Conf]
  9. Philippe Flajolet, Jean Françon, Jean Vuillemin
    Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:183-195 [Conf]
  10. Philippe Flajolet, Jean-Claude Raoult, Jean Vuillemin
    On the Average Number of Registers Required for Evaluating Arithmetic Expressions [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:196-205 [Conf]
  11. Jean Françon, G. Viennot, Jean Vuillemin
    Description and Analysis of an Efficient Priority Queue Representation [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:1-7 [Conf]
  12. Franco P. Preparata, Jean Vuillemin
    The Cube-Connected-Cycles: A Versatile Network for Parallel Computation (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:140-147 [Conf]
  13. Jean Vuillemin
    A Combinatorial Limit to the Computing Power of V.L.S.I. Circuits (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:294-300 [Conf]
  14. Alan Marshall, Tony Stansfield, Igor Kostarnov, Jean Vuillemin, Brad L. Hutchings
    A Reconfigurable Arithmetic Array for Multimedia Application. [Citation Graph (0, 0)][DBLP]
    FPGA, 1999, pp:135-143 [Conf]
  15. Laurent Moll, Jean Vuillemin, Philippe Boucard
    High-Energy Physics on DECPeRLe-1 Programmable Active Memory. [Citation Graph (0, 0)][DBLP]
    FPGA, 1995, pp:47-52 [Conf]
  16. Marc Daumas, Jean-Michel Muller, Jean Vuillemin
    Implementing On Line Arithmetic on PAM. [Citation Graph (0, 0)][DBLP]
    FPL, 1994, pp:196-207 [Conf]
  17. Zohar Manna, Jean Vuillemin
    Fixpoint Approach to the Theory of Computation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:273-291 [Conf]
  18. Franco P. Preparata, Jean Vuillemin
    Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform. [Citation Graph (0, 0)][DBLP]
    ICALP, 1981, pp:29-40 [Conf]
  19. Jean-Claude Raoult, Jean Vuillemin
    Optimal Unbounded Search Strategies. [Citation Graph (0, 0)][DBLP]
    ICALP, 1980, pp:512-530 [Conf]
  20. Jean Vuillemin
    Exact Real Computer Arithmetic with Continued Fractions. [Citation Graph (0, 0)][DBLP]
    LISP and Functional Programming, 1988, pp:14-27 [Conf]
  21. Patrice Bertin, Didier Roncin, Jean Vuillemin
    Programmable Active Memories: A Performance Assessment. [Citation Graph (0, 0)][DBLP]
    Heinz Nixdorf Symposium, 1992, pp:119-130 [Conf]
  22. Jean Vuillemin
    On Computing Power. [Citation Graph (0, 0)][DBLP]
    Programming Languages and System Architectures, 1994, pp:69-86 [Conf]
  23. Bruno Courcelle, Jean Vuillemin
    Complétude d'un système formel pour prouver l'équivalence de certains schémas récursifs monadiques. [Citation Graph (0, 0)][DBLP]
    Symposium on Programming, 1974, pp:234-252 [Conf]
  24. Mark Shand, Patrice Bertin, Jean Vuillemin
    Hardware Speedups in Long Integer Multiplication. [Citation Graph (0, 0)][DBLP]
    SPAA, 1990, pp:138-145 [Conf]
  25. Bruno Courcelle, Jean Vuillemin
    Semantics and Axiomatics of a Simple Recursive Language [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:13-26 [Conf]
  26. Philippe Flajolet, Jean Françon, Jean Vuillemin
    Computing Integrated Costs of Sequences of Operations with Application to Dictionaries [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:49-61 [Conf]
  27. Laurent Hyafil, F. Prusker, Jean Vuillemin
    An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:216-229 [Conf]
  28. Jean-Claude Raoult, Jean Vuillemin
    Operational and Semantic Equivalence between Recursive Programs [Citation Graph (0, 0)][DBLP]
    STOC, 1978, pp:75-85 [Conf]
  29. Ronald L. Rivest, Jean Vuillemin
    A Generalization and Proof of the Aanderaa-Rosenberg Conjecture [Citation Graph (0, 0)][DBLP]
    STOC, 1975, pp:6-11 [Conf]
  30. Jean Vuillemin
    Correct and Optimal Implementations of Recursion in a Simple Programming Language [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:224-239 [Conf]
  31. Jean Vuillemin
    Reconfigurable Systems: Past and Next 10 Years. [Citation Graph (0, 0)][DBLP]
    VECPAR, 1998, pp:334-354 [Conf]
  32. Maurice Schlumberger, Jean Vuillemin
    Optimal Disk Merge Patterns [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1973, v:3, n:, pp:25-35 [Journal]
  33. Zohar Manna, Stephen Nes, Jean Vuillemin
    Inductive Methods for Proving Properties of Programs. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1973, v:16, n:8, pp:491-502 [Journal]
  34. Jean Vuillemin
    A Data Structure for Manipulating Priority Queues. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1978, v:21, n:4, pp:309-315 [Journal]
  35. Franco P. Preparata, Jean Vuillemin
    Area-Time Optimal VLSI Networks for Multiplying Matrices. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:11, n:2, pp:77-80 [Journal]
  36. Philippe Flajolet, Claude Puech, Jean Vuillemin
    The analysis of simple list structures. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1986, v:38, n:2, pp:121-146 [Journal]
  37. Jean-Claude Raoult, Jean Vuillemin
    Operational and Semantic Equivalence Between Recursive Programs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:4, pp:772-796 [Journal]
  38. Philippe Flajolet, Jean Françon, Jean Vuillemin
    Sequence of Operations Analysis for Dynamic Data Structures. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1980, v:1, n:2, pp:111-141 [Journal]
  39. Bruno Courcelle, Jean Vuillemin
    Completeness Results for the Equivalence of Recursive Schemas. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1976, v:12, n:2, pp:179-197 [Journal]
  40. Jean Vuillemin
    Correct and Optimal Implementations of Recursion in a Simple Programming Language. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1974, v:9, n:3, pp:332-354 [Journal]
  41. Gérard M. Baudet, Franco P. Preparata, Jean Vuillemin
    Area-Time Optimal VLSI Circuits for Convolution. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1983, v:32, n:7, pp:684-688 [Journal]
  42. Franco P. Preparata, Jean Vuillemin
    Practical Cellular Dividers. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1990, v:39, n:5, pp:605-614 [Journal]
  43. Jean Vuillemin
    A Combinatorial Limit to the Computing Power of VLSI Circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1983, v:32, n:3, pp:294-300 [Journal]
  44. Jean Vuillemin
    Exact Real Computer Arithmetic with Continued Fractions. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1990, v:39, n:8, pp:1087-1105 [Journal]
  45. Jean Vuillemin
    On Circuits and Numbers. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1994, v:43, n:8, pp:868-879 [Journal]
  46. Philippe Flajolet, Jean-Claude Raoult, Jean Vuillemin
    The Number of Registers Required for Evaluating Arithmetic Expressions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:99-125 [Journal]
  47. Ronald L. Rivest, Jean Vuillemin
    On Recognizing Graph Properties from Adjacency Matrices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:3, n:3, pp:371-384 [Journal]
  48. Jean Vuillemin
    Comment Verifier l'Associativite d'une Table de Groupe. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1977, v:4, n:1, pp:77-82 [Journal]
  49. Jean-Baptiste Note, Mark Shand, Jean Vuillemin
    Real-Time Video Pixel Matching. [Citation Graph (0, 0)][DBLP]
    FPL, 2006, pp:1-6 [Conf]
  50. Jean Vuillemin, Patrice Bertin, Didier Roncin, Mark Shand, H. H. Touati, Philippe Boucard
    Programmable active memories: reconfigurable systems come of age. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. VLSI Syst., 1996, v:4, n:1, pp:56-69 [Journal]

  51. Fast implementations of RSA cryptography. [Citation Graph (, )][DBLP]


  52. Efficient Data Structure and Algorithms for Sparse Integers, Sets and Predicates. [Citation Graph (, )][DBLP]


  53. Compact Normal Form for Regular Languages as Xor Automata. [Citation Graph (, )][DBLP]


Search in 0.136secs, Finished in 0.138secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002