default search action
Theoretical Computer Science, Volume 795
Volume 795, November 2019
- Do Le Paul Minh, Truong Thi Thuy Duong:
Bayesian networks: The minimal triangulations of a graph. 1-8 - Sebastián González Hermosillo de la Maza, César Hernández-Cruz
:
On the complexity of the k-kernel problem on cyclically k-partite digraphs. 9-19 - Ming Zeng, Jie Chen, Kai Zhang
Public key encryption with equality test via hash proof system. 20-35 - Yanze Huang, Limei Lin, Li Xu, Xiaoding Wang
Extra diagnosability and good-neighbor diagnosability of n-dimensional alternating group graph AGn under the PMC model. 36-49 - Muhammad S. Akhtar, Usman Ali
On the game chromatic number of splitting graphs of path and cycle. 50-56 - Lin Lyu
Structure-preserving public-key encryption with leakage-resilient CCA security. 57-80 - Shlomi Dolev, Niv Gilboa, Ximing Li
Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation. 81-99 - Frank Gurski
On the hardness of palletizing bins using FIFO queues. 100-107 - Jørgen Bang-Jensen
The parameterized complexity landscape of finding 2-partitions of digraphs. 108-114 - Che-Nan Kuo
Cycles in folded hypercubes with two adjacent faulty vertices. 115-118 - Van Huy Pham
Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms. 119-127 - Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Maria Inés Lopez Pujato, Martin Milanic:
New algorithms for weighted k-domination and total k-domination problems in proper interval graphs. 128-141 - Boris Brimkov, Joshua Carlson, Illya V. Hicks
Power domination throttling. 142-153 - Yining Hu, Guoniu Wei-Han:
On the automaticity of the Hankel determinants of a family of automatic sequences. 154-164 - C. Ramya, B. V. Raghavendra Rao
Linear projections of the Vandermonde polynomial. 165-182 - Pierre Bergé, Arpad Rimmel, Joanna Tomasik:
On the parameterized complexity of separating certain sources from the target. 183-193 - Véronique Terrier:
Communication complexity tools on recognizable picture languages. 194-203 - Nicollas M. Sdroievski, Murilo V. G. da Silva
The Hidden Subgroup Problem and MKTP. 204-212 - Lu Miao, Shurong Zhang, Rong-Hua Li, Weihua Yang:
Structure fault tolerance of k-ary n-cube networks. 213-218 - Dongqin Cheng:
Vertex-disjoint paths joining adjacent vertices in faulty hypercubes. 219-224 - Mojtaba Khalili, Mohammad Dakhilalian
Short tightly secure signatures for signing a vector of group elements: A new approach. 225-239 - Michel Latteux, Yves Roos
On prefixal one-rule string rewrite systems. 240-256 - Friedrich Otto:
On deterministic ordered restart-delete automata. 257-274 - Leizhen Cai, Junjie Ye:
Two edge-disjoint paths with length constraints. 275-284 - Gruia Calinescu
Improved approximation algorithms for minimum power covering problems. 285-300 - Amy Glen, Jamie Simpson, W. F. Smyth:
More properties of the Fibonacci word on an infinite alphabet. 301-311 - Stephan Dominique Andres, Melissa A. Huggan, Fionn Mc Inerney
The orthogonal colouring game. 312-325 - Xiao Zhang, Shengli Liu, Jiaxin Pan
Tightly secure signature schemes from the LWE and subset sum assumptions. 326-344 - Diodato Ferraioli, Carmine Ventre
Social pressure in opinion dynamics. 345-361 - Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter:
Energy-optimal broadcast and exploration in a tree using mobile agents. 362-374 - Patrizio Angelini
Greedy rectilinear drawings. 375-397 - Mohammad Ali Abam, Mahnaz Sadat Qafari:
Geometric spanner games. 398-407 - Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze
Planar drawings of fixed-mobile bigraphs. 408-419 - Samir Khuller, Jingling Li, Pascal Sturmfels, Kevin Sun, Prayaag Venkat:
Select and permute: An improved online framework for scheduling to minimize weighted completion time. 420-431 - Liqiang Peng, Atsushi Takayasu
Generalized cryptanalysis of small CRT-exponent RSA. 432-458 - Michael Amir, Alfred M. Bruckstein
Probabilistic pursuits on graphs. 459-477 - Jason Crampton, Gregory Z. Gutin, Martin Koutecký
Parameterized resiliency problems. 478-491 - Pawel Garncarek
Online packet scheduling under adversarial errors. 492-509 - Naoyuki Kamiyama:
Discrete Newton methods for the evacuation problem. 510-519 - Bart M. P. Jansen, Jesper Nederlof:
Computing the chromatic number using graph decompositions via matrix rank. 520-539 - Min Xu, Yulong Wei:
The h-edge tolerable diagnosability of balanced hypercubes. 540-546 - Jan Legerský
Construction of algorithms for parallel addition in expanding bases via Extending Window Method. 547-569 - Keisuke Hara, Fuyuki Kitagawa, Takahiro Matsuda, Goichiro Hanaoka, Keisuke Tanaka:
Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions. 570-597
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-12-27 21:28 CET 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: