The Use of Public-Key Cryptography for Signing Checks. - Luc Longpré (CRYPTO, 1982)

Resource Bounded Kolmogorov Complexity, A Link between Computational Complexity & Information Theory. - Luc Longpré (1986)

Cook is faster than Karp: a study of reducibilities in NP. - Luc Longpré; Paul Young (SCT, 1988)

Cook Reducibility is Faster than Karp Reduciblity in NP. - Luc Longpré; Paul Young (J. Comput. Syst. Sci., 1990)

Nondeterministic and Alternating Computations. - Jie Wang 002; Luc Longpré (ICCI, 1992)

The Power of the Queue. - Ming Li 001; Luc Longpré; Paul M. B. Vitányi (SIAM J. Comput., 1992)

Symmetry of Information and One-Way Functions. - Luc Longpré; Sarah Mocas (Inf. Process. Lett., 1993)

Hard Promise Problems and Nonuniform Complexity. - Luc Longpré; Alan L. Selman (Theor. Comput. Sci., 1993)

On Reductions of NP Sets to Sparse Sets. - Steven Homer; Luc Longpré (J. Comput. Syst. Sci., 1994)

Communication Complexity of Key Agreement on Small Ranges. - Jin-yi Cai; Richard J. Lipton; Luc Longpré; Mitsunori Ogihara; Kenneth W. Regan; D. Sivakumar (STACS, 1995)

SPARSE Reduces Conjunctively to TALLY. - Harry Buhrman; Edith Hemaspaandra; Luc Longpré (SIAM J. Comput., 1995)

On Symmetry of Information and Polynomial Time Invertibility - Luc Longpré; Osamu Watanabe 001 (Inf. Comput., 1995)

Zeros of Riemann's Zeta Function are Uniformly Distributed, but not Random: An Answer to Calude's Open Problem. - Luc Longpré; Vladik Kreinovich (Bull. EATCS, 1996)

