Luc Longpré - RankMe

73 papers A* 1A 3B 5C 1Journal 42Unranked 15

Year	Rank	Type	Title / Venue / Authors
2023	—	`ch.`	Additional Spatial Dimensions Can Help Speed Up Computations. Decision Making Under Uncertainty and Constraints Luc Longpré, Olga Kosheleva, Vladik Kreinovich
2023	—	`ch.`	Baudelaire's Ideas of Vagueness and Uniqueness in Art: Algorithm-Based Explanations. Decision Making Under Uncertainty and Constraints Luc Longpré, Olga Kosheleva, Vladik Kreinovich
2023	—	`conf`	Fast - Asymptotically Optimal - Methods for Determining the Optimal Number of Features. IUKM (1) Saeid Tizpaz-Niari, Luc Longpré, Olga Kosheleva, Vladik Kreinovich
2023	—	`ch.`	How to Describe Hypothetic Truly Rare Events (With Probability 0). Uncertainty, Constraints, and Decision Making Luc Longpré, Vladik Kreinovich
2019	B	`conf`	Between Dog and Wolf: A Continuous Transition from Fuzzy to Probabilistic Estimates. FUZZ-IEEE Martine Ceberio, Olga Kosheleva, Vladik Kreinovich, Luc Longpré
2019	B	`conf`	In Its Usual Formulation, Fuzzy Computation Is, In General, NP-Hard, But a More Realistic Formulation Can Make It Feasible. FUZZ-IEEE Martine Ceberio, Olga Kosheleva, Vladik Kreinovich, Luc Longpré
2019	—	`ch.`	Why the Best Predictive Models Are Often Different from the Best Explanatory Models: A Theoretical Explanation. Structural Changes and their Econometric Modeling Songsak Sriboonchitta, Luc Longpré, Vladik Kreinovich, Thongchai Dumrongpokaphan
2017	—	`conf`	A View on Dealing with Privacy and Computer Malware Concerns. ICADIWT Luc Longpré
2015	—	`conf`	Coming up with a good question is not easy: A proof. NAFIPS/WConSC Joe Lorkowski, Luc Longpré, Olga Kosheleva, Salem Benferhat
2014	—	`conf`	Towards the Possibility of Objective Interval Uncertainty. SCAN Luc Longpré, Olga Kosheleva, Vladik Kreinovich
2013	J	`jnl`	Checking Monotonicity is NP-Hard Even for Cubic Polynomials. Reliab. Comput. Andrzej Pownuk, Luc Longpré, Vladik Kreinovich
2013	—	`conf`	Data anonymization that leads to the most accurate estimates of statistical characteristics: Fuzzy-motivated approach. IFSA/NAFIPS G. Xiang, Scott Ferson, Lev Ginzburg, Luc Longpré, E. Mayorga, Olga Kosheleva
2011	J	`jnl`	Estimating sample mean under interval uncertainty and constraint on sample variance. Int. J. Approx. Reason. Misha Koshelev, Ali Jalal-Kamali, Luc Longpré
2011	J	`jnl`	Quantum computation techniques for gauging reliability of interval and fuzzy data. Int. J. Gen. Syst. Luc Longpré, Christian Servin, Vladik Kreinovich
2011	J	`jnl`	Towards the Possibility of Objective Interval Uncertainty in Physics. Reliab. Comput. Darrell Cheu, Luc Longpré
2010	J	`jnl`	Algorithmic information theory may explain the pathogenic number of DNA repeats in myotonic dystrophy type 1 (and in similar diseases). SIGACT News Misha Koshelev, Luc Longpré
2009	J	`jnl`	The complexity of Solitaire. Theor. Comput. Sci. Luc Longpré, Pierre McKenzie
2007	—	`ch.`	How to Efficiently Process Uncertainty within a Cyberinfrastructure without Sacrificing Privacy and Confidentiality. Computational Intelligence in Information Assurance and Security Luc Longpré, Vladik Kreinovich
2007	B	`conf`	The Complexity of Solitaire. MFCS Luc Longpré, Pierre McKenzie
2006	J	`jnl`	Enumerations of the Kolmogorov function. J. Symb. Log. Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan, Leen Torenvliet
2006	—	`conf`	Measuring privacy loss in statistical databases. DCFS Vinod Chirayath, Luc Longpré
2006	J	`jnl`	Towards Combining Probabilistic and Interval Uncertainty in Engineering Calculations: Algorithms for Computing Statistics under Interval Uncertainty, and Their Computational Complexity. Reliab. Comput. Vladik Kreinovich, Gang Xiang, Scott A. Starks, Luc Longpré, Martine Ceberio, Roberto Araiza, Jan Beck, Raj Kandathi, Asis Nayak, Roberto Torres, Janos G. Hajagos
2005	J	`jnl`	Exact Bounds on Finite Populations of Interval Data. Reliab. Comput. Scott Ferson, Lev Ginzburg, Vladik Kreinovich, Luc Longpré, Monica Aviles
2005	J	`jnl`	Kolmogorov complexity leads to a representation theorem for idempotent probabilities (sigma-maxitive measures). SIGACT News Vladik Kreinovich, Luc Longpré
2005	J	`jnl`	Outlier Detection under Interval Uncertainty: Algorithmic Solvability and Computational Complexity. Reliab. Comput. Vladik Kreinovich, Luc Longpré, Praveen Patangay, Scott Ferson, Lev Ginzburg
2004	J	`jnl`	Dirty Pages of Logarithm Tables, Lifetime of the Universe, and (Subjective) Probabilities on Finite and Infinite Intervals. Reliab. Comput. Hung T. Nguyen, Vladik Kreinovich, Luc Longpré
2004	J	`jnl`	Eliminating Duplicates under Interval and Fuzzy Uncertainty: An Asymptotically Optimal Algorithm and Its Geospatial Applications. Reliab. Comput. Roberto Torres, G. Randy Keller, Vladik Kreinovich, Luc Longpré, Scott A. Starks
2004	J	`jnl`	Enumerations of the Kolmogorov Function Electron. Colloquium Comput. Complex. Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrei A. Muchnik, Frank Stephan, Leen Torenvliet
2004	J	`jnl`	Fast quantum algorithms for handling probabilistic and interval uncertainty. Math. Log. Q. Vladik Kreinovich, Luc Longpré
2004	—	`conf`	New Algorithms for Statistical Analysis of Interval Data. PARA Gang Xiang, Scott A. Starks, Vladik Kreinovich, Luc Longpré
2003	J	`jnl`	Are There Easy-to-Check Necessary and Sufficient Conditions for Straightforward Interval Computations To Be Exact? Reliab. Comput. Vladik Kreinovich, Luc Longpré, James J. Buckley
2003	J	`jnl`	Can quantum computers be useful when there are not yet enough qubits? Bull. EATCS Luc Longpré, Vladik Kreinovich
2003	B	`conf`	Dirty pages of logarithm tables, lifetime of the universe, and subjective (fuzzy) probabilities on finite and infinite intervals. FUZZ-IEEE Hung T. Nguyen, Vladik Kreinovich, Luc Longpré
2003	—	`conf`	Outlier Detection under Interval Uncertainty: Algorithmic Solvability and Computational Complexity. LSSC Vladik Kreinovich, Luc Longpré, Praveen Patangay, Scott Ferson, Lev Ginzburg
2002	J	`jnl`	Computing variance for interval data is NP-hard. SIGACT News Scott Ferson, Lev Ginzburg, Vladik Kreinovich, Luc Longpré, Monica Aviles
2002	J	`jnl`	Why is Selecting the Simplest Hypothesis (Consistent with Data) a Good Idea? A Simple Explanation. Bull. EATCS Vladik Kreinovich, Luc Longpré
2001	J	`jnl`	A new graph characteristic and its application to numerical computability. Inf. Process. Lett. Frank Harary, Vladik Kreinovich, Luc Longpré
2001	J	`jnl`	Compressibility and Resource Bounded Measure. SIAM J. Comput. Harry Buhrman, Luc Longpré
2001	—	`conf`	Second-order uncertainty as a bridge between probabilistic and fuzzy approaches. EUSFLAT Conf. Hung T. Nguyen, Vladik Kreinovich, Luc Longpré
2000	J	`jnl`	Choosing a Physical Model: Why Symmetries? Bull. EATCS Raul Trejo, Vladik Kreinovich, Luc Longpré
2000	J	`jnl`	How Important is Theory for Practical Problems? A Partial Explanation of Hartmanis' Observation. Bull. EATCS Vladik Kreinovich, Luc Longpré
2000	J	`jnl`	The Temporal Precedence Problem. Algorithmica Desh Ranjan, Enrico Pontelli, Gopal Gupta, Luc Longpré
1999	J	`jnl`	Encryption Algorithms Made (Somewhat) More Natural (a pedagogical remark). Bull. EATCS Misha Koshelev, Vladik Kreinovich, Luc Longpré
1999	—	`conf`	Encryption algorithms made natural. ITiCSE-WGR Misha Koshelev, Vladik Kreinovich, Luc Longpré
1999	J	`jnl`	Gasarch, W.I. and Martin, G.A.: Bounded Queries in Recursion Theory. Reliab. Comput. Luc Longpré, Vladik Kreinovich
1998	J	`jnl`	A Brief Description of Gell-Mann's Lecture and How Intervals May Help to Describe Complexity in the Real World. Reliab. Comput. Misha Koshelev, Luc Longpré
1998	J	`jnl`	A Variation on the Zero-One Law. Inf. Process. Lett. Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré
1998	J	`jnl`	Human Visual Perception and Kolmogorov Complexity: Revisited. Bull. EATCS Vladik Kreinovich, Luc Longpré
1998	J	`jnl`	Kolmogorov Complexity Justifies Software Engineering Heuristics. Bull. EATCS Ann Q. Gates, Vladik Kreinovich, Luc Longpré
1998	J	`jnl`	Optimal Enclosure of Quadratic Interval Functions. Reliab. Comput. Misha Koshelev, Luc Longpré, Patrick Taillibert
1998	J	`jnl`	Report on COMPLEXITY 1998. SIGACT News Luc Longpré
1997	J	`jnl`	Interval and Complexity Workshops Back-to-Back with 1997 ACM Symposium on Theory of Computing (STOC'97). Reliab. Comput. Luc Longpré, Martin Berz
1997	J	`jnl`	Report on Complexity 1997. SIGACT News Luc Longpré
1996	A	`conf`	Compressibility and Resource Bounded Measure. STACS Harry Buhrman, Luc Longpré
1996	J	`jnl`	Zeros of Riemann's Zeta Function are Uniformly Distributed, but not Random: An Answer to Calude's Open Problem. Bull. EATCS Luc Longpré, Vladik Kreinovich
1995	A	`conf`	Communication Complexity of Key Agreement on Small Ranges. STACS Jin-Yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar
1995	J	`jnl`	On Symmetry of Information and Polynomial Time Invertibility Inf. Comput. Luc Longpré, Osamu Watanabe
1995	J	`jnl`	SPARSE Reduces Conjunctively to TALLY. SIAM J. Comput. Harry Buhrman, Edith Hemaspaandra, Luc Longpré
1994	J	`jnl`	On Reductions of NP Sets to Sparse Sets. J. Comput. Syst. Sci. Steven Homer, Luc Longpré
1993	J	`jnl`	Hard Promise Problems and Nonuniform Complexity. Theor. Comput. Sci. Luc Longpré, Alan L. Selman
1993	—	`conf`	SPARSE reduces conjunctively to TALLY. SCT Harry Buhrman, Luc Longpré, Edith Spaan
1993	J	`jnl`	Symmetry of Information and One-Way Functions. Inf. Process. Lett. Luc Longpré, Sarah Mocas
1992	C	`conf`	Nondeterministic and Alternating Computations. ICCI Jie Wang, Luc Longpré
1992	B	`conf`	On Symmetry of Information and Polynomial Time Invertibility. ISAAC Luc Longpré, Osamu Watanabe
1992	J	`jnl`	The Power of the Queue. SIAM J. Comput. Ming Li, Luc Longpré, Paul M. B. Vitányi
1991	—	`conf`	On Reductions of NP Sets to Sparse Sets. SCT Steven Homer, Luc Longpré
1991	—	`conf`	Symmetry of Information and One-Way Functions. ISA Luc Longpré, Sarah Mocas
1990	J	`jnl`	Cook Reducibility is Faster than Karp Reduciblity in NP. J. Comput. Syst. Sci. Luc Longpré, Paul Young
1990	A	`conf`	Hard Promise Problems and Nonuniform Complexity. STACS Luc Longpré, Alan L. Selman
1988	—	`conf`	Cook is faster than Karp: a study of reducibilities in NP. SCT Luc Longpré, Paul Young
1986	—	`—`	Resource Bounded Kolmogorov Complexity, A Link between Computational Complexity & Information Theory. Luc Longpré
1986	—	`conf`	The Power of the Queue. SCT Ming Li, Luc Longpré, Paul M. B. Vitányi
1982	A*	`conf`	The Use of Public-Key Cryptography for Signing Checks. CRYPTO Luc Longpré