default search action
Luc Longpré
Person information
- affiliation: University of Texas at El Paso, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c25]Saeid Tizpaz-Niari, Luc Longpré, Olga Kosheleva
, Vladik Kreinovich
Fast - Asymptotically Optimal - Methods for Determining the Optimal Number of Features. IUKM (1) 2023: 123-128 - [p5]Luc Longpré, Olga Kosheleva, Vladik Kreinovich:
Baudelaire's Ideas of Vagueness and Uniqueness in Art: Algorithm-Based Explanations. Decision Making Under Uncertainty and Constraints 2023: 3-9 - [p4]Luc Longpré, Vladik Kreinovich:
How to Describe Hypothetic Truly Rare Events (With Probability 0). Uncertainty, Constraints, and Decision Making 2023: 211-215 - [p3]Luc Longpré, Olga Kosheleva, Vladik Kreinovich:
Additional Spatial Dimensions Can Help Speed Up Computations. Decision Making Under Uncertainty and Constraints 2023: 297-304
2010 – 2019
- 2019
- [c24]Martine Ceberio, Olga Kosheleva, Vladik Kreinovich, Luc Longpré:
Between Dog and Wolf: A Continuous Transition from Fuzzy to Probabilistic Estimates. FUZZ-IEEE 2019: 1-5 - [c23]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: 1-6 - [p2]Songsak Sriboonchitta, Luc Longpré, Vladik Kreinovich, Thongchai Dumrongpokaphan:
Why the Best Predictive Models Are Often Different from the Best Explanatory Models: A Theoretical Explanation. Structural Changes and their Econometric Modeling 2019: 163-171 - 2017
- [c22]Luc Longpré:
A View on Dealing with Privacy and Computer Malware Concerns. ICADIWT 2017: 16-24 - 2015
- [c21]Joe Lorkowski, Luc Longpré, Olga Kosheleva, Salem Benferhat:
Coming up with a good question is not easy: A proof. NAFIPS/WConSC 2015: 1-6 - 2014
- [c20]Luc Longpré, Olga Kosheleva, Vladik Kreinovich:
Towards the Possibility of Objective Interval Uncertainty. SCAN 2014: 54-65 - 2013
- [j41]Andrzej Pownuk, Luc Longpré, Vladik Kreinovich:
Checking Monotonicity is NP-Hard Even for Cubic Polynomials. Reliab. Comput. 18: 90-96 (2013) - [c19]G. Xiang, Scott Ferson
Data anonymization that leads to the most accurate estimates of statistical characteristics: Fuzzy-motivated approach. IFSA/NAFIPS 2013: 611-616 - 2011
- [j40]Misha Koshelev, Ali Jalal-Kamali, Luc Longpré:
Estimating sample mean under interval uncertainty and constraint on sample variance. Int. J. Approx. Reason. 52(8): 1136-1146 (2011) - [j39]Luc Longpré, Christian Servin, Vladik Kreinovich:
Quantum computation techniques for gauging reliability of interval and fuzzy data. Int. J. Gen. Syst. 40(1): 99-109 (2011) - [j38]Darrell Cheu, Luc Longpré:
Towards the Possibility of Objective Interval Uncertainty in Physics. Reliab. Comput. 15(1): 43-46 (2011) - 2010
- [j37]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): 61-64 (2010)
2000 – 2009
- 2009
- [j36]Luc Longpré, Pierre McKenzie:
The complexity of Solitaire. Theor. Comput. Sci. 410(50): 5252-5260 (2009) - 2007
- [c18]Luc Longpré, Pierre McKenzie:
The Complexity of Solitaire. MFCS 2007: 182-193 - [p1]Luc Longpré, Vladik Kreinovich:
How to Efficiently Process Uncertainty within a Cyberinfrastructure without Sacrificing Privacy and Confidentiality. Computational Intelligence in Information Assurance and Security 2007: 155-173 - 2006
- [j35]Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan
Enumerations of the Kolmogorov function. J. Symb. Log. 71(2): 501-528 (2006) - [j34]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): 471-501 (2006) - [c17]Vinod Chirayath, Luc Longpré:
Measuring privacy loss in statistical databases. DCFS 2006: 16-25 - 2005
- [j33]Vladik Kreinovich, Luc Longpré, Praveen Patangay, Scott Ferson
Outlier Detection under Interval Uncertainty: Algorithmic Solvability and Computational Complexity. Reliab. Comput. 11(1): 59-76 (2005) - [j32]Scott Ferson
Exact Bounds on Finite Populations of Interval Data. Reliab. Comput. 11(3): 207-233 (2005) - [j31]Vladik Kreinovich, Luc Longpré:
Kolmogorov complexity leads to a representation theorem for idempotent probabilities (sigma-maxitive measures). SIGACT News 36(3): 107-112 (2005) - 2004
- [j30]Vladik Kreinovich, Luc Longpré:
Fast quantum algorithms for handling probabilistic and interval uncertainty. Math. Log. Q. 50(4-5): 405-416 (2004) - [j29]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): 83-106 (2004) - [j28]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): 401-422 (2004) - [c16]Gang Xiang, Scott A. Starks, Vladik Kreinovich, Luc Longpré:
New Algorithms for Statistical Analysis of Interval Data. PARA 2004: 189-196 - [i1]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. TR04 (2004) - 2003
- [j27]Luc Longpré, Vladik Kreinovich:
Can quantum computers be useful when there are not yet enough qubits? Bull. EATCS 79: 164-169 (2003) - [j26]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): 349-358 (2003) - [c15]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: 67-73 - [c14]Vladik Kreinovich, Luc Longpré, Praveen Patangay, Scott Ferson
Outlier Detection under Interval Uncertainty: Algorithmic Solvability and Computational Complexity. LSSC 2003: 238-245 - 2002
- [j25]Vladik Kreinovich, Luc Longpré:
Why is Selecting the Simplest Hypothesis (Consistent with Data) a Good Idea? A Simple Explanation. Bull. EATCS 77: 191-194 (2002) - [j24]Scott Ferson
Computing variance for interval data is NP-hard. SIGACT News 33(2): 108-118 (2002) - 2001
- [j23]Frank Harary, Vladik Kreinovich, Luc Longpré:
A new graph characteristic and its application to numerical computability. Inf. Process. Lett. 77(5-6): 277-282 (2001) - [j22]Harry Buhrman, Luc Longpré:
Compressibility and Resource Bounded Measure. SIAM J. Comput. 31(3): 876-886 (2001) - [c13]Hung T. Nguyen, Vladik Kreinovich, Luc Longpré:
Second-order uncertainty as a bridge between probabilistic and fuzzy approaches. EUSFLAT Conf. 2001: 410-413 - 2000
- [j21]Desh Ranjan, Enrico Pontelli
The Temporal Precedence Problem. Algorithmica 28(3): 288-306 (2000) - [j20]Raul Trejo, Vladik Kreinovich, Luc Longpré:
Choosing a Physical Model: Why Symmetries? Bull. EATCS 70: 159-161 (2000) - [j19]Vladik Kreinovich, Luc Longpré:
How Important is Theory for Practical Problems? A Partial Explanation of Hartmanis' Observation. Bull. EATCS 71: 160-164 (2000)
1990 – 1999
- 1999
- [j18]Misha Koshelev, Vladik Kreinovich, Luc Longpré:
Encryption Algorithms Made (Somewhat) More Natural (a pedagogical remark). Bull. EATCS 67: 153-156 (1999) - [j17]Luc Longpré, Vladik Kreinovich:
Gasarch, W.I. and Martin, G.A.: Bounded Queries in Recursion Theory. Reliab. Comput. 5(2): 201-203 (1999) - [c12]Misha Koshelev, Vladik Kreinovich, Luc Longpré:
Encryption algorithms made natural. ITiCSE-WGR 1999: 50-51 - 1998
- [j16]Vladik Kreinovich, Luc Longpré:
Human Visual Perception and Kolmogorov Complexity: Revisited. Bull. EATCS 64 (1998) - [j15]Ann Q. Gates, Vladik Kreinovich, Luc Longpré:
Kolmogorov Complexity Justifies Software Engineering Heuristics. Bull. EATCS 66: 150-154 (1998) - [j14]Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré:
A Variation on the Zero-One Law. Inf. Process. Lett. 67(1): 29-30 (1998) - [j13]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): 105-107 (1998) - [j12]Misha Koshelev, Luc Longpré, Patrick Taillibert:
Optimal Enclosure of Quadratic Interval Functions. Reliab. Comput. 4(4): 351-360 (1998) - [j11]Luc Longpré:
Report on COMPLEXITY 1998. SIGACT News 29(3): 92-93 (1998) - 1997
- [j10]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): 453-457 (1997) - [j9]Luc Longpré:
Report on Complexity 1997. SIGACT News 28(4): 80-83 (1997) - 1996
- [j8]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) - [c11]Harry Buhrman, Luc Longpré:
Compressibility and Resource Bounded Measure. STACS 1996: 13-24 - 1995
- [j7]Luc Longpré, Osamu Watanabe:
On Symmetry of Information and Polynomial Time Invertibility. Inf. Comput. 121(1): 14-22 (1995) - [j6]Harry Buhrman, Edith Hemaspaandra, Luc Longpré:
SPARSE Reduces Conjunctively to TALLY. SIAM J. Comput. 24(4): 673-681 (1995) - [c10]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: 38-49 - 1994
- [j5]Steven Homer, Luc Longpré:
On Reductions of NP Sets to Sparse Sets. J. Comput. Syst. Sci. 48(2): 324-336 (1994) - 1993
- [j4]Luc Longpré, Sarah Mocas:
Symmetry of Information and One-Way Functions. Inf. Process. Lett. 46(2): 95-100 (1993) - [j3]Luc Longpré, Alan L. Selman:
Hard Promise Problems and Nonuniform Complexity. Theor. Comput. Sci. 115(2): 277-290 (1993) - [c9]Harry Buhrman, Luc Longpré, Edith Spaan:
SPARSE reduces conjunctively to TALLY. SCT 1993: 208-214 - 1992
- [j2]Ming Li, Luc Longpré, Paul M. B. Vitányi:
The Power of the Queue. SIAM J. Comput. 21(4): 697-712 (1992) - [c8]Jie Wang, Luc Longpré:
Nondeterministic and Alternating Computations. ICCI 1992: 88-91 - [c7]Luc Longpré, Osamu Watanabe
On Symmetry of Information and Polynomial Time Invertibility. ISAAC 1992: 410-419 - 1991
- [c6]Steven Homer, Luc Longpré:
On Reductions of NP Sets to Sparse Sets. SCT 1991: 79-88 - [c5]Luc Longpré, Sarah Mocas:
Symmetry of Information and One-Way Functions. ISA 1991: 308-315 - 1990
- [j1]Luc Longpré, Paul Young:
Cook Reducibility is Faster than Karp Reduciblity in NP. J. Comput. Syst. Sci. 41(3): 389-401 (1990) - [c4]Luc Longpré, Alan L. Selman:
Hard Promise Problems and Nonuniform Complexity. STACS 1990: 216-226
1980 – 1989
- 1988
- [c3]Luc Longpré, Paul Young:
Cook is faster than Karp: a study of reducibilities in NP. SCT 1988: 293-302 - 1986
- [b1]Luc Longpré:
Resource Bounded Kolmogorov Complexity, A Link between Computational Complexity & Information Theory. Cornell University, USA, 1986 - [c2]Ming Li, Luc Longpré, Paul M. B. Vitányi:
The Power of the Queue. SCT 1986: 218-233 - 1982
- [c1]Luc Longpré:
The Use of Public-Key Cryptography for Signing Checks. CRYPTO 1982: 187-197
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: