Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 347
Volume 347, Numbers 1-2, 30 November 2005
- Tatjana Petkovic, Saeed Salehi
:
Positive varieties of tree languages. 1-35
- Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi:
Reconciling a gene tree to a species tree under the duplication cost model. 36-53 - Victor Chepoi, Feodor F. Dragan, Chenyu Yan:
Additive sparse spanners for graphs with bounded length of largest induced cycle. 54-75 - Frank Gurski, Egon Wanke:
On the relationship between NLC-width and linear NLC-width. 76-89 - Tomoyuki Yamakami, Toshio Suzuki:
Resource bounded immunity and simplicity. 90-129 - Chryssis Georgiou, Dariusz R. Kowalski, Alexander A. Shvartsman:
Efficient gossip and robust distributed computation. 130-166 - Peter R. J. Asveld:
Fuzzy context-free languages - Part 1: Generalized fuzzy context-free grammars. 167-190 - Peter R. J. Asveld:
Fuzzy context-free languages - Part 2: Recognition and parsing algorithms. 191-213 - Krzysztof C. Kiwiel:
On Floyd and Rivest's SELECT algorithm. 214-238 - Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen:
Sequential and indexed two-dimensional combinatorial template matching allowing rotations. 239-275 - Zoltán Fülöp, Armin Kühnemann, Heiko Vogler:
Linear deterministic multi bottom-up tree transducers. 276-287 - Zhaohui Liu, T. C. Edwin Cheng:
Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine. 288-298 - Éric Schost:
There is no efficient reverse derivation mode for discrete derivatives. 299-305 - H. K. Hsiao, Y. T. Yeh, S. S. Yu:
Dependences related to strict binary relations. 306-324 - Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener:
On converting CNF to DNF. 325-335 - Giusi Castiglione, Andrea Frosini, Antonio Restivo, Simone Rinaldi:
Enumeration of L-convex polyominoes by rows and columns. 336-352 - Emanuele Munarini, Damiano Torri:
Cayley continuants. 353-369 - Andrea Frosini, Maurice Nivat, Laurent Vuillon:
An introduction to periodical discrete sets from a tomographical perspective. 370-392 - Sara Brunetti, Alain Daurat:
Random generation of Q-convex sets. 393-414
- N. V. Vinodchandran:
A note on the circuit complexity of PP. 415-418 - Tero Harju, Arto Lepistö, Dirk Nowotka:
A characterization of periodicity of bi-infinite words. 419-422 - Feng Feng, Xianzhong Zhao, Young Bae Jun:
*-μ-semirings and *-λ-semirings. 423-431 - Alain Daurat, Yan Gérard, Maurice Nivat:
Some necessary clarifications about the chords' problem and the Partial Digest Problem. 432-436
- Jean-Marc Champarnaud, Fabien Coulon:
Erratum to "NFA reduction algorithms by means of regular inequalities" [TCS 327 (2004) 241-253]. 437-440
Volume 347, Number 3, 1 December 2005
- Samson Abramsky:
A structural approach to reversible computation. 441-464 - Zurab Khasidashvili, John R. W. Glauert:
The conflict-free Reduction Geometry. 465-497 - Ivo Düntsch, Michael Winter:
A representation theorem for Boolean contact algebras. 498-512
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:
