Luc Longpré

According to our database1, Luc Longpré authored at least 59 papers between 1982 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Why the Best Predictive Models Are Often Different from the Best Explanatory Models: A Theoretical Explanation.
Proceedings of the Structural Changes and their Econometric Modeling, 2019

2017
A View on Dealing with Privacy and Computer Malware Concerns.
Proceedings of the Recent Advances in Artificial Intelligence Research and Development, 2017

2015
Coming up with a good question is not easy: A proof.
Proceedings of the 2015 Annual Conference of the North American Fuzzy Information Processing Society (NAFIPS) held jointly with 2015 5th World Conference on Soft Computing (WConSC), 2015

2014
Towards the Possibility of Objective Interval Uncertainty.
Proceedings of the Scientific Computing, Computer Arithmetic, and Validated Numerics, 2014

2013
Checking Monotonicity is NP-Hard Even for Cubic Polynomials.
Reliable Computing, 2013

Data anonymization that leads to the most accurate estimates of statistical characteristics: Fuzzy-motivated approach.
Proceedings of the Joint IFSA World Congress and NAFIPS Annual Meeting, 2013

2011
Towards the Possibility of Objective Interval Uncertainty in Physics.
Reliable Computing, 2011

Quantum computation techniques for gauging reliability of interval and fuzzy data.
Int. J. General Systems, 2011

Estimating sample mean under interval uncertainty and constraint on sample variance.
Int. J. Approx. Reasoning, 2011

2010
Algorithmic information theory may explain the pathogenic number of DNA repeats in myotonic dystrophy type 1 (and in similar diseases).
SIGACT News, 2010

2007
How to Efficiently Process Uncertainty within a Cyberinfrastructure without Sacrificing Privacy and Confidentiality.
Proceedings of the Computational Intelligence in Information Assurance and Security, 2007

The Complexity of Solitaire.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
Towards Combining Probabilistic and Interval Uncertainty in Engineering Calculations: Algorithms for Computing Statistics under Interval Uncertainty, and Their Computational Complexity.
Reliable Computing, 2006

Enumerations of the Kolmogorov function.
J. Symb. Log., 2006

Measuring privacy loss in statistical databases.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

2005
Kolmogorov complexity leads to a representation theorem for idempotent probabilities (sigma-maxitive measures).
SIGACT News, 2005

Exact Bounds on Finite Populations of Interval Data.
Reliable Computing, 2005

2004
Eliminating Duplicates under Interval and Fuzzy Uncertainty: An Asymptotically Optimal Algorithm and Its Geospatial Applications.
Reliable Computing, 2004

Dirty Pages of Logarithm Tables, Lifetime of the Universe, and (Subjective) Probabilities on Finite and Infinite Intervals.
Reliable Computing, 2004

Fast quantum algorithms for handling probabilistic and interval uncertainty.
Math. Log. Q., 2004

Enumerations of the Kolmogorov Function
Electronic Colloquium on Computational Complexity (ECCC), 2004

New Algorithms for Statistical Analysis of Interval Data.
Proceedings of the Applied Parallel Computing, 2004

2003
Are There Easy-to-Check Necessary and Sufficient Conditions for Straightforward Interval Computations To Be Exact?
Reliable Computing, 2003

Can quantum computers be useful when there are not yet enough qubits?
Bulletin of the EATCS, 2003

Outlier Detection under Interval Uncertainty: Algorithmic Solvability and Computational Complexity.
Proceedings of the Large-Scale Scientific Computing, 4th International Conference, 2003

Dirty pages of logarithm tables, lifetime of the universe, and subjective (fuzzy) probabilities on finite and infinite intervals.
Proceedings of the 12th IEEE International Conference on Fuzzy Systems, 2003

2002
Computing variance for interval data is NP-hard.
SIGACT News, 2002

Why is Selecting the Simplest Hypothesis (Consistent with Data) a Good Idea? A Simple Explanation.
Bulletin of the EATCS, 2002

2001
A new graph characteristic and its application to numerical computability.
Inf. Process. Lett., 2001

Second-order uncertainty as a bridge between probabilistic and fuzzy approaches.
Proceedings of the 2nd International Conference in Fuzzy Logic and Technology, 2001

2000
Choosing a Physical Model: Why Symmetries?
Bulletin of the EATCS, 2000

How Important is Theory for Practical Problems? A Partial Explanation of Hartmanis' Observation.
Bulletin of the EATCS, 2000

The Temporal Precedence Problem.
Algorithmica, 2000

1999
Encryption algorithms made natural.
SIGCSE Bulletin, 1999

Gasarch, W.I. and Martin, G.A.: Bounded Queries in Recursion Theory.
Reliable Computing, 1999

Encryption Algorithms Made (Somewhat) More Natural (a pedagogical remark).
Bulletin of the EATCS, 1999

1998
Report on COMPLEXITY 1998.
SIGACT News, 1998

Optimal Enclosure of Quadratic Interval Functions.
Reliable Computing, 1998

A Brief Description of Gell-Mann's Lecture and How Intervals May Help to Describe Complexity in the Real World.
Reliable Computing, 1998

A Variation on the Zero-One Law.
Inf. Process. Lett., 1998

Human Visual Perception and Kolmogorov Complexity: Revisited.
Bulletin of the EATCS, 1998

Kolmogorov Complexity Justifies Software Engineering Heuristics.
Bulletin of the EATCS, 1998

1997
Report on Complexity 1997.
SIGACT News, 1997

Interval and Complexity Workshops Back-to-Back with 1997 ACM Symposium on Theory of Computing (STOC'97).
Reliable Computing, 1997

1996
Zeros of Riemann's Zeta Function are Uniformly Distributed, but not Random: An Answer to Calude's Open Problem.
Bulletin of the EATCS, 1996

Compressibility and Resource Bounded Measure.
Proceedings of the STACS 96, 1996

1995
On Symmetry of Information and Polynomial Time Invertibility
Inf. Comput., August, 1995

SPARSE Reduces Conjunctively to TALLY.
SIAM J. Comput., 1995

Communication Complexity of Key Agreement on Small Ranges.
Proceedings of the STACS 95, 1995

1993
SPARSE reduces conjunctively to TALLY.
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1992
On Symmetry of Information and Polynomial Time Invertibility.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

Nondeterministic and Alternating Computations.
Proceedings of the Computing and Information, 1992

1991
Symmetry of Information and One-Way Functions.
Proceedings of the ISA '91 Algorithms, 1991

On Reductions of NP Sets to Sparse Sets.
Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991

1990
Cook Reducibility is Faster than Karp Reduciblity in NP.
J. Comput. Syst. Sci., 1990

Hard Promise Problems and Nonuniform Complexity.
Proceedings of the STACS 90, 1990

1988
Cook is faster than Karp: a study of reducibilities in NP.
Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988

1986
The Power of the Queue.
Proceedings of the Structure in Complexity Theory, 1986

1982
The Use of Public-Key Cryptography for Signing Checks.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982


  Loading...