Jean Vuillemin | Academic Influence

Jean Vuillemin's AcademicInfluence.com Rankings

Jean Vuillemin

Computer Science

#2252

World Rank

#2346

Historical Rank

Database

#7796

World Rank

#8109

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Jean Vuillemin's Degrees

PhD Computer Science Université Paris Cité
Masters Mathematics Université Paris Cité

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Jean Vuillemin Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jean Vuillemin is a French computer scientist known for his work in data structures and parallel computing. He is a professor of computer science at the École normale supérieure . Contributions Vuillemin invented the binomial heap and Cartesian tree data structures. With Ron Rivest, he proved the Aanderaa–Rosenberg conjecture, according to which any deterministic algorithm that tests a nontrivial monotone property of graphs, using queries that test whether pairs of vertices are adjacent, must perform a quadratic number of adjacency queries.

(See a Problem?)

Jean Vuillemin's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The cube-connected-cycles: A versatile network for parallel computation (1979) (1111)
Real time correlation-based stereo: algorithm, implementations and applications (1993) (484)
Programmable active memories: reconfigurable systems come of age (1996) (373)
A data structure for manipulating priority queues (1978) (325)
A unifying look at data structures (1980) (271)
Fast implementations of RSA cryptography (1993) (231)
A reconfigurable arithmetic array for multimedia applications (1999) (216)
Programmable Active Memories: A Performance Assessment (1992) (208)
Introduction to programmable active memories (1990) (201)
On Recognizing Graph Properties from Adjacency Matrices (1976) (188)
Exact real computer arithmetic with continued fractions (1988) (169)
Correct and optimal implementations of recursion in a simple programming language (1973) (142)
A Combinatorial Limit to the Computing Power of VLSI Circuits (1983) (141)
Inductive methods for proving properties of programs (1972) (118)
The Number of Registers Required for Evaluating Arithmetic Expressions (1979) (107)
Fixpoint approach to the theory of computation (1972) (90)
BigNum: A Portable and Efficient Package for Arbitrary-Precision Arithmetic (1989) (88)
Inductive methods for proving properties of programs (1973) (85)
Proof techniques for recursive programs (1973) (82)
Sequence of Operations Analysis for Dynamic Data Structures (1980) (70)
Operational and Semantic Equivalence Between Recursive Programs (1980) (69)
A combinatorial limit to the computing power of V.L.S.I. circuits (1980) (69)
Area-Time Optimal VLSI Networks for Multiplying Matrices (1980) (64)
A very fast multiplication algorithm for VLSI implementation (1983) (60)
Recursive implementation of optimal time VLSi integer multipliers (1984) (60)
On Circuits and Numbers (1994) (60)
A generalization and proof of the Aanderaa-Rosenberg conjecture (1975) (48)
Hardware speedups in long integer multiplication (1990) (42)
Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform (1981) (34)
Description and analysis of an efficient priority queue representation (1978) (32)
Fast linear Hough transform (1994) (31)
Hardware speedups in long integer multiplication (1991) (29)
The analysis of simple list structures (1986) (29)
Completeness Results for the Equivalence of Recursive Schemas (1976) (24)
On Computing Power (1994) (23)
High-Energy Physics on DECPeRLe-1 Programmable Active Memory (1995) (23)
Digital Algebra and Circuits (2003) (20)
Practical Cellular Dividers (1990) (19)
Area—Time Optimal VLSI Circuits for Convolution (1983) (17)
Programmable Active Memories: the Coming of Age (1994) (16)
Programmable active memories in real-time tasks: implementing data-driven triggers for LHC experiments (1995) (14)
Semantics and axiomatics of a simple recursive language. (1974) (14)
Efficient Data Structure and Algorithms for Sparse Integers, Sets and Predicates (2009) (14)
Efficient Equivalence and Minimization for Non Deterministic Xor Automata (2010) (13)
Finite Digital Synchronous Circuits Are Characterized by 2-Algebraic Truth Tables (2000) (13)
Compact Normal Form for Regular Languages as Xor Automata (2009) (12)
Implementing On Line Arithmetic on PAM (1994) (12)
On the average number of registers required for evaluating arithmetic expressions (1977) (10)
Area-Time Optimal VLSI Networks Based on the Cube-Connected-Cycles. (1980) (9)
Towards analysing sequences of operations for dynamic data structures (1979) (9)
Optimal Unbounded Search Strategies (1980) (8)
Dynamic data structures: Finite files, limiting profiles and variance analysis (1980) (7)
Real-Time Video Pixel Matching (2006) (5)
On the BDD of a Random Boolean Function (2004) (5)
Computing integrated costs of sequences of operations with application to dictionaries (1979) (5)
An efficient algorithm for computing optimal disk merge patterns. (Extended Abstract) (1974) (4)
Operational and semantic equivalence between recursive programs. (1978) (4)
Reconfigurable Systems: Past and Next 10 Years (1998) (4)
On fast binary addition in MDS Technologies (1983) (4)
Design of Optimal Merge on Direct Access Devices (1974) (3)
Decision tree complexity of Boolean functions (1992) (3)
On the time required to recognize properties of graphs from their adjacency matrices (2019) (2)
Comment Verifier l'Associativite d'une Table de Groupe (1977) (2)
Area-Time Optimal VLSI Networks for Matrix Multiplication and Inversion of Triangular Matrices. (1980) (2)
Optimal disk merge patterns (1973) (2)
Microarchitecture of VLSI computers (1985) (2)
The Conjoined Microprocessor (2016) (1)
Real-time high-energy physics applications on DECPeRLe-1 programmable active memory (1996) (1)
Reconfigurable systems : Past and next 10 years : Invited talk (1999) (0)
New Results - Hardware (2008) (0)
User programmable processor (1998) (0)
User programmable processor fields (1998) (0)
Specification for the Transition Radiation Tracker on DECPeRLe1 (1994) (0)
Minimal Non-Deterministic xor Automata (2009) (0)
Masking command to command streams forwarded to a processor (1998) (0)
Mise en application de multiplicateurs dans des matrices programmables (1998) (0)
Shared Integer Dichotomy (2014) (0)
From Semantics to Computer Science: Algorithms for equivalence and reduction to minimal form for a class of simple recursive equations (1974) (0)

This paper list is powered by the following services:

Other Resources About Jean Vuillemin

en.wikipedia.org

What Schools Are Affiliated With Jean Vuillemin?

Jean Vuillemin is affiliated with the following schools: