:facetid:toc:\"db/journals/ipl/ipl11.bht\"OK:facetid:toc:db/journals/ipl/ipl11.bhtDonald C. S. AllisonM. T. NogaSelection by Distributive Partitioning.Inf. Process. Lett.1117-81980Journal Articlesclosedjournals/ipl/AllisonN8010.1016/0020-0190(80)90023-Xhttps://doi.org/10.1016/0020-0190(80)90023-Xhttps://dblp.org/rec/journals/ipl/AllisonN80URL#7092352R. K. AroraS. P. RanaHeuristic Algorithms for Process Assignment in Distributed Computing Systems.Inf. Process. Lett.114/5199-2031980Journal Articlesclosedjournals/ipl/AroraR80a10.1016/0020-0190(80)90050-2https://doi.org/10.1016/0020-0190(80)90050-2https://dblp.org/rec/journals/ipl/AroraR80aURL#7092355David AvisComments on a Lower Bound for Convex Hull Determination.Inf. Process. Lett.1131261980Journal Articlesclosedjournals/ipl/Avis8010.1016/0020-0190(80)90125-8https://doi.org/10.1016/0020-0190(80)90125-8https://dblp.org/rec/journals/ipl/Avis80URL#7092356Thomas A. BaileyR. Geoff DromeyFast String Searching by Finding Subkeys in Subtext.Inf. Process. Lett.113130-1331980Journal Articlesclosedjournals/ipl/BaileyD8010.1016/0020-0190(80)90127-1https://doi.org/10.1016/0020-0190(80)90127-1https://dblp.org/rec/journals/ipl/BaileyD80URL#7092357Lech BanachowskiA Complement to Tarjan's Result about the Lower Bound on the Complexity of the Set Union Problem.Inf. Process. Lett.11259-651980Journal Articlesclosedjournals/ipl/Banachowski8010.1016/0020-0190(80)90001-0https://doi.org/10.1016/0020-0190(80)90001-0https://dblp.org/rec/journals/ipl/Banachowski80URL#7092358J. H. ter BekkeConvertibility in Databases.Inf. Process. Lett.114/5168-1711980Journal Articlesclosedjournals/ipl/Bekke8010.1016/0020-0190(80)90044-7https://doi.org/10.1016/0020-0190(80)90044-7https://dblp.org/rec/journals/ipl/Bekke80URL#7092360Kabekode V. S. BhatOn the Complexity of Testing a Graph for N-Cube.Inf. Process. Lett.11116-191980Journal Articlesclosedjournals/ipl/Bhat8010.1016/0020-0190(80)90025-3https://doi.org/10.1016/0020-0190(80)90025-3https://dblp.org/rec/journals/ipl/Bhat80URL#7092363Richard P. BrentH. T. Kung 0001On the Area of Binary Tree Layouts.Inf. Process. Lett.11146-481980Journal Articlesclosedjournals/ipl/BrentK8010.1016/0020-0190(80)90034-4https://doi.org/10.1016/0020-0190(80)90034-4https://dblp.org/rec/journals/ipl/BrentK80URL#7092369Donna J. BrownAn Improved BL Lower Bound.Inf. Process. Lett.11137-391980Journal Articlesclosedjournals/ipl/Brown8010.1016/0020-0190(80)90031-9https://doi.org/10.1016/0020-0190(80)90031-9https://dblp.org/rec/journals/ipl/Brown80URL#7092370Manfred BroyTransformational Semantics for Concurrent Programs.Inf. Process. Lett.11287-911980Journal Articlesclosedjournals/ipl/Broy8010.1016/0020-0190(80)90009-5https://doi.org/10.1016/0020-0190(80)90009-5https://dblp.org/rec/journals/ipl/Broy80URL#7092371Jacques CalmetRüdiger LoosAn Improvement of Rabin's Probabilistic Algorithm for Generating Irreducible Polynomials over GF(p).Inf. Process. Lett.11294-951980Journal Articlesclosedjournals/ipl/CalmetL8010.1016/0020-0190(80)90011-3https://doi.org/10.1016/0020-0190(80)90011-3https://dblp.org/rec/journals/ipl/CalmetL80URL#7092376Kin-Man ChungFabrizio LuccioC. K. WongMinimum Number of Steps for Permutation in a Bubble Memory.Inf. Process. Lett.11281-831980Journal Articlesclosedjournals/ipl/ChungLW80a10.1016/0020-0190(80)90007-1https://doi.org/10.1016/0020-0190(80)90007-1https://dblp.org/rec/journals/ipl/ChungLW80aURL#7092379Charles J. ColbournBrendan D. McKayA Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability.Inf. Process. Lett.11296-971980Journal Articlesclosedjournals/ipl/ColbournM8010.1016/0020-0190(80)90012-5https://doi.org/10.1016/0020-0190(80)90012-5https://dblp.org/rec/journals/ipl/ColbournM80URL#7092380J. D. DayOn the Internal S-Stability of Rosenbrock Methods.Inf. Process. Lett.11127-301980Journal Articlesclosedjournals/ipl/Day8010.1016/0020-0190(80)90028-9https://doi.org/10.1016/0020-0190(80)90028-9https://dblp.org/rec/journals/ipl/Day80URL#7092383J. D. DayComments on: T. D. Bui "On an L-Stable Method for Stiff Differential Equations".Inf. Process. Lett.11131-321980Journal Articlesclosedjournals/ipl/Day80a10.1016/0020-0190(80)90029-0https://doi.org/10.1016/0020-0190(80)90029-0https://dblp.org/rec/journals/ipl/Day80aURL#7092384Nachum DershowitzThe Schorr-Waite Marking Algorithm Revisited.Inf. Process. Lett.113141-1431980Journal Articlesclosedjournals/ipl/Dershowitz8010.1016/0020-0190(80)90130-1https://doi.org/10.1016/0020-0190(80)90130-1https://dblp.org/rec/journals/ipl/Dershowitz80URL#7092386Luc DevroyeA Note on Finding Convex Hulls Via Maximal Vectors.Inf. Process. Lett.11153-561980Journal Articlesclosedjournals/ipl/Devroye8010.1016/0020-0190(80)90036-8https://doi.org/10.1016/0020-0190(80)90036-8https://dblp.org/rec/journals/ipl/Devroye80URL#7092387Edsger W. DijkstraCarel S. ScholtenTermination Detection for Diffusing Computations.Inf. Process. Lett.1111-41980Journal Articlesclosedjournals/ipl/DijkstraS8010.1016/0020-0190(80)90021-6https://doi.org/10.1016/0020-0190(80)90021-6https://dblp.org/rec/journals/ipl/DijkstraS80URL#7092388Wlodzimierz DobosiewiczAn Efficient Variation of Bubble Sort.Inf. Process. Lett.1115-61980Journal Articlesclosedjournals/ipl/Dobosiewicz8010.1016/0020-0190(80)90022-8https://doi.org/10.1016/0020-0190(80)90022-8https://dblp.org/rec/journals/ipl/Dobosiewicz80URL#7092389Charles R. DyerA Fast Parallel Algorithm for the Closest Pair Problem.Inf. Process. Lett.11149-521980Journal Articlesclosedjournals/ipl/Dyer8010.1016/0020-0190(80)90035-6https://doi.org/10.1016/0020-0190(80)90035-6https://dblp.org/rec/journals/ipl/Dyer80URL#7092391Jürgen EbertA Note on Odd and Even Factors of Undirected Graphs.Inf. Process. Lett.11270-721980Journal Articlesclosedjournals/ipl/Ebert8010.1016/0020-0190(80)90004-6https://doi.org/10.1016/0020-0190(80)90004-6https://dblp.org/rec/journals/ipl/Ebert80URL#7092392Hannu ErkiöInternal Merge Sorting with Delayed Selection.Inf. Process. Lett.113137-1401980Journal Articlesclosedjournals/ipl/Erkio8010.1016/0020-0190(80)90129-5https://doi.org/10.1016/0020-0190(80)90129-5https://dblp.org/rec/journals/ipl/Erkio80URL#7092394Greg N. FredericksonProbabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms.Inf. Process. Lett.114/5156-1611980Journal Articlesclosedjournals/ipl/Frederickson8010.1016/0020-0190(80)90041-1https://doi.org/10.1016/0020-0190(80)90041-1https://dblp.org/rec/journals/ipl/Frederickson80URL#7092397Jan GrabowskiThe Decidability of Persistence for Vector Addition Systems.Inf. Process. Lett.11120-231980Journal Articlesclosedjournals/ipl/Grabowski8010.1016/0020-0190(80)90026-5https://doi.org/10.1016/0020-0190(80)90026-5https://dblp.org/rec/journals/ipl/Grabowski80URL#7092400David GriesGary LevinComputing Fibonacci Numbers (and Similarly Defined Functions) in Log Time.Inf. Process. Lett.11268-691980Journal Articlesclosedjournals/ipl/GriesL8010.1016/0020-0190(80)90003-4https://doi.org/10.1016/0020-0190(80)90003-4https://dblp.org/rec/journals/ipl/GriesL80URL#7092401David R. HansonCode Improvement Via Lazy Evaluation.Inf. Process. Lett.114/5163-1671980Journal Articlesclosedjournals/ipl/Hanson8010.1016/0020-0190(80)90043-5https://doi.org/10.1016/0020-0190(80)90043-5https://dblp.org/rec/journals/ipl/Hanson80URL#7092402J. ten HoopenConsecutive Retrieval with Redundancy: An Optimal Linear and an Optimal Cyclic Arrangement and Their Storage Space Requirements.Inf. Process. Lett.114/5211-2171980Journal Articlesclosedjournals/ipl/Hoopen8010.1016/0020-0190(80)90052-6https://doi.org/10.1016/0020-0190(80)90052-6https://dblp.org/rec/journals/ipl/Hoopen80URL#7092405Oscar H. IbarraShlomo MoranLouis E. RosierA Note on the Parallel Complexity of Computing the Rank of Order n Matrices.Inf. Process. Lett.114/51621980Journal Articlesclosedjournals/ipl/IbarraMR8010.1016/0020-0190(80)90042-3https://doi.org/10.1016/0020-0190(80)90042-3https://dblp.org/rec/journals/ipl/IbarraMR80URL#7092406Alfons J. JammelHelmut G. StieglerOn Expected Costs of Deadlock Detection.Inf. Process. Lett.114/5229-2311980Journal Articlesclosedjournals/ipl/JammelS8010.1016/0020-0190(80)90055-1https://doi.org/10.1016/0020-0190(80)90055-1https://dblp.org/rec/journals/ipl/JammelS80URL#7092408Robert B. Johnson Jr.The Complexity of a VLSI Adder.Inf. Process. Lett.11292-931980Journal Articlesclosedjournals/ipl/Johnson8010.1016/0020-0190(80)90010-1https://doi.org/10.1016/0020-0190(80)90010-1https://dblp.org/rec/journals/ipl/Johnson80URL#7092410