


default search action
Theoretical Computer Science, Volume 1001
Volume 1001, 2024
- Valentin Bouquet

, François Delbot, Christophe Picouleau, Stéphane Rovedakis:
On the complexity of Dominating Set for graphs with fixed diameter. 114561 - Karine Altisen, Alain Cournier, Geoffrey Defalque, Stéphane Devismes

:
Self-stabilizing synchronous unison in directed networks. 114577 - Marios Adamoudis, Konstantinos A. Draziotis

, Dimitrios Poulakis
:
Attacking (EC)DSA scheme with ephemeral keys sharing specific bits. 114578 - Jan Bok

, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphisms to separable signed graphs. 114580 - Hendrik Maarand

, Hellis Tamm
:
Yet another canonical nondeterministic automaton. 114581 - Diana Costa, Andreia Mordido, Diogo Poças

, Vasco T. Vasconcelos:
Polymorphic higher-order context-free session types. 114582 - Prosenjit Bose, Guillermo Esteban

, Anil Maheshwari:
A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes. 114583

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














