Publication | Date of Publication | Type |
---|
2-designs and redundant syndrome extraction for quantum error correction | 2023-03-01 | Paper |
An Algorithm to Generate Random Factored Smooth Integers | 2020-06-12 | Paper |
Corrigendum to Affine Relativization | 2019-12-16 | Paper |
Affine Relativization | 2019-12-06 | Paper |
Submodular goal value of Boolean functions | 2018-02-22 | Paper |
Baby-step giant-step algorithms for the symmetric group | 2017-10-10 | Paper |
Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime Test | 2017-05-10 | Paper |
Baby-Step Giant-Step Algorithms for the Symmetric Group | 2017-05-10 | Paper |
Approximately counting semismooth integers | 2017-02-10 | Paper |
A Parallel Approach in Computing Correlation Immunity up to Six Variables | 2016-08-08 | Paper |
Counting composites with two strong liars | 2015-08-13 | Paper |
One-dimensional quantum walks | 2015-02-27 | Paper |
On the number of distinct functional graphs of affine-linear transformations over finite fields | 2014-02-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q2880978 | 2012-04-17 | Paper |
THRESHOLD RULES FOR ONLINE SAMPLE SELECTION | 2011-03-25 | Paper |
Computing prime harmonic sums | 2010-11-07 | Paper |
Improved Asymptotic Formulas for Counting Correlation Immune Boolean Functions | 2010-08-27 | Paper |
Threshold Rules for Online Sample Selection | 2010-07-20 | Paper |
A novel information transmission problem and its optimal solution | 2010-04-13 | Paper |
Bounds for the expected duration of the monopolist game | 2010-01-29 | Paper |
Iterative root approximation in \(p\)-adic numerical analysis | 2010-01-12 | Paper |
Phase transition of multivariate polynomial systems | 2009-03-24 | Paper |
Absorption Probabilities for the Two-Barrier Quantum Walk | 2009-01-27 | Paper |
Efficient verification of Tunnell's criterion | 2008-12-01 | Paper |
The hardness of computing an eigenform | 2008-10-23 | Paper |
A Novel Information Transmission Problem and Its Optimal Solution | 2008-02-26 | Paper |
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem | 2007-12-20 | Paper |
Phase Transition of Multivariate Polynomial Systems | 2007-11-13 | Paper |
One-dimensional quantum walks with absorbing boundaries | 2005-02-23 | Paper |
On testing for zero polynomials by a set of points with bounded precision. | 2003-08-17 | Paper |
The complexity of number-theoretic constants | 2003-03-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q4551384 | 2002-09-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q2766831 | 2002-07-01 | Paper |
Factoring polynomials over special finite fields | 2002-05-19 | Paper |
Random bisection and evolutionary walks | 2001-01-01 | Paper |
Sheaf cohomology is \(\#\)P-hard | 2000-07-16 | Paper |
Note on taking square-roots modulo N | 1999-11-21 | Paper |
DNA models and algorithms for NP-complete problems | 1999-01-17 | Paper |
Efficient prediction of Marsaglia-Zaman random number generators | 1998-10-18 | Paper |
Moments in the duration of play | 1998-01-21 | Paper |
Energy Arguments in the Theory of Algorithms | 1998-01-21 | Paper |
Comments on search procedures for primitive roots | 1997-12-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4335193 | 1997-09-01 | Paper |
Estimating completion time ratios of a fork-join barrier synchronization | 1997-02-27 | Paper |
Asymptotic semismoothness probabilities | 1996-12-03 | Paper |
Explicit bounds for primes in residue classes | 1996-12-03 | Paper |
Results and estimates on pseudopowers | 1996-12-03 | Paper |
Weil bounds for singular curves | 1996-10-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q4888749 | 1996-08-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q4855917 | 1996-07-28 | Paper |
Tensor products and computability | 1996-07-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q4325958 | 1995-04-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q3138894 | 1994-09-19 | Paper |
Statistical Evidence for Small Generating Sets | 1994-04-04 | Paper |
Factor Refinement | 1994-04-04 | Paper |
Sieve algorithms for perfect power testing | 1993-06-29 | Paper |
Toward a theory of Pollard's rho method | 1991-01-01 | Paper |
Realistic analysis of some randomized algorithms | 1991-01-01 | Paper |
Factoring polynomials using fewer random bits | 1990-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3211422 | 1990-01-01 | Paper |
Explicit Bounds for Primality Testing and Related Problems | 1990-01-01 | Paper |
A note on square roots in finite fields | 1990-01-01 | Paper |
Factoring with Cyclotomic Polynomials | 1989-01-01 | Paper |
How to Generate Factored Random Numbers | 1988-01-01 | Paper |
Sums of Divisors, Perfect Numbers and Factoring | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3689236 | 1985-01-01 | Paper |