|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
55 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A fully abstract model for the exchange of information in multi-agent systems |
de Boer, Frank S. |
2003 |
290 | 3 |
p. 1753-1773 21 p. |
article |
|
| 2 | A hierarchy of deterministic context-free ω-languages |
Duparc, J. |
2003 |
290 | 3 |
p. 1253-1300 48 p. |
article |
|
| 3 | Algebraic aspects of emission tomography with absorption |
Hajdu, L. |
2003 |
290 | 3 |
p. 2169-2181 13 p. |
article |
|
| 4 | An approximate A∗ algorithm and its application to the SCS problem |
Nicosia, Gaia |
2003 |
290 | 3 |
p. 2021-2029 9 p. |
article |
|
| 5 | An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications |
Bampis, Evripidis |
2003 |
290 | 3 |
p. 1883-1895 13 p. |
article |
|
| 6 | An asymptotic theory for recurrence relations based on minimization and maximization |
Hwang, Hsien-Kuei |
2003 |
290 | 3 |
p. 1475-1501 27 p. |
article |
|
| 7 | A new routing algorithm for multirate rearrangeable Clos networks |
Ngo, Hung Q. |
2003 |
290 | 3 |
p. 2157-2167 11 p. |
article |
|
| 8 | A note on first-order projections and games |
Arratia, Argimiro A. |
2003 |
290 | 3 |
p. 2085-2093 9 p. |
article |
|
| 9 | Approximate sequencing for variable length tasks |
Cai, Mao-Cheng |
2003 |
290 | 3 |
p. 2037-2044 8 p. |
article |
|
| 10 | A probabilistic analysis of randomly generated binary constraint satisfaction problems |
Dyer, Martin |
2003 |
290 | 3 |
p. 1815-1828 14 p. |
article |
|
| 11 | A time-optimal solution for the path cover problem on cographs |
Nakano, Koji |
2003 |
290 | 3 |
p. 1541-1556 16 p. |
article |
|
| 12 | Author index |
2003 |
290 | 3 |
p. 2185-2189 5 p. |
article |
||
| 13 | Biinfinite words with maximal recurrent unbordered factors |
Costa, José Carlos |
2003 |
290 | 3 |
p. 2053-2061 9 p. |
article |
|
| 14 | Borel hierarchy and omega context free languages |
Finkel, Olivier |
2003 |
290 | 3 |
p. 1385-1405 21 p. |
article |
|
| 15 | Cartesian authentication codes from functions with optimal nonlinearity |
Chanson, Samuel |
2003 |
290 | 3 |
p. 1737-1752 16 p. |
article |
|
| 16 | Characterization of real time iterative array by alternating device |
Terrier, Véronique |
2003 |
290 | 3 |
p. 2075-2084 10 p. |
article |
|
| 17 | Coding properties of DNA languages |
Hussini, Salah |
2003 |
290 | 3 |
p. 1557-1579 23 p. |
article |
|
| 18 | Complexity of DNA sequencing by hybridization |
Błażewicz, Jacek |
2003 |
290 | 3 |
p. 1459-1473 15 p. |
article |
|
| 19 | Criteria to disprove context freeness of collage languages |
Drewes, Frank |
2003 |
290 | 3 |
p. 1445-1458 14 p. |
article |
|
| 20 | Deterministic broadcasting time with partial knowledge of the network |
De Marco, Gianluca |
2003 |
290 | 3 |
p. 2009-2020 12 p. |
article |
|
| 21 | Do stronger definitions of randomness exist? |
Durand, Bruno |
2003 |
290 | 3 |
p. 1987-1996 10 p. |
article |
|
| 22 | Erratum to “New upper bounds to the limitedness of distance automata” |
Hashiguchi, Kosaburo |
2003 |
290 | 3 |
p. 2183- 1 p. |
article |
|
| 23 | Extended Games–Chan algorithm for the 2-adic complexity of FCSR-sequences |
Meidl, Wilfried |
2003 |
290 | 3 |
p. 2045-2051 7 p. |
article |
|
| 24 | Faster deterministic sorting through better sampling |
Sibeyn, Jop F. |
2003 |
290 | 3 |
p. 1829-1850 22 p. |
article |
|
| 25 | Greedy algorithms, H-colourings and a complexity-theoretic dichotomy |
Puricella, Antonio |
2003 |
290 | 3 |
p. 1897-1913 17 p. |
article |
|
| 26 | Identification of function distinguishable languages |
Fernau, Henning |
2003 |
290 | 3 |
p. 1679-1711 33 p. |
article |
|
| 27 | Inplace run-length 2d compressed search |
Amir, Amihood |
2003 |
290 | 3 |
p. 1361-1383 23 p. |
article |
|
| 28 | Interval routing in some planar networks |
Chepoi, Victor |
2003 |
290 | 3 |
p. 1503-1540 38 p. |
article |
|
| 29 | Is DNA computing viable for 3-SAT problems? |
Li, Dafa |
2003 |
290 | 3 |
p. 2095-2107 13 p. |
article |
|
| 30 | Linear programs in a simple reversible language |
Matos, Armando B. |
2003 |
290 | 3 |
p. 2063-2074 12 p. |
article |
|
| 31 | Master index |
2003 |
290 | 3 |
p. 2191-2206 16 p. |
article |
||
| 32 | McNaughton families of languages |
Beaudry, M. |
2003 |
290 | 3 |
p. 1581-1628 48 p. |
article |
|
| 33 | Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard |
Charon, Irène |
2003 |
290 | 3 |
p. 2109-2120 12 p. |
article |
|
| 34 | More on randomized on-line algorithms for caching |
Chrobak, Marek |
2003 |
290 | 3 |
p. 1997-2008 12 p. |
article |
|
| 35 | Object grammars and bijections |
Dutour, I. |
2003 |
290 | 3 |
p. 1915-1929 15 p. |
article |
|
| 36 | On computing the entropy of cellular automata |
D'amico, Michele |
2003 |
290 | 3 |
p. 1629-1646 18 p. |
article |
|
| 37 | One application of real-valued interpretation of formal power series |
Muchnik, An.A. |
2003 |
290 | 3 |
p. 1931-1946 16 p. |
article |
|
| 38 | On images of D0L and DT0L power series |
Honkala, Juha |
2003 |
290 | 3 |
p. 1869-1882 14 p. |
article |
|
| 39 | On the degree of scattered context-sensitivity |
Fernau, Henning |
2003 |
290 | 3 |
p. 2121-2124 4 p. |
article |
|
| 40 | On the k-path partition of graphs |
Steiner, George |
2003 |
290 | 3 |
p. 2147-2155 9 p. |
article |
|
| 41 | On the number of occurrences of all short factors in almost all words |
Tomescu, Ioan |
2003 |
290 | 3 |
p. 2031-2035 5 p. |
article |
|
| 42 | On tiling under tomographic constraints |
Chrobak, Marek |
2003 |
290 | 3 |
p. 2125-2136 12 p. |
article |
|
| 43 | On uncertainty versus size in branching programs |
Jukna, S. |
2003 |
290 | 3 |
p. 1851-1867 17 p. |
article |
|
| 44 | On viewing block codes as finite automata |
Shankar, Priti |
2003 |
290 | 3 |
p. 1775-1797 23 p. |
article |
|
| 45 | Optimal binary search trees with costs depending on the access paths |
Szwarcfiter, Jayme L. |
2003 |
290 | 3 |
p. 1799-1814 16 p. |
article |
|
| 46 | 1-optimality of static BSP computations: scheduling independent chains as a case study |
Goldman, Alfredo |
2003 |
290 | 3 |
p. 1331-1359 29 p. |
article |
|
| 47 | Orphan gene finding—an exon assembly approach |
Blayo, Philippe |
2003 |
290 | 3 |
p. 1407-1431 25 p. |
article |
|
| 48 | Power and size of extended Watson–Crick L systems |
Csima, Judit |
2003 |
290 | 3 |
p. 1665-1678 14 p. |
article |
|
| 49 | Reconstructing (h,v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections |
Boufkhad, Yacine |
2003 |
290 | 3 |
p. 1647-1664 18 p. |
article |
|
| 50 | The definable criterion for definability in Presburger arithmetic and its applications |
Muchnik, An.A. |
2003 |
290 | 3 |
p. 1433-1444 12 p. |
article |
|
| 51 | Tiling with bars under tomographic constraints |
Dürr, Christoph |
2003 |
290 | 3 |
p. 1317-1329 13 p. |
article |
|
| 52 | Turning back time in Markovian process algebra |
Harrison, Peter G. |
2003 |
290 | 3 |
p. 1947-1986 40 p. |
article |
|
| 53 | Undecidable properties of monoids with word problem solvable in linear time |
Katsura, Masashi |
2003 |
290 | 3 |
p. 1301-1316 16 p. |
article |
|
| 54 | Verification in loosely synchronous queue-connected discrete timed automata |
Ibarra, Oscar H. |
2003 |
290 | 3 |
p. 1713-1735 23 p. |
article |
|
| 55 | Weak repetitions in Sturmian strings |
Karaman, Ayşe |
2003 |
290 | 3 |
p. 2137-2146 10 p. |
article |
55 results found