| Publication | Date of Publication | Type |
|---|
| MNP: A class of NP optimization problems | 2023-12-12 | Paper |
| Counting roots for polynomials modulo prime powers | 2023-08-02 | Paper |
| Qualitative structure of a discrete predator-prey model with nonmonotonic functional response | 2023-06-19 | Paper |
| Computing zeta functions of large polynomial systems over finite fields | 2022-09-12 | Paper |
| Solution counts and sums of roots of unity | 2022-08-04 | Paper |
| LWE from non-commutative group rings | 2022-01-19 | Paper |
| On the ideal shortest vector problem over random rational primes | 2021-12-08 | Paper |
| Qualitative analysis of a degenerate fixed point of a discrete predator–prey model with cooperative hunting | 2021-09-10 | Paper |
| Flip bifurcations of two systems of difference equations | 2021-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743490 | 2019-05-10 | Paper |
| An MDL Algorithm for Detecting More Sources Than Sensors Using Outer-Products of Array Output | 2018-08-22 | Paper |
| Factor base discrete logarithms in Kummer extensions | 2018-08-08 | Paper |
| Collaborative Event-Region and Boundary-Region Detections in Wireless Sensor Networks | 2018-06-27 | Paper |
| Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes | 2018-05-17 | Paper |
| Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes | 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 | 2017-07-13 | Paper |
| A Deterministic Reduction for the Gap Minimum Distance Problem | 2017-06-08 | Paper |
| On Determining Deep Holes of Generalized Reed–Solomon Codes | 2017-04-28 | Paper |
| Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields | 2017-02-10 | Paper |
| Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields | 2016-08-26 | Paper |
| On Generating Coset Representatives of $$PGL_{2}(\mathbb {F}_{q})$$ P G L 2 ( F q ) in $$PGL_{2}(\mathbb {F}_{q^{2}})$$ P G L 2 ( F q 2 ) | 2016-07-25 | Paper |
| Counting Value Sets: Algorithm and Complexity | 2015-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501351 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501378 | 2015-08-03 | Paper |
| Running time and program size for self-assembled squares | 2015-02-27 | Paper |
| A deterministic reduction for the gap minimum distance problem | 2015-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2935749 | 2014-12-30 | Paper |
| Lower bounds of shortest vector lengths in random NTRU lattices | 2014-12-02 | Paper |
| Traps to the BGJT-algorithm for discrete logarithms | 2014-09-05 | Paper |
| On Determining Deep Holes of Generalized Reed-Solomon Codes | 2014-01-14 | Paper |
| On certain computations of Pisot numbers | 2013-06-28 | Paper |
| Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices | 2012-07-16 | Paper |
| On the minimum gap between sums of square roots of small integers | 2011-10-10 | Paper |
| An ideal multi-secret sharing scheme based on MSP | 2011-06-17 | Paper |
| Bounding the sum of square roots via lattice reduction | 2010-08-30 | Paper |
| Combinatorial optimization problems in self-assembly | 2010-08-05 | Paper |
| Finding the Smallest Gap between Sums of Square Roots | 2010-04-27 | Paper |
| Efficient algorithms for sparse cyclotomic integer zero testing | 2010-03-05 | Paper |
| Comments on ``A linear prediction method for parameter estimation of damped sinusoids | 2009-04-03 | Paper |
| Hard Problems of Algebraic Geometry Codes | 2009-02-24 | Paper |
| Bandwidth management in distributed sequential detection | 2008-12-21 | Paper |
| Complexity of Decoding Positive-Rate Reed-Solomon Codes | 2008-08-28 | Paper |
| Constructing Finite Field Extensions with Large Order Elements | 2008-08-13 | Paper |
| On the List and Bounded Distance Decodability of Reed–Solomon Codes | 2008-03-28 | Paper |
| Advances in Cryptology - CRYPTO 2003 | 2007-11-28 | Paper |
| On Deciding Deep Holes of Reed-Solomon Codes | 2007-11-13 | Paper |
| On Comparing Sums of Square Roots of Small Integers | 2007-09-05 | Paper |
| Primality proving via one round in ECPP and one iteration in AKS | 2007-08-20 | Paper |
| Partial lifting and the elliptic curve discrete logarithm problem | 2006-10-16 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Optimally weighted ESPRIT using uniform circular arrays | 2005-11-25 | Paper |
| On the construction of finite field elements of large order | 2005-09-22 | Paper |
| On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields | 2005-09-16 | Paper |
| Complexities for Generalized Models of Self-Assembly | 2005-09-16 | Paper |
| Advances in Cryptology – CRYPTO 2004 | 2005-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4664413 | 2005-04-05 | Paper |
| Straight-line programs and torsion points on elliptic curves | 2005-02-11 | Paper |
| On the ultimate complexity of factorials | 2005-01-11 | Paper |
| On counting and generating curves over small finite fields | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472081 | 2004-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425948 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418645 | 2003-08-11 | Paper |
| Asymptotic performance of optimal gain-and-phase estimators of sensor arrays | 2003-03-20 | Paper |
| Kolmogorov random graphs only have trivial stable colorings. | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2739445 | 2001-09-09 | Paper |
| Computing simple paths among obstacles | 2001-04-10 | Paper |
| Consistency of two detection techniques using single measurement of data | 1998-08-13 | Paper |
| Detection of cisoids using least square error function | 1997-12-18 | Paper |
| MNP: A class of NP optimization problems | 1997-09-28 | Paper |
