Eric Bach

According to our database1, Eric Bach authored at least 54 papers between 1982 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Affine Relativization: Unifying the Algebrization and Relativization Barriers.
TOCT, 2018

Submodular goal value of Boolean functions.
Discrete Applied Mathematics, 2018

Liquid-chromatography retention order prediction for metabolite identification.
Bioinformatics, 2018

2017
Magnitude-Preserving Ranking for Structured Outputs.
Proceedings of The 9th Asian Conference on Machine Learning, 2017

2016
A Parallel Approach in Computing Correlation Immunity up to Six Variables.
Int. J. Found. Comput. Sci., 2016

Affine Relativization: Unifying the Algebrization and Relativization Barriers.
Electronic Colloquium on Computational Complexity (ECCC), 2016

Baby-Step Giant-Step Algorithms for the Symmetric Group.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime Test.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

On the Goal Value of a Boolean Function.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

2015
Counting composites with two strong liars.
Math. Comput., 2015

2014
Deep packet inspection with DFA-trees and parametrized language overapproximation.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

2013
Approximately counting semismooth integers.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2010
Threshold Rules for Online Sample Selection.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009
Improved Asymptotic Formulas for Counting Correlation Immune Boolean Functions.
SIAM J. Discrete Math., 2009

Computing prime harmonic sums.
Math. Comput., 2009

Exploiting Product Distributions to Identify Relevant Variables of Correlation Immune Functions.
Journal of Machine Learning Research, 2009

Iterative root approximation in p-adic numerical analysis.
J. Complexity, 2009

2007
Bounds for the expected duration of the monopolist game.
Inf. Process. Lett., 2007

Phase Transition of Multivariate Polynomial Systems.
Proceedings of the Theory and Applications of Models of Computation, 2007

A Novel Information Transmission Problem and Its Optimal Solution.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

2004
One-dimensional quantum walks with absorbing boundaries.
J. Comput. Syst. Sci., 2004

2003
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.
J. Scheduling, 2003

2001
One-dimensional quantum walks.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

On Testing for Zero Polynomials by a Set of Points with Bounded Precision.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
Threshold data structures and coding theory.
Theor. Comput. Sci., 2000

Better Bounds on the Accommodating Ratio for the Seat Reservation Problem.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999
Note on Taking Square-Roots Modulo N.
IEEE Trans. Information Theory, 1999

Sheaf Cohomology is #P-hard.
J. Symb. Comput., 1999

1998
Efficient Prediction of Marsaglia-Zaman Random Number Generators.
IEEE Trans. Information Theory, 1998

1997
Comments on search procedures for primitive roots.
Math. Comput., 1997

The Complexity of Number-Theoretic Constants.
Inf. Process. Lett., 1997

1996
Asynchronous Analysis of Parallel Dynamic Programming Algorithms.
IEEE Trans. Parallel Distrib. Syst., 1996

Explicit bounds for primes in residue classes.
Math. Comput., 1996

Asymptotic semismoothness probabilities.
Math. Comput., 1996

Results and estimates on pseudopowers.
Math. Comput., 1996

Weil bounds for singular curves.
Appl. Algebra Eng. Commun. Comput., 1996

DNA Models and Algorithms for NP-complete Problems.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1994
Tensor Products and Computability.
J. Symb. Comput., 1994

Exact Analysis of a Priority Queue Algorithm for Random Variate Generation.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993
Sieve Algorithms for Perfect Power Testing.
Algorithmica, 1993

Asynchronous Analysis of Parallel Dynamic Programming.
Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems, 1993

1991
Toward A Theory of Pollard's Rho Method
Inf. Comput., February, 1991

Realistic Analysis of Some Randomized Algorithms.
J. Comput. Syst. Sci., 1991

1990
A note on square roots in finite fields.
IEEE Trans. Information Theory, 1990

Factoring Polynomials Using Fewer Random Bits.
J. Symb. Comput., 1990

Factor Refinement.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1988
How to Generate Factored Random Numbers.
SIAM J. Comput., 1988

Intractable Problems in Number Theory.
Proceedings of the Advances in Cryptology, 1988

1987
Realistic Analysis of Some Randomized Algorithms
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1986
Sums of Divisors, Perfect Numbers and Factoring.
SIAM J. Comput., 1986

1985
Factoring with Cyclotomic Polynomials
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984
Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract)
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983
How to Generate Random Integers with Known Factorization
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1982
Fast Algorithms under the Extended Riemann Hypothesis: A Concrete Estimate
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982


  Loading...