default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 938
Volume 938, November 2022
- Martin Böhm
, Bertrand Simon:
Discovering and certifying lower bounds for the online bin stretching problem. 1-15 - Jing Zhang, Yuan Li:
Certificate complexity of elementary symmetric Boolean functions. 16-23 - Benjamin Moseley, Ruilong Zhang, Shanjiawen Zhao:
Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models. 24-38 - Arghya Bhattacharya, Rathish Das:
Machine learning advised algorithms for the ski rental problem with a discount. 39-49 - Marcella Anselmo, Manuela Flores, Maria Madonia:
On k-ary n-cubes and isometric words. 50-64 - Yuichi Kamiya:
On dragon curves which have two corners just meeting. 65-80 - Alessandro De Luca, Gabriele Fici:
On the Lie complexity of Sturmian words. 81-85 - Ya-Chun Liang, Kuan-Yun Lai, Ho-Lin Chen, Kazuo Iwama, Chung-Shou Liao:
Tight competitive analyses of online car-sharing problems. 86-96 - Meng He, Serikzhan Kazi:
Data structures for categorical path counting queries. 97-111 - Elena Barcucci, Antonio Bernini, Renzo Pinzani:
Strings from linear recurrences and permutations: A Gray code. 112-120
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-10-31 20:04 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:
