# Bitap algorithm

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2009

2009

- International Test Conference
- 2009

Growing test data volume and excessive test power consumption in scan-based testing are both serious concerns for the… (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- IEEE Transactions on Circuits and Systems I…
- 2008

This paper presents a new paradigm of design methodology to reduce the complexity of application-specific finite-impulse response… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- SIAM J. Scientific Computing
- 2006

We propose efficient preconditioning algorithms for an eigenvalue problem arising in quantum physics, namely the computation of a… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- ACM Trans. Math. Softw.
- 2005

The Scalable Library for Eigenvalue Problem Computations (SLEPc) is a software library for computing a few eigenvalues and… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- 2004

For the nonlinear eigenvalue problem T (λ)x = 0 we propose an iterative projection method for computing a few eigenvalues close… (More)

Is this relevant?

2002

2002

- SPIRE
- 2002

Given a text T [1 . . . n] and a pattern P [1 . . . m] over some alphabet Σ of size σ, finding the exact occurrences of P in T… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- INDOCRYPT
- 2000

In this paper we describe an efficient algorithm for multiplication in 2m , where the field elements of 2m are represented in… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- SIAM J. Scientific Computing
- 2000

We study large, sparse generalized eigenvalue problems for matrix pencils, where one of the matrices is Hamiltonian and the other… (More)

Is this relevant?

1999

1999

- CPM
- 1999

This paper considers the Shift-And approach to the problem of pattern matching in LZW compressed text, and gives a new algorithm… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- IEEE Symposium on Computer Arithmetic
- 1995

Until now the use of high radices to implement modular multiplication has been questioned, because it involves complex… (More)

Is this relevant?