| 2007 |
| 40 | EE | Eric Bach,
Jin-yi Cai:
A Novel Information Transmission Problem and Its Optimal Solution.
FCT 2007: 64-75 |
| 39 | EE | Giordano Fusco,
Eric Bach:
Phase Transition of Multivariate Polynomial Systems.
TAMC 2007: 632-645 |
| 38 | EE | Eric Bach:
Bounds for the expected duration of the monopolist game.
Inf. Process. Lett. 101(2): 86-92 (2007) |
| 2004 |
| 37 | EE | Eric Bach,
Susan Coppersmith,
Marcel Paz Goldschen,
Robert Joynt,
John Watrous:
One-dimensional quantum walks with absorbing boundaries.
J. Comput. Syst. Sci. 69(4): 562-592 (2004) |
| 2003 |
| 36 | | Eric Bach,
Joan Boyar,
Leah Epstein,
Lene M. Favrholdt,
Tao Jiang,
Kim S. Larsen,
Guo-Hui Lin,
Rob van Stee:
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.
J. Scheduling 6(2): 131-147 (2003) |
| 35 | EE | Jin-yi Cai,
Eric Bach:
On testing for zero polynomials by a set of points with bounded precision.
Theor. Comput. Sci. 296(1): 15-25 (2003) |
| 2001 |
| 34 | EE | Jin-yi Cai,
Eric Bach:
On Testing for Zero Polynomials by a Set of Points with Bounded Precision.
COCOON 2001: 473-482 |
| 33 | EE | Andris Ambainis,
Eric Bach,
Ashwin Nayak,
Ashvin Vishwanath,
John Watrous:
One-dimensional quantum walks.
STOC 2001: 37-49 |
| 2000 |
| 32 | EE | Eric Bach,
Joan Boyar,
Tao Jiang,
Kim S. Larsen,
Guo-Hui Lin:
Better Bounds on the Accommodating Ratio for the Seat Reservation Problem.
COCOON 2000: 221-231 |
| 31 | EE | Eric Bach,
Marcos A. Kiwi:
Threshold data structures and coding theory.
Theor. Comput. Sci. 235(1): 3-23 (2000) |
| 1999 |
| 30 | | Eric Bach,
Klaus Huber:
Note on Taking Square-Roots Modulo N.
IEEE Transactions on Information Theory 45(2): 807-809 (1999) |
| 29 | | Eric Bach:
Sheaf Cohomology is #P-hard.
J. Symb. Comput. 27(4): 429-433 (1999) |
| 1998 |
| 28 | | Eric Bach:
Efficient Prediction of Marsaglia-Zaman Random Number Generators.
IEEE Transactions on Information Theory 44(3): 1253-1257 (1998) |
| 27 | | Eric Bach,
Anne Condon,
Elton Glaser,
Celena Tanguay:
DNA Models and Algorithms for NP-Complete Problems.
J. Comput. Syst. Sci. 57(2): 172-186 (1998) |
| 1997 |
| 26 | EE | Eric Bach:
The Complexity of Number-Theoretic Constants.
Inf. Process. Lett. 62(3): 145-152 (1997) |
| 25 | | Eric Bach:
Comments on search procedures for primitive roots.
Math. Comput. 66(220): 1719-1727 (1997) |
| 1996 |
| 24 | EE | Eric Bach,
Anne Condon,
Elton Glaser,
Celena Tanguay:
DNA Models and Algorithms for NP-complete Problems.
IEEE Conference on Computational Complexity 1996: 290-300 |
| 23 | EE | Eric Bach:
Weil Bounds for Singular Curves.
Appl. Algebra Eng. Commun. Comput. 7(4): 289-298 (1996) |
| 22 | EE | Gary Lewandowski,
Anne Condon,
Eric Bach:
Asynchronous Analysis of Parallel Dynamic Programming Algorithms.
IEEE Trans. Parallel Distrib. Syst. 7(4): 425-438 (1996) |
| 21 | | Eric Bach,
René Peralta:
Asymptotic semismoothness probabilities.
Math. Comput. 65(216): 1701-1715 (1996) |
| 20 | | Eric Bach,
Jonathan Sorenson:
Explicit bounds for primes in residue classes.
Math. Comput. 65(216): 1717-1735 (1996) |
| 19 | | Eric Bach,
Richard F. Lukes,
Jeffrey Shallit,
Hugh C. Williams:
Results and estimates on pseudopowers.
Math. Comput. 65(216): 1737-1747 (1996) |
| 1994 |
| 18 | | Eric Bach:
Exact Analysis of a Priority Queue Algorithm for Random Variate Generation.
SODA 1994: 48-56 |
| 17 | | Eric Bach:
Tensor Products and Computability.
J. Symb. Comput. 18(6): 585-593 (1994) |
| 1993 |
| 16 | | Gary Lewandowski,
Anne Condon,
Eric Bach:
Asynchronous Analysis of Parallel Dynamic Programming.
SIGMETRICS 1993: 268-269 |
| 15 | | Eric Bach,
Jonathan Sorenson:
Sieve Algorithms for Perfect Power Testing.
Algorithmica 9(4): 313-328 (1993) |
| 14 | | Eric Bach,
James R. Driscoll,
Jeffrey Shallit:
Factor Refinement.
J. Algorithms 15(2): 199-222 (1993) |
| 1991 |
| 13 | | Eric Bach:
Toward A Theory of Pollard's Rho Method
Inf. Comput. 90(2): 139-155 (1991) |
| 12 | | Eric Bach:
Realistic Analysis of Some Randomized Algorithms.
J. Comput. Syst. Sci. 42(1): 30-53 (1991) |
| 1990 |
| 11 | | Eric Bach,
James R. Driscoll,
Jeffrey Shallit:
Factor Refinement.
SODA 1990: 201-211 |
| 10 | | Eric Bach:
A note on square roots in finite fields.
IEEE Transactions on Information Theory 36(6): 1494- (1990) |
| 9 | | Eric Bach,
Victor Shoup:
Factoring Polynomials Using Fewer Random Bits.
J. Symb. Comput. 9(3): 229-239 (1990) |
| 1988 |
| 8 | EE | Eric Bach:
Intractable Problems in Number Theory.
CRYPTO 1988: 77-93 |
| 7 | | Eric Bach:
How to Generate Factored Random Numbers.
SIAM J. Comput. 17(2): 179-193 (1988) |
| 1987 |
| 6 | | Eric Bach:
Realistic Analysis of Some Randomized Algorithms
STOC 1987: 453-461 |
| 1986 |
| 5 | | Eric Bach,
Gary L. Miller,
Jeffrey Shallit:
Sums of Divisors, Perfect Numbers and Factoring.
SIAM J. Comput. 15(4): 1143-1154 (1986) |
| 1985 |
| 4 | | Eric Bach,
Jeffrey Shallit:
Factoring with Cyclotomic Polynomials
FOCS 1985: 443-450 |
| 1984 |
| 3 | | Eric Bach,
Gary L. Miller,
Jeffrey Shallit:
Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract)
STOC 1984: 183-190 |
| 1983 |
| 2 | | Eric Bach:
How to Generate Random Integers with Known Factorization
STOC 1983: 184-188 |
| 1982 |
| 1 | | Eric Bach:
Fast Algorithms under the Extended Riemann Hypothesis: A Concrete Estimate
STOC 1982: 290-295 |