| Publication | Date of Publication | Type |
|---|
Global attractor and its 1D and 2D structures of Beverton-Holt Ricker competition model
Physica D | 2024-12-06 | Paper |
Secure three-party quantum summation based on W-class states
International Journal of Theoretical Physics | 2024-07-10 | Paper |
MNP: A class of NP optimization problems
Lecture Notes in Computer Science | 2023-12-12 | Paper |
Counting roots for polynomials modulo prime powers
Open Book Series | 2023-08-02 | Paper |
Qualitative structure of a discrete predator-prey model with nonmonotonic functional response
Discrete and Continuous Dynamical Systems. Series S | 2023-06-19 | Paper |
Computing zeta functions of large polynomial systems over finite fields
Journal of Complexity | 2022-09-12 | Paper |
Solution counts and sums of roots of unity
Journal of Number Theory | 2022-08-04 | Paper |
LWE from non-commutative group rings
Designs, Codes and Cryptography | 2022-01-19 | Paper |
On the ideal shortest vector problem over random rational primes
(available as arXiv preprint) | 2021-12-08 | Paper |
Qualitative analysis of a degenerate fixed point of a discrete predator-prey model with cooperative hunting
Mathematical Methods in the Applied Sciences | 2021-09-10 | Paper |
Lightweight noninteractive membership authentication and group key establishment for WSNs
Mathematical Problems in Engineering | 2021-05-14 | Paper |
Flip bifurcations of two systems of difference equations
Mathematical Methods in the Applied Sciences | 2021-01-12 | Paper |
| Constructing high order elements through subspace polynomials | 2019-05-10 | Paper |
An MDL Algorithm for Detecting More Sources Than Sensors Using Outer-Products of Array Output
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
Factor base discrete logarithms in Kummer extensions
Finite Fields and their Applications | 2018-08-08 | Paper |
Collaborative Event-Region and Boundary-Region Detections in Wireless Sensor Networks
IEEE Transactions on Signal Processing | 2018-06-27 | Paper |
Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes
Theoretical Computer Science | 2018-05-17 | Paper |
Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
| An Efficient Version of the Bombieri-Vaaler Lemma | 2017-07-19 | Paper |
Sparse univariate polynomials with many roots over finite fields
Finite Fields and their Applications | 2017-07-13 | Paper |
A Deterministic Reduction for the Gap Minimum Distance Problem
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
On Determining Deep Holes of Generalized Reed–Solomon Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation | 2017-02-10 | Paper |
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation | 2017-02-10 | Paper |
Sublinear root detection and new hardness results for sparse polynomials over finite fields
SIAM Journal on Computing | 2016-08-26 | Paper |
On generating coset representatives of \(\mathrm{PGL}_2(\mathbb F_q)\) in \(\mathrm{PGL}_2(\mathbb F_{q^2})\)
Information Security and Cryptology | 2016-07-25 | Paper |
Counting Value Sets: Algorithm and Complexity
(available as arXiv preprint) | 2015-10-01 | Paper |
| Invadable self-assembly: combining robustness with efficiency | 2015-08-03 | Paper |
| Constructing finite field extensions with large order elements | 2015-08-03 | Paper |
Running time and program size for self-assembled squares
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
A deterministic reduction for the gap minimum distance problem (extended abstract)
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
| scientific article; zbMATH DE number 6383052 (Why is no real title available?) | 2014-12-30 | Paper |
Lower bounds of shortest vector lengths in random NTRU lattices
Theoretical Computer Science | 2014-12-02 | Paper |
Traps to the BGJT-algorithm for discrete logarithms
LMS Journal of Computation and Mathematics | 2014-09-05 | Paper |
On Determining Deep Holes of Generalized Reed-Solomon Codes
Algorithms and Computation | 2014-01-14 | Paper |
On certain computations of Pisot numbers
Information Processing Letters | 2013-06-28 | Paper |
Lower bounds of shortest vector lengths in random NTRU lattices
Lecture Notes in Computer Science | 2012-07-16 | Paper |
On the minimum gap between sums of square roots of small integers
Theoretical Computer Science | 2011-10-10 | Paper |
An ideal multi-secret sharing scheme based on MSP
Information Sciences | 2011-06-17 | Paper |
Bounding the sum of square roots via lattice reduction
Mathematics of Computation | 2010-08-30 | Paper |
Combinatorial optimization problems in self-assembly
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Finding the smallest gap between sums of square roots
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Efficient algorithms for sparse cyclotomic integer zero testing
Theory of Computing Systems | 2010-03-05 | Paper |
Comments on ``A linear prediction method for parameter estimation of damped sinusoids
Signal Processing | 2009-04-03 | Paper |
Hard Problems of Algebraic Geometry Codes
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Bandwidth management in distributed sequential detection
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Complexity of Decoding Positive-Rate Reed-Solomon Codes
Automata, Languages and Programming | 2008-08-28 | Paper |
Constructing Finite Field Extensions with Large Order Elements
SIAM Journal on Discrete Mathematics | 2008-08-13 | Paper |
On the List and Bounded Distance Decodability of Reed–Solomon Codes
SIAM Journal on Computing | 2008-03-28 | Paper |
Advances in Cryptology - CRYPTO 2003
Lecture Notes in Computer Science | 2007-11-28 | Paper |
On Deciding Deep Holes of Reed-Solomon Codes
Lecture Notes in Computer Science | 2007-11-13 | Paper |
On Comparing Sums of Square Roots of Small Integers
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Primality proving via one round in ECPP and one iteration in AKS
Journal of Cryptology | 2007-08-20 | Paper |
Primality proving via one round in ECPP and one iteration in AKS
Journal of Cryptology | 2007-08-20 | Paper |
Partial lifting and the elliptic curve discrete logarithm problem
Algorithmica | 2006-10-16 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Optimally weighted ESPRIT using uniform circular arrays
Computers and Electrical Engineering | 2005-11-25 | Paper |
On the construction of finite field elements of large order
Finite Fields and their Applications | 2005-09-22 | Paper |
Complexities for Generalized Models of Self-Assembly
SIAM Journal on Computing | 2005-09-16 | Paper |
On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields
SIAM Journal on Computing | 2005-09-16 | Paper |
Advances in Cryptology – CRYPTO 2004
Lecture Notes in Computer Science | 2005-08-23 | Paper |
| scientific article; zbMATH DE number 2152822 (Why is no real title available?) | 2005-04-05 | Paper |
Straight-line programs and torsion points on elliptic curves
Computational Complexity | 2005-02-11 | Paper |
On the ultimate complexity of factorials
Theoretical Computer Science | 2005-01-11 | Paper |
On counting and generating curves over small finite fields
Journal of Complexity | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2079935 (Why is no real title available?) | 2004-08-03 | Paper |
| scientific article; zbMATH DE number 1979493 (Why is no real title available?) | 2003-09-14 | Paper |
| scientific article; zbMATH DE number 1962810 (Why is no real title available?) | 2003-08-11 | Paper |
Asymptotic performance of optimal gain-and-phase estimators of sensor arrays
IEEE Transactions on Signal Processing | 2003-03-20 | Paper |
Kolmogorov random graphs only have trivial stable colorings.
Information Processing Letters | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1643928 (Why is no real title available?) | 2001-09-09 | Paper |
Computing simple paths among obstacles
Computational Geometry | 2001-04-10 | Paper |
Consistency of two detection techniques using single measurement of data
Signal Processing | 1998-08-13 | Paper |
Detection of cisoids using least square error function
IEEE Transactions on Signal Processing | 1997-12-18 | Paper |
MNP: A class of NP optimization problems
Journal of Computer Science and Technology | 1997-09-28 | Paper |
