default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 940
Volume 940, Number Part B, January 2023
- Lila Kari:
Editorial. 1 - Declan Thompson
:
Execution trace sets for real computation. 2-17 - Carsten Witt:
How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys. 18-42 - Xuan Kien Phung:
On invertible and stably reversible non-uniform cellular automata. 43-59 - Michael J. Dinneen, Pankaj S. Ghodla, Simone Linz:
A QUBO formulation for the Tree Containment problem. 60-79 - Suxia Jiang, Bowen Xu, Tao Liang, Xiaoliang Zhu, Tingfang Wu:
Numerical spiking neural P systems with production functions on synapses. 80-89 - Honghui Xu, Wei Li, Zhipeng Cai:
Analysis on methods to effectively improve transfer learning performance. 90-107 - Nikolay K. Vereshchagin:
Information disclosure in the framework of Kolmogorov complexity. 108-122 - Jonathan Heins, Jakob Bossek, Janina Pohl, Moritz Seiler, Heike Trautmann, Pascal Kerschke:
A study on the effects of normalized TSP features for automated algorithm selection. 123-145 - Marius Bozga, Radu Iosif, Joseph Sifakis:
Verification of component-based systems with recursive architectures. 146-175 - Peter Hertling:
Remarks on the effective Jordan decomposition. 176-188 - Gabriel Istrate, Cosmin Bonchis:
A parametric worst-case approach to fairness in cooperative games with transferable utility. 189-205 - Eric Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle:
Cryptographic hardness under projections for time-bounded Kolmogorov complexity. 206-224
Volume 940, Number Part A, January 2023
- Carlos V. G. C. Lima, Thiago Marcilon, Nicolas Almeida Martins, Rudini Menezes Sampaio:
The connected greedy coloring game. 1-13 - Zhiyuan An, Jing Pan, Yamin Wen, Fangguo Zhang:
Secret handshakes: Full dynamicity, deniability and lattice-based design. 14-35 - Frédéric Giroire, Stéphane Pérennes, Thibaud Trolliet:
A random growth model with any real or theoretical degree distribution. 36-51 - Zichen Wang, Hongwei Du:
Collaborative coalitions-based joint service caching and task offloading for edge networks. 52-65 - Martin Berglund, Brink van der Merwe:
Re-examining regular expressions with backreferences. 66-80 - Danish Kashaev, Richard Santiago:
A simple optimal contention resolution scheme for uniform matroids. 81-96 - Vittorio Bilò, Laurent Gourvès, Jérôme Monnot:
Project games. 97-111 - Dekel Tsur:
Faster parameterized algorithms for two vertex deletion problems. 112-123 - Gabriele Buriola, Domenico Cantone, Gianluca Cincotti, Eugenio G. Omodeo, Gaetano T. Spartà:
A decidable theory involving addition of differentiable real functions. 124-148 - Geevarghese Philip, M. R. Rani, R. Subashini:
On computing the Hamiltonian index of graphs. 149-179 - Hong Zhang, Shuming Zhou, Xiaoqing Liu, Zhenqin Yu:
Extra (component) connectivity and diagnosability of bubble sort networks. 180-189 - Dishant Goyal, Ragesh Jaiswal:
Tight FPT approximation for constrained k-center and k-supplier. 190-208 - Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman:
Structural parameterizations of budgeted graph coloring. 209-221 - Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo:
Preference swaps for the stable matching problem. 222-230 - Szymon Lopaciuk, Daniel Reidenbach:
On Billaud words and their companions. 231-253 - Simone Faro, Stefano Scafiti:
Compact suffix automata representations for searching long patterns. 254-268 - Mikhail A. Raskin:
Protocols with constant local storage and unreliable communication. 269-282 - Jiangkun Li, Peng Zhang:
New approximation algorithms for the rooted Budgeted Cycle Cover problem. 283-295
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-11-28 23:54 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:
