Information Processing Letters, Volume 73
Volume 73, Numbers 1-2, 31 January 2000
Erkki Mäkinen: On inferring linear single-tree languages. 1-3- Michael A. Bender, Chandra Chekuri: Performance guarantees for the TSP with a parameterized triangle inequality. 17-21
- Mikael Goldmann, Alexander Russell, Denis Thérien: An ergodic theorem for read-once non-uniform deterministic finite automata. 23-28
- Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman: Low discrepancy sets yield approximate min-wise independent permutation families. 29-32
- Ted Herman, Sriram V. Pemmaraju: Error-detecting codes and fault-containing self-stabilization. 41-46
- Vladimir Pestov: On the geometry of similarity search: Dimensionality curse and concentration of measure. 47-51
- Enno Ohlebusch: A uniform framework for term and graph rewriting applied to combined systems. 53-59
Volume 73, Numbers 3-4, 29 February 2000
- Jean Marcel Pallo: An efficient upper bound of the rotation distance of binary trees. 87-92
- Shahrokh Saeednia: On the security of a convertible group signature scheme. 93-96
- Min-Shiang Hwang: Cryptanalysis of YCN key assignment scheme in a hierarchy. 97-101
- Tzung-Shi Chen: Task migration in 2D wormhole-routed mesh multicomputers. 103-110
- Alberto Caprara, Hans Kellerer, Ulrich Pferschy: A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. 111-118
- Rolf Niedermeier, Peter Rossmanith: A general method to speed up fixed-parameter-tractable algorithms. 125-129
- Guillaume Fertin: Hierarchical broadcast and gossip networks. 131-136
Volume 73, Numbers 5-6, 31 March 2000
- Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg: Pancyclicity in switching classes. 153-156
- Fanica Gavril: Maximum weight independent sets and cliques in intersection graphs of filaments. 181-188
- Giovanni Dimauro, Sebastiano Impedovo, Giuseppe Pirlo, A. Salzo: RNS architectures for the implementation of the `diagonal function'. 189-198
- Amiya Nayak, J. Ren, Nicola Santoro: An improved testing scheme for catastrophic fault patterns. 199-206
- Achour Mostéfaoui, Michel Raynal, Frederic Tronel: From Binary Consensus to Multivalued Consensus in asynchronous message-passing systems. 207-212
- Daniel Stefankovic: Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms. 221-225
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team