:facetid:toc:\"db/journals/ipl/ipl81.bht\"OK:facetid:toc:db/journals/ipl/ipl81.bhtSusanne AlbersMarek KarpinskiRandomized splay trees: Theoretical and experimental results.Inf. Process. Lett.814213-2212002Journal Articlesclosedjournals/ipl/AlbersK0210.1016/S0020-0190(01)00230-7https://doi.org/10.1016/S0020-0190(01)00230-7https://dblp.org/rec/journals/ipl/AlbersK02URL#6234907Toru ArakiYukio ShibataPancyclicity of recursive circulant graphs.Inf. Process. Lett.814187-1902002Journal Articlesclosedjournals/ipl/ArakiS0210.1016/S0020-0190(01)00226-5https://doi.org/10.1016/S0020-0190(01)00226-5https://dblp.org/rec/journals/ipl/ArakiS02URL#6234911Aleksander BachmanAdam JaniakMikhail Y. KovalyovMinimizing the total weighted completion time of deteriorating jobs.Inf. Process. Lett.81281-842002Journal Articlesclosedjournals/ipl/BachmanJK0210.1016/S0020-0190(01)00196-Xhttps://doi.org/10.1016/S0020-0190(01)00196-Xhttps://dblp.org/rec/journals/ipl/BachmanJK02URL#6234919Mark de BergA. Frank van der StappenOn the fatness of Minkowski sums.Inf. Process. Lett.815259-2642002Journal Articlesclosedjournals/ipl/BergS0210.1016/S0020-0190(01)00233-2https://doi.org/10.1016/S0020-0190(01)00233-2https://dblp.org/rec/journals/ipl/BergS02URL#6234926Jürgen BrankeStefan LeppertMartin MiddendorfPeter EadesWidth-restricted layering of acyclic digraphs with consideration of dummy nodes.Inf. Process. Lett.81259-632002Journal Articlesclosedjournals/ipl/BrankeLME0210.1016/S0020-0190(01)00200-9https://doi.org/10.1016/S0020-0190(01)00200-9https://dblp.org/rec/journals/ipl/BrankeLME02URL#6234932Alain BrettoStéphane UbédaJanez ZerovnikA polynomial algorithm for the strong Helly property.Inf. Process. Lett.81155-572002Journal Articlesclosedjournals/ipl/BrettoUZ0210.1016/S0020-0190(01)00186-7https://doi.org/10.1016/S0020-0190(01)00186-7https://dblp.org/rec/journals/ipl/BrettoUZ02URL#6234933Judit BükiCsaba SzabóComplexity of homomorphisms to direct products of graphs.Inf. Process. Lett.814175-1782002Journal Articlesclosedjournals/ipl/BukiS0210.1016/S0020-0190(01)00225-3https://doi.org/10.1016/S0020-0190(01)00225-3https://dblp.org/rec/journals/ipl/BukiS02URL#6234934R. W. BultermanF. W. van der SommenGerard ZwaanTom VerhoeffA. J. M. van GasterenW. H. J. FeijenOn computing a longest path in a tree.Inf. Process. Lett.81293-962002Journal Articlesclosedjournals/ipl/BultermanSZVGF0210.1016/S0020-0190(01)00198-3https://doi.org/10.1016/S0020-0190(01)00198-3https://dblp.org/rec/journals/ipl/BultermanSZVGF02URL#6234935Arturo CarpiAldo de LucaA combinatorial property of the factor poset of a word.Inf. Process. Lett.81135-392002Journal Articlesclosedjournals/ipl/CarpiL0210.1016/S0020-0190(01)00192-2https://doi.org/10.1016/S0020-0190(01)00192-2https://dblp.org/rec/journals/ipl/CarpiL02URL#6234941Marco CesatiPerfect Code is W[1]-complete.Inf. Process. Lett.813163-1682002Journal Articlesclosedjournals/ipl/Cesati0210.1016/S0020-0190(01)00207-1https://doi.org/10.1016/S0020-0190(01)00207-1https://dblp.org/rec/journals/ipl/Cesati02URL#6234942Qi Cheng 0001Fang FangKolmogorov random graphs only have trivial stable colorings.Inf. Process. Lett.813133-1362002Journal Articlesclosedjournals/ipl/ChengF0210.1016/S0020-0190(01)00206-Xhttps://doi.org/10.1016/S0020-0190(01)00206-Xhttps://dblp.org/rec/journals/ipl/ChengF02URL#6234950Rezaul Alam ChowdhuryM. KaykobadIrwin KingAn efficient decoding technique for Huffman codes.Inf. Process. Lett.816305-3082002Journal Articlesclosedjournals/ipl/ChowdhuryKK0210.1016/S0020-0190(01)00243-5https://doi.org/10.1016/S0020-0190(01)00243-5https://dblp.org/rec/journals/ipl/ChowdhuryKK02URL#6234957Ilyong ChungWankyu ChoiYoungchel KimMike LeeThe design of conference key distribution system employing a symmetric balanced incomplete block design.Inf. Process. Lett.816313-3182002Journal Articlesclosedjournals/ipl/ChungCKL0210.1016/S0020-0190(01)00240-Xhttps://doi.org/10.1016/S0020-0190(01)00240-Xhttps://dblp.org/rec/journals/ipl/ChungCKL02URL#6234959Tae-Sun ChungHyoung-Joo Kim 0001Extracting indexing information from XML DTDs.Inf. Process. Lett.81297-1032002Journal Articlesclosedjournals/ipl/ChungK0210.1016/S0020-0190(01)00193-4https://doi.org/10.1016/S0020-0190(01)00193-4https://dblp.org/rec/journals/ipl/ChungK02URL#6234960Kuo-Liang ChungWen-Ming YanFast 2D discrete cosine transform on compressed image in restricted quadtree and shading format.Inf. Process. Lett.81113-212002Journal Articlesclosedjournals/ipl/ChungY0210.1016/S0020-0190(01)00188-0https://doi.org/10.1016/S0020-0190(01)00188-0https://dblp.org/rec/journals/ipl/ChungY02URL#6234961Fanica GavrilAlgorithms for maximum weight induced paths.Inf. Process. Lett.814203-2082002Journal Articlesclosedjournals/ipl/Gavril0210.1016/S0020-0190(01)00222-8https://doi.org/10.1016/S0020-0190(01)00222-8https://dblp.org/rec/journals/ipl/Gavril02URL#6234982Diganta GoswamiRajib MallAn efficient method for computing dynamic program slices.Inf. Process. Lett.812111-1172002Journal Articlesclosedjournals/ipl/GoswamiM0210.1016/S0020-0190(01)00202-2https://doi.org/10.1016/S0020-0190(01)00202-2https://dblp.org/rec/journals/ipl/GoswamiM02URL#6234985Joachim GudmundssonThore HusfeldtChristos LevcopoulosLower bounds for approximate polygon decomposition and minimum gap.Inf. Process. Lett.813137-1412002Journal Articlesclosedjournals/ipl/GudmundssonHL0210.1016/S0020-0190(01)00203-4https://doi.org/10.1016/S0020-0190(01)00203-4https://dblp.org/rec/journals/ipl/GudmundssonHL02URL#6234989Andrew G. HartServet Martínez 0001Sequential iteration of the Erlang fixed-point equations.Inf. Process. Lett.816319-3252002Journal Articlesclosedjournals/ipl/HartM0210.1016/S0020-0190(01)00238-1https://doi.org/10.1016/S0020-0190(01)00238-1https://dblp.org/rec/journals/ipl/HartM02URL#6234993Refael HassinShlomi RubinsteinA 7/8-approximation algorithm for metric Max TSP.Inf. Process. Lett.815247-2512002Journal Articlesclosedjournals/ipl/HassinR0210.1016/S0020-0190(01)00234-4https://doi.org/10.1016/S0020-0190(01)00234-4https://dblp.org/rec/journals/ipl/HassinR02URL#6234994Chien-Lung HsuTzong-Sun WuTzong-Chen WuImprovements of generalization of threshold signature and authenticated encryption for group communications.Inf. Process. Lett.81141-452002Journal Articlesclosedjournals/ipl/HsuWW0210.1016/S0020-0190(01)00189-2https://doi.org/10.1016/S0020-0190(01)00189-2https://dblp.org/rec/journals/ipl/HsuWW02URL#6235002Fredrik JönssonThomas Johansson 0001A fast correlation attack on LILI-128.Inf. Process. Lett.813127-1322002Journal Articlesclosedjournals/ipl/JonssonJ0210.1016/S0020-0190(01)00208-3https://doi.org/10.1016/S0020-0190(01)00208-3https://dblp.org/rec/journals/ipl/JonssonJ02URL#6235006Jörg Keller 0001A heuristic to accelerate in-situ permutation algorithms.Inf. Process. Lett.813119-1252002Journal Articlesclosedjournals/ipl/Keller0210.1016/S0020-0190(01)00219-8https://doi.org/10.1016/S0020-0190(01)00219-8https://dblp.org/rec/journals/ipl/Keller02URL#6235009Nectarios KitsiosChristos MakrisSpyros SioutasAthanasios K. TsakalidisJohn TsaknakisBill VassiliadisAn optimal algorithm for reporting visible rectangles.Inf. Process. Lett.815283-2882002Journal Articlesclosedjournals/ipl/KitsiosMSTTV0210.1016/S0020-0190(01)00228-9https://doi.org/10.1016/S0020-0190(01)00228-9https://dblp.org/rec/journals/ipl/KitsiosMSTTV02URL#6235013Zenji KobayashiTakeshi SekiguchiOn a characterization of the standard Gray code by using its edge type on a hypercube.Inf. Process. Lett.815231-2372002Journal Articlesclosedjournals/ipl/KobayashiS0210.1016/S0020-0190(01)00237-Xhttps://doi.org/10.1016/S0020-0190(01)00237-Xhttps://dblp.org/rec/journals/ipl/KobayashiS02URL#6235014Noritaka KobayashiTatsuhiro TsuchiyaTohru KikunoA new method for constructing pair-wise covering designs for software testing.Inf. Process. Lett.81285-912002Journal Articlesclosedjournals/ipl/KobayashiTK0210.1016/S0020-0190(01)00195-8https://doi.org/10.1016/S0020-0190(01)00195-8https://dblp.org/rec/journals/ipl/KobayashiTK02URL#6235015Pascal KoiranTransfer theorems via sign conditions.Inf. Process. Lett.81265-692002Journal Articlesclosedjournals/ipl/Koiran0210.1016/S0020-0190(01)00197-1https://doi.org/10.1016/S0020-0190(01)00197-1https://dblp.org/rec/journals/ipl/Koiran02URL#6235016Alena KoubkováVáclav KoubekAlgorithms for transitive closure.Inf. Process. Lett.816289-2962002Journal Articlesclosedjournals/ipl/KoubkovaK0210.1016/S0020-0190(01)00245-9https://doi.org/10.1016/S0020-0190(01)00245-9https://dblp.org/rec/journals/ipl/KoubkovaK02URL#6235018Michael KrivelevichDeciding k-colorability in expected polynomial time.Inf. Process. Lett.8111-62002Journal Articlesclosedjournals/ipl/Krivelevich0210.1016/S0020-0190(01)00187-9https://doi.org/10.1016/S0020-0190(01)00187-9https://dblp.org/rec/journals/ipl/Krivelevich02URL#6235020Oh-Heum KwonKyung-Yong ChwaApproximation algorithms for general parallel task scheduling.Inf. Process. Lett.813143-1502002Journal Articlesclosedjournals/ipl/KwonC0210.1016/S0020-0190(01)00210-1https://doi.org/10.1016/S0020-0190(01)00210-1https://dblp.org/rec/journals/ipl/KwonC02URL#6235023Wei LaiPeter EadesRemoving edge-node intersections in drawings of graphs.Inf. Process. Lett.812105-1102002Journal Articlesclosedjournals/ipl/LaiE0210.1016/S0020-0190(01)00194-6https://doi.org/10.1016/S0020-0190(01)00194-6https://dblp.org/rec/journals/ipl/LaiE02URL#6235025Hoàng-Oanh LeVan Bang LeThe NP-completeness of (1, r)-subcolorability of cubic graphs.Inf. Process. Lett.813157-1622002Journal Articlesclosedjournals/ipl/LeL0210.1016/S0020-0190(01)00205-8https://doi.org/10.1016/S0020-0190(01)00205-8https://dblp.org/rec/journals/ipl/LeL02URL#6235027Dong-Ho LeeHyoung-Joo KimAn efficient nearest neighbor search in high-dimensional data spaces.Inf. Process. Lett.815239-2462002Journal Articlesclosedjournals/ipl/LeeK0210.1016/S0020-0190(01)00236-8https://doi.org/10.1016/S0020-0190(01)00236-8https://dblp.org/rec/journals/ipl/LeeK02URL#6235029Jae-Ha LeeSang-Min ParkKyung-Yong ChwaSimple algorithms for searching a polygon with flashlights.Inf. Process. Lett.815265-2702002Journal Articlesclosedjournals/ipl/LeePC0210.1016/S0020-0190(01)00235-6https://doi.org/10.1016/S0020-0190(01)00235-6https://dblp.org/rec/journals/ipl/LeePC02URL#6235031Oukseh LeeKwangkeun YiYunheung PaekA proof method for the correctness of modularized 0CFA.Inf. Process. Lett.814179-1852002Journal Articlesclosedjournals/ipl/LeeYP0210.1016/S0020-0190(01)00223-Xhttps://doi.org/10.1016/S0020-0190(01)00223-Xhttps://dblp.org/rec/journals/ipl/LeeYP02URL#6235032Vadim V. LozinOn maximum induced matchings in bipartite graphs.Inf. Process. Lett.8117-112002Journal Articlesclosedjournals/ipl/Lozin0210.1016/S0020-0190(01)00185-5https://doi.org/10.1016/S0020-0190(01)00185-5https://dblp.org/rec/journals/ipl/Lozin02URL#6235039Gordon LyonComparison of two code scalability tests.Inf. Process. Lett.813169-1742002Journal Articlesclosedjournals/ipl/Lyon0210.1016/S0020-0190(01)00204-6https://doi.org/10.1016/S0020-0190(01)00204-6https://dblp.org/rec/journals/ipl/Lyon02URL#6235040Soumen MaityBimal K. RoyAmiya NayakOn enumeration of catastrophic fault patterns.Inf. Process. Lett.814209-2122002Journal Articlesclosedjournals/ipl/MaityRN0210.1016/S0020-0190(01)00231-9https://doi.org/10.1016/S0020-0190(01)00231-9https://dblp.org/rec/journals/ipl/MaityRN02URL#6235043Charles U. MartelThe expected complexity of Prim's minimum spanning tree algorithm.Inf. Process. Lett.814197-2012002Journal Articlesclosedjournals/ipl/Martel0210.1016/S0020-0190(01)00220-4https://doi.org/10.1016/S0020-0190(01)00220-4https://dblp.org/rec/journals/ipl/Martel02URL#6235046Alexander MedunaDusan KolárHomogeneous grammars with a reduced number of non-context-free productions.Inf. Process. Lett.815253-2572002Journal Articlesclosedjournals/ipl/MedunaK0210.1016/S0020-0190(01)00224-1https://doi.org/10.1016/S0020-0190(01)00224-1https://dblp.org/rec/journals/ipl/MedunaK02URL#6235048Kurt MehlhornVolker PriebeGuido SchäferNaveen SivadasanAll-pairs shortest-paths computation in the presence of negative cycles.Inf. Process. Lett.816341-3432002Journal Articlesclosedjournals/ipl/MehlhornPSS0210.1016/S0020-0190(01)00242-3https://doi.org/10.1016/S0020-0190(01)00242-3https://dblp.org/rec/journals/ipl/MehlhornPSS02URL#6235049Edwin NaroskaUwe SchwiegelshohnOn an on-line scheduling problem for parallel jobs.Inf. Process. Lett.816297-3042002Journal Articlesclosedjournals/ipl/NaroskaS0210.1016/S0020-0190(01)00241-1https://doi.org/10.1016/S0020-0190(01)00241-1https://dblp.org/rec/journals/ipl/NaroskaS02URL#6235055C. T. Ng 0001T. C. Edwin ChengAleksander BachmanAdam JaniakThree scheduling problems with deteriorating jobs to minimize the total completion time.Inf. Process. Lett.816327-3332002Journal Articlesclosedjournals/ipl/NgCBJ0210.1016/S0020-0190(01)00244-7https://doi.org/10.1016/S0020-0190(01)00244-7https://dblp.org/rec/journals/ipl/NgCBJ02URL#6235057John NogaSteven S. SeidenGerhard J. WoegingerA faster off-line algorithm for the TCP acknowledgement problem.Inf. Process. Lett.81271-732002Journal Articlesclosedjournals/ipl/NogaSW0210.1016/S0020-0190(01)00199-5https://doi.org/10.1016/S0020-0190(01)00199-5https://dblp.org/rec/journals/ipl/NogaSW02URL#6235061Alfredo García OlaverriFerran HurtadoMarc NoyJavier TejelOn the minimum size of visibility graphs.Inf. Process. Lett.814223-2302002Journal Articlesclosedjournals/ipl/OlaverriHNT0210.1016/S0020-0190(01)00227-7https://doi.org/10.1016/S0020-0190(01)00227-7https://dblp.org/rec/journals/ipl/OlaverriHNT02URL#6235063Holger Petersen 0001Bounds for the Element Distinctness Problem on one-tape Turing machines.Inf. Process. Lett.81275-792002Journal Articlesclosedjournals/ipl/Petersen0210.1016/S0020-0190(01)00201-0https://doi.org/10.1016/S0020-0190(01)00201-0https://dblp.org/rec/journals/ipl/Petersen02URL#6235066Yaoyun ShiEntropy lower bounds for quantum decision tree complexity.Inf. Process. Lett.81123-272002Journal Articlesclosedjournals/ipl/Shi0210.1016/S0020-0190(01)00191-0https://doi.org/10.1016/S0020-0190(01)00191-0https://dblp.org/rec/journals/ipl/Shi02URL#6235085San Skulrattanakulchai4-edge-coloring graphs of maximum degree 3 in linear time.Inf. Process. Lett.814191-1952002Journal Articlesclosedjournals/ipl/Skulrattanakulchai0210.1016/S0020-0190(01)00221-6https://doi.org/10.1016/S0020-0190(01)00221-6https://dblp.org/rec/journals/ipl/Skulrattanakulchai02URL#6235087Jerzy SkurczynskiA characterization of Büchi tree automata.Inf. Process. Lett.81129-332002Journal Articlesclosedjournals/ipl/Skurczynski0210.1016/S0020-0190(01)00190-9https://doi.org/10.1016/S0020-0190(01)00190-9https://dblp.org/rec/journals/ipl/Skurczynski02URL#6235088Éric SopenaThere exist oriented planar graphs with oriented chromatic number at least sixteen.Inf. Process. Lett.816309-3122002Journal Articlesclosedjournals/ipl/Sopena0210.1016/S0020-0190(01)00246-0https://doi.org/10.1016/S0020-0190(01)00246-0https://dblp.org/rec/journals/ipl/Sopena02URL#6235089Michael J. SpriggsJ. Mark KeilA new bound for map labeling with uniform circle pairs.Inf. Process. Lett.81147-532002Journal Articlesclosedjournals/ipl/SpriggsK0210.1016/S0020-0190(01)00184-3https://doi.org/10.1016/S0020-0190(01)00184-3https://dblp.org/rec/journals/ipl/SpriggsK02URL#6235090Aleksander VeselJanez ZerovnikImproved lower bound on the Shannon capacity of C7.Inf. Process. Lett.815277-2822002Journal Articlesclosedjournals/ipl/VeselZ0210.1016/S0020-0190(01)00229-0https://doi.org/10.1016/S0020-0190(01)00229-0https://dblp.org/rec/journals/ipl/VeselZ02URL#6235105Lusheng Wang 0001Zimao LiAn approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane.Inf. Process. Lett.813151-1562002Journal Articlesclosedjournals/ipl/WangL0210.1016/S0020-0190(01)00209-5https://doi.org/10.1016/S0020-0190(01)00209-5https://dblp.org/rec/journals/ipl/WangL02URL#6235107Bruno ZanuttiniJean-Jacques HébrardA unified framework for structure identification.Inf. Process. Lett.816335-3392002Journal Articlesclosedjournals/ipl/ZanuttiniH0210.1016/S0020-0190(01)00247-2https://doi.org/10.1016/S0020-0190(01)00247-2https://dblp.org/rec/journals/ipl/ZanuttiniH02URL#6235109Hai Zhou 0001Narendra V. ShenoyWilliam NichollsEfficient minimum spanning tree construction without Delaunay triangulation.Inf. Process. Lett.815271-2762002Journal Articlesclosedjournals/ipl/ZhouSN0210.1016/S0020-0190(01)00232-0https://doi.org/10.1016/S0020-0190(01)00232-0https://dblp.org/rec/journals/ipl/ZhouSN02URL#6235110