30 citations to https://www.mathnet.ru/eng/jams1
  1. A. B. Kalmynin, S. V. Konyagin, “A polynomial analogue of Jacobsthal function”, Izv. Math., 88:2 (2024), 225–235  mathnet  mathnet  crossref  crossref
  2. Péter L. Erdős, Gergely Harcos, Shubha R. Kharel, Péter Maga, Tamás Róbert Mezei, Zoltán Toroczkai, “The sequence of prime gaps is graphic”, Math. Ann., 388:2 (2024), 2195  crossref
  3. Stefan Glock, Felix Joos, Jaehoon Kim, Marcus Kühn, Lyuben Lichev, “Conflict‐free hypergraph matchings”, Journal of London Math Soc, 109:5 (2024)  crossref
  4. M. R. Gabdullin, A. O. Radomskii, “Prime avoiding numbers is a basis of order 2”, Mat. Sb., 215:5 (2024), 47–70  mathnet  mathnet  crossref
  5. M. R. Gabdullin, A. O. Radomskii, “Prime avoiding numbers form a basis of order $2$”, Sb. Math., 215:5 (2024), 612–633  mathnet  mathnet  crossref  crossref
  6. Yifan Jing, Bojan Mohar, “Efficient polynomial-time approximation scheme for the genus of dense graphs”, J. ACM, 71:6 (2024), 1  crossref
  7. Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah, Patrick A. Phillips, “Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting”, ACM Trans. Comput. Theory, 16:4 (2024), 1  crossref
  8. Donatella Cassettari, Giuseppe Mussardo, Andrea Trombettoni, J C Davis, “Holographic realization of the prime number quantum potential”, PNAS Nexus, 2:1 (2023)  crossref
  9. Andrew Granville, Allysa Lumley, “Primes in Short Intervals: Heuristics and Calculations”, Experimental Mathematics, 32:2 (2023), 378  crossref
  10. Dong Yeap Kang, Daniela Kühn, Abhishek Methuku, Deryk Osthus, “New bounds on the size of nearly perfect matchings in almost regular hypergraphs”, Journal of London Math Soc, 108:5 (2023), 1701  crossref
1
2
3
Next