Information Processing Letters, Volume 82
Volume 82, Number 1, 15 April 2002
- Enrique Alba: Parallel evolutionary algorithms can achieve super-linear performance. 7-13
- Erick Cantú-Paz: Order statistics and selection methods of evolutionary algorithms. 15-22
- John H. Holmes, Pier Luca Lanzi, Wolfgang Stolzmann, Stewart W. Wilson: Learning classifier systems: New models, successful applications. 23-30
- Vili Podgorelec, Peter Kokol: Evolutionary induced decision trees for dangerous software modules prediction. 31-38
- Günther R. Raidl, Ivana Ljubic: Evolutionary local search for the edge-biconnectivity augmentation problem. 39-45
- Shisanu Tongchim, Prabhas Chongstitvatana: Parallel genetic algorithm with parameter adaptation. 47-54
- Anjan Kumar Swain, Alan S. Morris: Performance improvement of self-adaptive evolutionary methods with a dynamic lower bound. 55-63
Volume 82, Number 2, 30 April 2002
- Keon-Jik Lee, Kee-Won Kim, Kee-Young Yoo: Digit-serial-in-serial-out systolic multiplier for Montgomery algorithm. 65-71
- Tsorng-Lin Chia, Kuang-Bor Wang, Zen Chen, Der-Chyuan Lou: Parallel distance transforms on a linear array architecture. 73-81
- W. Zimmermann, W. Löwem, Denis Trystram: On scheduling send-graphs and receive-graphs under the LogP-model. 83-92
- Peter Damaschke: Optimizing a mail-order with discount and shipping costs. 93-97
- Stephan Eidenbenz: Approximation algorithms for terrain guarding. 99-105
- Zhaohui Liu, T. C. Edwin Cheng: Scheduling with job release dates, delivery times and preemption penalties. 107-111
- Jianxi Fan: Hamilton-connectivity and cycle-embedding of the Möbius cubes. 113-117
Volume 82, Number 3, 16 May 2002
- Andreas Brandstädt, Hoàng-Oanh Le, Van Bang Le: On alpha-redundant vertices in P5-free graphs. 119-122
- Anindya C. Patthak, Indrajit Bhattacharya, Anirban Dasgupta, Pallab Dasgupta, P. P. Chakrabarti: Quantified Computation Tree Logic. 123-129
- Sun-Yuan Hsieh: On vertex ranking of a starlike graph. 131-135
- Håkan Jonsson: The Traveling Salesman Problem for lines in the plane. 137-142
- John P. Fishburn: Solving a system of difference constraints with variables restricted to a finite set. 143-144
- Walter J. Gutjahr: ACO algorithms with guaranteed convergence to the optimal solution. 145-153
- Dan Gusfield: Partition-distance: A problem and class of perfect graphs arising in clustering. 159-164
- Jörg Rothe, Lane A. Hemaspaandra: On characterizing the existence of partial one-way permutations. 165-171
Volume 82, Number 4, 31 May 2002
- Yung H. Tsin: Some remarks on distributed depth-first search. 173-178
- Ji-Woong Chang, Young-Koo Lee, Kyu-Young Whang: Global lock escalation in database management systems. 179-186
- C. T. Ng, T. C. Edwin Cheng, J. J. Yuan: Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem. 187-191
- Martin Richards: A note concerning the closest point pair algorithm. 193-195
- Cedric Chauve: Tree pattern matching with a more general notion of occurrence of the pattern. 197-201
- Paulo A. S. Veloso, José Luiz Fiadeiro, Sheila R. M. Veloso: On local modularity and interpolation in entailment systems. 203-211
- Yangjun Chen: Signature files and signature trees. 213-221
Volume 82, Number 5, 15 June 2002
- Arnaldo V. Moura, Guilherme A. Pinto: A note on the verification of automata specifications of probabilistic real-time systems. 223-228
- Jérôme Monnot: Differential approximation results for the traveling salesman and related problems. 229-235
- Paolo Penna: On the approximability of two tree drawing conventions. 237-242
- Seokhie Hong, Jaechul Sung, Sangjin Lee, Jongin Lim, Jongsu Kim: Provable security for 13 round Skipjack-like structure. 243-246
- Taekyoung Kwon: Digital signature algorithm for securing digital identities. 247-252
- Harald Kosch, Solomon Atnafu: Processing a multimedia join through the method of nearest neighbor search. 269-276
Volume 82, Number 6, 30 June 2002
- Jerry L. Trahan, Ramachandran Vaidyanathan: Scaling multiple addition and prefix sums on the reconfigurable mesh. 277-282
- Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino: Recognition and dualization of disguised bidual Horn functions. 283-291
- Xiao Yu Li, Matthias F. M. Stallmann: New bounds on the barycenter heuristic for bipartite graph drawing. 293-298
- Emmanuel Godard: A self-stabilizing enumeration algorithm. 299-305
- S. Srinivasa Rao: Time-space trade-offs for compressed suffix arrays. 307-311
- Manindra Agrawal: For completeness, sublogarithmic space is no space. 321-325
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team