Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 168
Volume 168, June 2021
- Masashi Kiyomi, Takashi Horiyama, Yota Otachi:
Longest common subsequence in sublinear space. 106084 - Verónica Becher
, Lucas Cortés:
Extending de Bruijn sequences to larger alphabets. 106085 - Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot:
On computing Pareto optimal paths in weighted time-dependent networks. 106086 - Olaf Beyersdorff, Joshua Blinkhorn:
A simple proof of QBF hardness. 106093 - Elena V. Konstantinova, Alexey N. Medvedev:
Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph. 106094 - Dekel Tsur:
Faster parameterized algorithm for Bicluster Editing. 106095 - Robin Fritsch:
Online graph exploration on trees, unicyclic graphs and cactus graphs. 106096 - Hideo Bannai, Shunsuke Inenaga, Neerja Mhaskar:
Longest previous overlapping factor array. 106097 - Xujin Chen, Xiaodong Hu, Zhongzheng Tang, Chenhao Wang:
Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game. 106098
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-06-18 21:15 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:
