Laurent Hyafil

1.2k total citations · 1 hit paper
12 papers, 719 citations indexed

About

Laurent Hyafil is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Computer Networks and Communications. According to data from OpenAlex, Laurent Hyafil has authored 12 papers receiving a total of 719 indexed citations (citations by other indexed papers that have themselves been cited), including 4 papers in Computational Theory and Mathematics, 4 papers in Electrical and Electronic Engineering and 3 papers in Computer Networks and Communications. Recurrent topics in Laurent Hyafil's work include Polynomial and algebraic computation (3 papers), Interconnection Networks and Systems (2 papers) and Parallel Computing and Optimization Techniques (2 papers). Laurent Hyafil is often cited by papers focused on Polynomial and algebraic computation (3 papers), Interconnection Networks and Systems (2 papers) and Parallel Computing and Optimization Techniques (2 papers). Laurent Hyafil collaborates with scholars based in United States and France. Laurent Hyafil's co-authors include Ronald L. Rivest, H. T. Kung, Prakash Ramanan, H. T. Kung and Jean Vuillemin and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Journal of Algorithms.

In The Last Decade

Laurent Hyafil

10 papers receiving 635 citations

Hit Papers

align trajectories sort by overperformance

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Constructing optimal binary decision trees is NP-complete

1976 571 citations Laurent Hyafil, Ronald L. Rivest Information Processing Letters profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Laurent Hyafil United States	8	416	201	137	114	80	12	719
Se June Hong United States	15	272 0.7×	139 0.7×	119 0.9×	142 1.2×	210 2.6×	33	748
Arthur B. Kahn United States	6	103 0.2×	72 0.4×	61 0.4×	127 1.1×	46 0.6×	9	507
Andreas Bauer Germany	11	296 0.7×	308 1.5×	81 0.6×	149 1.3×	87 1.1×	33	603
Man‐Tak Shing United States	13	164 0.4×	155 0.8×	155 1.1×	162 1.4×	58 0.7×	79	504
Stefan Leue Germany	15	263 0.6×	415 2.1×	149 1.1×	141 1.2×	71 0.9×	70	727
Shahriar Lotfi Iran	12	276 0.7×	102 0.5×	89 0.6×	134 1.2×	48 0.6×	52	503
Preston Briggs United States	17	341 0.8×	170 0.8×	127 0.9×	446 3.9×	675 8.4×	36	1.0k
John Slaney Australia	19	710 1.7×	388 1.9×	53 0.4×	227 2.0×	11 0.1×	56	948
Armando Tacchella Italy	14	423 1.0×	268 1.3×	60 0.4×	137 1.2×	22 0.3×	64	645
Thang Nguyen Bui United States	13	269 0.6×	246 1.2×	56 0.4×	370 3.2×	135 1.7×	19	863

Countries citing papers authored by Laurent Hyafil

Since Specialization

Citations

This map shows the geographic impact of Laurent Hyafil's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Laurent Hyafil with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Laurent Hyafil more than expected).

Fields of papers citing papers by Laurent Hyafil

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Laurent Hyafil. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Laurent Hyafil. The network helps show where Laurent Hyafil may publish in the future.

Co-authorship network of co-authors of Laurent Hyafil

This figure shows the co-authorship network connecting the top 25 collaborators of Laurent Hyafil. A scholar is included among the top collaborators of Laurent Hyafil based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Laurent Hyafil. Laurent Hyafil is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

12 of 12 papers shown

1.

Hyafil, Laurent & H. T. Kung. (2018). Bounds on the speed-up of parallel evaluation of recurrences. Figshare.

2.

Ramanan, Prakash & Laurent Hyafil. (1984). New algorithms for selection. Journal of Algorithms. 5(4). 557–578. 7 indexed citations

3.

Hyafil, Laurent. (1979). On the Parallel Evaluation of Multivariate Polynomials. SIAM Journal on Computing. 8(2). 120–123. 30 indexed citations

4.

Hyafil, Laurent. (1978). On the parallel evaluation of multivariate polynomials. 193–195. 10 indexed citations

5.

Hyafil, Laurent. (1977). The power of commutativity. 264. 171–174. 7 indexed citations

6.

Hyafil, Laurent & H. T. Kung. (1977). The Complexity of Parallel Evaluation of Linear Recurrences. Journal of the ACM. 24(3). 513–521. 44 indexed citations

7.

Hyafil, Laurent & Ronald L. Rivest. (1976). Constructing optimal binary decision trees is NP-complete. Information Processing Letters. 5(1). 15–17. 571 indexed citations breakdown →

8.

Hyafil, Laurent. (1976). Bounds for Selection. SIAM Journal on Computing. 5(1). 109–114. 35 indexed citations

9.

Hyafil, Laurent, et al.. (1975). On the additive complexity of specific polynomials. Information Processing Letters. 4(2). 45–47. 1 indexed citations

10.

Hyafil, Laurent & H. T. Kung. (1975). The complexity of parallel evaluation of linear recurrence. 12–22. 7 indexed citations

11.

Hyafil, Laurent & H. T. Kung. (1974). Parallel Algorithms for Solving Triangular Linear Systems with Small Parallelism,. Defense Technical Information Center (DTIC). 5 indexed citations

12.

Hyafil, Laurent, et al.. (1974). An efficient algorithm for computing optimal disk merge patterns. (Extended Abstract). 216–229. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact