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/ipl34.bht:"
download as .bib file
@article{DBLP:journals/ipl/Ahuja90,
author = {Mohan Ahuja},
title = {Flush Primitives for Asynchronous Distributed Systems},
journal = {Inf. Process. Lett.},
volume = {34},
number = {1},
pages = {5--12},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90222-J},
doi = {10.1016/0020-0190(90)90222-J},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ahuja90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Althofer90,
author = {Ingo Alth{\"{o}}fer},
title = {Tight Lower Bounds on the Length of Word Chains},
journal = {Inf. Process. Lett.},
volume = {34},
number = {5},
pages = {275--276},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90136-L},
doi = {10.1016/0020-0190(90)90136-L},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Althofer90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AnderssonC90,
author = {Arne Andersson and
Svante Carlsson},
title = {Construction of a Tree From its Traversals in Optimal Time and Space},
journal = {Inf. Process. Lett.},
volume = {34},
number = {1},
pages = {21--25},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90224-L},
doi = {10.1016/0020-0190(90)90224-L},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AnderssonC90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BagchiHMS90,
author = {Anindo Bagchi and
S. Louis Hakimi and
John Mitchem and
Edward F. Schmeichel},
title = {Parallel Algorithms for Gossiping by Mail},
journal = {Inf. Process. Lett.},
volume = {34},
number = {4},
pages = {197--202},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90160-Y},
doi = {10.1016/0020-0190(90)90160-Y},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BagchiHMS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BertoniGM90,
author = {Alberto Bertoni and
Massimiliano Goldwurm and
Paolo Massazza},
title = {Counting Problems and Algebraic Formal Power Series in Noncommuting
Variables},
journal = {Inf. Process. Lett.},
volume = {34},
number = {3},
pages = {117--121},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90089-G},
doi = {10.1016/0020-0190(90)90089-G},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BertoniGM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bradford90,
author = {James H. Bradford},
title = {Sequence Matching with Binary Codes},
journal = {Inf. Process. Lett.},
volume = {34},
number = {4},
pages = {193--196},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90159-U},
doi = {10.1016/0020-0190(90)90159-U},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bradford90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chandrasekharan90,
author = {N. Chandrasekharan},
title = {Isomorphism Testing of k-Trees is in NC, for Fixed k},
journal = {Inf. Process. Lett.},
volume = {34},
number = {6},
pages = {283--287},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90011-L},
doi = {10.1016/0020-0190(90)90011-L},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chandrasekharan90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChomickiS90,
author = {Jan Chomicki and
V. S. Subrahmanian},
title = {Generalized Closed World Assumptions is Pi0{\_}2-Complete},
journal = {Inf. Process. Lett.},
volume = {34},
number = {6},
pages = {289--291},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90012-M},
doi = {10.1016/0020-0190(90)90012-M},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChomickiS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CookP90,
author = {Stephen A. Cook and
Toniann Pitassi},
title = {A Feasibly Constructive Lower Bound for Resolution Proofs},
journal = {Inf. Process. Lett.},
volume = {34},
number = {2},
pages = {81--85},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90141-J},
doi = {10.1016/0020-0190(90)90141-J},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CookP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CooperK90,
author = {James W. Cooper and
Leslie J. Kitchen},
title = {Casop: {A} Fast Algorithm for Computing the n-Ary Composition of a
Binary Associative Operator},
journal = {Inf. Process. Lett.},
volume = {34},
number = {4},
pages = {209--213},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90162-Q},
doi = {10.1016/0020-0190(90)90162-Q},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CooperK90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CosnardDF90,
author = {Michel Cosnard and
Jean Duprat and
Afonso Ferreira},
title = {The Complexity of Searching in {X+Y} and Other Multisets},
journal = {Inf. Process. Lett.},
volume = {34},
number = {2},
pages = {103--109},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90144-M},
doi = {10.1016/0020-0190(90)90144-M},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CosnardDF90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DeyBT90,
author = {Pradip Dey and
Barrett R. Bryant and
Tadao Takaoka},
title = {Lexical Ambiguity in Tree Adjoining Grammars},
journal = {Inf. Process. Lett.},
volume = {34},
number = {2},
pages = {65--69},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90138-N},
doi = {10.1016/0020-0190(90)90138-N},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DeyBT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Dunne90,
author = {Paul E. S. Dunne},
title = {Comment on Kochol's Paper "Efficient Monotone Circuits for Threshold
Functions"},
journal = {Inf. Process. Lett.},
volume = {34},
number = {5},
pages = {221--222},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90125-H},
doi = {10.1016/0020-0190(90)90125-H},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Dunne90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Francez90,
author = {Nissim Francez},
title = {Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty
Interactions},
journal = {Inf. Process. Lett.},
volume = {34},
number = {1},
pages = {57},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90231-L},
doi = {10.1016/0020-0190(90)90231-L},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Francez90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Goeman90,
author = {Henk Goeman},
title = {Towards a Theory of (Self) Applicative Communicating Processes: {A}
Short Note},
journal = {Inf. Process. Lett.},
volume = {34},
number = {3},
pages = {139--142},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90092-C},
doi = {10.1016/0020-0190(90)90092-C},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Goeman90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Goldreich90,
author = {Oded Goldreich},
title = {A Note on Computational Indistinguishability},
journal = {Inf. Process. Lett.},
volume = {34},
number = {6},
pages = {277--281},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90010-U},
doi = {10.1016/0020-0190(90)90010-U},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Goldreich90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GonnetB90,
author = {Gaston H. Gonnet and
Ricardo A. Baeza{-}Yates},
title = {An Analysis of the Karp-Rabin String Matching Algorithm},
journal = {Inf. Process. Lett.},
volume = {34},
number = {5},
pages = {271--274},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90135-K},
doi = {10.1016/0020-0190(90)90135-K},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GonnetB90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HarnK90,
author = {Lein Harn and
Thomas Kiesler},
title = {An Efficient Probabilistic Encryption Scheme},
journal = {Inf. Process. Lett.},
volume = {34},
number = {3},
pages = {123--129},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90090-K},
doi = {10.1016/0020-0190(90)90090-K},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HarnK90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Heath90,
author = {Lenwood S. Heath},
title = {Covering a Set with Arithmetic Progressions is NP-Complete},
journal = {Inf. Process. Lett.},
volume = {34},
number = {6},
pages = {293--298},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90013-N},
doi = {10.1016/0020-0190(90)90013-N},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Heath90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hoare90,
author = {C. A. R. Hoare},
title = {Fixed Points of Increasing Functions},
journal = {Inf. Process. Lett.},
volume = {34},
number = {3},
pages = {111--112},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90087-E},
doi = {10.1016/0020-0190(90)90087-E},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hoare90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jacob90,
author = {Jeremy Jacob},
title = {Separability and the Detection of Hidden Channels},
journal = {Inf. Process. Lett.},
volume = {34},
number = {1},
pages = {27--29},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90225-M},
doi = {10.1016/0020-0190(90)90225-M},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jacob90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kale90,
author = {Laxmikant V. Kal{\'{e}}},
title = {An Almost Perfect Heuristic for the {N} Nonattacking Queens Problem},
journal = {Inf. Process. Lett.},
volume = {34},
number = {4},
pages = {173--178},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90156-R},
doi = {10.1016/0020-0190(90)90156-R},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kale90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Khuller90,
author = {Samir Khuller},
title = {Coloring Algorithms for K{\_}5-Minor Free Graphs},
journal = {Inf. Process. Lett.},
volume = {34},
number = {4},
pages = {203--208},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90161-P},
doi = {10.1016/0020-0190(90)90161-P},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Khuller90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kim90,
author = {Sung Kwon Kim},
title = {A Parallel Algorithm for Finding a Maximum Clique of a Set of Circular
Arcs of a Circle},
journal = {Inf. Process. Lett.},
volume = {34},
number = {5},
pages = {235--241},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90128-K},
doi = {10.1016/0020-0190(90)90128-K},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kim90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KleinS90,
author = {Philip N. Klein and
Clifford Stein},
title = {A Parallel Algorithm for Eliminating Cycles in Undirected Graphs},
journal = {Inf. Process. Lett.},
volume = {34},
number = {6},
pages = {307--312},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90015-P},
doi = {10.1016/0020-0190(90)90015-P},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KleinS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KuoT90,
author = {R. T. Kuo and
S. S. Tseng},
title = {The Necessary and Sufficient Condition for the Worst-Case Male Optimal
Stable Matching},
journal = {Inf. Process. Lett.},
volume = {34},
number = {5},
pages = {261--263},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90132-H},
doi = {10.1016/0020-0190(90)90132-H},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KuoT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KuriharaK90,
author = {Masahito Kurihara and
Ikuo Kaji},
title = {Modular Term Rewriting Systems and the Termination},
journal = {Inf. Process. Lett.},
volume = {34},
number = {1},
pages = {1--4},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90221-I},
doi = {10.1016/0020-0190(90)90221-I},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KuriharaK90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Laumond90,
author = {Jean{-}Paul Laumond},
title = {Connectivity of Plane Triangulations},
journal = {Inf. Process. Lett.},
volume = {34},
number = {2},
pages = {87--96},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90142-K},
doi = {10.1016/0020-0190(90)90142-K},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Laumond90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeungY90,
author = {Joseph Y.{-}T. Leung and
Gilbert H. Young},
title = {Preemptive Scheduling to Minimize Mean Weighted Flow Time},
journal = {Inf. Process. Lett.},
volume = {34},
number = {1},
pages = {47--50},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90229-Q},
doi = {10.1016/0020-0190(90)90229-Q},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeungY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lutz90,
author = {Earlin Lutz},
title = {Some Proofs of Data Refinement},
journal = {Inf. Process. Lett.},
volume = {34},
number = {4},
pages = {179--185},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90157-S},
doi = {10.1016/0020-0190(90)90157-S},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lutz90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Manber90,
author = {Udi Manber},
title = {Recognizing Breadth-First Search Trees in Linear Time},
journal = {Inf. Process. Lett.},
volume = {34},
number = {4},
pages = {167--171},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90155-Q},
doi = {10.1016/0020-0190(90)90155-Q},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Manber90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MartinezWL90,
author = {Alejandro D. Mart{\'{\i}}nez and
Rosita Wachenchauzer and
Rafael Dueire Lins},
title = {Cycle Reference Counting with Local Mark-Scan},
journal = {Inf. Process. Lett.},
volume = {34},
number = {1},
pages = {31--35},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90226-N},
doi = {10.1016/0020-0190(90)90226-N},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MartinezWL90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MatsliachS90,
author = {Gabriel Matsliach and
Oded Shmueli},
title = {Distributing {A} B+-Tree in a Loosely Coupled Environment},
journal = {Inf. Process. Lett.},
volume = {34},
number = {6},
pages = {313--321},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90016-Q},
doi = {10.1016/0020-0190(90)90016-Q},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MatsliachS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Meinel90,
author = {Christoph Meinel},
title = {Logic {VS.} Complexity Theoretic Properties of the Graph Accessibility
Problem for Directed Graphs of Bounded Degree},
journal = {Inf. Process. Lett.},
volume = {34},
number = {3},
pages = {143--146},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90093-D},
doi = {10.1016/0020-0190(90)90093-D},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Meinel90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MorrisonABD90,
author = {Ronald Morrison and
Malcolm P. Atkinson and
Alfred L. Brown and
Alan Dearle},
title = {On the Classification of Binding Mechanisms},
journal = {Inf. Process. Lett.},
volume = {34},
number = {1},
pages = {51--55},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90230-U},
doi = {10.1016/0020-0190(90)90230-U},
timestamp = {Wed, 11 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MorrisonABD90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Murphy90,
author = {Owen Murphy},
title = {A Unifying Framework for Trie Design Heuristics},
journal = {Inf. Process. Lett.},
volume = {34},
number = {5},
pages = {243--249},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90129-L},
doi = {10.1016/0020-0190(90)90129-L},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Murphy90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MurphyS90,
author = {O. J. Murphy and
Stanley M. Selkow},
title = {Finding Nearest Neighbors with Voronoi Tessellations},
journal = {Inf. Process. Lett.},
volume = {34},
number = {1},
pages = {37--41},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90227-O},
doi = {10.1016/0020-0190(90)90227-O},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MurphyS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ntafos90,
author = {Simeon C. Ntafos},
title = {The Robber Route Problem},
journal = {Inf. Process. Lett.},
volume = {34},
number = {2},
pages = {59--63},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90137-M},
doi = {10.1016/0020-0190(90)90137-M},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ntafos90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Olariu90a,
author = {Stephan Olariu},
title = {On the Closure of Triangle-Free Graphs Under Substitution},
journal = {Inf. Process. Lett.},
volume = {34},
number = {2},
pages = {97--101},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90143-L},
doi = {10.1016/0020-0190(90)90143-L},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Olariu90a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pallo90,
author = {Jean Marcel Pallo},
title = {A Distance Metric on Binary Trees Using Lattice-Theoretic Measures},
journal = {Inf. Process. Lett.},
volume = {34},
number = {3},
pages = {113--116},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90088-F},
doi = {10.1016/0020-0190(90)90088-F},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Pallo90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ParkK90,
author = {Moon Hwa Park and
Myunghwan Kim},
title = {A Distributed Synchronization Scheme for Fair Multi-Process Handshakes},
journal = {Inf. Process. Lett.},
volume = {34},
number = {3},
pages = {131--138},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90091-B},
doi = {10.1016/0020-0190(90)90091-B},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ParkK90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Plehn90,
author = {J{\"{u}}rgen Plehn},
title = {Preemptive Scheduling of Independent Jobs with Releas Times and Deadlines
on a Hypercube},
journal = {Inf. Process. Lett.},
volume = {34},
number = {3},
pages = {161--166},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90096-G},
doi = {10.1016/0020-0190(90)90096-G},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Plehn90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pombortsis90,
author = {Andreas S. Pombortsis},
title = {Sharing Special Purpose Resources in a Multiprocessor Environment},
journal = {Inf. Process. Lett.},
volume = {34},
number = {5},
pages = {255--260},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90131-G},
doi = {10.1016/0020-0190(90)90131-G},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Pombortsis90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pugh90,
author = {William W. Pugh},
title = {Slow Optimally Balanced Search Strategies {VS.} Cached Fast Uniformly
Balanced Search Strategies},
journal = {Inf. Process. Lett.},
volume = {34},
number = {5},
pages = {251--254},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90130-P},
doi = {10.1016/0020-0190(90)90130-P},
timestamp = {Mon, 04 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Pugh90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PurdyP90,
author = {Carla Neaderhouser Purdy and
George B. Purdy},
title = {The Area-Time Complexity of the Greatest Common Divisor Problem: {A}
Lower Bound},
journal = {Inf. Process. Lett.},
volume = {34},
number = {1},
pages = {43--46},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90228-P},
doi = {10.1016/0020-0190(90)90228-P},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PurdyP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RamalingamR90,
author = {G. Ramalingam and
C. Pandu Rangan},
title = {New Sequential and Parallel Algorithms for Interval Graph Recognition},
journal = {Inf. Process. Lett.},
volume = {34},
number = {4},
pages = {215--219},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90163-R},
doi = {10.1016/0020-0190(90)90163-R},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RamalingamR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Robson90,
author = {J. M. Robson},
title = {Random Access Machines with Multi-Dimensional Memories},
journal = {Inf. Process. Lett.},
volume = {34},
number = {5},
pages = {265--266},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90133-I},
doi = {10.1016/0020-0190(90)90133-I},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Robson90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RonnS90,
author = {Stefan R{\"{o}}nn and
Heikki Saikkonen},
title = {Distributed Termination Detection with Counters},
journal = {Inf. Process. Lett.},
volume = {34},
number = {5},
pages = {223--227},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90126-I},
doi = {10.1016/0020-0190(90)90126-I},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RonnS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sen90,
author = {Sandeep Sen},
title = {Finding an Approximate Median with High Probability in Constant Parallel
Time},
journal = {Inf. Process. Lett.},
volume = {34},
number = {2},
pages = {77--80},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90140-S},
doi = {10.1016/0020-0190(90)90140-S},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sen90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SenguptaB90,
author = {Abhijit Sengupta and
Subir Bandyopadhyay},
title = {Deadlock-Free Routing in k-Ary Hypercube Network in Presence of Processor
Failures},
journal = {Inf. Process. Lett.},
volume = {34},
number = {6},
pages = {323--328},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90017-R},
doi = {10.1016/0020-0190(90)90017-R},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SenguptaB90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Simonson90,
author = {Shai Simonson},
title = {Routing with Critical Paths},
journal = {Inf. Process. Lett.},
volume = {34},
number = {1},
pages = {13--19},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90223-K},
doi = {10.1016/0020-0190(90)90223-K},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Simonson90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Teng90,
author = {Shang{-}Hua Teng},
title = {Space Efficient Processor Identity Protocol},
journal = {Inf. Process. Lett.},
volume = {34},
number = {3},
pages = {147--154},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90094-E},
doi = {10.1016/0020-0190(90)90094-E},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Teng90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tipper90,
author = {John C. Tipper},
title = {A Straightforward Iterative Algorithm for the Planar Voronoi Diagram},
journal = {Inf. Process. Lett.},
volume = {34},
number = {3},
pages = {155--160},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90095-F},
doi = {10.1016/0020-0190(90)90095-F},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tipper90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tuza90,
author = {Zsolt Tuza},
title = {Periodic String Division Generated by Deterministic {L} Systems},
journal = {Inf. Process. Lett.},
volume = {34},
number = {5},
pages = {229--234},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90127-J},
doi = {10.1016/0020-0190(90)90127-J},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tuza90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangCL90,
author = {Biing{-}Feng Wang and
Gen{-}Huey Chen and
Ferng{-}Chiang Lin},
title = {Constant Time Sorting on a Processor Array with a Reconfigurable Bus
System},
journal = {Inf. Process. Lett.},
volume = {34},
number = {4},
pages = {187--192},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90158-T},
doi = {10.1016/0020-0190(90)90158-T},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangCL90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WeeCW90,
author = {Young C. Wee and
Seth Chaiken and
Dan E. Willard},
title = {On the Angle Restricted Nearest Neighbor Problem},
journal = {Inf. Process. Lett.},
volume = {34},
number = {2},
pages = {71--76},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90139-O},
doi = {10.1016/0020-0190(90)90139-O},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WeeCW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WeissS90,
author = {Mark Allen Weiss and
Robert Sedgewick},
title = {More on Shellsort Increment Sequences},
journal = {Inf. Process. Lett.},
volume = {34},
number = {5},
pages = {267--270},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90134-J},
doi = {10.1016/0020-0190(90)90134-J},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WeissS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZarghamD90,
author = {Mehdi R. Zargham and
Kenneth J. Danhof},
title = {Toward a Definition of Fault Analysis for Petri Nets Models},
journal = {Inf. Process. Lett.},
volume = {34},
number = {6},
pages = {299--305},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90014-O},
doi = {10.1016/0020-0190(90)90014-O},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZarghamD90.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-03 17: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:
