default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 1
Volume 1, Number 1, February 2003
- Sergei Bespamyatnikh, Andrei V. Kelarev:
Algorithms for shortest paths and d-cycle problems. 1-9 - 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 - Michael J. Dinneen, Bakhadyr Khoussainov:
Update games and update networks. 53-65 - William Duckworth, Nicholas C. Wormald, Michele Zito:
A PTAS for the sparsest 2-spanner of 4-connected planar triangulations. 67-76 - Jeffrey H. Kingston, Nicholas Paul Sheppard:
On reductions for the Steiner Problem in Graphs. 77-88 - Rolf Niedermeier, Peter Rossmanith:
An efficient fixed-parameter algorithm for 3-Hitting Set. 89-102 - Ramesh Hariharan, V. Vinay:
String matching in Õ(sqrt(n)+sqrt(m)) quantum time. 103-110 - Jeong Seop Sim, Kunsoo Park:
The consensus string problem for a metric is NP-complete. 111-117
Volume 1, Number 2, April 2003
- Paolo Boldi, Sebastiano Vigna:
Lower bounds for weak sense of direction. 119-128 - 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 - Cyril Gavoille, Akka Zemmari:
The compactness of adaptive routing tables. 237-254
Volume 1, Numbers 3-4, June 2003
- Maxime Crochemore, Borivoj Melichar, Zdenek Tronícek:
Directed acyclic subsequence graph - Overview. 255-280 - Serafino Cicerone, Gabriele Di Stefano:
(k, +)-distance-hereditary graphs. 281-302 - Fabrizio d'Amore, Fabio Iacobini:
On-line algorithms for networks of temporal constraints. 303-312 - 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 - David E. Daykin, Jacqueline W. Daykin:
Lyndon-like and V-order factorizations of strings. 357-365
Volume 1, Numbers 5-6, October 2003
- Carola Wenk:
Applying an edit distance to the matching of tree ring sequences in dendrochronology. 367-385 - Robert W. Irving, Lorna Love:
The suffix binary search tree and suffix AVL tree. 387-408 - 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 - Francis C. M. Lau, Shi-Heng Zhang:
Optimal gossiping in paths and cycles. 461-475
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-22 02:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
