default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric Bach 0001
Person information
- affiliation: University of Wisconsin-Madison, Madison, USA
Other persons with the same name
- Eric Bach 0002
![[0000-0001-6200-5462]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-6200-5462")
— Aalto University, Espoo, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j40]Vickram N. Premakumar, Hele Sha, Daniel Crow, Eric Bach, Robert Joynt:
2-designs and redundant syndrome extraction for quantum error correction. Quantum Inf. Process. 20(3): 84 (2021)
2010 – 2019
- 2019
- [j39]Baris Aydinlioglu, Eric Bach:
Corrigendum to Affine Relativization: Unifying the Algebrization and Relativization Barriers. ACM Trans. Comput. Theory 11(3): 16:1 (2019) - 2018
- [j38]Eric Bach, Jérémie Dusart, Lisa Hellerstein, Devorah Kletenik:
Submodular goal value of Boolean functions. Discret. Appl. Math. 238: 1-13 (2018) - [j37]Eric Bach, Bryce Sandlund:
Baby-step giant-step algorithms for the symmetric group. J. Symb. Comput. 85: 55-71 (2018) - [j36]Baris Aydinlioglu, Eric Bach:
Affine Relativization: Unifying the Algebrization and Relativization Barriers. ACM Trans. Comput. Theory 10(1): 1:1-1:67 (2018) - [i7]Eric Bach, Bryce Sandlund:
On Euclidean Methods for Cubic and Quartic Jacobi Symbols. CoRR abs/1807.07719 (2018) - 2017
- [i6]Eric Bach, Jérémie Dusart, Lisa Hellerstein, Devorah Kletenik:
Submodular Goal Value of Boolean Functions. CoRR abs/1702.04067 (2017) - 2016
- [j35]Carole J. Etherington, Matthew W. Anderson, Eric Bach, Jon T. Butler, Pantelimon Stanica:
A Parallel Approach in Computing Correlation Immunity up to Six Variables. Int. J. Found. Comput. Sci. 27(4): 511- (2016) - [c21]Eric Bach, Lisa Hellerstein, Devorah Kletenik:
On the Goal Value of a Boolean Function. ISAIM 2016 - [c20]Eric Bach, Rex D. Fernando:
Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime Test. ISSAC 2016: 47-54 - [c19]Eric Bach, Bryce Sandlund:
Baby-Step Giant-Step Algorithms for the Symmetric Group. ISSAC 2016: 55-62 - [i5]Eric Bach, Bryce Sandlund:
Baby-Step Giant-Step Algorithms for the Symmetric Group. CoRR abs/1612.03456 (2016) - [i4]Baris Aydinlioglu, Eric Bach:
Affine Relativization: Unifying the Algebrization and Relativization Barriers. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j34]Eric Bach, Andrew Shallue:
Counting composites with two strong liars. Math. Comput. 84(296): 3069-3089 (2015) - [i3]Eric Bach, Rex D. Fernando:
Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime Test. CoRR abs/1512.00444 (2015) - 2014
- [c18]Daniel Luchaup, Lorenzo De Carli, Somesh Jha, Eric Bach:
Deep packet inspection with DFA-trees and parametrized language overapproximation. INFOCOM 2014: 531-539 - 2013
- [c17]Eric Bach, Jonathan P. Sorenson:
Approximately counting semismooth integers. ISSAC 2013: 23-30 - [i2]Eric Bach, Jonathan P. Sorenson:
Approximately counting semismooth integers. CoRR abs/1301.5293 (2013) - 2010
- [j33]Eric Bach, Shuchi Chawla, Seeun Umboh:
Threshold Rules for Online Sample Selection. Discret. Math. Algorithms Appl. 2(4): 625-642 (2010) - [c16]Eric Bach, Shuchi Chawla, Seeun Umboh:
Threshold Rules for Online Sample Selection. COCOON 2010: 489-499 - [i1]Eric Bach, Shuchi Chawla, Seeun Umboh:
Threshold rules for online sample selection. CoRR abs/1002.5034 (2010)
2000 – 2009
- 2009
- [j32]Eric Bach, Jin-Yi Cai:
A Novel Information Transmission Problem and its Optimal Solution. Commun. Inf. Syst. 9(2): 141-162 (2009) - [j31]Eric Bach:
Iterative root approximation in p-adic numerical analysis. J. Complex. 25(6): 511-529 (2009) - [j30]Lisa Hellerstein, Bernard Rosell, Eric Bach, Soumya Ray, David Page:
Exploiting Product Distributions to Identify Relevant Variables of Correlation Immune Functions. J. Mach. Learn. Res. 10: 2374-2411 (2009) - [j29]Eric Bach, Dominic Klyve, Jonathan P. Sorenson:
Computing prime harmonic sums. Math. Comput. 78(268): 2283-2305 (2009) - [j28]Giordano Fusco, Eric Bach:
Phase transition of multivariate polynomial systems. Math. Struct. Comput. Sci. 19(1): 9-23 (2009) - [j27]Eric Bach:
Improved Asymptotic Formulas for Counting Correlation Immune Boolean Functions. SIAM J. Discret. Math. 23(3): 1525-1538 (2009) - 2007
- [j26]Eric Bach:
Bounds for the expected duration of the monopolist game. Inf. Process. Lett. 101(2): 86-92 (2007) - [c15]Eric Bach, Jin-yi Cai:
A Novel Information Transmission Problem and Its Optimal Solution. FCT 2007: 64-75 - [c14]Giordano Fusco, Eric Bach:
Phase Transition of Multivariate Polynomial Systems. TAMC 2007: 632-645 - 2004
- [j25]Eric Bach, Susan N. 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
- [j24]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. Sched. 6(2): 131-147 (2003) - [j23]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
- [c13]Jin-yi Cai, Eric Bach:
On Testing for Zero Polynomials by a Set of Points with Bounded Precision. COCOON 2001: 473-482 - [c12]Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, John Watrous:
One-dimensional quantum walks. STOC 2001: 37-49 - 2000
- [j22]Eric Bach, Marcos A. Kiwi:
Threshold data structures and coding theory. Theor. Comput. Sci. 235(1): 3-23 (2000) - [c11]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
1990 – 1999
- 1999
- [j21]Eric Bach:
Sheaf Cohomology is #P-hard. J. Symb. Comput. 27(4): 429-433 (1999) - [j20]Eric Bach, Klaus Huber:
Note on Taking Square-Roots Modulo N. IEEE Trans. Inf. Theory 45(2): 807-809 (1999) - 1998
- [j19]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) - [j18]Eric Bach:
Efficient Prediction of Marsaglia-Zaman Random Number Generators. IEEE Trans. Inf. Theory 44(3): 1253-1257 (1998) - 1997
- [j17]Eric Bach:
The Complexity of Number-Theoretic Constants. Inf. Process. Lett. 62(3): 145-152 (1997) - [j16]Eric Bach:
Comments on search procedures for primitive roots. Math. Comput. 66(220): 1719-1727 (1997) - 1996
- [j15]Eric Bach:
Weil bounds for singular curves. Appl. Algebra Eng. Commun. Comput. 7(4): 289-298 (1996) - [j14]Eric Bach, René Peralta:
Asymptotic semismoothness probabilities. Math. Comput. 65(216): 1701-1715 (1996) - [j13]Eric Bach, Jonathan P. Sorenson:
Explicit bounds for primes in residue classes. Math. Comput. 65(216): 1717-1735 (1996) - [j12]Eric Bach, Richard F. Lukes, Jeffrey O. Shallit, Hugh C. Williams:
Results and estimates on pseudopowers. Math. Comput. 65(216): 1737-1747 (1996) - [j11]Eric Bach, Rajesh K. Mansharamani, John C. Strikwerda:
Estimating Completion Time Ratios of a Fork-Join Barrier Synchronization. Perform. Evaluation 26(2): 145-154 (1996) - [j10]Gary Lewandowski, Anne Condon, Eric Bach:
Asynchronous Analysis of Parallel Dynamic Programming Algorithms. IEEE Trans. Parallel Distributed Syst. 7(4): 425-438 (1996) - [c10]Eric Bach, Anne Condon, Elton Glaser, Celena Tanguay:
DNA Models and Algorithms for NP-complete Problems. CCC 1996: 290-300 - 1994
- [j9]Eric Bach:
Tensor Products and Computability. J. Symb. Comput. 18(6): 585-593 (1994) - [c9]Eric Bach:
Exact Analysis of a Priority Queue Algorithm for Random Variate Generation. SODA 1994: 48-56 - 1993
- [j8]Eric Bach, Jonathan P. Sorenson:
Sieve Algorithms for Perfect Power Testing. Algorithmica 9(4): 313-328 (1993) - [j7]Eric Bach, James R. Driscoll, Jeffrey O. Shallit:
Factor Refinement. J. Algorithms 15(2): 199-222 (1993) - [c8]Gary Lewandowski, Anne Condon, Eric Bach:
Asynchronous Analysis of Parallel Dynamic Programming. SIGMETRICS 1993: 268-269 - 1991
- [j6]Eric Bach:
Toward A Theory of Pollard's Rho Method. Inf. Comput. 90(2): 139-155 (1991) - [j5]Eric Bach:
Realistic Analysis of Some Randomized Algorithms. J. Comput. Syst. Sci. 42(1): 30-53 (1991) - 1990
- [j4]Eric Bach, Victor Shoup:
Factoring Polynomials Using Fewer Random Bits. J. Symb. Comput. 9(3): 229-239 (1990) - [j3]Eric Bach:
A note on square roots in finite fields. IEEE Trans. Inf. Theory 36(6): 1494-1498 (1990) - [c7]Eric Bach, James R. Driscoll, Jeffrey O. Shallit:
Factor Refinement. SODA 1990: 201-211
1980 – 1989
- 1988
- [j2]Eric Bach:
How to Generate Factored Random Numbers. SIAM J. Comput. 17(2): 179-193 (1988) - [c6]Eric Bach:
Intractable Problems in Number Theory. CRYPTO 1988: 77-93 - 1987
- [c5]Eric Bach:
Realistic Analysis of Some Randomized Algorithms. STOC 1987: 453-461 - 1986
- [j1]Eric Bach, Gary L. Miller, Jeffrey O. Shallit:
Sums of Divisors, Perfect Numbers and Factoring. SIAM J. Comput. 15(4): 1143-1154 (1986) - 1985
- [c4]Eric Bach, Jeffrey O. Shallit:
Factoring with Cyclotomic Polynomials. FOCS 1985: 443-450 - 1984
- [c3]Eric Bach, Gary L. Miller, Jeffrey O. Shallit:
Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract). STOC 1984: 183-190 - 1983
- [c2]Eric Bach:
How to Generate Random Integers with Known Factorization. STOC 1983: 184-188 - 1982
- [c1]Eric Bach:
Fast Algorithms under the Extended Riemann Hypothesis: A Concrete Estimate. STOC 1982: 290-295
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
