Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 134 matches
- 2023
- MohammadHossein AskariHemmat, Théo Dupuis, Yoan Fournier, Nizar El Zarif, Matheus A. Cavalcante, Matteo Perotti, Frank K. Gürkaynak, Luca Benini, François Leduc-Primeau, Yvon Savaria, Jean-Pierre David:
Quark: An Integer RISC-V Vector Processor for Sub-Byte Quantized DNN Inference. ISCAS 2023: 1-5 - MohammadHossein AskariHemmat, Théo Dupuis, Yoan Fournier, Nizar El Zarif, Matheus A. Cavalcante, Matteo Perotti, Frank K. Gürkaynak, Luca Benini, François Leduc-Primeau, Yvon Savaria, Jean-Pierre David:
Quark: An Integer RISC-V Vector Processor for Sub-Byte Quantized DNN Inference. CoRR abs/2302.05996 (2023) - 2022
- Zheang Huai, Jingbo Zhou, Xinmiao Zhang:
Efficient Hardware Implementation Architectures for Long Integer Modular Multiplication over General Solinas Prime. J. Signal Process. Syst. 94(10): 1067-1082 (2022) - 2021
- Christoph Haase, Alessio Mansutti:
On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes. MFCS 2021: 55:1-55:20 - Zheang Huai, Keshab K. Parhi, Xinmiao Zhang:
Efficient Architecture for Long Integer Modular Multiplication over Solinas Prime. SiPS 2021: 146-151 - 2020
- Hartosh Singh Bal, Gaurav Bhatnagar:
Prime Number Conjectures From the Shapiro Class Structure. Integers 20: A11 (2020) - Snehal M. Shekatkar, Tian An Wong:
Shifts of the Prime Divisor Function of Alladi and Erdős. Integers 20: A4 (2020) - Joseph Vandehey:
A Proof of the Infinitude of Primes Via Continued Fractions. Integers 20: A19 (2020) - Freeman J. Dyson, Norman E. Frankel, Anthony J. Guttmann:
SanD Primes and Numbers. J. Integer Seq. 23(3): 20.3.4 (2020) - Emilia Rutkowski, Sheridan K. Houghten:
Cryptanalysis of RSA: Integer Prime Factorization Using Genetic Algorithms. CEC 2020: 1-8 - Julian Renner, Sven Puchinger, Antonia Wachter-Zeh, Camilla Hollanti, Ragnar Freij-Hollanti:
Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power. ISIT 2020: 19-24 - Julian Renner, Sven Puchinger, Antonia Wachter-Zeh, Camilla Hollanti, Ragnar Freij-Hollanti:
Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power. CoRR abs/2001.04800 (2020) - 2019
- William Banks, Paul Pollack, Carl Pomerance:
Symmetric Primes Revisited. Integers 19: A54 (2019) - Tianxin Cai, Liuquan Wang, Yong Zhang:
Perfect Numbers and Fibonacci Primes II. Integers 19: A21 (2019) - Peter Fletcher, Camron Withrow:
Primes p Having at Most One Divisor of p-1 of a Specified Multiplicative Order. Integers 19: A61 (2019) - Peng Gao, Liangyi Zhao:
Primes p ≡ 1 mod d and a(p-1)/d ≡ 1 mod p. Integers 19: A33 (2019) - Darij Grinberg:
On Binomial Coefficients Modulo Squares of Primes. Integers 19: A14 (2019) - Paul Kinlaw:
Lower Bounds for Numbers With Three Prime Factors. Integers 19: A22 (2019) - Jean-Marie De Koninck, Nicolas Doyon, Vincent Ouellet:
The Limit Distribution of the Middle Prime Factors of an Integer. Integers 19: A56 (2019) - Ladislav Skula:
Prime Power Divisors of Mersenne Numbers and Wieferich Primes of Higher Order. Integers 19: A19 (2019) - Min Zhang, Jinjiang Li:
On a Diophantine Equation With Three Prime Variables. Integers 19: A39 (2019) - Christian Axler:
New Estimates for the nth Prime Number. J. Integer Seq. 22(4): 19.4.2 (2019) - Christian Axler:
On a Family of Functions Defined Over Sums of Primes. J. Integer Seq. 22(5): 19.5.7 (2019) - Nathaniel Benjamin, Grant Fickes, Eugene Fiorini, Edgar Jaramillo Rodriguez, Eric Jovinelly, Tony W. H. Wong:
Primes and Perfect Powers in the Catalan Triangle. J. Integer Seq. 22(7): 19.7.6 (2019) - Spencer P. Hurd, Judson S. McCranie:
Integers That Are Sums of Uniform Powers of All Their Prime Factors: The Sequence A068916. J. Integer Seq. 22(3): 19.3.4 (2019) - Svyatoslav Covanov, Emmanuel Thomé:
Fast integer multiplication using \goodbreak generalized Fermat primes. Math. Comput. 88(317): 1449-1477 (2019) - David Harvey, Joris van der Hoeven:
Faster integer multiplication using plain vanilla FFT primes. Math. Comput. 88(315): 501-514 (2019) - Minjia Shi, Tor Helleseth, Patrick Solé:
Two-weight codes over the integers modulo a prime power. CoRR abs/1911.07657 (2019) - Zhizhu Lian, Yupu Hu, Hu Chen, Baocang Wang:
Faster Bootstrapping of FHE over the integers with large prime message space. IACR Cryptol. ePrint Arch. 2019: 561 (2019) - 2018
- Christian Axler:
New Estimates for Some Functions Defined Over Primes. Integers 18: A52 (2018)
skipping 104 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-04-23 18:05 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint