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/ipl31.bht:"
download as .bib file
@article{DBLP:journals/ipl/AggarwalH89,
author = {Alok Aggarwal and
Michael Hawrylycz},
title = {On Computing the Closest Boundary Point on the Convex Hull},
journal = {Inf. Process. Lett.},
volume = {31},
number = {6},
pages = {311--314},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90093-8},
doi = {10.1016/0020-0190(89)90093-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AggarwalH89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AggarwalK89,
author = {Alok Aggarwal and
Dina Kravets},
title = {A Linear Time Algorithm for Finding all Farthest Neighbors in a Convex
Polygon},
journal = {Inf. Process. Lett.},
volume = {31},
number = {1},
pages = {17--20},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90103-8},
doi = {10.1016/0020-0190(89)90103-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AggarwalK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Allison89,
author = {Lloyd Allison},
title = {Direct Semantics and Exceptions Define Jumps and Coroutines},
journal = {Inf. Process. Lett.},
volume = {31},
number = {6},
pages = {327--330},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90097-5},
doi = {10.1016/0020-0190(89)90097-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Allison89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BasartH89,
author = {Josep M. Basart and
Lloren{\c{c}} Huguet i Rotger},
title = {An Approximation Algorithm for the {TSP}},
journal = {Inf. Process. Lett.},
volume = {31},
number = {2},
pages = {77--81},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90072-0},
doi = {10.1016/0020-0190(89)90072-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BasartH89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Beaudry89,
author = {Martin Beaudry},
title = {Characterization of Idempotent Transformation Monoids},
journal = {Inf. Process. Lett.},
volume = {31},
number = {3},
pages = {163--166},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90226-3},
doi = {10.1016/0020-0190(89)90226-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Beaudry89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BermudezL89,
author = {Manuel E. Bermudez and
George Logothetis},
title = {Simple Computation of {LALR(1)} Lookahead Sets},
journal = {Inf. Process. Lett.},
volume = {31},
number = {5},
pages = {233--238},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90079-3},
doi = {10.1016/0020-0190(89)90079-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BermudezL89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BertolazziS89,
author = {Paola Bertolazzi and
Antonio Sassano},
title = {A Decomposition Strategy for the Vertex Cover Problem},
journal = {Inf. Process. Lett.},
volume = {31},
number = {6},
pages = {299--304},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90091-4},
doi = {10.1016/0020-0190(89)90091-4},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BertolazziS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BloniarzR89,
author = {Peter A. Bloniarz and
S. S. Ravi},
title = {An O(n log n) Lower Bound for Decomposing a Set of Points into Chains},
journal = {Inf. Process. Lett.},
volume = {31},
number = {6},
pages = {319--322},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90095-1},
doi = {10.1016/0020-0190(89)90095-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BloniarzR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bodlaender89,
author = {Hans L. Bodlaender},
title = {Achromatic Number is NP-Complete for Cographs and Interval Graphs},
journal = {Inf. Process. Lett.},
volume = {31},
number = {3},
pages = {135--138},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90221-4},
doi = {10.1016/0020-0190(89)90221-4},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Bodlaender89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Burton89,
author = {F. Warren Burton},
title = {A Note on Higher-Order Functions Versus Logical Variables},
journal = {Inf. Process. Lett.},
volume = {31},
number = {2},
pages = {91--95},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90074-4},
doi = {10.1016/0020-0190(89)90074-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Burton89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CarlssonCS89,
author = {Svante Carlsson and
Jingsen Chen and
Thomas Strothotte},
title = {A Note on the Construction of Data Structure "DEAP"},
journal = {Inf. Process. Lett.},
volume = {31},
number = {6},
pages = {315--317},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90094-X},
doi = {10.1016/0020-0190(89)90094-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CarlssonCS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CarsonV89,
author = {Scott D. Carson and
Paul Vongsathorn},
title = {Error Bounds on Disk Arrangement Using Frequency Information},
journal = {Inf. Process. Lett.},
volume = {31},
number = {4},
pages = {209--213},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90125-7},
doi = {10.1016/0020-0190(89)90125-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CarsonV89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CasasDS89,
author = {Rafael Casas and
Josep D{\'{\i}}az and
Jean{-}Marc Steyaert},
title = {Average-Case Analysis of Robinson's Unification Algorithm with Two
Different Variables},
journal = {Inf. Process. Lett.},
volume = {31},
number = {5},
pages = {227--232},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90078-1},
doi = {10.1016/0020-0190(89)90078-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CasasDS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CheriyanM89,
author = {Joseph Cheriyan and
S. N. Maheshwari},
title = {The Parallel Complexity of Finding a Blocking Flow in a 3-Layer Network},
journal = {Inf. Process. Lett.},
volume = {31},
number = {3},
pages = {157--161},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90225-1},
doi = {10.1016/0020-0190(89)90225-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CheriyanM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chlebus89,
author = {Bogdan S. Chlebus},
title = {Parallel Iterated Bucket Sort},
journal = {Inf. Process. Lett.},
volume = {31},
number = {4},
pages = {181--183},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90120-8},
doi = {10.1016/0020-0190(89)90120-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chlebus89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Czaja89,
author = {Ludwik Czaja},
title = {Finite Processes in Cause-Effect Structures and Their Composition},
journal = {Inf. Process. Lett.},
volume = {31},
number = {6},
pages = {305--310},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90092-6},
doi = {10.1016/0020-0190(89)90092-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Czaja89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Eisinger89,
author = {Norbert Eisinger},
title = {A Note on the Completeness of Resolution with Self-Resolution},
journal = {Inf. Process. Lett.},
volume = {31},
number = {6},
pages = {323--326},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90096-3},
doi = {10.1016/0020-0190(89)90096-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Eisinger89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Falkowski89,
author = {Bernd{-}J{\"{u}}rgen Falkowski},
title = {A Self-Optimizing Prolog Program and the Underlying Statistical Model},
journal = {Inf. Process. Lett.},
volume = {31},
number = {5},
pages = {273--276},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90085-9},
doi = {10.1016/0020-0190(89)90085-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Falkowski89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Feinberg89,
author = {Ellen B. Feinberg},
title = {Characterizing the Shortest Path of an Object Among Obstacles},
journal = {Inf. Process. Lett.},
volume = {31},
number = {5},
pages = {257--264},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90083-5},
doi = {10.1016/0020-0190(89)90083-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Feinberg89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FosterV89,
author = {Dean P. Foster and
Rakesh Vohra},
title = {Probabilistic Analysis of a Heuristics for the Dual Bin Packing Problem},
journal = {Inf. Process. Lett.},
volume = {31},
number = {6},
pages = {287--290},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90088-4},
doi = {10.1016/0020-0190(89)90088-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FosterV89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FraysseixI89,
author = {Hubert de Fraysseix and
Hiroshi Imai},
title = {Notes on Oriented Depth-First Search and Longest Paths},
journal = {Inf. Process. Lett.},
volume = {31},
number = {1},
pages = {53--56},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90109-9},
doi = {10.1016/0020-0190(89)90109-9},
timestamp = {Wed, 04 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FraysseixI89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GinatST89,
author = {David Ginat and
Daniel Dominic Sleator and
Robert Endre Tarjan},
title = {A Tight Amortized Bound for Path Reversal},
journal = {Inf. Process. Lett.},
volume = {31},
number = {1},
pages = {3--5},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90101-4},
doi = {10.1016/0020-0190(89)90101-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GinatST89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GoldbergT89,
author = {Andrew V. Goldberg and
Robert Endre Tarjan},
title = {A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network},
journal = {Inf. Process. Lett.},
volume = {31},
number = {5},
pages = {265--271},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90084-7},
doi = {10.1016/0020-0190(89)90084-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GoldbergT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Goldman89,
author = {Sally A. Goldman},
title = {A Space Efficient Greedy Triangulation Algorithm},
journal = {Inf. Process. Lett.},
volume = {31},
number = {4},
pages = {191--196},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90122-1},
doi = {10.1016/0020-0190(89)90122-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Goldman89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gregori89,
author = {Angelo Gregori},
title = {Unit-Length Embedding of Binary Trees on a Square Grid},
journal = {Inf. Process. Lett.},
volume = {31},
number = {4},
pages = {167--173},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90118-X},
doi = {10.1016/0020-0190(89)90118-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gregori89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hartley89,
author = {Richard I. Hartley},
title = {Drawing Polygons Given Angle Sequences},
journal = {Inf. Process. Lett.},
volume = {31},
number = {1},
pages = {31--33},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90105-1},
doi = {10.1016/0020-0190(89)90105-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hartley89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Head89,
author = {Tom Head},
title = {Deciding the Immutability of Regular Codes and Languages Under Finite
Transductions},
journal = {Inf. Process. Lett.},
volume = {31},
number = {5},
pages = {239--241},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90080-X},
doi = {10.1016/0020-0190(89)90080-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Head89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HoL89,
author = {Chin{-}Wen Ho and
Richard C. T. Lee},
title = {Counting Clique Trees and Computing Perfect Elimination Schemes in
Parallel},
journal = {Inf. Process. Lett.},
volume = {31},
number = {2},
pages = {61--68},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90070-7},
doi = {10.1016/0020-0190(89)90070-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HoL89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HochbaumS89,
author = {Dorit S. Hochbaum and
Ron Shamir},
title = {An O(n log2 n) Algorithm for the Maximum Weighted Tardiness Problem},
journal = {Inf. Process. Lett.},
volume = {31},
number = {4},
pages = {215--219},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90126-9},
doi = {10.1016/0020-0190(89)90126-9},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HochbaumS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KamadaK89,
author = {Tomihisa Kamada and
Satoru Kawai},
title = {An Algorithm for Drawing General Undirected Graphs},
journal = {Inf. Process. Lett.},
volume = {31},
number = {1},
pages = {7--15},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90102-6},
doi = {10.1016/0020-0190(89)90102-6},
timestamp = {Fri, 14 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KamadaK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Khuller89,
author = {Samir Khuller},
title = {On Computing Graph Closures},
journal = {Inf. Process. Lett.},
volume = {31},
number = {5},
pages = {249--255},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90082-3},
doi = {10.1016/0020-0190(89)90082-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Khuller89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kotov89,
author = {Vadim E. Kotov},
title = {Andrei P. Ershov {(1931-1988)}},
journal = {Inf. Process. Lett.},
volume = {31},
number = {1},
pages = {1--2},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90100-2},
doi = {10.1016/0020-0190(89)90100-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kotov89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kumar89,
author = {Vijay Kumar},
title = {Concurrency Control on Extendible Hashing},
journal = {Inf. Process. Lett.},
volume = {31},
number = {1},
pages = {35--41},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90106-3},
doi = {10.1016/0020-0190(89)90106-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kumar89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LentfertO89,
author = {Patrick Lentfert and
Mark H. Overmars},
title = {Data Structures in a Real-Time Environment},
journal = {Inf. Process. Lett.},
volume = {31},
number = {3},
pages = {151--155},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90224-X},
doi = {10.1016/0020-0190(89)90224-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LentfertO89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Leung89,
author = {Joseph Y.{-}T. Leung},
title = {Bin Packing with Restricted Piece Sizes},
journal = {Inf. Process. Lett.},
volume = {31},
number = {3},
pages = {145--149},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90223-8},
doi = {10.1016/0020-0190(89)90223-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Leung89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuccioP89,
author = {Fabrizio Luccio and
Linda Pagli},
title = {On the Upper Bound on the Rotation Distance of Binary Trees},
journal = {Inf. Process. Lett.},
volume = {31},
number = {2},
pages = {57--60},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90069-0},
doi = {10.1016/0020-0190(89)90069-0},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LuccioP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MalhotraTK89,
author = {Vishv M. Malhotra and
T. V. To and
Kanchana Kanchanasut},
title = {An Improved Data-Dependency-Based Backtracking Scheme for Prolog},
journal = {Inf. Process. Lett.},
volume = {31},
number = {4},
pages = {185--189},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90121-X},
doi = {10.1016/0020-0190(89)90121-X},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MalhotraTK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MatsuokaKK89,
author = {Satoshi Matsuoka and
Tomihisa Kamada and
Satoru Kawai},
title = {Asymptotic Evaluation of Window Visibility},
journal = {Inf. Process. Lett.},
volume = {31},
number = {3},
pages = {119--126},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90218-4},
doi = {10.1016/0020-0190(89)90218-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MatsuokaKK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mattern89a,
author = {Friedemann Mattern},
title = {An Efficient Distributed Termination Test},
journal = {Inf. Process. Lett.},
volume = {31},
number = {4},
pages = {203--208},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90124-5},
doi = {10.1016/0020-0190(89)90124-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mattern89a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mukkamala89,
author = {Ravi Mukkamala},
title = {Some Properties of View-Based Replication Control Algorithms for Distributed
Systems},
journal = {Inf. Process. Lett.},
volume = {31},
number = {6},
pages = {295--298},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90090-2},
doi = {10.1016/0020-0190(89)90090-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mukkamala89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NagamochiI89,
author = {Hiroshi Nagamochi and
Toshihide Ibaraki},
title = {On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity
Flows in Directed Networks},
journal = {Inf. Process. Lett.},
volume = {31},
number = {6},
pages = {279--285},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90087-2},
doi = {10.1016/0020-0190(89)90087-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/NagamochiI89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Olariu89,
author = {Stephan Olariu},
title = {A Simple Linear-Time Algorithm for Computing the {RNG} and {MST} of
Unimodal Polygons},
journal = {Inf. Process. Lett.},
volume = {31},
number = {5},
pages = {243--247},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90081-1},
doi = {10.1016/0020-0190(89)90081-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Olariu89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/OlariuR89,
author = {Stephan Olariu and
J. Randall},
title = {Welsh-Powell Opposition Graphs},
journal = {Inf. Process. Lett.},
volume = {31},
number = {1},
pages = {43--46},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90107-5},
doi = {10.1016/0020-0190(89)90107-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/OlariuR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ramakrishna89,
author = {M. V. Ramakrishna},
title = {Analysis of Random Probing Hashing},
journal = {Inf. Process. Lett.},
volume = {31},
number = {2},
pages = {83--90},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90073-2},
doi = {10.1016/0020-0190(89)90073-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ramakrishna89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ramanan89,
author = {Prakash V. Ramanan},
title = {Average-Case Analysis of the Smart Next Fit Algorithm},
journal = {Inf. Process. Lett.},
volume = {31},
number = {5},
pages = {221--225},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90077-X},
doi = {10.1016/0020-0190(89)90077-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ramanan89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RobertTV89,
author = {Yves Robert and
Bernard Tourancheau and
Gilles Villard},
title = {Data Allocation Strategies for the Gauss and Jordan Algorithms on
a Ring of Processors},
journal = {Inf. Process. Lett.},
volume = {31},
number = {1},
pages = {21--29},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90104-X},
doi = {10.1016/0020-0190(89)90104-X},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/RobertTV89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rytter89,
author = {Wojciech Rytter},
title = {A Note on Optimal Parallel Transformations of Regular Expressions
to Nondeterministic Finite Automata},
journal = {Inf. Process. Lett.},
volume = {31},
number = {2},
pages = {103--109},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90076-8},
doi = {10.1016/0020-0190(89)90076-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rytter89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShihH89,
author = {Wei{-}Kuan Shih and
Wen{-}Lian Hsu},
title = {An O(n log n+m log log n) Maximum Weight Clique Algorithm for Circular-Arc
Graphs},
journal = {Inf. Process. Lett.},
volume = {31},
number = {3},
pages = {129--134},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90220-2},
doi = {10.1016/0020-0190(89)90220-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ShihH89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SkillicornB89,
author = {David B. Skillicorn and
David T. Barnard},
title = {Parallel Parsing on the Connection Machine},
journal = {Inf. Process. Lett.},
volume = {31},
number = {3},
pages = {111--117},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90217-2},
doi = {10.1016/0020-0190(89)90217-2},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SkillicornB89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Stalmarck89,
author = {Gunnar St{\aa}lmarck},
title = {A Note on the Computational Complexity of the Pure Classical Implication
Calculus},
journal = {Inf. Process. Lett.},
volume = {31},
number = {6},
pages = {277--278},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90086-0},
doi = {10.1016/0020-0190(89)90086-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Stalmarck89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Stewart89,
author = {Iain A. Stewart},
title = {An Algorithm for Colouring Perfect Planar Graphs},
journal = {Inf. Process. Lett.},
volume = {31},
number = {2},
pages = {97--101},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90075-6},
doi = {10.1016/0020-0190(89)90075-6},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Stewart89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sundar89,
author = {R. Sundar},
title = {Worst-Case Data Structures for the Priority Queue with Attrition},
journal = {Inf. Process. Lett.},
volume = {31},
number = {2},
pages = {69--75},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90071-9},
doi = {10.1016/0020-0190(89)90071-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sundar89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TelM89,
author = {Gerard Tel and
Friedemann Mattern},
title = {Comments on "Ring Based Termination Detection Algorithm for Distributed
Computations"},
journal = {Inf. Process. Lett.},
volume = {31},
number = {3},
pages = {127--128},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90219-6},
doi = {10.1016/0020-0190(89)90219-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TelM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsitsiklis89,
author = {John N. Tsitsiklis},
title = {On the Use of Random Numbers in Asynchronous Simulation via Rollback},
journal = {Inf. Process. Lett.},
volume = {31},
number = {3},
pages = {139--144},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90222-6},
doi = {10.1016/0020-0190(89)90222-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tsitsiklis89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Varma89,
author = {Anujan Varma},
title = {Fault-Tolerant Routing in Unique-Path Multistage Interconnection Networks},
journal = {Inf. Process. Lett.},
volume = {31},
number = {4},
pages = {197--201},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90123-3},
doi = {10.1016/0020-0190(89)90123-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Varma89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wu89,
author = {Xiaolin Wu},
title = {Fast Approximations to Discrete Optimal Quantization},
journal = {Inf. Process. Lett.},
volume = {31},
number = {4},
pages = {175--179},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90119-1},
doi = {10.1016/0020-0190(89)90119-1},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wu89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Yoccoz89,
author = {Serge Yoccoz},
title = {Recursive (omega)o-Rule for Proof Systems},
journal = {Inf. Process. Lett.},
volume = {31},
number = {6},
pages = {291--294},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90089-6},
doi = {10.1016/0020-0190(89)90089-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Yoccoz89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Yu89,
author = {Sheng Yu},
title = {A Pumping Lemma for Deterministic Context-Free Languages},
journal = {Inf. Process. Lett.},
volume = {31},
number = {1},
pages = {47--51},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90108-7},
doi = {10.1016/0020-0190(89)90108-7},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Yu89.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-04-30 14:04 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:
