default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 849
Volume 849, January 2021
- Palash Dey:
Local distance constrained bribery in voting. 1-21 - Sebastian Brandt
, Manuela Fischer, Jara Uitto:
Breaking the linear-memory barrier in MPC: Fast MIS on trees with strongly sublinear memory. 22-34 - Andreas Bärtschi, Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Christina Karousatou, Matús Mihalák:
Near-gathering of energy-constrained mobile agents. 35-46 - Siwoo Song, Geonmo Gu, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast algorithms for single and multiple pattern Cartesian tree matching. 47-63 - Atsushi Takayasu, Yohei Watanabe:
Revocable identity-based encryption with bounded decryption key exposure resistance: Lattice-based construction and more. 64-98 - Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
Gathering robots in graphs: The central role of synchronicity. 99-120 - Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
A topological perspective on distributed network algorithms. 121-137 - Kaustav Bose, Manash Kumar Kundu, Ranendu Adhikary, Buddhadeb Sau:
Arbitrary pattern formation by asynchronous opaque robots with lights. 138-158 - Lon H. Mitchell:
Propagation tree decompositions and linearly independent vertices. 159-162 - Yulong Wei, Min Xu:
Conditional diagnosability of Cayley graphs generated by wheel graphs under the PMC model. 163-172 - Peng Zhang, Zhendong Liu:
Approximating Max k-Uncut via LP-rounding plus greed, with applications to Densest k-Subgraph. 173-183 - Kristina Ago, Bojan Basic, Stefan Hacko, Danijela Mitrovic:
On generalized highly potential words. 184-196 - Yihong Wang, Cheng-Kuan Lin, Qianru Zhou, Shuming Zhou:
Note on Rg-conditional diagnosability of hypercube. 197-201 - Nianpeng Zhang, Qiang Zhu:
Reliability and hybrid diagnosis of exchanged hypercube. 202-209 - Florian Starke:
Exploring the topological entropy of formal languages. 210-226 - Yuma Tamura, Takehiro Ito, Xiao Zhou:
Approximability of the independent feedback vertex set problem for bipartite graphs. 227-236
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-11-22 19:32 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:
