default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 892
Volume 892, November 2021
- Peter Jonsson, Victor Lagerkvist, Johannes Schmidt
, Hannes Uppman:
The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems. 1-24 - Helmut Jürgensen, Ludwig Staiger:
Automata for solid codes. 25-47 - Leslie Ann Goldberg, John Lapinskas, David Richerby:
Faster exponential-time algorithms for approximately counting independent sets. 48-84 - Qinyi Li, Xavier Boyen:
Efficient public-key encryption with equality test from lattices. 85-107 - Fernando Santolaya, Mónica Caniupán, Luis Gajardo, Miguel Romero, Rodrigo Torres-Avilés:
Efficient computation of spatial queries over points stored in k2-tree compact data structures. 108-131 - Seok-Hee Hong, Hiroshi Nagamochi:
Re-embedding a 1-plane graph for a straight-line drawing in linear time. 132-154 - Vedran Cacic, Marko Horvat, Zvonko Iljazovic:
Computable subcontinua of semicomputable chainable Hausdorff continua. 155-169 - Kaito Fujii, Tasuku Soma, Yuichi Yoshida:
Polynomial-time algorithms for submodular Laplacian systems. 170-186 - Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil:
Uniform bipartition in the population protocol model with arbitrary graphs. 187-207 - Keisuke Hara, Keisuke Tanaka:
Tightly secure ring signatures in the standard model. 208-237 - Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney:
On the role of 3s for the 1-2-3 Conjecture. 238-257 - Yu Yang, Xiao-xiao Li, Meng-yuan Jin, Long Li, Hua Wang, Xiao-Dong Zhang:
Enumeration of subtrees and BC-subtrees with maximum degree no more than k in trees. 258-278 - Sun Xie, Haixing Zhao, Jun Yin:
Nonexistence of uniformly most reliable two-terminal graphs. 279-288
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 2025-01-30 20:34 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:
