| Year |
Citation |
Score |
| 2018 |
Aydinlioğlu B, Bach E. Affine Relativization: Unifying the Algebrization and Relativization Barriers Acm Transactions On Computation Theory. 10: 1-67. DOI: 10.1145/3170704 |
0.331 |
|
| 2015 |
Bach E, Shallue A. Counting composites with two strong liars Ieee Communications Magazine. 84: 3069-3089. DOI: 10.1090/Mcom/2949 |
0.406 |
|
| 2013 |
Rudinger K, Gamble JK, Bach E, Friesen M, Joynt R, Coppersmith SN. Comparing algorithms for graph isomorphism using discrete-and continuous-time quantum random walks Journal of Computational and Theoretical Nanoscience. 10: 1653-1661. DOI: 10.1166/Jctn.2013.3105 |
0.346 |
|
| 2013 |
Frees A, Gamble JK, Rudinger K, Bach E, Friesen M, Joynt R, Coppersmith SN. Power-law scaling for the adiabatic algorithm for search-engine ranking Physical Review a - Atomic, Molecular, and Optical Physics. 88. DOI: 10.1103/Physreva.88.032307 |
0.347 |
|
| 2013 |
Bach E, Bridy A. On the number of distinct functional graphs of affine-linear transformations over finite fields Linear Algebra and Its Applications. 439: 1312-1320. DOI: 10.1016/J.Laa.2013.04.014 |
0.621 |
|
| 2009 |
Bach E. Improved asymptotic formulas for counting correlation immune boolean functions Siam Journal On Discrete Mathematics. 23: 1525-1538. DOI: 10.1137/070705520 |
0.333 |
|
| 2009 |
Bach E, Klyve D, Sorenson JP. Computing prime harmonic sums Mathematics of Computation. 78: 2283-2305. DOI: 10.1090/S0025-5718-09-02249-2 |
0.302 |
|
| 2009 |
Bach E. Iterative root approximation in p-adic numerical analysis Journal of Complexity. 25: 511-529. DOI: 10.1016/J.Jco.2009.07.004 |
0.332 |
|
| 2007 |
Bach E, Ryan NC. Efficient Verification of Tunnell's Criterion Japan Journal of Industrial and Applied Mathematics. 24: 229-239. DOI: 10.1007/Bf03167537 |
0.371 |
|
| 2003 |
Bach E, Boyar J, Epstein L, Favrholdt LM, Jiang T, Larsen KS, Lin GH, Van Stee R. Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem Journal of Scheduling. 6: 131-147. DOI: 10.1023/A:1022985808959 |
0.324 |
|
| 2003 |
Cai J, Bach E. On testing for zero polynomials by a set of points with bounded precision Theoretical Computer Science. 296: 15-25. DOI: 10.1016/S0304-3975(02)00429-2 |
0.391 |
|
| 2001 |
Bach E, Von Zur Gathen J, Lenstra HW. Factoring polynomials over special finite fields Finite Fields and Their Applications. 7: 5-28. DOI: 10.1006/Ffta.2000.0306 |
0.379 |
|
| 1999 |
Bach E, Huber K. Note on taking square-roots modulo N Ieee Transactions On Information Theory. 45: 807-809. DOI: 10.1109/18.749034 |
0.337 |
|
| 1999 |
Bach E. Sheaf Cohomology is #P-hard Journal of Symbolic Computation. 27: 429-433. DOI: 10.1006/Jsco.1998.0261 |
0.31 |
|
| 1998 |
Bach E. Efficient prediction of Marsaglia-Zaman random number generators Ieee Transactions On Information Theory. 44: 1253-1257. DOI: 10.1109/18.669305 |
0.321 |
|
| 1997 |
Bach E. Comments on search procedures for primitive roots Mathematics of Computation. 66: 1719-1727. DOI: 10.1090/S0025-5718-97-00890-9 |
0.386 |
|
| 1997 |
Bach E. Energy arguments in the theory of algorithms American Mathematical Monthly. 104: 831-837. DOI: 10.1080/00029890.1997.11990725 |
0.302 |
|
| 1997 |
Bach E. Moments in the duration of play Statistics & Probability Letters. 36: 1-7. DOI: 10.1016/S0167-7152(97)00042-4 |
0.334 |
|
| 1997 |
Bach E. The complexity of number-theoretic constants Information Processing Letters. 62: 145-152. DOI: 10.1016/S0020-0190(97)00051-3 |
0.322 |
|
| 1996 |
Lewandowski G, Condon A, Bach E. Asynchronous analysis of parallel dynamic programming algorithms Ieee Transactions On Parallel and Distributed Systems. 7: 425-438. DOI: 10.1109/71.494636 |
0.329 |
|
| 1996 |
Bach E, Peralta R. Asymptotic semismoothness probabilities Mathematics of Computation. 65: 1701-1715. DOI: 10.1090/S0025-5718-96-00775-2 |
0.352 |
|
| 1996 |
Bach E, Sorenson J. Explicit bounds for primes in residue classes Mathematics of Computation. 65: 1717-1735. DOI: 10.1090/S0025-5718-96-00763-6 |
0.348 |
|
| 1996 |
Bach E, Lukes R, Shallit J, Williams HC. Results and estimates on pseudopowers Mathematics of Computation. 65: 1737-1747. DOI: 10.1090/S0025-5718-96-00762-4 |
0.354 |
|
| 1996 |
Bach E. Weil bounds for singular curves Applicable Algebra in Engineering, Communication and Computing. 7: 289-298. DOI: 10.1007/Bf01195534 |
0.328 |
|
| 1993 |
Bach E, Huelsbergen L. Statistical evidence for small generating sets Mathematics of Computation. 61: 69-82. DOI: 10.1090/S0025-5718-1993-1195432-5 |
0.366 |
|
| 1993 |
Bach E, Sorenson JP. Sieve algorithms for perfect power testing Algorithmica. 9: 313-328. DOI: 10.1007/Bf01228507 |
0.302 |
|
| 1991 |
Bach E. Realistic analysis of some randomized algorithms Journal of Computer and System Sciences. 42: 30-53. DOI: 10.1016/0022-0000(91)90038-7 |
0.398 |
|
| 1990 |
Bach E. A note on square roots in finite fields Ieee Transactions On Information Theory. 36: 1494-1498. DOI: 10.1109/18.59955 |
0.372 |
|
| 1990 |
Bach E, Shoup V. Factoring polynomials using fewer random bits Journal of Symbolic Computation. 9: 229-239. DOI: 10.1016/S0747-7171(08)80011-9 |
0.392 |
|
| 1989 |
Bach E, Shallit J. Factoring with cyclotomic polynomials Mathematics of Computation. 52: 201-219. DOI: 10.1090/S0025-5718-1989-0947467-1 |
0.369 |
|
| 1988 |
Bach E. How to generate factored random numbers Siam Journal On Computing. 17: 179-193. DOI: 10.1137/0217012 |
0.414 |
|
| 1986 |
Bach E, Miller G, Shallit J. Sums of divisors, perfect numbers and factoring Siam Journal On Computing. 15: 1143-1154. DOI: 10.1137/0215083 |
0.406 |
|
| Show low-probability matches. |