Interval and Complexity Workshops Back-to-Back with 1997 ACM Symposium on Theory of Computing (STOC'97). - Luc Longpré; Martin Berz (Reliab. Comput., 1997)

Report on Complexity 1997. - Luc Longpré (SIGACT News, 1997)

Kolmogorov Complexity Justifies Software Engineering Heuristics. - Ann Q. Gates; Vladik Kreinovich; Luc Longpré (Bull. EATCS, 1998)

Human Visual Perception and Kolmogorov Complexity: Revisited. - Vladik Kreinovich; Luc Longpré (Bull. EATCS, 1998)

A Variation on the Zero-One Law. - Andreas Blass; Yuri Gurevich; Vladik Kreinovich; Luc Longpré (Inf. Process. Lett., 1998)

A Brief Description of Gell-Mann's Lecture and How Intervals May Help to Describe Complexity in the Real World. - Misha Koshelev; Luc Longpré (Reliab. Comput., 1998)

Optimal Enclosure of Quadratic Interval Functions. - Misha Koshelev; Luc Longpré; Patrick Taillibert (Reliab. Comput., 1998)

Report on COMPLEXITY 1998. - Luc Longpré (SIGACT News, 1998)

Encryption Algorithms Made (Somewhat) More Natural (a pedagogical remark). - Misha Koshelev; Vladik Kreinovich; Luc Longpré (Bull. EATCS, 1999)

Gasarch, W.I. and Martin, G.A.: Bounded Queries in Recursion Theory. - Luc Longpré; Vladik Kreinovich (Reliab. Comput., 1999)

Encryption algorithms made natural. - Misha Koshelev; Vladik Kreinovich; Luc Longpré (ITiCSE-WGR, 1999)

The Temporal Precedence Problem. - Desh Ranjan; Enrico Pontelli; Gopal Gupta 001; Luc Longpré (Algorithmica, 2000)

How Important is Theory for Practical Problems? A Partial Explanation of Hartmanis' Observation. - Vladik Kreinovich; Luc Longpré (Bull. EATCS, 2000)

Choosing a Physical Model: Why Symmetries? - Raul Trejo; Vladik Kreinovich; Luc Longpré (Bull. EATCS, 2000)

Second-order uncertainty as a bridge between probabilistic and fuzzy approaches. - Hung T. Nguyen 002; Vladik Kreinovich; Luc Longpré (EUSFLAT Conf., 2001)

A new graph characteristic and its application to numerical computability. - Frank Harary; Vladik Kreinovich; Luc Longpré (Inf. Process. Lett., 2001)

Compressibility and Resource Bounded Measure. - Harry Buhrman; Luc Longpré (SIAM J. Comput., 2001)

Why is Selecting the Simplest Hypothesis (Consistent with Data) a Good Idea? A Simple Explanation. - Vladik Kreinovich; Luc Longpré (Bull. EATCS, 2002)

Computing variance for interval data is NP-hard. - Scott Ferson; Lev Ginzburg; Vladik Kreinovich; Luc Longpré; Monica Aviles (SIGACT News, 2002)

Dirty pages of logarithm tables, lifetime of the universe, and subjective (fuzzy) probabilities on finite and infinite intervals. - Hung T. Nguyen 002; Vladik Kreinovich; Luc Longpré (FUZZ-IEEE, 2003)

Can quantum computers be useful when there are not yet enough qubits? - Luc Longpré; Vladik Kreinovich (Bull. EATCS, 2003)

Are There Easy-to-Check Necessary and Sufficient Conditions for Straightforward Interval Computations To Be Exact? - Vladik Kreinovich; Luc Longpré; James J. Buckley (Reliab. Comput., 2003)

New Algorithms for Statistical Analysis of Interval Data. - Gang Xiang; Scott A. Starks; Vladik Kreinovich; Luc Longpré (PARA, 2004)

Fast quantum algorithms for handling probabilistic and interval uncertainty. - Vladik Kreinovich; Luc Longpré (Math. Log. Q., 2004)

Dirty Pages of Logarithm Tables, Lifetime of the Universe, and (Subjective) Probabilities on Finite and Infinite Intervals. - Hung T. Nguyen 002; Vladik Kreinovich; Luc Longpré (Reliab. Comput., 2004)

Eliminating Duplicates under Interval and Fuzzy Uncertainty: An Asymptotically Optimal Algorithm and Its Geospatial Applications. - Roberto Torres; G. Randy Keller; Vladik Kreinovich; Luc Longpré; Scott A. Starks (Reliab. Comput., 2004)

Exact Bounds on Finite Populations of Interval Data. - Scott Ferson; Lev Ginzburg; Vladik Kreinovich; Luc Longpré; Monica Aviles (Reliab. Comput., 2005)

Outlier Detection under Interval Uncertainty: Algorithmic Solvability and Computational Complexity. - Vladik Kreinovich; Luc Longpré; Praveen Patangay; Scott Ferson; Lev Ginzburg (Reliab. Comput., 2005)

Kolmogorov complexity leads to a representation theorem for idempotent probabilities (sigma-maxitive measures). - Vladik Kreinovich; Luc Longpré (SIGACT News, 2005)

Measuring privacy loss in statistical databases. - Vinod Chirayath; Luc Longpré (DCFS, 2006)

Enumerations of the Kolmogorov function. - Richard Beigel; Harry Buhrman; Peter A. Fejer; Lance Fortnow; Piotr Grabowski; Luc Longpré; Andrej Muchnik; Frank Stephan 001; Leen Torenvliet (J. Symb. Log., 2006)

Towards Combining Probabilistic and Interval Uncertainty in Engineering Calculations: Algorithms for Computing Statistics under Interval Uncertainty, and Their Computational Complexity. - Vladik Kreinovich; Gang Xiang; Scott A. Starks; Luc Longpré; Martine Ceberio; Roberto Araiza; Jan Beck; Raj Kandathi; Asis Nayak; Roberto Torres; Janos G. Hajagos (Reliab. Comput., 2006)

How to Efficiently Process Uncertainty within a Cyberinfrastructure without Sacrificing Privacy and Confidentiality. - Luc Longpré; Vladik Kreinovich (Computational Intelligence in Information Assurance and Security, 2007)

The complexity of Solitaire. - Luc Longpré; Pierre McKenzie (Theor. Comput. Sci., 2009)

Algorithmic information theory may explain the pathogenic number of DNA repeats in myotonic dystrophy type 1 (and in similar diseases). - Misha Koshelev; Luc Longpré (SIGACT News, 2010)

Estimating sample mean under interval uncertainty and constraint on sample variance. - Misha Koshelev; Ali Jalal-Kamali; Luc Longpré (Int. J. Approx. Reason., 2011)

Quantum computation techniques for gauging reliability of interval and fuzzy data. - Luc Longpré; Christian Servin; Vladik Kreinovich (Int. J. Gen. Syst., 2011)

Towards the Possibility of Objective Interval Uncertainty in Physics. - Darrell Cheu; Luc Longpré (Reliab. Comput., 2011)

Data anonymization that leads to the most accurate estimates of statistical characteristics: Fuzzy-motivated approach. - G. Xiang; Scott Ferson; Lev Ginzburg; Luc Longpré; E. Mayorga; Olga Kosheleva (IFSA/NAFIPS, 2013)

Checking Monotonicity is NP-Hard Even for Cubic Polynomials. - Andrzej Pownuk; Luc Longpré; Vladik Kreinovich (Reliab. Comput., 2013)

Towards the Possibility of Objective Interval Uncertainty. - Luc Longpré; Olga Kosheleva; Vladik Kreinovich (SCAN, 2014)

Coming up with a good question is not easy: A proof. - Joe Lorkowski; Luc Longpré; Olga Kosheleva; Salem Benferhat (NAFIPS/WConSC, 2015)

A View on Dealing with Privacy and Computer Malware Concerns. - Luc Longpré (ICADIWT, 2017)

Between Dog and Wolf: A Continuous Transition from Fuzzy to Probabilistic Estimates. - Martine Ceberio; Olga Kosheleva; Vladik Kreinovich; Luc Longpré (FUZZ-IEEE, 2019)

In Its Usual Formulation, Fuzzy Computation Is, In General, NP-Hard, But a More Realistic Formulation Can Make It Feasible. - Martine Ceberio; Olga Kosheleva; Vladik Kreinovich; Luc Longpré (FUZZ-IEEE, 2019)

Why the Best Predictive Models Are Often Different from the Best Explanatory Models: A Theoretical Explanation. - Songsak Sriboonchitta; Luc Longpré; Vladik Kreinovich; Thongchai Dumrongpokaphan (Structural Changes and their Econometric Modeling, 2019)

How to Describe Hypothetic Truly Rare Events (With Probability 0). - Luc Longpré; Vladik Kreinovich (Uncertainty, Constraints, and Decision Making, 2023)

Baudelaire's Ideas of Vagueness and Uniqueness in Art: Algorithm-Based Explanations. - Luc Longpré; Olga Kosheleva; Vladik Kreinovich (Decision Making Under Uncertainty and Constraints, 2023)

Additional Spatial Dimensions Can Help Speed Up Computations. - Luc Longpré; Olga Kosheleva; Vladik Kreinovich (Decision Making Under Uncertainty and Constraints, 2023)

Fast - Asymptotically Optimal - Methods for Determining the Optimal Number of Features. - Saeid Tizpaz-Niari; Luc Longpré; Olga Kosheleva; Vladik Kreinovich (IUKM (1), 2023)