Laurent Hyafil

1.2k citations
12 papers · 719 indexed · 1 hit paper · h-index 8
Topics
Polynomial and algebraic computation (3 papers)Interconnection Networks and Systems (2 papers)Parallel Computing and Optimization Techniques (2 papers)
Partner nations
United StatesFrance

In The Last Decade

Laurent Hyafil

10 papers receiving 635 citations

Hit Papers

Constructing optimal binary decision trees is NP-complete19762026199220091976100200300400500

Peers

Laurent Hyafil
Comparison fields: 5 of 96
  • Artificial Intelligence 416
  • Computational Theory and Mathematics 201
  • Information Systems 137
  • Computer Networks and Communications 114
  • Hardware and Architecture 80
Replace Se June Hong with:
Se June Hong United States
Thang Nguyen Bui United States
Arthur B. Kahn United States
Shahriar Lotfi Iran
Lawrence T. Kou United States
Man‐Tak Shing United States
Suresh Rai United States
Preston Briggs United States
Paul Morris United States
Armando Tacchella Italy
Laurent Hyafil relative to Se June Hong United States Se June Hong's profile →
Citations per field
00.5×3.4×
Se June Hong · 1×
Citations per year

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

12 of 12 papers shown
#WorkIndexed citations
1 0
2 7
3 30
4 10
5 44
6 7
7
Constructing optimal binary decision trees is NP-completebreakdown →
571
8 35
9 1
10 7
11
Parallel Algorithms for Solving Triangular Linear Systems with Small Parallelism,
5
12 2

About Laurent Hyafil

Laurent Hyafil is a scholar working on Discrete Mathematics and Combinatorics, Hardware and Architecture and Computational Theory and Mathematics, having authored 12 papers that have together received 719 indexed citations. Recurring topics across this work include Polynomial and algebraic computation (3 papers), Interconnection Networks and Systems (2 papers) and Parallel Computing and Optimization Techniques (2 papers). The work is most often cited by research in Artificial Intelligence (416 citations), Computational Theory and Mathematics (201 citations) and Hardware and Architecture (80 citations). Laurent Hyafil has collaborated with scholars based in United States and France. Frequent co-authors include Ronald L. Rivest, H. T. Kung, Prakash Ramanan, H. T. Kung and Jean Vuillemin. Their work appears in journals such as Journal of the ACM, SIAM Journal on Computing and Journal of Algorithms.

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

Rankless by CCL
2026