Journal: Inf. Process. Lett.

Volume 59, Issue 6

289 -- 294Artur Czumaj, Krzysztof Diks, Teresa M. Przytycka. Parallel Maximum Independent Set in Convex Bipartite Graphs
295 -- 301Vladimir G. Deineko, Gerhard J. Woeginger. The Convex-Hull-and-k-Line Travelling Salesman Problem
303 -- 308Helmut Seidl. Fast and Simple Nested Fixpoints
309 -- 315Roberto De Prisco, Giuseppe Parlati, Giuseppe Persiano. A Note on the Expected Path Length of Trees with Known Fringe
317 -- 323Adele A. Rescigno. On the Communication Complexity of Polling
325 -- 330A. P. Ustimenko. Algebra of Two-Level Cause-Effect Structures
331 -- 333Shin-ichi Tokunaga. Intersection Number of Two Connected Geometric Graphs
335 -- 339Avraham A. Melkman, Solomon Eyal Shimony. Algorithms for Parsimonious Complete Sets in Directed Graphs

Volume 59, Issue 5

233 -- 239Beate Bollig, Martin Löbbing, Ingo Wegener. On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams
241 -- 244Ricardo A. Baeza-Yates, Luis O. Fuentes. A Framework to Animate String Algorithms
245 -- 250Judi Romijn, Frits W. Vaandrager. A Note on Fairness in I/O Automata
251 -- 254György Turán, Farrokh Vatan. A Size-Depth Trade-Off for the Analog Computation of Boolean Functions
255 -- 259Frank Nielsen. Output-Sensitive Peeling of Convex and Maximal Layers
261 -- 265Antonio Hernández-Barrera. Algorithms for Deciding the Containment of Polygons
267 -- 271Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha. Parallel Tree-Contraction and Fibonacci Numbers
273 -- 279Keisuke Tanaka, Tetsuro Nishino, Robert Beals. Negation-Limited Circuit Complexity of Symmetric Functions
281 -- 288Sukumar Ghosh, Arobinda Gupta. An Exercise in Fault-Containment: Self-Stabilizing Leader Election

Volume 59, Issue 4

175 -- 178Francisco Santos. Inscribing a Symmetric Body in an Ellipse
179 -- 184Ursula Goltz, Heike Wehrheim. Modelling Causality via Action Dependencies in Branching Time Semantics
185 -- 189Petrisor Panaite. Hypercube Permutations Routable Under all Dimension Orderings
191 -- 196Christopher H. Young, Philip A. Wilsey. A Distributed Method to Bound Rollback Lengths for Fossil Collection in Time Warp Simulators
197 -- 202Wlodzimierz Holsztynski, Waldemar W. Koczkodaj. Convergence of Inconsistency Algorithms for the Pairwise Comparisons
203 -- 206Andrzej Szepietowski. The Element Distinctness Problem on One-Tape Turing Machines
207 -- 210Muhammad H. Alsuwaiyel. Finding a Shortest Hamiltonian Path Inside a Simple Polygon
211 -- 215Bernd Borchert, Antoni Lozano. Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept
217 -- 222Yu-Chee Tseng. Embedding a Ring in a Hypercube with Both Faulty Links and Faulty Nodes
223 -- 228G. Athithan, T. Sony Roy. Hyperspherical Neighbourhoods and Pattern Recognition Using Neural Networks
229 -- 232Zoran Ivkovic, Errol L. Lloyd. A Fundamental Restriction on Fully Dynamic Maintenance of Bin Packing

Volume 59, Issue 3

117 -- 122Hong Shen, Sarnath Ramnath. Optimal Parallel Selection in Sorted Matrices
123 -- 127Noga Alon, Phillip G. Bradford, Rudolf Fleischer. Matching Nuts and Bolts Faster
129 -- 133Gheorghe Paun. Splicing Systems with Targets are Computationally Universal
135 -- 143Christel Baier, Mila E. Majster-Cederbaum. Denotational Linear Time Semantics and Sequential Composition
145 -- 150Rohan F. M. Aranha, C. Pandu Rangan. An Efficient Distributed Algorithm for Centering a Spanning Tree of a Biconnected Graph
151 -- 157Anna Bernasconi. Sensitivity vs. Block Sensitivity (an Average-Case Study)
159 -- 163Carroll Morgan, Annabelle McIver. Unifying wp and wlp
165 -- 168Tetsuo Moriya, Hideki Yamasaki. Literal Shuffle on omega-Languages
169 -- 174Sergio De Agostino, James A. Storer. On-Line Versus Off-Line Computation in Dynamic Text Compression

Volume 59, Issue 2

59 -- 63Toshihiro Fujito. A Note on Approximation of the Vertex Cover and Feedback Vertex Set Problems - Unified Approach
65 -- 73Paul G. Howard, Jeffrey Scott Vitter. Parallel Lossless Image Compression Using Huffman and Arithmetic Coding
75 -- 77Ian Glaister, Jeffrey Shallit. A Lower Bound Technique for the Size of Nondeterministic Finite Automata
79 -- 84Brian Dunten, Julie Jones, Jonathan Sorenson. A Space-Efficient Fast Prime Number Sieve
85 -- 89Dominique Barth. Optimal Broadcasting in the Back to Back d-ary Trees
91 -- 96Hideo Nagumo, Mi Lu, Karan L. Watson. On-Line Longest Fragment First Parsing Algorithm
97 -- 102M. S. Madanlal, G. Venkatesan, C. Pandu Rangan. Tree 3-Spanners on Interval, Permutation and Regular Bipartite Graphs
103 -- 107Ting-Yem Ho, Yue-Li Wang, Ming-Tsan Juan. A Linear Time Algorithm for Finding all Hinge Vertices of a Permutation Graph
109 -- 115Soon Myoung Chung, Pyeong S. Mah. Semantics-Based Transaction Management for Multidatabase Systems

Volume 59, Issue 1

1 -- 7Gurmeet Singh Manku. A Linear Time Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem
9 -- 11Stephen Alstrup, Jens Clausen, Kristian Jørgensen. An O(|V|*|E|) Algorithm for Finding Immediate Multiple-Vertex Dominators
13 -- 17Dietmar Wätjen, Heike Spilker. Decidability Results Concerning k-limited ED0L Systems
19 -- 20Thomas Natschläger, Michael Schmitt. Exact VC-Dimension of Boolean Monomials
21 -- 27Ricardo A. Baeza-Yates, Chris H. Perleberg. Fast and Practical Approximate String Matching
29 -- 30Uri Zwick. On the Number of ANDs Versus the Number of ORs in Monotone Boolean Circuits
31 -- 36Yu-Chen Kuo, Shing-Tsaan Huang. A Simple Scheme to Construct k-Coteries with O(sqrt(N)) Uniform Quorum Sizes
37 -- 39Nader H. Bshouty. A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries
41 -- 44Monika Rauch Henzinger, David P. Williamson. On the Number of Small Cuts in a Graph
45 -- 51Xiadong Wang, Qingxiang Fu. A Frame for General Divide-and-Conquer Recurrences
53 -- 58Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert. Maintaining a Topological Order Under Edge Insertions