Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 547
Volume 547, August 2014
- Feodor F. Dragan, Muad Abu-Ata:
Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences. 1-17 - Clemens Heuberger, Michela Mazzoli
:
Symmetric digit sets for elliptic curve scalar multiplication without precomputation. 18-33 - Hung-Hsun Chen, Wen-Guei Hu, De-Jan Lai, Song-Sun Lin:
Nonemptiness problems of Wang tiles with three colors. 34-45 - Kojiro Kobayashi:
The minimum firing time of the generalized firing squad synchronization problem for squares. 46-69 - Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu:
Set graphs. II. Complexity of set graph recognition and similar problems. 70-81 - Tiziana Calamoneri, Rossella Petreschi:
On pairwise compatibility graphs having Dilworth number k. 82-89 - Yotam Elor, Alfred M. Bruckstein:
"Robot Cloud" gradient climbing with point measurements. 90-103 - Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, Michael A. Raskin:
Approximating the minimum cycle mean. 104-116
- Igor E. Shparlinski:
Evasive properties of sparse graphs and some linear equations in primes. 117-121
- Aviezri S. Fraenkel, Jamie Simpson:
Corrigendum to "The exact number of squares in Fibonacci words" [Theoret. Comput. Sci. 218(1) (1999) 95-106]. 122
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-04-17 21:28 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:
