| Publication | Date of Publication | Type |
|---|
2-designs and redundant syndrome extraction for quantum error correction
Quantum Information Processing | 2023-03-01 | Paper |
| An Algorithm to Generate Random Factored Smooth Integers | 2020-06-12 | Paper |
Corrigendum to: ``Affine relativization: unifying the algebrization and relativization barriers
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Affine relativization: unifying the algebrization and relativization barriers
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Submodular goal value of Boolean functions
Discrete Applied Mathematics | 2018-02-22 | Paper |
Baby-step giant-step algorithms for the symmetric group
Journal of Symbolic Computation | 2017-10-10 | Paper |
Infinitely many Carmichael numbers for a modified Miller-Rabin prime test
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation | 2017-05-10 | Paper |
Baby-step giant-step algorithms for the symmetric group
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation | 2017-05-10 | Paper |
Approximately counting semismooth integers
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation | 2017-02-10 | Paper |
A parallel approach in computing correlation immunity up to six variables
International Journal of Foundations of Computer Science | 2016-08-08 | Paper |
Counting composites with two strong liars
Mathematics of Computation | 2015-08-13 | Paper |
One-dimensional quantum walks
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
On the number of distinct functional graphs of affine-linear transformations over finite fields
Linear Algebra and its Applications | 2014-02-19 | Paper |
Exploiting product distributions to identify relevant variables of correlation immune functions
Journal of Machine Learning Research (JMLR) | 2012-04-17 | Paper |
Threshold rules for online sample selection
Discrete Mathematics, Algorithms and Applications | 2011-03-25 | Paper |
Computing prime harmonic sums
Mathematics of Computation | 2010-11-07 | Paper |
Improved Asymptotic Formulas for Counting Correlation Immune Boolean Functions
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
Threshold rules for online sample selection
Lecture Notes in Computer Science | 2010-07-20 | Paper |
A novel information transmission problem and its optimal solution
Communications in Information and Systems | 2010-04-13 | Paper |
Bounds for the expected duration of the monopolist game
Information Processing Letters | 2010-01-29 | Paper |
Iterative root approximation in \(p\)-adic numerical analysis
Journal of Complexity | 2010-01-12 | Paper |
Phase transition of multivariate polynomial systems
Mathematical Structures in Computer Science | 2009-03-24 | Paper |
| Absorption Probabilities for the Two-Barrier Quantum Walk | 2009-01-27 | Paper |
Efficient verification of Tunnell's criterion
Japan Journal of Industrial and Applied Mathematics | 2008-12-01 | Paper |
The hardness of computing an eigenform
arXiv preprint | 2008-10-23 | Paper |
A Novel Information Transmission Problem and Its Optimal Solution
Fundamentals of Computation Theory | 2008-02-26 | Paper |
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
Journal of Scheduling | 2007-12-20 | Paper |
Phase Transition of Multivariate Polynomial Systems
Lecture Notes in Computer Science | 2007-11-13 | Paper |
One-dimensional quantum walks with absorbing boundaries
Journal of Computer and System Sciences | 2005-02-23 | Paper |
On testing for zero polynomials by a set of points with bounded precision.
Theoretical Computer Science | 2003-08-17 | Paper |
The complexity of number-theoretic constants
Information Processing Letters | 2003-03-19 | Paper |
| scientific article; zbMATH DE number 1796989 (Why is no real title available?) | 2002-09-05 | Paper |
| scientific article; zbMATH DE number 1696638 (Why is no real title available?) | 2002-07-01 | Paper |
Factoring polynomials over special finite fields
Finite Fields and their Applications | 2002-05-19 | Paper |
Random bisection and evolutionary walks
Journal of Applied Probability | 2001-01-01 | Paper |
Sheaf cohomology is \(\#\)P-hard
Journal of Symbolic Computation | 2000-07-16 | Paper |
Note on taking square-roots modulo N
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
DNA models and algorithms for NP-complete problems
Journal of Computer and System Sciences | 1999-01-17 | Paper |
Efficient prediction of Marsaglia-Zaman random number generators
IEEE Transactions on Information Theory | 1998-10-18 | Paper |
Moments in the duration of play
Statistics & Probability Letters | 1998-01-21 | Paper |
Energy Arguments in the Theory of Algorithms
The American Mathematical Monthly | 1998-01-21 | Paper |
Comments on search procedures for primitive roots
Mathematics of Computation | 1997-12-16 | Paper |
| scientific article; zbMATH DE number 1003234 (Why is no real title available?) | 1997-09-01 | Paper |
Estimating completion time ratios of a fork-join barrier synchronization
Performance Evaluation | 1997-02-27 | Paper |
Asymptotic semismoothness probabilities
Mathematics of Computation | 1996-12-03 | Paper |
Results and estimates on pseudopowers
Mathematics of Computation | 1996-12-03 | Paper |
Explicit bounds for primes in residue classes
Mathematics of Computation | 1996-12-03 | Paper |
Weil bounds for singular curves
Applicable Algebra in Engineering, Communication and Computing | 1996-10-10 | Paper |
| scientific article; zbMATH DE number 918133 (Why is no real title available?) | 1996-08-19 | Paper |
| scientific article; zbMATH DE number 819075 (Why is no real title available?) | 1996-07-28 | Paper |
Tensor products and computability
Journal of Symbolic Computation | 1996-07-14 | Paper |
| scientific article; zbMATH DE number 733563 (Why is no real title available?) | 1995-04-03 | Paper |
| scientific article; zbMATH DE number 432766 (Why is no real title available?) | 1994-09-19 | Paper |
Factor Refinement
Journal of Algorithms | 1994-04-04 | Paper |
| Statistical Evidence for Small Generating Sets | 1994-04-04 | Paper |
Sieve algorithms for perfect power testing
Algorithmica | 1993-06-29 | Paper |
Toward a theory of Pollard's rho method
Information and Computation | 1991-01-01 | Paper |
Realistic analysis of some randomized algorithms
Journal of Computer and System Sciences | 1991-01-01 | Paper |
| Explicit Bounds for Primality Testing and Related Problems | 1990-01-01 | Paper |
Factoring polynomials using fewer random bits
Journal of Symbolic Computation | 1990-01-01 | Paper |
A note on square roots in finite fields
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4191829 (Why is no real title available?) | 1990-01-01 | Paper |
| Factoring with Cyclotomic Polynomials | 1989-01-01 | Paper |
How to Generate Factored Random Numbers
SIAM Journal on Computing | 1988-01-01 | Paper |
Sums of Divisors, Perfect Numbers and Factoring
SIAM Journal on Computing | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3912454 (Why is no real title available?) | 1985-01-01 | Paper |
