Information Processing Letters, Volume 96
Volume 96, Number 1, 16 October 2005
- Dariusz Biernacki, Olivier Danvy, Chung-chieh Shan: On the dynamic extent of delimited continuations. 7-17
- Andrea Pietracaprina, Geppino Pucci: Optimal many-to-one routing on the mesh with constant queues. 24-29
- Alain Finkel, Jérôme Leroux: The convex hull of a regular set of integer vectors is polyhedral and effectively computable. 30-35
- K. Alagarsamy: A mutual exclusion algorithm with optimally bounded bypasses. 36-40
Volume 96, Number 2, 31 October 2005
- Huaming Zhang, Xin He: Visibility representation of plane graphs via canonical ordering tree, . 41-48
- Vassilios V. Dimakopoulos, Leonidas Palios, Athanasios S. Poulakidas: On the hamiltonicity of the cartesian product. 49-53
- Ferucio Laurentiu Tiplea, Dan C. Marinescu: Structural soundness of workflow nets is decidable. 54-58
- Dieter Rautenbach: Lower bounds on treespan. 67-70
Volume 96, Number 3, 15 November 2005
- Jérôme Monnot: The labeled perfect matching in bipartite graphs. 81-88
- Sahadeo Padhye: Partial known plaintext attack on Koyama scheme. 96-100
- Jianhua Zhao, Xuandong Li, Guoliang Zheng: A quadratic-time DBM-based successor algorithm for checking timed automata. 101-105
- Yuriy A. Reznik: On the average depth of asymmetric LC-tries. 106-113
Volume 96, Number 4, 30 November 2005
- Pangfeng Liu: Minimum degree triangulation for rectangular domains. 128-135
Volume 96, Number 5, 16 December 2005
- Tadao Takaoka: An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem. 155-161
- Walter A. Burkhard: Double hashing with passbits. 162-166
- Xianbing Wang, Yong Meng Teo, Jiannong Cao: A bivalency proof of the lower bound for uniform consensus. 167-174
- Igor Shparlinski, Arne Winterhof: On the linear complexity of bounded integer sequences over different moduli. 175-177
- Moritz G. Maaß, Johannes Nowak: A new method for approximate indexing and dictionary lookup with one error. 185-191
Volume 96, Number 6, 31 December 2005
- Kuan-Yu Chen, Kun-Mao Chao: Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint. 197-201
- Stasys Jukna: On the P versus NP intersected with co-NP question in communication complexity. 202-206
- Méziane Aïder, Mustapha Aouchiche: Distance monotonicity and a new characterization of Hamming graphs. 207-213
- Eduardo Moreno: De Bruijn sequences and De Bruijn graphs for a general language. 214-219
- Thuy Duong Vu: The compression structure of a process. 225-229
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team