|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
Abdelkader Senouci, Abdelkader Zanou, “The weighted Hardy operators and quasi-monotone functions”, J. Sib. Fed. Univ. Math. Phys., 17:3 (2024), 318–325  |
| 2. |
A. Ouardani, A. Senouci, “Hardy type inequalities in classical and grand Lebesgue spaces $L_{p)}$, $0<p\leqslant 1$, for quasi-monotone functions”, Vladikavkaz. Mat. Zh., 26:2 (2024), 70–81 |
|
2023 |
| 3. |
V. I. Burenkov, A. Senouci, “Equivalent semi-norms for Nikol'skii–Besov spaces”, Eurasian Math. J., 14:4 (2023), 15–22 |
1
|
|
2020 |
| 4. |
A. Senouci, A. Zanou, “Some integral inequalities for quasimonotone functions in weighted variable exponent Lebesgue space with $0<p(x)<1$”, Eurasian Math. J., 11:4 (2020), 58–65   |
3
|
| 5. |
B. Halim, A. Senouci, M. Sofrani, “Some Chebyshev type inequalities for generalized Riemann–Liouville operator”, Ufimsk. Mat. Zh., 12:2 (2020), 87–95 ; Ufa Math. J., 12:2 (2020), 88–96 |
|
2019 |
| 6. |
A. Senouci, N. Azzouz, “Hardy type inequality with sharp constant for $0 < p < 1$”, Eurasian Math. J., 10:1 (2019), 52–58 |
2
|
|
2018 |
| 7. |
S. A. Bendaoud, A. Senouci, “Inequalities for weighted Hardy operators in weighted variable exponent Lebesgue space with $0 < p(x) < 1$”, Eurasian Math. J., 9:1 (2018), 30–39 |
1
|
|
2016 |
| 8. |
B. Halim, A. Senouci, “Equivalent quasi-norms involving differences and moduli of continuity in anisotropic Nikol’skii–Besov spaces”, Eurasian Math. J., 7:2 (2016), 7–18 |
|
2015 |
| 9. |
N. Azzouz, V. I. Burenkov, A. Senouci, “A weighted Hardy-type inequality for $0<p<1$ with sharp constant”, Math. Inequal. Appl., 18:2 (2015), 787–799  |
1
|
|
2013 |
| 10. |
N. Azzouz, B. Halim, A. Senouci, “An inequality for the weighted Hardy operator for $0<p<1$”, Eurasian Math. J., 4:3 (2013), 127–131 |
4
|
|
2010 |
| 11. |
V. I. Burenkov, A. Senouci, T. V. Tararykova, “Hardy-type inequality for $0<p<1$ and hypodecreasing functions”, Eurasian Math. J., 1:3 (2010), 27–42  |
8
|
|
| Presentations in Math-Net.Ru |
|
|
| Organisations |
|
| |
|
|
Contact us: