Search the dblp DataBase
Luc Longpré :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
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 ] 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 ] 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 ] Luc Longpré The Use of Public-Key Cryptography for Signing Checks. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1982, pp:187-197 [Conf ] Jie Wang , Luc Longpré Nondeterministic and Alternating Computations. [Citation Graph (0, 0)][DBLP ] ICCI, 1992, pp:88-91 [Conf ] Luc Longpré , Sarah Mocas Symmetry of Information and One-Way Functions. [Citation Graph (0, 0)][DBLP ] ISA, 1991, pp:308-315 [Conf ] Luc Longpré , Osamu Watanabe On Symmetry of Information and Polynomial Time Invertibility. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:410-419 [Conf ] 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 ] 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 ] Harry Buhrman , Luc Longpré Compressibility and Resource Bounded Measure. [Citation Graph (0, 0)][DBLP ] STACS, 1996, pp:13-24 [Conf ] 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 ] Luc Longpré , Alan L. Selman Hard Promise Problems and Nonuniform Complexity. [Citation Graph (0, 0)][DBLP ] STACS, 1990, pp:216-226 [Conf ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Luc Longpré , Pierre McKenzie The Complexity of Solitaire. [Citation Graph (0, 0)][DBLP ] MFCS, 2007, pp:182-193 [Conf ] Second-order uncertainty as a bridge between probabilistic and fuzzy approaches. [Citation Graph (, )][DBLP ] Search in 0.007secs, Finished in 0.286secs