Luc Longpré

Publication Activity (10 Years)

Years Active: 1982-2023
Publications (10 Years): 5

Top Topics

Interval Type Fuzzy

Hermite Transform

Data Anonymization

Asymptotically Optimal

Top Venues

Publications

Saeid Tizpaz-Niari, Luc Longpré, Olga Kosheleva, Vladik Kreinovich
Fast - Asymptotically Optimal - Methods for Determining the Optimal Number of Features. IUKM (1) (2023)
Martine Ceberio, Olga Kosheleva, Vladik Kreinovich, Luc Longpré
In Its Usual Formulation, Fuzzy Computation Is, In General, NP-Hard, But a More Realistic Formulation Can Make It Feasible. FUZZ-IEEE (2019)
Martine Ceberio, Olga Kosheleva, Vladik Kreinovich, Luc Longpré
Between Dog and Wolf: A Continuous Transition from Fuzzy to Probabilistic Estimates. FUZZ-IEEE (2019)
Luc Longpré
A View on Dealing with Privacy and Computer Malware Concerns. ICADIWT (2017)
Joe Lorkowski, Luc Longpré, Olga Kosheleva, Salem Benferhat
Coming up with a good question is not easy: A proof. NAFIPS/WConSC (2015)
Luc Longpré, Olga Kosheleva, Vladik Kreinovich
Towards the Possibility of Objective Interval Uncertainty. SCAN (2014)
G. Xiang, Scott Ferson, Lev Ginzburg, Luc Longpré, E. Mayorga, Olga Kosheleva
Data anonymization that leads to the most accurate estimates of statistical characteristics: Fuzzy-motivated approach. IFSA/NAFIPS (2013)
Andrzej Pownuk, Luc Longpré, Vladik Kreinovich
Checking Monotonicity is NP-Hard Even for Cubic Polynomials. Reliab. Comput. 18 (2013)
Darrell Cheu, Luc Longpré
Towards the Possibility of Objective Interval Uncertainty in Physics. Reliab. Comput. 15 (1) (2011)
Misha Koshelev, Ali Jalal-Kamali, Luc Longpré
Estimating sample mean under interval uncertainty and constraint on sample variance. Int. J. Approx. Reason. 52 (8) (2011)
Luc Longpré, Christian Servin, Vladik Kreinovich
Quantum computation techniques for gauging reliability of interval and fuzzy data. Int. J. Gen. Syst. 40 (1) (2011)
Misha Koshelev, Luc Longpré
Algorithmic information theory may explain the pathogenic number of DNA repeats in myotonic dystrophy type 1 (and in similar diseases). SIGACT News 41 (4) (2010)
Luc Longpré, Pierre McKenzie
The complexity of Solitaire. Theor. Comput. Sci. 410 (50) (2009)
Luc Longpré, Pierre McKenzie
The Complexity of Solitaire. MFCS (2007)
Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan, Leen Torenvliet
Enumerations of the Kolmogorov function. J. Symb. Log. 71 (2) (2006)
Vladik Kreinovich, Gang Xiang, Scott A. Starks, Luc Longpré, Martine Ceberio, Roberto Araiza, Jan Beck, Raj Kandathi, Asis Nayak, Roberto Torres, Janos G. Hajagos
Towards Combining Probabilistic and Interval Uncertainty in Engineering Calculations: Algorithms for Computing Statistics under Interval Uncertainty, and Their Computational Complexity. Reliab. Comput. 12 (6) (2006)
Vinod Chirayath, Luc Longpré
Measuring privacy loss in statistical databases. DCFS (2006)
Vladik Kreinovich, Luc Longpré, Praveen Patangay, Scott Ferson, Lev Ginzburg
Outlier Detection under Interval Uncertainty: Algorithmic Solvability and Computational Complexity. Reliab. Comput. 11 (1) (2005)
Vladik Kreinovich, Luc Longpré
Kolmogorov complexity leads to a representation theorem for idempotent probabilities (sigma-maxitive measures). SIGACT News 36 (3) (2005)
Scott Ferson, Lev Ginzburg, Vladik Kreinovich, Luc Longpré, Monica Aviles
Exact Bounds on Finite Populations of Interval Data. Reliab. Comput. 11 (3) (2005)
Hung T. Nguyen, Vladik Kreinovich, Luc Longpré
Dirty Pages of Logarithm Tables, Lifetime of the Universe, and (Subjective) Probabilities on Finite and Infinite Intervals. Reliab. Comput. 10 (2) (2004)
Gang Xiang, Scott A. Starks, Vladik Kreinovich, Luc Longpré
New Algorithms for Statistical Analysis of Interval Data. PARA (2004)
Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrei A. Muchnik, Frank Stephan, Leen Torenvliet
Enumerations of the Kolmogorov Function Electron. Colloquium Comput. Complex. (015) (2004)
Roberto Torres, G. Randy Keller, Vladik Kreinovich, Luc Longpré, Scott A. Starks
Eliminating Duplicates under Interval and Fuzzy Uncertainty: An Asymptotically Optimal Algorithm and Its Geospatial Applications. Reliab. Comput. 10 (5) (2004)
Vladik Kreinovich, Luc Longpré
Fast quantum algorithms for handling probabilistic and interval uncertainty. Math. Log. Q. 50 (4-5) (2004)
Hung T. Nguyen, Vladik Kreinovich, Luc Longpré
Dirty pages of logarithm tables, lifetime of the universe, and subjective (fuzzy) probabilities on finite and infinite intervals. FUZZ-IEEE (2003)
Vladik Kreinovich, Luc Longpré, James J. Buckley
Are There Easy-to-Check Necessary and Sufficient Conditions for Straightforward Interval Computations To Be Exact? Reliab. Comput. 9 (5) (2003)
Vladik Kreinovich, Luc Longpré, Praveen Patangay, Scott Ferson, Lev Ginzburg
Outlier Detection under Interval Uncertainty: Algorithmic Solvability and Computational Complexity. LSSC (2003)
Luc Longpré, Vladik Kreinovich
Can quantum computers be useful when there are not yet enough qubits? Bull. EATCS 79 (2003)
Vladik Kreinovich, Luc Longpré
Why is Selecting the Simplest Hypothesis (Consistent with Data) a Good Idea? A Simple Explanation. Bull. EATCS 77 (2002)
Scott Ferson, Lev Ginzburg, Vladik Kreinovich, Luc Longpré, Monica Aviles
Computing variance for interval data is NP-hard. SIGACT News 33 (2) (2002)
Harry Buhrman, Luc Longpré
Compressibility and Resource Bounded Measure. SIAM J. Comput. 31 (3) (2001)
Frank Harary, Vladik Kreinovich, Luc Longpré
A new graph characteristic and its application to numerical computability. Inf. Process. Lett. 77 (5-6) (2001)
Hung T. Nguyen, Vladik Kreinovich, Luc Longpré
Second-order uncertainty as a bridge between probabilistic and fuzzy approaches. EUSFLAT Conf. (2001)
Desh Ranjan, Enrico Pontelli, Gopal Gupta, Luc Longpré
The Temporal Precedence Problem. Algorithmica 28 (3) (2000)
Raul Trejo, Vladik Kreinovich, Luc Longpré
Choosing a Physical Model: Why Symmetries? Bull. EATCS 70 (2000)
Vladik Kreinovich, Luc Longpré
How Important is Theory for Practical Problems? A Partial Explanation of Hartmanis' Observation. Bull. EATCS 71 (2000)
Misha Koshelev, Vladik Kreinovich, Luc Longpré
Encryption algorithms made natural. ACM SIGCSE Bull. 31 (4) (1999)
Luc Longpré, Vladik Kreinovich
Gasarch, W.I. and Martin, G.A.: Bounded Queries in Recursion Theory. Reliab. Comput. 5 (2) (1999)
Misha Koshelev, Vladik Kreinovich, Luc Longpré
Encryption Algorithms Made (Somewhat) More Natural (a pedagogical remark). Bull. EATCS 67 (1999)
Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré
A Variation on the Zero-One Law. Inf. Process. Lett. 67 (1) (1998)
Misha Koshelev, Luc Longpré
A Brief Description of Gell-Mann's Lecture and How Intervals May Help to Describe Complexity in the Real World. Reliab. Comput. 4 (1) (1998)
Misha Koshelev, Luc Longpré, Patrick Taillibert
Optimal Enclosure of Quadratic Interval Functions. Reliab. Comput. 4 (4) (1998)
Ann Q. Gates, Vladik Kreinovich, Luc Longpré
Kolmogorov Complexity Justifies Software Engineering Heuristics. Bull. EATCS 66 (1998)
Vladik Kreinovich, Luc Longpré
Human Visual Perception and Kolmogorov Complexity: Revisited. Bull. EATCS 64 (1998)
Luc Longpré
Report on COMPLEXITY 1998. SIGACT News 29 (3) (1998)
Luc Longpré
Report on Complexity 1997. SIGACT News 28 (4) (1997)
Luc Longpré, Martin Berz
Interval and Complexity Workshops Back-to-Back with 1997 ACM Symposium on Theory of Computing (STOC'97). Reliab. Comput. 3 (4) (1997)
Harry Buhrman, Luc Longpré
Compressibility and Resource Bounded Measure. STACS (1996)
Luc Longpré, Vladik Kreinovich
Zeros of Riemann's Zeta Function are Uniformly Distributed, but not Random: An Answer to Calude's Open Problem. Bull. EATCS 59 (1996)
Harry Buhrman, Edith Hemaspaandra, Luc Longpré
SPARSE Reduces Conjunctively to TALLY. SIAM J. Comput. 24 (4) (1995)
Luc Longpré, Osamu Watanabe
On Symmetry of Information and Polynomial Time Invertibility Inf. Comput. 121 (1) (1995)
Jin-yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar
Communication Complexity of Key Agreement on Small Ranges. STACS (1995)
Steven Homer, Luc Longpré
On Reductions of NP Sets to Sparse Sets. J. Comput. Syst. Sci. 48 (2) (1994)
Luc Longpré, Sarah Mocas
Symmetry of Information and One-Way Functions. Inf. Process. Lett. 46 (2) (1993)
Luc Longpré, Alan L. Selman
Hard Promise Problems and Nonuniform Complexity. Theor. Comput. Sci. 115 (2) (1993)
Harry Buhrman, Luc Longpré, Edith Spaan
SPARSE reduces conjunctively to TALLY. Computational Complexity Conference (1993)
Luc Longpré, Osamu Watanabe
On Symmetry of Information and Polynomial Time Invertibility. ISAAC (1992)
Ming Li, Luc Longpré, Paul M. B. Vitányi
The Power of the Queue. SIAM J. Comput. 21 (4) (1992)
Jie Wang, Luc Longpré
Nondeterministic and Alternating Computations. ICCI (1992)
Steven Homer, Luc Longpré
On Reductions of NP Sets to Sparse Sets. Computational Complexity Conference (1991)
Luc Longpré, Sarah Mocas
Symmetry of Information and One-Way Functions. ISA (1991)
Luc Longpré, Paul Young
Cook Reducibility is Faster than Karp Reduciblity in NP. J. Comput. Syst. Sci. 41 (3) (1990)
Luc Longpré, Alan L. Selman
Hard Promise Problems and Nonuniform Complexity. STACS (1990)
Luc Longpré, Paul Young
Cook is faster than Karp: a study of reducibilities in NP. Computational Complexity Conference (1988)
Ming Li, Luc Longpré, Paul M. B. Vitányi
The Power of the Queue. Computational Complexity Conference (1986)
Luc Longpré
The Use of Public-Key Cryptography for Signing Checks. CRYPTO (1982)