default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jda/jda1.bht:"
download as .bib file
@article{DBLP:journals/jda/AmirALS03,
author = {Amihood Amir and
Alberto Apostolico and
Gad M. Landau and
Giorgio Satta},
title = {Efficient text fingerprinting via Parikh mapping},
journal = {J. Discrete Algorithms},
volume = {1},
number = {5-6},
pages = {409--421},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00035-2},
doi = {10.1016/S1570-8667(03)00035-2},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AmirALS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BaldoniHRT03,
author = {Roberto Baldoni and
Jean{-}Michel H{\'{e}}lary and
Michel Raynal and
L{\'{e}}naick Tanguy},
title = {Consensus in Byzantine asynchronous systems},
journal = {J. Discrete Algorithms},
volume = {1},
number = {2},
pages = {185--210},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00025-X},
doi = {10.1016/S1570-8667(03)00025-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BaldoniHRT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Balint03,
author = {Vojtech B{\'{a}}lint},
title = {The non-approximability of bicriteria network design problems},
journal = {J. Discrete Algorithms},
volume = {1},
number = {3-4},
pages = {339--355},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00033-9},
doi = {10.1016/S1570-8667(03)00033-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Balint03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BespamyatnikhK03,
author = {Sergei Bespamyatnikh and
Andrei V. Kelarev},
title = {Algorithms for shortest paths and d-cycle problems},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {1--9},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00002-9},
doi = {10.1016/S1570-8667(03)00002-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BespamyatnikhK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BoldiV03,
author = {Paolo Boldi and
Sebastiano Vigna},
title = {Lower bounds for weak sense of direction},
journal = {J. Discrete Algorithms},
volume = {1},
number = {2},
pages = {119--128},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00021-2},
doi = {10.1016/S1570-8667(03)00021-2},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BoldiV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BroderCM03,
author = {Andrei Z. Broder and
Moses Charikar and
Michael Mitzenmacher},
title = {A derandomization using min-wise independent permutations},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {11--20},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00003-0},
doi = {10.1016/S1570-8667(03)00003-0},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BroderCM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CiceroneS03,
author = {Serafino Cicerone and
Gabriele Di Stefano},
title = {(k, +)-distance-hereditary graphs},
journal = {J. Discrete Algorithms},
volume = {1},
number = {3-4},
pages = {281--302},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00030-3},
doi = {10.1016/S1570-8667(03)00030-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CiceroneS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CohenS03,
author = {Graeme L. Cohen and
Ronald M. Sorli},
title = {On the number of distinct prime factors of an odd perfect number},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {21--35},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00004-2},
doi = {10.1016/S1570-8667(03)00004-2},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/CohenS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrochemoreHL03,
author = {Maxime Crochemore and
Christophe Hancart and
Thierry Lecroq},
title = {A unifying look at the Apostolico-Giancarlo string-matching algorithm},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {37--52},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00005-4},
doi = {10.1016/S1570-8667(03)00005-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CrochemoreHL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrochemoreMT03,
author = {Maxime Crochemore and
Borivoj Melichar and
Zdenek Tron{\'{\i}}cek},
title = {Directed acyclic subsequence graph - Overview},
journal = {J. Discrete Algorithms},
volume = {1},
number = {3-4},
pages = {255--280},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00029-7},
doi = {10.1016/S1570-8667(03)00029-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CrochemoreMT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DaykinD03,
author = {David E. Daykin and
Jacqueline W. Daykin},
title = {Lyndon-like and V-order factorizations of strings},
journal = {J. Discrete Algorithms},
volume = {1},
number = {3-4},
pages = {357--365},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00039-X},
doi = {10.1016/S1570-8667(03)00039-X},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/DaykinD03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DinitzMR03,
author = {Yefim Dinitz and
Shlomo Moran and
Sergio Rajsbaum},
title = {Exact communication costs for consensus and leader in a tree},
journal = {J. Discrete Algorithms},
volume = {1},
number = {2},
pages = {167--183},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00024-8},
doi = {10.1016/S1570-8667(03)00024-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DinitzMR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DinneenK03,
author = {Michael J. Dinneen and
Bakhadyr Khoussainov},
title = {Update games and update networks},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {53--65},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00006-6},
doi = {10.1016/S1570-8667(03)00006-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DinneenK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DuckworthWZ03,
author = {William Duckworth and
Nicholas C. Wormald and
Michele Zito},
title = {A {PTAS} for the sparsest 2-spanner of 4-connected planar triangulations},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {67--76},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00007-8},
doi = {10.1016/S1570-8667(03)00007-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DuckworthWZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FlocchiniKRRS03,
author = {Paola Flocchini and
Rastislav Kralovic and
Peter Ruzicka and
Alessandro Roncato and
Nicola Santoro},
title = {On time versus size for monotone dynamic monopolies in regular topologies},
journal = {J. Discrete Algorithms},
volume = {1},
number = {2},
pages = {129--150},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00022-4},
doi = {10.1016/S1570-8667(03)00022-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FlocchiniKRRS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FranekLS03,
author = {Frantisek Franek and
Weilin Lu and
William F. Smyth},
title = {Two-pattern strings {I} - {A} recognition algorithm},
journal = {J. Discrete Algorithms},
volume = {1},
number = {5-6},
pages = {445--460},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00037-6},
doi = {10.1016/S1570-8667(03)00037-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FranekLS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GavoilleZ03,
author = {Cyril Gavoille and
Akka Zemmari},
title = {The compactness of adaptive routing tables},
journal = {J. Discrete Algorithms},
volume = {1},
number = {2},
pages = {237--254},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00027-3},
doi = {10.1016/S1570-8667(03)00027-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GavoilleZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GeorgiouS03,
author = {Chryssis Georgiou and
Alexander A. Shvartsman},
title = {Cooperative computing with fragmentable and mergeable groups},
journal = {J. Discrete Algorithms},
volume = {1},
number = {2},
pages = {211--235},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00026-1},
doi = {10.1016/S1570-8667(03)00026-1},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/GeorgiouS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HariharanV03,
author = {Ramesh Hariharan and
V. Vinay},
title = {String matching in {\~{O}}(sqrt(n)+sqrt(m)) quantum time},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {103--110},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00010-8},
doi = {10.1016/S1570-8667(03)00010-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HariharanV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/IrvingL03,
author = {Robert W. Irving and
Lorna Love},
title = {The suffix binary search tree and suffix {AVL} tree},
journal = {J. Discrete Algorithms},
volume = {1},
number = {5-6},
pages = {387--408},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00034-0},
doi = {10.1016/S1570-8667(03)00034-0},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/IrvingL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JuurlinkKHR03,
author = {Ben H. H. Juurlink and
Petr Kolman and
Friedhelm Meyer auf der Heide and
Ingo Rieping},
title = {Optimal broadcast on parallel locality models},
journal = {J. Discrete Algorithms},
volume = {1},
number = {2},
pages = {151--166},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00023-6},
doi = {10.1016/S1570-8667(03)00023-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/JuurlinkKHR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KarkkainenNU03,
author = {Juha K{\"{a}}rkk{\"{a}}inen and
Gonzalo Navarro and
Esko Ukkonen},
title = {Approximate string matching on Ziv-Lempel compressed text},
journal = {J. Discrete Algorithms},
volume = {1},
number = {3-4},
pages = {313--338},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00032-7},
doi = {10.1016/S1570-8667(03)00032-7},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KarkkainenNU03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KingstonS03,
author = {Jeffrey H. Kingston and
Nicholas Paul Sheppard},
title = {On reductions for the Steiner Problem in Graphs},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {77--88},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00008-X},
doi = {10.1016/S1570-8667(03)00008-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KingstonS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LauZ03,
author = {Francis C. M. Lau and
Shi{-}Heng Zhang},
title = {Optimal gossiping in paths and cycles},
journal = {J. Discrete Algorithms},
volume = {1},
number = {5-6},
pages = {461--475},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00038-8},
doi = {10.1016/S1570-8667(03)00038-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LauZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Navarro03,
author = {Gonzalo Navarro},
title = {Regular expression searching on compressed text},
journal = {J. Discrete Algorithms},
volume = {1},
number = {5-6},
pages = {423--443},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00036-4},
doi = {10.1016/S1570-8667(03)00036-4},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Navarro03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/NiedermeierR03,
author = {Rolf Niedermeier and
Peter Rossmanith},
title = {An efficient fixed-parameter algorithm for 3-Hitting Set},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {89--102},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00009-1},
doi = {10.1016/S1570-8667(03)00009-1},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/NiedermeierR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SimP03,
author = {Jeong Seop Sim and
Kunsoo Park},
title = {The consensus string problem for a metric is NP-complete},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {111--117},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00011-X},
doi = {10.1016/S1570-8667(03)00011-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SimP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Wenk03,
author = {Carola Wenk},
title = {Applying an edit distance to the matching of tree ring sequences in
dendrochronology},
journal = {J. Discrete Algorithms},
volume = {1},
number = {5-6},
pages = {367--385},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00028-5},
doi = {10.1016/S1570-8667(03)00028-5},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Wenk03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/dAmoreI03,
author = {Fabrizio d'Amore and
Fabio Iacobini},
title = {On-line algorithms for networks of temporal constraints},
journal = {J. Discrete Algorithms},
volume = {1},
number = {3-4},
pages = {303--312},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00031-5},
doi = {10.1016/S1570-8667(03)00031-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/dAmoreI03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
retrieved on 2024-11-17 00:47 CET from data curated 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:
