#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2008

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Md. Nazrul Islam, Md. Monir Hossain Mia, Muhammad F. I. Chowdhury, Mohammad Abdul Matin
- 2008 Ninth ACIS International Conference onâ€¦
- 2008

The selective application of technological and related procedural safeguards is an important responsibility of every organization in providing adequate security to its electronic data systems.â€¦ (More)

We study the cost of multiplication modulo triangular families of polynomials. Following previous work by Li, Moreno Maza and Schost, we propose an algorithm that relies on homotopy and fastâ€¦ (More)

- Muhammad F. I. Chowdhury, Claude-Pierre Jeannerod, Vincent Neiger, Ã‰ric Schost, Gilles Villard
- IEEE Transactions on Information Theory
- 2015

The interpolation step in the Guruswami-Sudan algorithm is a bivariate interpolation problem with multiplicities commonly solved in the literature using either structured linear algebra or basisâ€¦ (More)

- Mashiour Rahman, Muhammad F. I. Chowdhury
- 2009 12th International Conference on Computersâ€¦
- 2009

The multiprocessor task graph scheduling problem has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallelâ€¦ (More)

We provide algorithms computing power series solutions of a large class of differential or q-differential equations or systems. Their number of arithmetic operations grows linearly with theâ€¦ (More)

- Alin Bostan, Muhammad F. I. Chowdhury, Joris van der Hoeven, Ã‰ric Schost
- J. Symb. Comput.
- 2011

We study the cost of multiplication modulo triangular families of polynomials. Following previous work by Li, Moreno Maza and Schost, we propose an algorithm that relies on homotopy and fastâ€¦ (More)

- Muhammad F. I. Chowdhury, Marc Moreno Maza, Wei Pan, Ã‰ric Schost
- ACM Comm. Computer Algebra
- 2010

Today's parallel hardware architectures and computer memory hierarchies enforce revisiting fundamental algorithms which were often designed with algebraic complexity as the main complexity measureâ€¦ (More)

- Muhammad F. I. Chowdhury, Romain Lebreton
- ACM Comm. Computer Algebra
- 2011

Motivatived by Guruswami and Rudra's construction of folded Reed-Solomon codes, we give algorithms to solve functional equations of the form Q(x, f(x), f(x)) = 0, where Q is a trivariate polynomial.â€¦ (More)

The interpolation step in the Guruswami-Sudan algorithm has attracted a lot of interest and it is now solved by many algorithms in the literature; they use either structured linear algebra or basisâ€¦ (More)

We study the cost of multiplication modulo triangular families of polynomials. Following previous work by Li, Moreno Maza and Schost, we propose an algorithm that relies on homotopy and fastâ€¦ (More)

- â€¹
- 1
- â€º