External Links

    Journal: Inf. Process. Lett.

    Volume 84, Issue 6

    291 -- 294Daniel Kirsten. The finite power problem revisited
    295 -- 303Prasanta K. Jana, B. Damodara Naidu, Shailendra Kumar, Manish Arora, Bhabani P. Sinha. Parallel prefix computation on extended multi-mesh network
    305 -- 310Andrea Maggiolo-Schettini, Simone Tini. On disjunction of literals in triggers of statecharts transitions
    311 -- 317Antoni Diller. Efficient multi-variate abstraction using an array representation for combinators
    319 -- 326Carlo Blundo, Stelvio Cimato, Barbara Masucci. A note on optimal metering schemes
    327 -- 332A. L. Rastsvetaev, Lev D. Beklemishev. On the query complexity of finding a local maximum point
    333 -- 338Sean Cleary. Restricted rotation distance between binary trees
    339 -- 344Michael Domaratzki, Giovanni Pighizzini, Jeffrey Shallit. Simulating finite automata with context-free grammars

    Volume 84, Issue 5

    235 -- 236Oliver Pretzel. Characterization of simple edge-firing games
    237 -- 240Adi Rosén. A note on models for non-probabilistic analysis of packet switching networks
    241 -- 249Stefania Costantini, Ottavio M. D Antona, Alessandro Provetti. On the equivalence and range of applicability of graph-based representations of logic programs
    251 -- 259Andreas Brandstädt, Suhail Mahfud. Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time
    261 -- 264Ken-etsu Fujita. An interpretation of [lambda][mu]-calculus in [lambda]-calculus
    265 -- 269Hung Q. Ngo, Ding-Zhu Du, Ronald L. Graham. New bounds on a hypercube coloring problem
    271 -- 276. More on random walks, electrical networks, and the harmonic k-server algorithm
    277 -- 284Hsun-Jung Cho, Li-Yen Hsu. Ring embedding in faulty honeycomb rectangular torus
    285 -- 290Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli. Approximating minimum cocolorings

    Volume 84, Issue 4

    175 -- 180Alberto Caprara, Romeo Rizzi. Packing triangles in bounded degree graphs
    181 -- 187Jakub Neumann, Andrzej Szepietowski, Igor Walukiewicz. Complexity of weak acceptance conditions in tree automata
    189 -- 193Kazuhisa Makino, Takashi Takabatake, Satoru Fujishige. A simple matching algorithm for regular bipartite graphs
    195 -- 199Yin-Te Tsai, Yaw-Ling Lin, Fang-Rong Hsu. The on-line first-fit algorithm for radio frequency assignment problems
    201 -- 206Sunil Arya. Binary space partitions for axis-parallel line segments: Size-height tradeoffs
    207 -- 214Enno Ohlebusch. Hierarchical termination revisited
    215 -- 220Samir Khuller, An Zhu. The General Steiner Tree-Star problem
    221 -- 225Minyoung Sung, Soyoung Kim, Sangsoo Park, Naehyuck Chang, Heonshik Shin. Comparative performance evaluation of Java threads for embedded applications: Linux Thread vs. Green Thread
    227 -- 233Rakesh M. Verma. Algorithms and reductions for rewriting problems II

    Volume 84, Issue 3

    117 -- 124Eli Biham. How to decrypt or even substitute DES-encrypted messages in 2:::28::: steps
    125 -- 130Seung Mo Cho, Hyung-Ho Kim, Sung Deok Cha, Doo-Hwan Bae. A semantics of sequence diagrams
    131 -- 139Guillaume Fertin, Emmanuel Godard, André Raspaud. Minimum feedback vertex set and acyclic coloring
    141 -- 145Zhi-Zhong Chen, Shiqing Zhang. Tight upper bound on the number of edges in a bipartite K::3, 3::-free or K::5::-free graph with an application
    147 -- 151Hans Kleine Büning, Xishun Zhao. Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency
    153 -- 157Oded Regev. Priority algorithms for makespan minimization in the subset model
    159 -- 166Roberto Baldoni, Giovanna Melideo. On the minimal information to encode timestamps in distributed computations
    167 -- 172Shin-Ichi Nakano. Efficient generation of plane trees
    173 -- 0Tom Araki, Yukio Shibata. Erratum to Pancyclicity of recursive circulant graphs : [Information Processing Letters 81 (2002) 187-190]

    Volume 84, Issue 2

    57 -- 60Juha Honkala. The equality problem for Parikh simple algebraic power series
    61 -- 67Gregory Karagiorgos, Nikolaos M. Missirlis. Accelerated diffusion algorithms for dynamic load balancing
    69 -- 73Lars Jacobsen, Kim S. Larsen, Morten N. Nielsen. On the existence and construction of non-extreme (a, b)-trees
    75 -- 85Patricia Bouyer. A logical characterization of data languages
    87 -- 92Yen-Chu Chuang, Lih-Hsing Hsu, Chung-Haw Chang. Optimal 1-edge fault-tolerant designs for ladders
    93 -- 98Anand Srinivasan, Sanjoy K. Baruah. Deadline-based scheduling of periodic task systems on multiprocessors
    99 -- 101Yingyu Wan, Guoliang Chen, Yinlong Xu. A note on the minimum label spanning tree
    103 -- 107Guo-Hui Lin, Guoliang Xue. On the terminal Steiner tree problem
    109 -- 116Oh-Heum Kwon. Scheduling time-constrained multicast messages in circuit-switched tree networks

    Volume 84, Issue 1

    1 -- 3Elvira Mayordomo. A Kolmogorov complexity characterization of constructive Hausdorff dimension
    5 -- 16Mauricio Ayala-Rincón, Alexsandro F. da Fonseca, Haydée Werneck Poubel, José de Siqueira. A framework to visualize equivalences between computational models of regular languages
    17 -- 22Takeshi Kanda, Kokichi Sugihara. Comparison of various trees for nearest-point search with/without the Voronoi diagram
    23 -- 30Shivi Shekhar Bansal, Bijendra Vishal, Phalguni Gupta. Near optimal Cholesky factorization on orthogonal multiprocessors
    31 -- 39Jun Gu, Xiao-Dong Hu, Mu-Hong Zhang. Algorithms for multicast connection under multi-path routing model
    41 -- 46Ronald I. Greenberg, Lee Guan. On the area of hypercube layouts
    47 -- 55Yong-Jik Kim, James H. Anderson. A space- and time-efficient local-spin spin lock
    runs on