Luc Longpré

995 total citations
72 papers, 472 citations indexed

About

Luc Longpré is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Statistics and Probability. According to data from OpenAlex, Luc Longpré has authored 72 papers receiving a total of 472 indexed citations (citations by other indexed papers that have themselves been cited), including 50 papers in Computational Theory and Mathematics, 35 papers in Artificial Intelligence and 8 papers in Statistics and Probability. Recurrent topics in Luc Longpré's work include Computability, Logic, AI Algorithms (31 papers), Numerical Methods and Algorithms (21 papers) and Algorithms and Data Compression (10 papers). Luc Longpré is often cited by papers focused on Computability, Logic, AI Algorithms (31 papers), Numerical Methods and Algorithms (21 papers) and Algorithms and Data Compression (10 papers). Luc Longpré collaborates with scholars based in United States, Netherlands and Singapore. Luc Longpré's co-authors include Владик Крейнович, Scott Ferson, Lev R. Ginzburg, Steven Homer, Scott A. Starks, Harry Buhrman, Roberto Torres, Gang Xiang, Martine Ceberio and Jan Beck and has published in prestigious journals such as SIAM Journal on Computing, Journal of Computational and Applied Mathematics and Theoretical Computer Science.

In The Last Decade

Luc Longpré

66 papers receiving 432 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Luc Longpré United States 11 297 248 88 82 51 72 472
Chenyi Hu United States 10 126 0.4× 115 0.5× 30 0.3× 40 0.5× 66 1.3× 47 407
Theodore Hailperin United States 10 150 0.5× 297 1.2× 35 0.4× 51 0.6× 15 0.3× 32 550
Barbara Vantaggi Italy 17 238 0.8× 518 2.1× 26 0.3× 114 1.4× 22 0.4× 83 799
Shoumei Li China 17 157 0.5× 193 0.8× 33 0.4× 394 4.8× 106 2.1× 52 632
R.B. Bapat India 11 160 0.5× 76 0.3× 53 0.6× 138 1.7× 22 0.4× 27 428
Javier Peña United States 13 246 0.8× 154 0.6× 21 0.2× 17 0.2× 40 0.8× 54 547
Jarmo Alanen Finland 6 59 0.2× 95 0.4× 54 0.6× 21 0.3× 40 0.8× 30 340
Bernard Hanzon Netherlands 14 113 0.4× 123 0.5× 89 1.0× 11 0.1× 262 5.1× 64 635
Diethard Pallaschke Germany 14 448 1.5× 36 0.1× 16 0.2× 53 0.6× 56 1.1× 58 695
Qianli Zhou China 12 101 0.3× 234 0.9× 35 0.4× 52 0.6× 42 0.8× 28 408

Countries citing papers authored by Luc Longpré

Since Specialization
Citations

This map shows the geographic impact of Luc Longpré'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 Luc Longpré with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Luc Longpré more than expected).

Fields of papers citing papers by Luc Longpré

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Luc Longpré. 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 Luc Longpré. The network helps show where Luc Longpré may publish in the future.

Co-authorship network of co-authors of Luc Longpré

This figure shows the co-authorship network connecting the top 25 collaborators of Luc Longpré. A scholar is included among the top collaborators of Luc Longpré 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 Luc Longpré. Luc Longpré is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Longpré, Luc, et al.. (2017). Entropy as a Measure of Average Loss of Privacy. Thai Journal of Mathematics. 7–15. 6 indexed citations
2.
Gates, Ann Q., et al.. (2014). Roadmap for Graduating Students with Expertise in the Analysis and Development of Secure Cyber- Systems. scholarworks - UTEP (The University of Texas at El Paso). 26(4). 749–56. 2 indexed citations
3.
Longpré, Luc, et al.. (2013). Checking Monotonicity Is NP-Hard Even for Cubic Polynomials. Reliable Computing. 18. 90–96. 1 indexed citations
5.
Longpré, Luc & Olga Kosheleva. (2012). TOWARDS UNIQUE PHYSICALLY MEANINGFUL DEFINITIONS OF RANDOM AND TYPICAL OBJECTS. scholarworks - UTEP (The University of Texas at El Paso).
6.
Крейнович, Владик, et al.. (2011). Towards a "Generic" Notion of Genericity: From "Typical" and "Random" to Meager, Shy, etc.. scholarworks - UTEP (The University of Texas at El Paso). 6(2). 104–113. 3 indexed citations
7.
Koshelev, Misha, et al.. (2011). Estimating sample mean under interval uncertainty and constraint on sample variance. International Journal of Approximate Reasoning. 52(8). 1136–1146.
8.
Longpré, Luc, Christian Servín, & Владик Крейнович. (2010). Quantum computation techniques for gauging reliability of interval and fuzzy data. International Journal of General Systems. 40(1). 99–109. 2 indexed citations
9.
Longpré, Luc, William Gasarch, G. William Walster, & Владик Крейнович. (2007). m solutions good, m-1 solutions better. Applied mathematical sciences. 2(5). 223–239. 2 indexed citations
10.
Beigel, Richard, Harry Buhrman, Lance Fortnow, et al.. (2004). Enumerations of the Kolmogorov Function. UvA-DARE (University of Amsterdam). 1 indexed citations
11.
Longpré, Luc & Владик Крейнович. (2003). Can Quantum Computers Be Useful When There are Not Yet Enough Qubits. scholarworks - UTEP (The University of Texas at El Paso). 79. 164–169. 2 indexed citations
12.
Крейнович, Владик, Luc Longpré, Scott Ferson, & Lev R. Ginzburg. (2002). Why is Selecting the Simplest Hypothesis (Consistent with Data) a Good Idea? A Simple Explanation. scholarworks - UTEP (The University of Texas at El Paso). 77. 191–194. 4 indexed citations
13.
Nguyen, Hung T., Владик Крейнович, & Luc Longpré. (2001). Second-Order Uncertainty as a Bridge Between Probabilistic and Fuzzy Approaches. scholarworks - UTEP (The University of Texas at El Paso). 410–413. 4 indexed citations
14.
Kreinovich, Vladik & Luc Longpré. (2000). How Important is Theory for Practical Problems? A Partial Explanation of Hartmanis' Observation. scholarworks - UTEP (The University of Texas at El Paso). 71. 160–164. 1 indexed citations
15.
Kosheleva, Olga, et al.. (1999). An Optimal FFT-Based Algorithm for Mosaicking Images, with Applications to Satellite Imaging and Web Search. scholarworks - UTEP (The University of Texas at El Paso). 5 indexed citations
16.
Крейнович, Владик & Luc Longpré. (1998). Human Visual Perception and Kolmogorov Complexity: Revisited. scholarworks - UTEP (The University of Texas at El Paso). 64. 1 indexed citations
17.
Gates, Ann Q., Владик Крейнович, & Luc Longpré. (1998). Kolmogorov Complexity Justifies Software Engineering Heuristics. scholarworks - UTEP (The University of Texas at El Paso). 66. 150–154. 2 indexed citations
18.
Buhrman, Harry & Luc Longpré. (1996). Compressibility and resource bounded measure. Lecture notes in computer science. 5 indexed citations
19.
Homer, Steven & Luc Longpré. (1994). On reductions of NP sets to sparse sets. Journal of Computer and System Sciences. 48(2). 324–336. 24 indexed citations
20.
Longpré, Luc & Paul R. Young. (1990). Cook reducibility is faster than Karp reducibility in NP. Journal of Computer and System Sciences. 41(3). 389–401. 10 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

Rankless by CCL
2026