default search action
Theoretical Computer Science, Volume 919
Volume 919, June 2022
- Elena Zamaraeva, Jovisa D. Zunic:
A characterization of 2-threshold functions via pairs of prime segments. 1-17 - Marek Klonowski, Dariusz R. Kowalski, Dominik Pajak:
Generalized framework for Group Testing: Queries, feedbacks and adversaries. 18-35 - Mourad Baïou, Rafael Colares, Hervé Kerivin:
The complexity of the unit stop number problem and its implications to other related problems. 36-46 - Michel Raynal, Gadi Taubenfeld:
A visit to mutual exclusion in seven dates. 47-65 - Steven Chaplick, Stefan Felsner, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations. 66-74 - Radoslaw Zak:
Finding binary words with a given number of subsequences. 75-79 - Jiao Du, Ziyu Chen, Shaojing Fu, Longjiang Qu, Chao Li:
Constructions of 2-resilient rotation symmetric Boolean functions through symbol transformations of cyclic Hadamard matrix. 80-91 - Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman:
Fragile complexity of adaptive algorithms. 92-102 - Nicola Galesi, Fariba Ranjbar:
Tight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography. 103-117 - Manfred Droste, Zoltán Fülöp, Dávid Kószó, Heiko Vogler:
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids. 118-143
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.