Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/ipl/ipl83.bht:"
download as .bib file
@article{DBLP:journals/ipl/AmirLP02,
author = {Amihood Amir and
Moshe Lewenstein and
Ely Porat},
title = {Approximate swapped matching},
journal = {Inf. Process. Lett.},
volume = {83},
number = {1},
pages = {33--39},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00302-7},
doi = {10.1016/S0020-0190(01)00302-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AmirLP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ApostolicoL02,
author = {Alberto Apostolico and
Stefano Lonardi},
title = {A speed-up for the commute between subword trees and DAWGs},
journal = {Inf. Process. Lett.},
volume = {83},
number = {3},
pages = {159--161},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00327-1},
doi = {10.1016/S0020-0190(01)00327-1},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ApostolicoL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ArbellLM02,
author = {Ora Arbell and
Gad M. Landau and
Joseph S. B. Mitchell},
title = {Edit distance of run-length encoded strings},
journal = {Inf. Process. Lett.},
volume = {83},
number = {6},
pages = {307--314},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00215-6},
doi = {10.1016/S0020-0190(02)00215-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ArbellLM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ArbibC02,
author = {Claudio Arbib and
Alberto Caprara},
title = {On the stability number of the edge intersection of two graphs},
journal = {Inf. Process. Lett.},
volume = {83},
number = {3},
pages = {173--174},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00324-6},
doi = {10.1016/S0020-0190(01)00324-6},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ArbibC02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Aronov02,
author = {Boris Aronov},
title = {A lower bound on Voronoi diagram complexity},
journal = {Inf. Process. Lett.},
volume = {83},
number = {4},
pages = {183--185},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00336-2},
doi = {10.1016/S0020-0190(01)00336-2},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Aronov02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Attie02,
author = {Paul C. Attie},
title = {Wait-free Byzantine consensus},
journal = {Inf. Process. Lett.},
volume = {83},
number = {4},
pages = {221--227},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00334-9},
doi = {10.1016/S0020-0190(01)00334-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Attie02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BaevME02,
author = {Ivan D. Baev and
Waleed Meleis and
Alexandre E. Eichenberger},
title = {Lower bounds on precedence-constrained scheduling for parallel processors},
journal = {Inf. Process. Lett.},
volume = {83},
number = {1},
pages = {27--32},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00303-9},
doi = {10.1016/S0020-0190(01)00303-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BaevME02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Baeza-YatesS02,
author = {Ricardo A. Baeza{-}Yates and
Hector Soza{-}Pollman},
title = {Optimal bounded disorder},
journal = {Inf. Process. Lett.},
volume = {83},
number = {3},
pages = {151--157},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00326-X},
doi = {10.1016/S0020-0190(01)00326-X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Baeza-YatesS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BarbutiBF02,
author = {Roberto Barbuti and
Cinzia Bernardeschi and
Nicoletta De Francesco},
title = {Abstract interpretation of operational semantics for secure information
flow},
journal = {Inf. Process. Lett.},
volume = {83},
number = {2},
pages = {101--108},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00219-3},
doi = {10.1016/S0020-0190(02)00219-3},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BarbutiBF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CaragiannisKK02,
author = {Ioannis Caragiannis and
Christos Kaklamanis and
Panagiotis Kanellopoulos},
title = {New bounds on the size of the minimum feedback vertex set in meshes
and butterflies},
journal = {Inf. Process. Lett.},
volume = {83},
number = {5},
pages = {275--280},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00266-1},
doi = {10.1016/S0020-0190(02)00266-1},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CaragiannisKK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Carpentieri02,
author = {Bruno Carpentieri},
title = {Sending compressed messages to a learned receiver on a bidirectional
line},
journal = {Inf. Process. Lett.},
volume = {83},
number = {2},
pages = {63--70},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00316-7},
doi = {10.1016/S0020-0190(01)00316-7},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Carpentieri02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chang02,
author = {Byeong{-}Mo Chang},
title = {Managing the granularity of constraint-based analyses by rule transformation},
journal = {Inf. Process. Lett.},
volume = {83},
number = {2},
pages = {79--88},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00314-3},
doi = {10.1016/S0020-0190(01)00314-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chang02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chang02a,
author = {Gerard J. Chang},
title = {Corrigendum to "The path-partition problem in block graphs"},
journal = {Inf. Process. Lett.},
volume = {83},
number = {5},
pages = {293},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00320-4},
doi = {10.1016/S0020-0190(02)00320-4},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chang02a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChengC02,
author = {Sheng{-}Tzong Cheng and
Ing{-}Ray Chen},
title = {A self-adjusting quality of service control scheme},
journal = {Inf. Process. Lett.},
volume = {83},
number = {6},
pages = {337--344},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00212-0},
doi = {10.1016/S0020-0190(02)00212-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChengC02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChewDKK02,
author = {L. Paul Chew and
Haggai David and
Matthew J. Katz and
Klara Kedem},
title = {Walking around fat obstacles},
journal = {Inf. Process. Lett.},
volume = {83},
number = {3},
pages = {135--140},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00321-0},
doi = {10.1016/S0020-0190(01)00321-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChewDKK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChinW02,
author = {Francis Y. L. Chin and
Fu Lee Wang},
title = {Efficient algorithm for transversal of disjoint convex polygons},
journal = {Inf. Process. Lett.},
volume = {83},
number = {3},
pages = {141--144},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00322-2},
doi = {10.1016/S0020-0190(01)00322-2},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChinW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cho02,
author = {Haengrae Cho},
title = {Database recovery using incomplete page versions in a multisystem
data sharing environment},
journal = {Inf. Process. Lett.},
volume = {83},
number = {1},
pages = {49--55},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00304-0},
doi = {10.1016/S0020-0190(01)00304-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Cho02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ErgunSZ02,
author = {Funda Erg{\"{u}}n and
Rakesh K. Sinha and
Lisa Zhang},
title = {An improved {FPTAS} for Restricted Shortest Path},
journal = {Inf. Process. Lett.},
volume = {83},
number = {5},
pages = {287--291},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00205-3},
doi = {10.1016/S0020-0190(02)00205-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ErgunSZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FecherMW02,
author = {Harald Fecher and
Mila E. Majster{-}Cederbaum and
Jinzhao Wu},
title = {Bundle event structures: {A} revised cpo approach},
journal = {Inf. Process. Lett.},
volume = {83},
number = {1},
pages = {7--12},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00310-6},
doi = {10.1016/S0020-0190(01)00310-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FecherMW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FominL02,
author = {Fedor V. Fomin and
Andrzej Lingas},
title = {Approximation algorithms for time-dependent orienteering},
journal = {Inf. Process. Lett.},
volume = {83},
number = {2},
pages = {57--62},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00313-1},
doi = {10.1016/S0020-0190(01)00313-1},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FominL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fouquet02,
author = {Jean{-}Luc Fouquet},
title = {No odd pairs in minimal imperfect NP\({}_{\mbox{5}}\) graphs},
journal = {Inf. Process. Lett.},
volume = {83},
number = {4},
pages = {201--204},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00329-5},
doi = {10.1016/S0020-0190(01)00329-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fouquet02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GalbraithMS02,
author = {Steven D. Galbraith and
John Malone{-}Lee and
Nigel P. Smart},
title = {Public key signatures in the multi-user setting},
journal = {Inf. Process. Lett.},
volume = {83},
number = {5},
pages = {263--266},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00338-6},
doi = {10.1016/S0020-0190(01)00338-6},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GalbraithMS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GasieniecL02,
author = {Leszek Gasieniec and
Andrzej Lingas},
title = {On adaptive deterministic gossiping in ad hoc radio networks},
journal = {Inf. Process. Lett.},
volume = {83},
number = {2},
pages = {89--93},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00312-X},
doi = {10.1016/S0020-0190(01)00312-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GasieniecL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GroplHNP02,
author = {Clemens Gr{\"{o}}pl and
Stefan Hougardy and
Till Nierhoff and
Hans J{\"{u}}rgen Pr{\"{o}}mel},
title = {Steiner trees in uniformly quasi-bipartite graphs},
journal = {Inf. Process. Lett.},
volume = {83},
number = {4},
pages = {195--200},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00335-0},
doi = {10.1016/S0020-0190(01)00335-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GroplHNP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HajiaghayiG02,
author = {Mohammad Taghi Hajiaghayi and
Yashar Ganjali},
title = {A note on the Consecutive Ones Submatrix problem},
journal = {Inf. Process. Lett.},
volume = {83},
number = {3},
pages = {163--166},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00325-8},
doi = {10.1016/S0020-0190(01)00325-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HajiaghayiG02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/He02,
author = {Wei{-}Hua He},
title = {Weaknesses in some multisignature schemes for specified group of verifiers},
journal = {Inf. Process. Lett.},
volume = {83},
number = {2},
pages = {95--99},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00317-9},
doi = {10.1016/S0020-0190(01)00317-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/He02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HoffmanJR02,
author = {Alan J. Hoffman and
Kate Jenkins and
Tim Roughgarden},
title = {On a game in directed graphs},
journal = {Inf. Process. Lett.},
volume = {83},
number = {1},
pages = {13--16},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00309-X},
doi = {10.1016/S0020-0190(01)00309-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HoffmanJR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HoltC02,
author = {John D. Holt and
Soon Myoung Chung},
title = {Mining association rules using inverted hashing and pruning},
journal = {Inf. Process. Lett.},
volume = {83},
number = {4},
pages = {211--220},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00330-1},
doi = {10.1016/S0020-0190(01)00330-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HoltC02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KovalyovPS02,
author = {Mikhail Y. Kovalyov and
Marcus Pattloch and
G{\"{u}}nter Schmidt},
title = {A polynomial algorithm for lot-size scheduling of two type tasks},
journal = {Inf. Process. Lett.},
volume = {83},
number = {4},
pages = {229--235},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00331-3},
doi = {10.1016/S0020-0190(01)00331-3},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KovalyovPS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LaberH02,
author = {Eduardo Sany Laber and
Leonardo Gomes Holanda},
title = {Improved bounds for asymmetric communication protocols},
journal = {Inf. Process. Lett.},
volume = {83},
number = {4},
pages = {205--209},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00332-5},
doi = {10.1016/S0020-0190(01)00332-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LaberH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LatapyM02,
author = {Matthieu Latapy and
Cl{\'{e}}mence Magnien},
title = {Coding distributive lattices with Edge Firing Games},
journal = {Inf. Process. Lett.},
volume = {83},
number = {3},
pages = {125--128},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00319-2},
doi = {10.1016/S0020-0190(01)00319-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LatapyM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeHK02,
author = {Dong{-}Ho Lee and
Shin Heu and
Hyoung{-}Joo Kim},
title = {An efficient algorithm for hyperspherical range query processing in
high-dimensional data space},
journal = {Inf. Process. Lett.},
volume = {83},
number = {2},
pages = {115--123},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00318-0},
doi = {10.1016/S0020-0190(01)00318-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeeHK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LefebvreL02,
author = {Arnaud Lefebvre and
Thierry Lecroq},
title = {Compror: On-line lossless data compression with a factor oracle},
journal = {Inf. Process. Lett.},
volume = {83},
number = {1},
pages = {1--6},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00308-8},
doi = {10.1016/S0020-0190(01)00308-8},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LefebvreL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lins02,
author = {Rafael Dueire Lins},
title = {An efficient algorithm for cyclic reference counting},
journal = {Inf. Process. Lett.},
volume = {83},
number = {3},
pages = {145--150},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00328-3},
doi = {10.1016/S0020-0190(01)00328-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lins02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Low02,
author = {Chor Ping Low},
title = {An efficient retrieval selection algorithm for video servers with
random duplicated assignment storage technique},
journal = {Inf. Process. Lett.},
volume = {83},
number = {6},
pages = {315--321},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00210-7},
doi = {10.1016/S0020-0190(02)00210-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Low02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Maitra02,
author = {Subhamoy Maitra},
title = {Highly nonlinear balanced Boolean functions with good local and global
avalanche characteristics},
journal = {Inf. Process. Lett.},
volume = {83},
number = {5},
pages = {281--286},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00207-7},
doi = {10.1016/S0020-0190(02)00207-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Maitra02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MalpaniC02,
author = {Navneet Malpani and
Jianer Chen},
title = {A note on practical construction of maximum bandwidth paths},
journal = {Inf. Process. Lett.},
volume = {83},
number = {3},
pages = {175--180},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00323-4},
doi = {10.1016/S0020-0190(01)00323-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MalpaniC02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MukherjeeC02,
author = {Maharaj Mukherjee and
Kanad Chakraborty},
title = {A polynomial-time optimization algorithm for a rectilinear partitioning
problem with applications in {VLSI} design automation},
journal = {Inf. Process. Lett.},
volume = {83},
number = {1},
pages = {41--48},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00305-2},
doi = {10.1016/S0020-0190(01)00305-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MukherjeeC02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NielsenWZ02,
author = {Benny K. Nielsen and
Pawel Winter and
Martin Zachariasen},
title = {On the location of Steiner points in uniformly-oriented Steiner trees},
journal = {Inf. Process. Lett.},
volume = {83},
number = {5},
pages = {237--241},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00208-9},
doi = {10.1016/S0020-0190(02)00208-9},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/NielsenWZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Piotrow02,
author = {Marek Piotr{\'{o}}w},
title = {A note on constructing binary heaps with periodic networks},
journal = {Inf. Process. Lett.},
volume = {83},
number = {3},
pages = {129--134},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00320-9},
doi = {10.1016/S0020-0190(01)00320-9},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Piotrow02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Quaglia02,
author = {Francesco Quaglia},
title = {A restriction of the elastic time algorithm},
journal = {Inf. Process. Lett.},
volume = {83},
number = {5},
pages = {243--249},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00209-0},
doi = {10.1016/S0020-0190(02)00209-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Quaglia02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Saeednia02,
author = {Shahrokh Saeednia},
title = {An identity-based society oriented signature scheme with anonymous
signers},
journal = {Inf. Process. Lett.},
volume = {83},
number = {6},
pages = {295--299},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00216-8},
doi = {10.1016/S0020-0190(02)00216-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Saeednia02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Saez02,
author = {Carles Padr{\'{o}} and
Germ{\'{a}}n S{\'{a}}ez},
title = {Lower bounds on the information rate of secret sharing schemes with
homogeneous access structure},
journal = {Inf. Process. Lett.},
volume = {83},
number = {6},
pages = {345--351},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00213-2},
doi = {10.1016/S0020-0190(02)00213-2},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Saez02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sasaki02,
author = {Atsushi Sasaki},
title = {A time-optimal distributed sorting algorithm on a line network},
journal = {Inf. Process. Lett.},
volume = {83},
number = {1},
pages = {21--26},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00307-6},
doi = {10.1016/S0020-0190(01)00307-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sasaki02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Schnoebelen02,
author = {Philippe Schnoebelen},
title = {Verifying lossy channel systems has nonprimitive recursive complexity},
journal = {Inf. Process. Lett.},
volume = {83},
number = {5},
pages = {251--261},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00337-4},
doi = {10.1016/S0020-0190(01)00337-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Schnoebelen02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SchobbensSSS02,
author = {Pierre{-}Yves Schobbens and
Gunter Saake and
Am{\'{\i}}lcar Sernadas and
Cristina Sernadas},
title = {A two-level temporal logic for evolving specifications},
journal = {Inf. Process. Lett.},
volume = {83},
number = {3},
pages = {167--172},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00289-2},
doi = {10.1016/S0020-0190(02)00289-2},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SchobbensSSS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SchwarzerS02,
author = {Fabian Schwarzer and
Achim Schweikard},
title = {On the complexity of one-shot translational separability},
journal = {Inf. Process. Lett.},
volume = {83},
number = {4},
pages = {187--194},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00333-7},
doi = {10.1016/S0020-0190(01)00333-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SchwarzerS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Schwiebert02,
author = {Loren Schwiebert},
title = {There is no optimal routing policy for the torus},
journal = {Inf. Process. Lett.},
volume = {83},
number = {6},
pages = {331--336},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00217-X},
doi = {10.1016/S0020-0190(02)00217-X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Schwiebert02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shparlinski02,
author = {Igor E. Shparlinski},
title = {Security of most significant bits of g\({}^{\mbox{x\({}^{\mbox{2}}\)}}\)},
journal = {Inf. Process. Lett.},
volume = {83},
number = {2},
pages = {109--113},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00315-5},
doi = {10.1016/S0020-0190(01)00315-5},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Shparlinski02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ta-Shma02,
author = {Amnon Ta{-}Shma},
title = {Storing information with extractors},
journal = {Inf. Process. Lett.},
volume = {83},
number = {5},
pages = {267--274},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00206-5},
doi = {10.1016/S0020-0190(02)00206-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ta-Shma02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TanH02,
author = {Zhiyi Tan and
Yong He},
title = {Optimal online algorithm for scheduling on two identical machines
with machine availability constraints},
journal = {Inf. Process. Lett.},
volume = {83},
number = {6},
pages = {323--329},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00211-9},
doi = {10.1016/S0020-0190(02)00211-9},
timestamp = {Thu, 28 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TanH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TsaiTLH02,
author = {Chang{-}Hsiung Tsai and
Jimmy J. M. Tan and
Tyne Liang and
Lih{-}Hsing Hsu},
title = {Fault-tolerant hamiltonian laceability of hypercubes},
journal = {Inf. Process. Lett.},
volume = {83},
number = {6},
pages = {301--306},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00214-4},
doi = {10.1016/S0020-0190(02)00214-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TsaiTLH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TsuchiyaK02,
author = {Tatsuhiro Tsuchiya and
Tohru Kikuno},
title = {Byzantine quorum systems with maximum availability},
journal = {Inf. Process. Lett.},
volume = {83},
number = {2},
pages = {71--77},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00311-8},
doi = {10.1016/S0020-0190(01)00311-8},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/TsuchiyaK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wegener02,
author = {Ingo Wegener},
title = {A simplified correctness proof for a well-known algorithm computing
strongly connected components},
journal = {Inf. Process. Lett.},
volume = {83},
number = {1},
pages = {17--19},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00306-4},
doi = {10.1016/S0020-0190(01)00306-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wegener02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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-05-31 23:20 CEST 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:
