Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 896
Volume 896, December 2021
- Shuhei Nakamura, Yasuhiko Ikematsu, Yacheng Wang, Jintai Ding, Tsuyoshi Takagi:
New complexity estimation on the Rainbow-Band-Separation attack. 1-18 - Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini
:
(k, p)-planarity: A relaxation of hybrid planarity. 19-30 - Emilio Di Giacomo, Jaroslav Hancl Jr., Giuseppe Liotta:
2-colored point-set embeddings of partial 2-trees. 31-45 - Gabriele Fici, Nicola Prezza, Rossano Venturini:
Adaptive learning of compressible strings. 46-52 - Josef Rukavicka:
A unique extension of rich words. 53-64 - Koji M. Kobayashi:
An optimal algorithm for 2-bounded delay buffer management with lookahead. 65-78 - Robert Cori, Andrea Frosini, Giulia Palma, Elisa Pergola, Simone Rinaldi:
On doubly symmetric Dyck words. 79-97 - Kai Feng, Xinyu Ma, Wei Wei:
Subnetwork reliability analysis of bubble-sort graph networks. 98-110 - Susanne Albers, Jens Quedenfeld:
Algorithms for energy conservation in heterogeneous data centers. 111-131 - Arnab Ganguly, Daniel Gibney, Sharma V. Thankachan, Rahul Shah:
I/O-optimal categorical 3-sided skyline queries. 132-144 - Hongbin Zhuang, Wenzhong Guo, Xiao-Yan Li, Ximeng Liu, Cheng-Kuan Lin:
The component connectivity, component diagnosability, and t/k-diagnosability of Bicube networks. 145-157 - Pramod P. Nair, Rajan Sundaravaradhan, Bhadrachalam Chitturi:
Improved upper bound for sorting permutations by prefix transpositions. 158-167 - Pascal Ochem:
A family of formulas with reversal of arbitrarily high avoidability index. 168-170
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-13 21:13 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:
