Luc Longpré - researchr alias

researchr

You are not signed in
Sign in
Sign up

2010

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, 41(4):61-64, 2010. [doi]

2007

The Complexity of SolitaireLuc Longpré, Pierre McKenzie. mfcs 2007: 182-193 [doi]

How to Efficiently Process Uncertainty within a Cyberinfrastructure without Sacrificing Privacy and ConfidentialityLuc Longpré, Vladik Kreinovich. In Nadia Nedjah, Ajith Abraham, Luiza de Macedo Mourelle, editors, Computational Intelligence in Information Assurance and Security. Volume 57 of Studies in Computational Intelligence, pages 155-173, Springer, 2007. [doi]

2006

2005

2004

Enumerations of the Kolmogorov FunctionRichard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrei A. Muchnik, Frank Stephan, Leen Torenvliet. eccc, (015), 2004. [doi]

Fast quantum algorithms for handling probabilistic and interval uncertaintyVladik Kreinovich, Luc Longpré. mlq, 50(4-5):405-416, 2004. [doi]

Dirty Pages of Logarithm Tables, Lifetime of the Universe, and (Subjective) Probabilities on Finite and Infinite IntervalsHung T. Nguyen, Vladik Kreinovich, Luc Longpré. rc, 10(2):83-106, 2004. [doi]

Eliminating Duplicates under Interval and Fuzzy Uncertainty: An Asymptotically Optimal Algorithm and Its Geospatial ApplicationsRoberto Torres, G. Randy Keller, Vladik Kreinovich, Luc Longpré, Scott A. Starks. rc, 10(5):401-422, 2004. [doi]

New Algorithms for Statistical Analysis of Interval DataGang Xiang, Scott A. Starks, Vladik Kreinovich, Luc Longpré. para 2006: 189-196 [doi]

2003

Outlier Detection under Interval Uncertainty: Algorithmic Solvability and Computational ComplexityVladik Kreinovich, Luc Longpré, Praveen Patangay, Scott Ferson, Lev Ginzburg. lssc 2004: 238-245 [doi]

Are There Easy-to-Check Necessary and Sufficient Conditions for Straightforward Interval Computations To Be Exact?Vladik Kreinovich, Luc Longpré, James J. Buckley. rc, 9(5):349-358, 2003. [doi]

Can quantum computers be useful when there are not yet enough qubits?Luc Longpré, Vladik Kreinovich. eatcs, 79:164-169, 2003.

2002

Why is Selecting the Simplest Hypothesis (Consistent with Data) a Good Idea? A Simple ExplanationVladik Kreinovich, Luc Longpré. eatcs, 77:191-194, 2002.

2001

Compressibility and Resource Bounded MeasureHarry Buhrman, Luc Longpré. siamcomp, 31(3):876-886, 2001. [doi]

A new graph characteristic and its application to numerical computabilityFrank Harary, Vladik Kreinovich, Luc Longpré. ipl, 77(5-6):277-282, 2001. [doi]

Second-order uncertainty as a bridge between probabilistic and fuzzy approachesHung T. Nguyen, Vladik Kreinovich, Luc Longpré. eusflat 2001: 410-413 [doi]

2000

How Important is Theory for Practical Problems? A Partial Explanation of Hartmanis ObservationVladik Kreinovich, Luc Longpré. eatcs, 71:160-164, 2000.

The Temporal Precedence ProblemDesh Ranjan, Enrico Pontelli, Gopal Gupta, Luc Longpré. algorithmica, 28(3):288-306, 2000. [doi]

Choosing a Physical Model: Why Symmetries?Raul Trejo, Vladik Kreinovich, Luc Longpré. eatcs, 70:159-161, 2000.

1999

Encryption Algorithms Made (Somewhat) More Natural (a pedagogical remark)Misha Koshelev, Vladik Kreinovich, Luc Longpré. eatcs, 67:153-156, 1999.

Gasarch, W.I. and Martin, G.A.: Bounded Queries in Recursion TheoryLuc Longpré, Vladik Kreinovich. rc, 5(2):201-203, 1999. [doi]

1998

1997

Interval and Complexity Workshops Back-to-Back with 1997 ACM Symposium on Theory of Computing (STOC 97)Luc Longpré, Martin Berz. rc, 3(4):453-457, 1997. [doi]

1996

Compressibility and Resource Bounded MeasureHarry Buhrman, Luc Longpré. STACS 1996: 13-24

Zeros of Riemann s Zeta Function are Uniformly Distributed, but not Random: An Answer to Calude s Open ProblemLuc Longpré, Vladik Kreinovich. eatcs, 59, 1996.

1995

SPARSE Reduces Conjunctively to TALLYHarry Buhrman, Edith Hemaspaandra, Luc Longpré. siamcomp, 24(4):673-681, 1995.

Communication Complexity of Key Agreement on Small RangesJin-yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar. STACS 1995: 38-49

On Symmetry of Information and Polynomial Time InvertibilityLuc Longpré, Osamu Watanabe. iandc, 121(1):14-22, August 1995.

1994

On Reductions of NP Sets to Sparse SetsSteven Homer, Luc Longpré. jcss, 48(2):324-336, 1994.

1993

SPARSE reduces conjunctively to TALLYHarry Buhrman, Luc Longpré, Edith Spaan. cocoon 1993: 208-214

Symmetry of Information and One-Way FunctionsLuc Longpré, Sarah Mocas. ipl, 46(2):95-100, 1993.

Hard Promise Problems and Nonuniform ComplexityLuc Longpré, Alan L. Selman. TCS, 115(2):277-290, 1993.

1992

The Power of the QueueMing Li, Luc Longpré, Paul M. B. Vitányi. siamcomp, 21(4):697-712, 1992.

On Symmetry of Information and Polynomial Time InvertibilityLuc Longpré, Osamu Watanabe. isaac 1992: 410-419

Nondeterministic and Alternating ComputationsJie Wang, Luc Longpré. icci 1992: 88-91

1991

On Reductions of NP Sets to Sparse SetsSteven Homer, Luc Longpré. cocoon 1991: 79-88

Symmetry of Information and One-Way FunctionsLuc Longpré, Sarah Mocas. sersc-isa 1991: 308-315

1990

Hard Promise Problems and Nonuniform ComplexityLuc Longpré, Alan L. Selman. STACS 1990: 216-226

Cook Reducibility is Faster than Karp Reduciblity in NPLuc Longpré, Paul Young. jcss, 41(3):389-401, 1990.

1986

The Power of the QueueMing Li, Luc Longpré, Paul M. B. Vitányi. cocoon 1986: 218-233

1982

The Use of Public-Key Cryptography for Signing ChecksLuc Longpré. crypto 1982: 187-197