External Links

    Journal: Inf. Process. Lett.

    Volume 73, Issue 5-6

    153 -- 156Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg. Pancyclicity in switching classes
    157 -- 161Raymond R. Devillers, Joël Goossens. Liu and Layland s schedulability test revisited
    163 -- 165Atsushi Kaneko, Kiyoshi Yoshimoto. On spanning trees with restricted degrees
    167 -- 168Liang Chen, Naoyuki Tokuda. A note on Category and measure in complexity classes
    169 -- 173Steven McKellar, Robert Davis. Redundancy removal in multicast protocols
    175 -- 180Zoltán Fülöp, Sebastian Maneth. Domains of partial attributed tree transducers
    181 -- 188Fanica Gavril. Maximum weight independent sets and cliques in intersection graphs of filaments
    189 -- 198Giovanni Dimauro, Sebastiano Impedovo, Giuseppe Pirlo, A. Salzo. RNS architectures for the implementation of the diagonal function
    199 -- 206Amiya Nayak, J. Ren, Nicola Santoro. An improved testing scheme for catastrophic fault patterns
    207 -- 212Achour Mostéfaoui, Michel Raynal, Frederic Tronel. From Binary Consensus to Multivalued Consensus in asynchronous message-passing systems
    213 -- 220Amos Beimel, Eyal Kushilevitz. Learning unions of high-dimensional boxes over the reals
    221 -- 225Daniel Stefankovic. Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms

    Volume 73, Issue 3-4

    77 -- 86Vlady Ravelomanana, Loÿs Thimonier. Patchworks and metablocks enumeration
    87 -- 92Jean Marcel Pallo. An efficient upper bound of the rotation distance of binary trees
    93 -- 96Shahrokh Saeednia. On the security of a convertible group signature scheme
    97 -- 101Min-Shiang Hwang. Cryptanalysis of YCN key assignment scheme in a hierarchy
    103 -- 110Tzung-Shi Chen. Task migration in 2D wormhole-routed mesh multicomputers
    111 -- 118Alberto Caprara, Hans Kellerer, Ulrich Pferschy. A PTAS for the Multiple Subset Sum Problem with different knapsack capacities
    119 -- 124Ferdinando Cicalese, Ugo Vaccaro. An improved heuristic for Ulam-Rényi game
    125 -- 129Rolf Niedermeier, Peter Rossmanith. A general method to speed up fixed-parameter-tractable algorithms
    131 -- 136Guillaume Fertin. Hierarchical broadcast and gossip networks
    137 -- 143David Avis, Luc Devroye. Estimating the number of vertices of a polyhedron
    145 -- 151Sukumar Ghosh, Xin He. Fault-containing self-stabilization using priority scheduling

    Volume 73, Issue 1-2

    1 -- 3Erkki Mäkinen. On inferring linear single-tree languages
    5 -- 10Eddie Cheng, Marc J. Lipman. On the Day-Tripathi orientation of the star graphs: Connectivity
    11 -- 16Jorge Castro, David Guijarro. PACS, simple-PAC and query learning
    17 -- 21Michael A. Bender, Chandra Chekuri. Performance guarantees for the TSP with a parameterized triangle inequality
    23 -- 28Mikael Goldmann, Alexander Russell, Denis Thérien. An ergodic theorem for read-once non-uniform deterministic finite automata
    29 -- 32Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman. Low discrepancy sets yield approximate min-wise independent permutation families
    33 -- 39Sung Kwon Kim, Chan-Su Shin, Tae-Cheon Yang. Placing two disks in a convex polygon
    41 -- 46Ted Herman, Sriram V. Pemmaraju. Error-detecting codes and fault-containing self-stabilization
    53 -- 59Enno Ohlebusch. A uniform framework for term and graph rewriting applied to combined systems
    61 -- 68Giorgio Gambosi, Gaia Nicosia. On-line scheduling with setup costs
    69 -- 75Uriel Feige, Joe Kilian. Finding OR in a noisy broadcast network
    runs on