default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 389
Volume 389, Numbers 1-2, December 2007
- Ramtin Khosravi, Mohammad Ghodsi:
Query-point visibility constrained shortest paths in simple polygons. 1-11 - Julien Bernat, Zuzana Masáková, Edita Pelantová
:
On a class of infinite words with affine factor complexity. 12-25 - James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong:
Towards a theory of data entanglement. 26-43 - Ilan Gronau, Shlomo Moran:
On the hardness of inferring phylogenies from triplet-dissimilarities. 44-55 - Tomasz Jurdzinski:
On complexity of grammars related to the safety problem. 56-72 - Alexander Meduna, Jirí Techet:
Canonical scattered context generators of sentences with their parses. 73-81 - Minh Ha Le, Thi Ha Duong Phan:
Strict partitions and discrete dynamical systems. 82-90 - Caterina De Simone, Anna Galluccio:
Edge-colouring of regular graphs of large degree. 91-99 - Javier Herranz:
Identity-based ring signatures from RSA. 100-117 - Bo Tan:
Mirror substitutions and palindromic sequences. 118-124 - Dimitrios Michail:
Reducing rank-maximal to maximum weight matching. 125-132 - Fábio Viduani Martinez, José Coelho de Pina, José Soares:
Algorithms for terminal Steiner trees. 133-142 - Yinfeng Xu, Wenqiang Dai, Naoki Katoh, Makoto Ohsaki:
Triangulating a convex polygon with fewer number of non-standard bars. 143-151 - Oddvar Kloster:
A solution to the Angel Problem. 152-161 - Ryan C. Harkins, John M. Hitchcock:
Upward separations and weaker hypotheses in resource-bounded measure. 162-171 - Pascal Koiran, Sylvain Perifel:
The complexity of two problems on arithmetic circuits. 172-181 - Hsiao-Fei Liu, Kun-Mao Chao:
A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering. 182-189 - Sanjay Jain, Efim B. Kinber:
Learning languages from positive data and a limited number of short counterexamples. 190-218 - Vladimir E. Alekseev, Rodica Boliac, Dmitry V. Korobitsyn, Vadim V. Lozin:
NP-hard graph problems and boundary classes of graphs. 219-236 - Vesa Halava, Tero Harju, Tomi Kärki:
Relational codes of words. 237-249 - Rui Wang, Francis C. M. Lau, Yan Yan Liu:
On the hardness of minimizing space for all-shortest-path interval routing schemes. 250-264 - Florin Manea, Robert Mercas:
Freeness of partial words. 265-277 - Dirk Strothmann:
The affix array data structure and its applications to RNA secondary structure analysis. 278-294 - Andreas Brandstädt, Chính T. Hoàng:
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem. 295-306 - Yo-Sub Han, Yajun Wang, Derick Wood:
Prefix-free regular languages and pattern matching. 307-317 - Yossi Moshe:
On the subword complexity of Thue-Morse polynomial extractions. 318-329
- Van Bang Le, Bert Randerath, Ingo Schiermeyer:
On the complexity of 4-coloring graphs without long induced paths. 330-335
Volume 389, Number 3, December 2007
- Donald Sannella, Vladimiro Sassone:
Semantic and logical foundations of global computing: Papers from the EU-FET global computing initiative (2001-2005). 337-340
- Alexander Joseph Ahern, Nobuko Yoshida:
Formalising Java RMI with explicit code mobility. 341-410 - David Aspinall, Lennart Beringer, Martin Hofmann, Hans-Wolfgang Loidl, Alberto Momigliano:
A program logic for resources. 411-445 - Paolo Baldan, Andrea Bracciali, Roberto Bruni:
A semantic framework for open processes. 446-483 - Sébastien Briais, Uwe Nestmann:
A formal semantics for protocol narrations. 484-511 - Konstantinos Chatzikokolakis, Catuscia Palamidessi:
A framework for analyzing probabilistic protocols and its application to the Partial Secrets Exchange. 512-527 - Karl Krukow, Andrew Twigg:
The complexity of fixed point models of trust in distributed networks. 528-549
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-02-24 21:32 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:
