Journal of Discrete Algorithms, Volume 1
Volume 1, Number 1, February 2003
- Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher: A derandomization using min-wise independent permutations. 11-20
- Graeme L. Cohen, Ronald M. Sorli: On the number of distinct prime factors of an odd perfect number. 21-35
- Maxime Crochemore, Christophe Hancart, Thierry Lecroq: A unifying look at the Apostolico-Giancarlo string-matching algorithm. 37-52
- William Duckworth, Nicholas C. Wormald, Michele Zito: A PTAS for the sparsest 2-spanner of 4-connected planar triangulations. 67-76
- Rolf Niedermeier, Peter Rossmanith: An efficient fixed-parameter algorithm for 3-Hitting Set. 89-102
Volume 1, Number 2, April 2003
- Paola Flocchini, Rastislav Kralovic, Peter Ruzicka, Alessandro Roncato, Nicola Santoro: On time versus size for monotone dynamic monopolies in regular topologies. 129-150
- Ben H. H. Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping: Optimal broadcast on parallel locality models. 151-166
- Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum: Exact communication costs for consensus and leader in a tree. 167-183
- Roberto Baldoni, Jean-Michel Hélary, Michel Raynal, Lénaick Tanguy: Consensus in Byzantine asynchronous systems. 185-210
- Chryssis Georgiou, Alexander A. Shvartsman: Cooperative computing with fragmentable and mergeable groups. 211-235
Volume 1, Numbers 3-4, June 2003
- Maxime Crochemore, Borivoj Melichar, Zdenek Tronícek: Directed acyclic subsequence graph - Overview. 255-280
- Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen: Approximate string matching on Ziv-Lempel compressed text. 313-338
- Vojtech Bálint: The non-approximability of bicriteria network design problems. 339-355
Volume 1, Numbers 5-6, October 2003
- Carola Wenk: Applying an edit distance to the matching of tree ring sequences in dendrochronology. 367-385
- Amihood Amir, Alberto Apostolico, Gad M. Landau, Giorgio Satta: Efficient text fingerprinting via Parikh mapping. 409-421
- Gonzalo Navarro: Regular expression searching on compressed text. 423-443
- Frantisek Franek, Weilin Lu, William F. Smyth: Two-pattern strings I - A recognition algorithm. 445-460
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