Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 337
Volume 337, Number 1-3, June 2005
- Roberto Giacobazzi, Isabella Mastroeni
:
Transforming semantics by abstract interpretation. 1-50 - Gennaro Costagliola, Filomena Ferrucci, Carmine Gravino:
Adding symbolic information to picture models: definitions and properties. 51-104 - Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
On the complexity of decidable cases of the commutation problem of languages. 105-118 - Ian McQuillan:
The generative capacity of block-synchronized context-free grammars. 119-133 - T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov:
Semi-on-line multiprocessor scheduling with given total processing time. 134-146 - Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer:
Gathering of asynchronous robots with limited visibility. 147-168 - Wai-Fong Chuan:
Factors of characteristic words of irrational numbers. 169-182 - Etsuro Moriya, Dieter Hofbauer, Maria Huber, Friedrich Otto:
On state-alternating context-free grammars. 183-216 - Philip Bille:
A survey on tree edit distance and related problems. 217-239 - Vânia M. Félix Dias, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter:
Generating bicliques of a graph in lexicographic order. 240-248 - Michael Elkin, David Peleg:
Approximating k-spanner problems for kge2. 249-277 - Dimitar P. Guelev, Dang Van Hung:
On the completeness and decidability of duration calculus with iteration. 278-304 - Jianer Chen, Iyad A. Kanj:
On approximating minimum vertex cover for graphs with perfect matching. 305-318 - Martin Aigner, Gianluca De Marco, Manuela Montangero:
The plurality problem with three colors and more. 319-330 - Bodo Manthey, Rüdiger Reischuk:
The intractability of computing the Hamming distance. 331-346 - Shlomo Hoory, Stefan Szeider:
Computing unsatisfiable k-SAT instances with few occurrences per variable. 347-359 - Arthur W. Chou, Ker-I Ko:
The computational complexity of distance functions of two-dimensional domains. 360-369 - Sun-Yuan Hsieh:
Embedding longest fault-free paths onto star graphs with more vertex faults. 370-378 - Henk Bruin, Oksan Volkova:
The complexity of Fibonacci-like kneading sequences. 379-389 - Li-Sha Huang, Minming Li, Bo Zhang:
Approximation of Walrasian equilibrium in single-minded auctions. 390-398
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-05-10 18:47 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:
