2007 | ||
---|---|---|
47 | EE | Luc Longpré, Pierre McKenzie: The Complexity of Solitaire. MFCS 2007: 182-193 |
46 | EE | 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 | ||
45 | EE | 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 12(6): 471-501 (2006) |
2005 | ||
44 | EE | Vladik Kreinovich, Luc Longpré, Praveen Patangay, Scott Ferson, Lev Ginzburg: Outlier Detection under Interval Uncertainty: Algorithmic Solvability and Computational Complexity. Reliable Computing 11(1): 59-76 (2005) |
43 | EE | Scott Ferson, Lev Ginzburg, Vladik Kreinovich, Luc Longpré, Monica Aviles: Exact Bounds on Finite Populations of Interval Data. Reliable Computing 11(3): 207-233 (2005) |
42 | EE | 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 | ||
41 | EE | Gang Xiang, Scott A. Starks, Vladik Kreinovich, Luc Longpré: New Algorithms for Statistical Analysis of Interval Data. PARA 2004: 189-196 |
40 | EE | 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)(015): (2004) |
39 | EE | Vladik Kreinovich, Luc Longpré: Fast quantum algorithms for handling probabilistic and interval uncertainty. Math. Log. Q. 50(4-5): 405-416 (2004) |
38 | EE | 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 10(2): 83-106 (2004) |
37 | EE | 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 10(5): 401-422 (2004) |
2003 | ||
36 | EE | Vladik Kreinovich, Luc Longpré, Praveen Patangay, Scott Ferson, Lev Ginzburg: Outlier Detection under Interval Uncertainty: Algorithmic Solvability and Computational Complexity. LSSC 2003: 238-245 |
35 | Luc Longpré, Vladik Kreinovich: Can quantum computers be useful when there are not yet enough qubits? Bulletin of the EATCS 79: 164-169 (2003) | |
34 | EE | 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 9(5): 349-358 (2003) |
2002 | ||
33 | Vladik Kreinovich, Luc Longpré: Why is Selecting the Simplest Hypothesis (Consistent with Data) a Good Idea? A Simple Explanation. Bulletin of the EATCS 77: 191-194 (2002) | |
2001 | ||
32 | EE | Hung T. Nguyen, Vladik Kreinovich, Luc Longpré: Second-order uncertainty as a bridge between probabilistic and fuzzy approaches. EUSFLAT Conf. 2001: 410-413 |
31 | EE | 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) |
30 | EE | Harry Buhrman, Luc Longpré: Compressibility and Resource Bounded Measure. SIAM J. Comput. 31(3): 876-886 (2001) |
2000 | ||
29 | EE | Desh Ranjan, Enrico Pontelli, Gopal Gupta, Luc Longpré: The Temporal Precedence Problem. Algorithmica 28(3): 288-306 (2000) |
28 | Raul Trejo, Vladik Kreinovich, Luc Longpré: Choosing a Physical Model: Why Symmetries? Bulletin of the EATCS 70: 159-161 (2000) | |
27 | Vladik Kreinovich, Luc Longpré: How Important is Theory for Practical Problems? A Partial Explanation of Hartmanis' Observation. Bulletin of the EATCS 71: 160-164 (2000) | |
1999 | ||
26 | Misha Koshelev, Vladik Kreinovich, Luc Longpré: Encryption Algorithms Made (Somewhat) More Natural (a pedagogical remark). Bulletin of the EATCS 67: 153-156 (1999) | |
25 | EE | Luc Longpré, Vladik Kreinovich: Gasarch, W.I. and Martin, G.A.: Bounded Queries in Recursion Theory. Reliable Computing 5(2): 201-203 (1999) |
1998 | ||
24 | Vladik Kreinovich, Luc Longpré: Human Visual Perception and Kolmogorov Complexity: Revisited. Bulletin of the EATCS 64: (1998) | |
23 | Ann Q. Gates, Vladik Kreinovich, Luc Longpré: Kolmogorov Complexity Justifies Software Engineering Heuristics. Bulletin of the EATCS 66: 150-154 (1998) | |
22 | EE | Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré: A Variation on the Zero-One Law. Inf. Process. Lett. 67(1): 29-30 (1998) |
21 | EE | 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 4(1): 105-107 (1998) |
20 | EE | Misha Koshelev, Luc Longpré, Patrick Taillibert: Optimal Enclosure of Quadratic Interval Functions. Reliable Computing 4(4): 351-360 (1998) |
1997 | ||
19 | EE | Luc Longpré, Martin Berz: Interval and Complexity Workshops Back-to-Back with 1997 ACM Symposium on Theory of Computing (STOC'97). Reliable Computing 3(4): 453-457 (1997) |
1996 | ||
18 | Harry Buhrman, Luc Longpré: Compressibility and Resource Bounded Measure. STACS 1996: 13-24 | |
17 | 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 59: (1996) | |
1995 | ||
16 | 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 | |
15 | Luc Longpré, Osamu Watanabe: On Symmetry of Information and Polynomial Time Invertibility Inf. Comput. 121(1): 14-22 (1995) | |
14 | Harry Buhrman, Edith Hemaspaandra, Luc Longpré: SPARSE Reduces Conjunctively to TALLY. SIAM J. Comput. 24(4): 673-681 (1995) | |
1994 | ||
13 | Steven Homer, Luc Longpré: On Reductions of NP Sets to Sparse Sets. J. Comput. Syst. Sci. 48(2): 324-336 (1994) | |
1993 | ||
12 | Harry Buhrman, Luc Longpré, Edith Spaan: SPARSE reduces conjunctively to TALLY. Structure in Complexity Theory Conference 1993: 208-214 | |
11 | Luc Longpré, Sarah Mocas: Symmetry of Information and One-Way Functions. Inf. Process. Lett. 46(2): 95-100 (1993) | |
10 | Luc Longpré, Alan L. Selman: Hard Promise Problems and Nonuniform Complexity. Theor. Comput. Sci. 115(2): 277-290 (1993) | |
1992 | ||
9 | Jie Wang, Luc Longpré: Nondeterministic and Alternating Computations. ICCI 1992: 88-91 | |
8 | Luc Longpré, Osamu Watanabe: On Symmetry of Information and Polynomial Time Invertibility. ISAAC 1992: 410-419 | |
7 | Ming Li, Luc Longpré, Paul M. B. Vitányi: The Power of the Queue. SIAM J. Comput. 21(4): 697-712 (1992) | |
1991 | ||
6 | Luc Longpré, Sarah Mocas: Symmetry of Information and One-Way Functions. ISA 1991: 308-315 | |
5 | Steven Homer, Luc Longpré: On Reductions of NP Sets to Sparse Sets. Structure in Complexity Theory Conference 1991: 79-88 | |
1990 | ||
4 | Luc Longpré, Alan L. Selman: Hard Promise Problems and Nonuniform Complexity. STACS 1990: 216-226 | |
3 | Luc Longpré, Paul Young: Cook Reducibility is Faster than Karp Reduciblity in NP. J. Comput. Syst. Sci. 41(3): 389-401 (1990) | |
1986 | ||
2 | Ming Li, Luc Longpré, Paul M. B. Vitányi: The Power of the Queue. Structure in Complexity Theory Conference 1986: 218-233 | |
1982 | ||
1 | Luc Longpré: The Use of Public-Key Cryptography for Signing Checks. CRYPTO 1982: 187-197 |