| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Misha Koshelev, Ali Jalal-Kamali, Luc Longpré |
Estimating sample mean under interval uncertainty and constraint on sample variance.  |
Int. J. Approx. Reasoning  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Longpré, Pierre McKenzie |
The complexity of Solitaire. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Longpré, Pierre McKenzie |
The Complexity of Solitaire. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Reliable Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Vinod Chirayath, Luc Longpré |
Measuring privacy loss in statistical databases. |
DCFS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Scott Ferson, Lev Ginzburg, Vladik Kreinovich, Luc Longpré, Monica Aviles |
Exact Bounds on Finite Populations of Interval Data. |
Reliable Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladik Kreinovich, Luc Longpré, Praveen Patangay, Scott Ferson, Lev Ginzburg |
Outlier Detection under Interval Uncertainty: Algorithmic Solvability and Computational Complexity. |
Reliable Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladik Kreinovich, Luc Longpré |
Kolmogorov complexity leads to a representation theorem for idempotent probabilities (sigma-maxitive measures). |
SIGACT News |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladik Kreinovich, Luc Longpré |
Fast quantum algorithms for handling probabilistic and interval uncertainty. |
Math. Log. Q. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Hung T. Nguyen, Vladik Kreinovich, Luc Longpré |
Dirty Pages of Logarithm Tables, Lifetime of the Universe, and (Subjective) Probabilities on Finite and Infinite Intervals. |
Reliable Computing |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Reliable Computing |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gang Xiang, Scott A. Starks, Vladik Kreinovich, Luc Longpré |
New Algorithms for Statistical Analysis of Interval Data. |
PARA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladik Kreinovich, Luc Longpré, James J. Buckley |
Are There Easy-to-Check Necessary and Sufficient Conditions for Straightforward Interval Computations To Be Exact? |
Reliable Computing |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Longpré, Vladik Kreinovich |
Can quantum computers be useful when there are not yet enough qubits? |
Bulletin of the EATCS |
2003 |
DBLP BibTeX RDF |
|
| 1 | Vladik Kreinovich, Luc Longpré, Praveen Patangay, Scott Ferson, Lev Ginzburg |
Outlier Detection under Interval Uncertainty: Algorithmic Solvability and Computational Complexity. |
LSSC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladik Kreinovich, Luc Longpré |
Why is Selecting the Simplest Hypothesis (Consistent with Data) a Good Idea? A Simple Explanation. |
Bulletin of the EATCS |
2002 |
DBLP BibTeX RDF |
|
| 1 | Scott Ferson, Lev Ginzburg, Vladik Kreinovich, Luc Longpré, Monica Aviles |
Computing variance for interval data is NP-hard. |
SIGACT News |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Harary, Vladik Kreinovich, Luc Longpré |
A new graph characteristic and its application to numerical computability. |
Inf. Process. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Luc Longpré |
Compressibility and Resource Bounded Measure. |
SIAM J. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Hung T. Nguyen, Vladik Kreinovich, Luc Longpré |
Second-order uncertainty as a bridge between probabilistic and fuzzy approaches. |
EUSFLAT Conf. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Desh Ranjan, Enrico Pontelli, Gopal Gupta, Luc Longpré |
The Temporal Precedence Problem. |
Algorithmica |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladik Kreinovich, Luc Longpré |
How Important is Theory for Practical Problems? A Partial Explanation of Hartmanis' Observation. |
Bulletin of the EATCS |
2000 |
DBLP BibTeX RDF |
|
| 1 | Raul Trejo, Vladik Kreinovich, Luc Longpré |
Choosing a Physical Model: Why Symmetries? |
Bulletin of the EATCS |
2000 |
DBLP BibTeX RDF |
|
| 1 | Luc Longpré, Vladik Kreinovich |
Gasarch, W.I. and Martin, G.A.: Bounded Queries in Recursion Theory. |
Reliable Computing |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Misha Koshelev, Vladik Kreinovich, Luc Longpré |
Encryption Algorithms Made (Somewhat) More Natural (a pedagogical remark). |
Bulletin of the EATCS |
1999 |
DBLP BibTeX RDF |
|
| 1 | Misha Koshelev, Vladik Kreinovich, Luc Longpré |
Encryption algorithms made natural. |
SIGCSE Bulletin |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré |
A Variation on the Zero-One Law. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Misha Koshelev, Luc Longpré |
A Brief Description of Gell-Mann's Lecture and How Intervals May Help to Describe Complexity in the Real World. |
Reliable Computing |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Misha Koshelev, Luc Longpré, Patrick Taillibert |
Optimal Enclosure of Quadratic Interval Functions. |
Reliable Computing |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladik Kreinovich, Luc Longpré |
Human Visual Perception and Kolmogorov Complexity: Revisited. |
Bulletin of the EATCS |
1998 |
DBLP BibTeX RDF |
|
| 1 | Ann Q. Gates, Vladik Kreinovich, Luc Longpré |
Kolmogorov Complexity Justifies Software Engineering Heuristics. |
Bulletin of the EATCS |
1998 |
DBLP BibTeX RDF |
|
| 1 | Luc Longpré |
Report on COMPLEXITY 1998. |
SIGACT News |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Longpré, Martin Berz |
Interval and Complexity Workshops Back-to-Back with 1997 ACM Symposium on Theory of Computing (STOC'97). |
Reliable Computing |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Longpré |
Report on Complexity 1997. |
SIGACT News |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Longpré, Vladik Kreinovich |
Zeros of Riemann's Zeta Function are Uniformly Distributed, but not Random: An Answer to Calude's Open Problem. |
Bulletin of the EATCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Harry Buhrman, Luc Longpré |
Compressibility and Resource Bounded Measure. |
STACS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Longpré, Osamu Watanabe |
On Symmetry of Information and Polynomial Time Invertibility |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Edith Hemaspaandra, Luc Longpré |
SPARSE Reduces Conjunctively to TALLY. |
SIAM J. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer, Luc Longpré |
On Reductions of NP Sets to Sparse Sets. |
J. Comput. Syst. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Longpré, Sarah Mocas |
Symmetry of Information and One-Way Functions. |
Inf. Process. Lett. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Longpré, Alan L. Selman |
Hard Promise Problems and Nonuniform Complexity. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Luc Longpré, Edith Spaan |
SPARSE reduces conjunctively to TALLY. |
Structure in Complexity Theory Conference |
1993 |
DBLP BibTeX RDF |
|
| 1 | Ming Li, Luc Longpré, Paul M. B. Vitányi |
The Power of the Queue. |
SIAM J. Comput. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jie Wang, Luc Longpré |
Nondeterministic and Alternating Computations. |
ICCI |
1992 |
DBLP BibTeX RDF |
|
| 1 | Luc Longpré, Osamu Watanabe |
On Symmetry of Information and Polynomial Time Invertibility. |
ISAAC |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Longpré, Sarah Mocas |
Symmetry of Information and One-Way Functions. |
ISA |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer, Luc Longpré |
On Reductions of NP Sets to Sparse Sets. |
Structure in Complexity Theory Conference |
1991 |
DBLP BibTeX RDF |
|
| 1 | Luc Longpré, Paul Young |
Cook Reducibility is Faster than Karp Reduciblity in NP. |
J. Comput. Syst. Sci. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Longpré, Alan L. Selman |
Hard Promise Problems and Nonuniform Complexity. |
STACS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Ming Li, Luc Longpré, Paul M. B. Vitányi |
The Power of the Queue. |
Structure in Complexity Theory Conference |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Longpré |
The Use of Public-Key Cryptography for Signing Checks. |
CRYPTO |
1982 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")