Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 809
Volume 809, February 2020
- C. Ramya, B. V. Raghavendra Rao:
Lower bounds for special cases of syntactic multilinear ABPs. 1-20 - Antoine Abram, Mélodie Lapointe, Christophe Reutenauer:
Palindromization and construction of Markoff triples. 21-29 - Amanda Burcroff, Eric Winsor:
Generalized Lyndon factorizations of infinite words. 30-38 - Mickaël Postic, Luca Q. Zamboni:
ω-Lyndon words. 39-44 - Keren Censor-Hillel, Dean Leitersdorf, Elia Turner
:
Sparse matrix multiplication and triangle listing in the Congested Clique model. 45-60 - Marcel Abas, Tomás Vetrík:
Metric dimension of Cayley digraphs of split metacyclic groups. 61-72 - Zhen Zhao, Fuchun Guo, Jianchang Lai, Willy Susilo, Baocang Wang, Yupu Hu:
Accountable authority identity-based broadcast encryption with constant-size private keys and ciphertexts. 73-87 - Mengjie Lv, Jianxi Fan, Jingya Zhou, Baolei Cheng, Xiaohua Jia:
The extra connectivity and extra diagnosability of regular interconnection networks. 88-102 - Shuichi Katsumata, Takahiro Matsuda, Atsushi Takayasu:
Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance. 103-136 - Pratish Datta:
Constrained pseudorandom functions from functional encryption. 137-170 - Morgan Barbier, Hayat Cheballah, Jean-Marie Le Bars:
On the computation of the Möbius transform. 171-188 - Xiaoyan Li, Xiaohua Jia, Jianxi Fan, Cheng-Kuan Lin:
Reliability analysis of data center networks based on precise and imprecise diagnosis strategies. 189-203 - Daniel R. Page, Roberto Solis-Oba, Marten Maack:
Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments. 204-217 - Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth:
Online unit covering in Euclidean space. 218-230 - Changjie Cheng, Changhong Lu, Yu Zhou:
The k-power domination problem in weighted trees. 231-238 - Cédric Bentz, Pierre Le Bodic:
Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth. 239-249 - Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani:
Polyline drawings with topological constraints. 250-264 - Naoyuki Kamiyama:
Popular matchings with two-sided preference lists and matroid constraints. 265-276 - Yanwei Zhou, Bo Yang, Zhe Xia, Mingwu Zhang, Yi Mu:
Identity-based encryption with leakage-amplified chosen-ciphertext attacks security. 277-295 - Di Wang, Jinhui Xu:
Principal Component Analysis in the local differential privacy model. 296-312 - Gianluca De Marco, Mauro Leoncini, Manuela Montangero:
Distributed balanced color assignment on arbitrary networks. 313-326 - Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski:
Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs. 327-338 - Ferdinando Cicalese, Massimiliano Rossi:
On the multi-interval Ulam-Rényi game: For 3 lies 4 intervals suffice. 339-356 - Masahiro Shibata, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings. 357-371 - Jiahui Chen, Jianting Ning, Jie Ling, Terry Shue Chien Lau, Yacheng Wang:
A new encryption scheme for multivariate quadratic systems. 372-383 - Marc Hellmuth, Manuela Geiß, Peter F. Stadler:
Complexity of modification problems for reciprocal best match graphs. 384-393 - Wenyu Hu, Shenghao Li, Jinhong Huang, Tinghua Wang, Gaohang Yu:
Computing the nearest polynomial to multiple given polynomials with a given zero via l2, q-norm minimization. 394-406 - Michel Dekking:
Morphic words, Beatty sequences and integer images of the Fibonacci language. 407-417 - Daniele D'Angeli, Emanuele Rodaro, Jan Philipp Wächter:
Orbit expandability of automaton semigroups and groups. 418-429 - Meng Wang, Cong Tian, Nan Zhang, Zhenhua Duan, Chenguang Yao:
Translating Xd-C programs to MSVL programs. 430-465 - Titus Dose:
An oracle separating conjectures about incompleteness in the finite domain. 466-481 - K. Alex Mills, R. Chandrasekaran, Neeraj Mittal:
Algorithms for optimal replica placement under correlated failure in hierarchical failure domains. 482-518 - Nan Zhang, Zhenhua Duan, Cong Tian, Hongwei Du:
A novel approach to verifying context free properties of programs. 519-530 - Nikolay K. Vereshchagin:
Descriptive complexity of computable sequences revisited. 531-537 - Amazigh Amrane, Nicolas Bedon:
Logic and rational languages of scattered and countable series-parallel posets. 538-562 - Lingxiao Huang, Jian Li, Qicai Shi:
Approximation algorithms for the connected sensor cover problem. 563-574
a service of 
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 2024-05-31 18:38 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
