default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 994
Volume 994, 2024
- Ildikó Schlotter:
Recognizing when a preference system is close to admitting a master list. 114445 - Hong Chang, Jing Jin, Zhicheng Liu, Donglei Du, Xiaoyan Zhang:
Two-stage BP maximization under p-matroid constraint. 114469 - Junyi Guo, Po-Chun Yu
:
Puzzle and Dragons is hard. 114477 - Sungmin Kim, Sang-Ki Ko, Yo-Sub Han:
Simon's congruence pattern matching. 114478 - Toru Kato, Yoichi Hirashima:
The synchronized ambient calculus. 114479 - Zhe Sun, Jincheng Zhuang, Zimeng Zhou, Fang-Wei Fu:
A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes. 114480 - Wenjuan Jia, Jiang Zhang, Binwu Xiang, Baocang Wang:
Hardness of (M)LWE with semi-uniform seeds. 114481
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.
last updated on 2026-08-02 01:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
