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/ipl81.bht:"
download as .bib file
@article{DBLP:journals/ipl/AlbersK02,
author = {Susanne Albers and
Marek Karpinski},
title = {Randomized splay trees: Theoretical and experimental results},
journal = {Inf. Process. Lett.},
volume = {81},
number = {4},
pages = {213--221},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00230-7},
doi = {10.1016/S0020-0190(01)00230-7},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AlbersK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ArakiS02,
author = {Toru Araki and
Yukio Shibata},
title = {Pancyclicity of recursive circulant graphs},
journal = {Inf. Process. Lett.},
volume = {81},
number = {4},
pages = {187--190},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00226-5},
doi = {10.1016/S0020-0190(01)00226-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ArakiS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BachmanJK02,
author = {Aleksander Bachman and
Adam Janiak and
Mikhail Y. Kovalyov},
title = {Minimizing the total weighted completion time of deteriorating jobs},
journal = {Inf. Process. Lett.},
volume = {81},
number = {2},
pages = {81--84},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00196-X},
doi = {10.1016/S0020-0190(01)00196-X},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BachmanJK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BergS02,
author = {Mark de Berg and
A. Frank van der Stappen},
title = {On the fatness of Minkowski sums},
journal = {Inf. Process. Lett.},
volume = {81},
number = {5},
pages = {259--264},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00233-2},
doi = {10.1016/S0020-0190(01)00233-2},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BergS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrankeLME02,
author = {J{\"{u}}rgen Branke and
Stefan Leppert and
Martin Middendorf and
Peter Eades},
title = {Width-restricted layering of acyclic digraphs with consideration of
dummy nodes},
journal = {Inf. Process. Lett.},
volume = {81},
number = {2},
pages = {59--63},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00200-9},
doi = {10.1016/S0020-0190(01)00200-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrankeLME02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrettoUZ02,
author = {Alain Bretto and
St{\'{e}}phane Ub{\'{e}}da and
Janez Zerovnik},
title = {A polynomial algorithm for the strong Helly property},
journal = {Inf. Process. Lett.},
volume = {81},
number = {1},
pages = {55--57},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00186-7},
doi = {10.1016/S0020-0190(01)00186-7},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BrettoUZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BukiS02,
author = {Judit B{\"{u}}ki and
Csaba Szab{\'{o}}},
title = {Complexity of homomorphisms to direct products of graphs},
journal = {Inf. Process. Lett.},
volume = {81},
number = {4},
pages = {175--178},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00225-3},
doi = {10.1016/S0020-0190(01)00225-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BukiS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BultermanSZVGF02,
author = {R. W. Bulterman and
F. W. van der Sommen and
Gerard Zwaan and
Tom Verhoeff and
A. J. M. van Gasteren and
W. H. J. Feijen},
title = {On computing a longest path in a tree},
journal = {Inf. Process. Lett.},
volume = {81},
number = {2},
pages = {93--96},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00198-3},
doi = {10.1016/S0020-0190(01)00198-3},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BultermanSZVGF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CarpiL02,
author = {Arturo Carpi and
Aldo de Luca},
title = {A combinatorial property of the factor poset of a word},
journal = {Inf. Process. Lett.},
volume = {81},
number = {1},
pages = {35--39},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00192-2},
doi = {10.1016/S0020-0190(01)00192-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CarpiL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cesati02,
author = {Marco Cesati},
title = {Perfect Code is W[1]-complete},
journal = {Inf. Process. Lett.},
volume = {81},
number = {3},
pages = {163--168},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00207-1},
doi = {10.1016/S0020-0190(01)00207-1},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Cesati02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChengF02,
author = {Qi Cheng and
Fang Fang},
title = {Kolmogorov random graphs only have trivial stable colorings},
journal = {Inf. Process. Lett.},
volume = {81},
number = {3},
pages = {133--136},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00206-X},
doi = {10.1016/S0020-0190(01)00206-X},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChengF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChowdhuryKK02,
author = {Rezaul Alam Chowdhury and
M. Kaykobad and
Irwin King},
title = {An efficient decoding technique for Huffman codes},
journal = {Inf. Process. Lett.},
volume = {81},
number = {6},
pages = {305--308},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00243-5},
doi = {10.1016/S0020-0190(01)00243-5},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChowdhuryKK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChungCKL02,
author = {Ilyong Chung and
Wankyu Choi and
Youngchel Kim and
Mike Lee},
title = {The design of conference key distribution system employing a symmetric
balanced incomplete block design},
journal = {Inf. Process. Lett.},
volume = {81},
number = {6},
pages = {313--318},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00240-X},
doi = {10.1016/S0020-0190(01)00240-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChungCKL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChungK02,
author = {Tae{-}Sun Chung and
Hyoung{-}Joo Kim},
title = {Extracting indexing information from {XML} DTDs},
journal = {Inf. Process. Lett.},
volume = {81},
number = {2},
pages = {97--103},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00193-4},
doi = {10.1016/S0020-0190(01)00193-4},
timestamp = {Mon, 01 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChungK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChungY02,
author = {Kuo{-}Liang Chung and
Wen{-}Ming Yan},
title = {Fast 2D discrete cosine transform on compressed image in restricted
quadtree and shading format},
journal = {Inf. Process. Lett.},
volume = {81},
number = {1},
pages = {13--21},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00188-0},
doi = {10.1016/S0020-0190(01)00188-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChungY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gavril02,
author = {Fanica Gavril},
title = {Algorithms for maximum weight induced paths},
journal = {Inf. Process. Lett.},
volume = {81},
number = {4},
pages = {203--208},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00222-8},
doi = {10.1016/S0020-0190(01)00222-8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Gavril02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GoswamiM02,
author = {Diganta Goswami and
Rajib Mall},
title = {An efficient method for computing dynamic program slices},
journal = {Inf. Process. Lett.},
volume = {81},
number = {2},
pages = {111--117},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00202-2},
doi = {10.1016/S0020-0190(01)00202-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GoswamiM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GudmundssonHL02,
author = {Joachim Gudmundsson and
Thore Husfeldt and
Christos Levcopoulos},
title = {Lower bounds for approximate polygon decomposition and minimum gap},
journal = {Inf. Process. Lett.},
volume = {81},
number = {3},
pages = {137--141},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00203-4},
doi = {10.1016/S0020-0190(01)00203-4},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GudmundssonHL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HartM02,
author = {Andrew G. Hart and
Servet Mart{\'{\i}}nez},
title = {Sequential iteration of the Erlang fixed-point equations},
journal = {Inf. Process. Lett.},
volume = {81},
number = {6},
pages = {319--325},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00238-1},
doi = {10.1016/S0020-0190(01)00238-1},
timestamp = {Mon, 26 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HartM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HassinR02,
author = {Refael Hassin and
Shlomi Rubinstein},
title = {A 7/8-approximation algorithm for metric Max {TSP}},
journal = {Inf. Process. Lett.},
volume = {81},
number = {5},
pages = {247--251},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00234-4},
doi = {10.1016/S0020-0190(01)00234-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HassinR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HsuWW02,
author = {Chien{-}Lung Hsu and
Tzong{-}Sun Wu and
Tzong{-}Chen Wu},
title = {Improvements of generalization of threshold signature and authenticated
encryption for group communications},
journal = {Inf. Process. Lett.},
volume = {81},
number = {1},
pages = {41--45},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00189-2},
doi = {10.1016/S0020-0190(01)00189-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HsuWW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JonssonJ02,
author = {Fredrik J{\"{o}}nsson and
Thomas Johansson},
title = {A fast correlation attack on {LILI-128}},
journal = {Inf. Process. Lett.},
volume = {81},
number = {3},
pages = {127--132},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00208-3},
doi = {10.1016/S0020-0190(01)00208-3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JonssonJ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Keller02,
author = {J{\"{o}}rg Keller},
title = {A heuristic to accelerate in-situ permutation algorithms},
journal = {Inf. Process. Lett.},
volume = {81},
number = {3},
pages = {119--125},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00219-8},
doi = {10.1016/S0020-0190(01)00219-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Keller02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KitsiosMSTTV02,
author = {Nectarios Kitsios and
Christos Makris and
Spyros Sioutas and
Athanasios K. Tsakalidis and
John Tsaknakis and
Bill Vassiliadis},
title = {An optimal algorithm for reporting visible rectangles},
journal = {Inf. Process. Lett.},
volume = {81},
number = {5},
pages = {283--288},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00228-9},
doi = {10.1016/S0020-0190(01)00228-9},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KitsiosMSTTV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KobayashiS02,
author = {Zenji Kobayashi and
Takeshi Sekiguchi},
title = {On a characterization of the standard Gray code by using its edge
type on a hypercube},
journal = {Inf. Process. Lett.},
volume = {81},
number = {5},
pages = {231--237},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00237-X},
doi = {10.1016/S0020-0190(01)00237-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KobayashiS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KobayashiTK02,
author = {Noritaka Kobayashi and
Tatsuhiro Tsuchiya and
Tohru Kikuno},
title = {A new method for constructing pair-wise covering designs for software
testing},
journal = {Inf. Process. Lett.},
volume = {81},
number = {2},
pages = {85--91},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00195-8},
doi = {10.1016/S0020-0190(01)00195-8},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KobayashiTK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Koiran02,
author = {Pascal Koiran},
title = {Transfer theorems via sign conditions},
journal = {Inf. Process. Lett.},
volume = {81},
number = {2},
pages = {65--69},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00197-1},
doi = {10.1016/S0020-0190(01)00197-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Koiran02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KoubkovaK02,
author = {Alena Koubkov{\'{a}} and
V{\'{a}}clav Koubek},
title = {Algorithms for transitive closure},
journal = {Inf. Process. Lett.},
volume = {81},
number = {6},
pages = {289--296},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00245-9},
doi = {10.1016/S0020-0190(01)00245-9},
timestamp = {Tue, 28 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KoubkovaK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Krivelevich02,
author = {Michael Krivelevich},
title = {Deciding k-colorability in expected polynomial time},
journal = {Inf. Process. Lett.},
volume = {81},
number = {1},
pages = {1--6},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00187-9},
doi = {10.1016/S0020-0190(01)00187-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Krivelevich02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KwonC02,
author = {Oh{-}Heum Kwon and
Kyung{-}Yong Chwa},
title = {Approximation algorithms for general parallel task scheduling},
journal = {Inf. Process. Lett.},
volume = {81},
number = {3},
pages = {143--150},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00210-1},
doi = {10.1016/S0020-0190(01)00210-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KwonC02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LaiE02,
author = {Wei Lai and
Peter Eades},
title = {Removing edge-node intersections in drawings of graphs},
journal = {Inf. Process. Lett.},
volume = {81},
number = {2},
pages = {105--110},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00194-6},
doi = {10.1016/S0020-0190(01)00194-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LaiE02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeL02,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
title = {The NP-completeness of (1, r)-subcolorability of cubic graphs},
journal = {Inf. Process. Lett.},
volume = {81},
number = {3},
pages = {157--162},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00205-8},
doi = {10.1016/S0020-0190(01)00205-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeK02,
author = {Dong{-}Ho Lee and
Hyoung{-}Joo Kim},
title = {An efficient nearest neighbor search in high-dimensional data spaces},
journal = {Inf. Process. Lett.},
volume = {81},
number = {5},
pages = {239--246},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00236-8},
doi = {10.1016/S0020-0190(01)00236-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeeK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeePC02,
author = {Jae{-}Ha Lee and
Sang{-}Min Park and
Kyung{-}Yong Chwa},
title = {Simple algorithms for searching a polygon with flashlights},
journal = {Inf. Process. Lett.},
volume = {81},
number = {5},
pages = {265--270},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00235-6},
doi = {10.1016/S0020-0190(01)00235-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeePC02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeYP02,
author = {Oukseh Lee and
Kwangkeun Yi and
Yunheung Paek},
title = {A proof method for the correctness of modularized 0CFA},
journal = {Inf. Process. Lett.},
volume = {81},
number = {4},
pages = {179--185},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00223-X},
doi = {10.1016/S0020-0190(01)00223-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeeYP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lozin02,
author = {Vadim V. Lozin},
title = {On maximum induced matchings in bipartite graphs},
journal = {Inf. Process. Lett.},
volume = {81},
number = {1},
pages = {7--11},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00185-5},
doi = {10.1016/S0020-0190(01)00185-5},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Lozin02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lyon02,
author = {Gordon Lyon},
title = {Comparison of two code scalability tests},
journal = {Inf. Process. Lett.},
volume = {81},
number = {3},
pages = {169--174},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00204-6},
doi = {10.1016/S0020-0190(01)00204-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lyon02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MaityRN02,
author = {Soumen Maity and
Bimal K. Roy and
Amiya Nayak},
title = {On enumeration of catastrophic fault patterns},
journal = {Inf. Process. Lett.},
volume = {81},
number = {4},
pages = {209--212},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00231-9},
doi = {10.1016/S0020-0190(01)00231-9},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MaityRN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Martel02,
author = {Charles U. Martel},
title = {The expected complexity of Prim's minimum spanning tree algorithm},
journal = {Inf. Process. Lett.},
volume = {81},
number = {4},
pages = {197--201},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00220-4},
doi = {10.1016/S0020-0190(01)00220-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Martel02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MedunaK02,
author = {Alexander Meduna and
Dusan Kol{\'{a}}r},
title = {Homogeneous grammars with a reduced number of non-context-free productions},
journal = {Inf. Process. Lett.},
volume = {81},
number = {5},
pages = {253--257},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00224-1},
doi = {10.1016/S0020-0190(01)00224-1},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MedunaK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MehlhornPSS02,
author = {Kurt Mehlhorn and
Volker Priebe and
Guido Sch{\"{a}}fer and
Naveen Sivadasan},
title = {All-pairs shortest-paths computation in the presence of negative cycles},
journal = {Inf. Process. Lett.},
volume = {81},
number = {6},
pages = {341--343},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00242-3},
doi = {10.1016/S0020-0190(01)00242-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MehlhornPSS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NaroskaS02,
author = {Edwin Naroska and
Uwe Schwiegelshohn},
title = {On an on-line scheduling problem for parallel jobs},
journal = {Inf. Process. Lett.},
volume = {81},
number = {6},
pages = {297--304},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00241-1},
doi = {10.1016/S0020-0190(01)00241-1},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/NaroskaS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NgCBJ02,
author = {C. T. Ng and
T. C. Edwin Cheng and
Aleksander Bachman and
Adam Janiak},
title = {Three scheduling problems with deteriorating jobs to minimize the
total completion time},
journal = {Inf. Process. Lett.},
volume = {81},
number = {6},
pages = {327--333},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00244-7},
doi = {10.1016/S0020-0190(01)00244-7},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/NgCBJ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NogaSW02,
author = {John Noga and
Steven S. Seiden and
Gerhard J. Woeginger},
title = {A faster off-line algorithm for the {TCP} acknowledgement problem},
journal = {Inf. Process. Lett.},
volume = {81},
number = {2},
pages = {71--73},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00199-5},
doi = {10.1016/S0020-0190(01)00199-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/NogaSW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/OlaverriHNT02,
author = {Alfredo Garc{\'{\i}}a Olaverri and
Ferran Hurtado and
Marc Noy and
Javier Tejel},
title = {On the minimum size of visibility graphs},
journal = {Inf. Process. Lett.},
volume = {81},
number = {4},
pages = {223--230},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00227-7},
doi = {10.1016/S0020-0190(01)00227-7},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/OlaverriHNT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Petersen02,
author = {Holger Petersen},
title = {Bounds for the Element Distinctness Problem on one-tape Turing machines},
journal = {Inf. Process. Lett.},
volume = {81},
number = {2},
pages = {75--79},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00201-0},
doi = {10.1016/S0020-0190(01)00201-0},
timestamp = {Fri, 15 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Petersen02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shi02,
author = {Yaoyun Shi},
title = {Entropy lower bounds for quantum decision tree complexity},
journal = {Inf. Process. Lett.},
volume = {81},
number = {1},
pages = {23--27},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00191-0},
doi = {10.1016/S0020-0190(01)00191-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shi02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Skulrattanakulchai02,
author = {San Skulrattanakulchai},
title = {4-edge-coloring graphs of maximum degree 3 in linear time},
journal = {Inf. Process. Lett.},
volume = {81},
number = {4},
pages = {191--195},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00221-6},
doi = {10.1016/S0020-0190(01)00221-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Skulrattanakulchai02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Skurczynski02,
author = {Jerzy Skurczynski},
title = {A characterization of B{\"{u}}chi tree automata},
journal = {Inf. Process. Lett.},
volume = {81},
number = {1},
pages = {29--33},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00190-9},
doi = {10.1016/S0020-0190(01)00190-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Skurczynski02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sopena02,
author = {{\'{E}}ric Sopena},
title = {There exist oriented planar graphs with oriented chromatic number
at least sixteen},
journal = {Inf. Process. Lett.},
volume = {81},
number = {6},
pages = {309--312},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00246-0},
doi = {10.1016/S0020-0190(01)00246-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sopena02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SpriggsK02,
author = {Michael J. Spriggs and
J. Mark Keil},
title = {A new bound for map labeling with uniform circle pairs},
journal = {Inf. Process. Lett.},
volume = {81},
number = {1},
pages = {47--53},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00184-3},
doi = {10.1016/S0020-0190(01)00184-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SpriggsK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VeselZ02,
author = {Aleksander Vesel and
Janez Zerovnik},
title = {Improved lower bound on the Shannon capacity of {C7}},
journal = {Inf. Process. Lett.},
volume = {81},
number = {5},
pages = {277--282},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00229-0},
doi = {10.1016/S0020-0190(01)00229-0},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/VeselZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangL02,
author = {Lusheng Wang and
Zimao Li},
title = {An approximation algorithm for a bottleneck k-Steiner tree problem
in the Euclidean plane},
journal = {Inf. Process. Lett.},
volume = {81},
number = {3},
pages = {151--156},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00209-5},
doi = {10.1016/S0020-0190(01)00209-5},
timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/WangL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZanuttiniH02,
author = {Bruno Zanuttini and
Jean{-}Jacques H{\'{e}}brard},
title = {A unified framework for structure identification},
journal = {Inf. Process. Lett.},
volume = {81},
number = {6},
pages = {335--339},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00247-2},
doi = {10.1016/S0020-0190(01)00247-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZanuttiniH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhouSN02,
author = {Hai Zhou and
Narendra V. Shenoy and
William Nicholls},
title = {Efficient minimum spanning tree construction without Delaunay triangulation},
journal = {Inf. Process. Lett.},
volume = {81},
number = {5},
pages = {271--276},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00232-0},
doi = {10.1016/S0020-0190(01)00232-0},
timestamp = {Wed, 16 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhouSN02.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-24 00:17 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:
