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).
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
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
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
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.