The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Luc Longpré: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  45. Second-order uncertainty as a bridge between probabilistic and fuzzy approaches. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002