Остановите войну!
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 133 matches
- 2024
- Hoon Hong, Jing Yang:
Computing greatest common divisor of several parametric univariate polynomials via generalized subresultant polynomials. CoRR abs/2401.00408 (2024) - 2023
- Sahand Hadizadeh Kafash, Justin Ruths:
Relaxation of the greatest common divisor condition for the controllability of bilinear systems. Autom. 153: 111048 (2023) - Vanni Noferini, Paul Van Dooren:
Revisiting the Matrix Polynomial Greatest Common Divisor. SIAM J. Matrix Anal. Appl. 44(3): 1164-1188 (2023) - Muhammad Imran:
Secure multiparty quantum computations for greatest common divisor and private set intersection. CoRR abs/2303.17196 (2023) - François Charton:
Can transformers learn the greatest common divisor? CoRR abs/2308.15594 (2023) - Muhammad Imran:
A private set intersection protocol based on multi-party quantum computation for greatest common divisor. IACR Cryptol. ePrint Arch. 2023: 476 (2023) - 2022
- Joseph A. Erho, Juliana I. Consul, Bunakiye R. Japheth:
Greatest-common-divisor dependency of juggling sequence rotation efficient performance. Open Comput. Sci. 12(1): 92-102 (2022) - Xiaoling Yu, Yuntao Wang, Chungen Xu, Tsuyoshi Takagi:
Revisiting the Orthogonal Lattice Algorithm in Solving General Approximate Common Divisor Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(3): 195-202 (2022) - Jun Xu, Santanu Sarkar, Lei Hu:
Revisiting orthogonal lattice attacks on approximate common divisor problems. Theor. Comput. Sci. 911: 55-69 (2022) - Yanfang Liu, Fei Zou, Wei Yang, Hongcheng Zeng, Chunsheng Li:
A Novel SAR Sidelobe Suppression Method based on Approximate Greatest Common Divisors. IGARSS 2022: 747-750 - Doni Pracner, Natasa Sukur:
Transforming Low-Level Variants of Greatest Common Divisor Algorithm: A Case Study. SQAMIA 2022 - Vanni Noferini, Paul Van Dooren:
Revisiting the matrix polynomial greatest common divisor. CoRR abs/2210.16234 (2022) - 2021
- Skander Belhaj, Abdulrahman Alsulami:
Approximate greatest common divisor of several polynomials from Hankel matrices. ACM Commun. Comput. Algebra 55(3): 77-81 (2021) - Wonhee Cho, Jiseung Kim, Changmin Lee:
Extension of simultaneous Diophantine approximation algorithm for partial approximate common divisor variants. IET Inf. Secur. 15(6): 417-427 (2021) - Deepak Kapur, Dong Lu, Michael B. Monagan, Yao Sun, Dingkang Wang:
Algorithms for computing greatest common divisors of parametric multivariate polynomials. J. Symb. Comput. 102: 3-20 (2021) - Fenggang Yan, Xiang-Tian Meng, Liang He, Bing-Xia Cao, Ye Zhang:
Generalized polynomial deflation method for rooting-based DOA estimators using greatest common divisor. Signal Process. 188: 108177 (2021) - Zhonggang Zeng:
The numerical greatest common divisor of univariate polynomials. CoRR abs/2103.04196 (2021) - 2020
- Mark Giesbrecht, Joseph Haraldson, Erich L. Kaltofen:
Computing Approximate Greatest Common Right Divisors of Differential Polynomials. Found. Comput. Math. 20(2): 331-366 (2020) - Qasem Abu Al-Haija, Mohammad M. Asad, Ibrahim Marouf, Mahmoud A. Smadi:
Design alternatives of Euclidian greatest common divisor with enhanced architecture. Int. J. Comput. Aided Eng. Technol. 13(4): 425-436 (2020) - Jorge Flórez, Cihan Karabulut, Elkin Quintero Vanegas:
The Distribution of the Generalized Greatest Common Divisor and Visibility of Lattice Points. Integers 20: A6 (2020) - Martin Bourne, Joab R. Winkler, Yi Su:
The computation of the degree of the greatest common divisor of three Bernstein basis polynomials. J. Comput. Appl. Math. 373: 112373 (2020) - Jung Hee Cheon, Wonhee Cho, Minki Hhan, Jiseung Kim, Changmin Lee:
Algorithms for CRT-variant of Approximate Greatest Common Divisor Problem. J. Math. Cryptol. 14(1): 397-413 (2020) - Eduardo Lopes Cominetti, Marcos A. Simplício Jr.:
Fast Additive Partially Homomorphic Encryption From the Approximate Common Divisor Problem. IEEE Trans. Inf. Forensics Secur. 15: 2988-2998 (2020) - 2019
- James Dyer, Martin E. Dyer, Karim Djemame:
Order-preserving encryption using approximate common divisors. J. Inf. Secur. Appl. 49 (2019) - Antonio Fazzi, Nicola Guglielmi, Ivan Markovsky:
An ODE-based method for computing the approximate greatest common divisor of polynomials. Numer. Algorithms 81(2): 719-740 (2019) - Leizhang Wang, Quanbo Qu, Tuoyan Li, Yange Chen:
Implementing Attacks on the Approximate Greatest Common Divisor Problem. FCS 2019: 209-227 - Jun Xu, Santanu Sarkar, Lei Hu:
Revisiting Approximate Polynomial Common Divisor Problem and Noisy Multipolynomial Reconstruction. INDOCRYPT 2019: 398-411 - Jung Hee Cheon, Wonhee Cho, Minki Hhan, Minsik Kang, Jiseung Kim, Changmin Lee:
Algorithms for CRT-variant of Approximate Greatest Common Divisor Problem. IACR Cryptol. ePrint Arch. 2019: 195 (2019) - 2018
- Hanan Halawani:
Blind image deconvolution using approximate greatest common divisor and approximate polynomial factorisation. University of Sheffield, UK, 2018 - Bartlomiej Bosek, Michal Debski, Jaroslaw Grytczuk, Joanna Sokól, Malgorzata Sleszynska-Nowak, Wiktor Zelazny:
Graph coloring and Graham's greatest common divisor problem. Discret. Math. 341(3): 781-785 (2018)
skipping 103 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-03-29 01:53 CET 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