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/ipl32.bht:"
download as .bib file
@article{DBLP:journals/ipl/Abiteboul89,
author = {Serge Abiteboul},
title = {Boundedness is Undecidable for Datalog Programs with a Single Recursive
Rule},
journal = {Inf. Process. Lett.},
volume = {32},
number = {6},
pages = {281--287},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90019-7},
doi = {10.1016/0020-0190(89)90019-7},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Abiteboul89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AbiteboulGG89,
author = {Serge Abiteboul and
Marc Gyssens and
Dirk Van Gucht},
title = {An Alternative Way to Represent the Cogroup of a Relation in the Context
of Nested Databases},
journal = {Inf. Process. Lett.},
volume = {32},
number = {6},
pages = {317--324},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90025-2},
doi = {10.1016/0020-0190(89)90025-2},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AbiteboulGG89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Alblas89,
author = {Henk Alblas},
title = {Optimal Incremental Simple Multi-Pass Attribute Evaluation},
journal = {Inf. Process. Lett.},
volume = {32},
number = {6},
pages = {289--295},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90020-3},
doi = {10.1016/0020-0190(89)90020-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Alblas89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AtallahC89,
author = {Mikhail J. Atallah and
Danny Z. Chen},
title = {An Optimal Parallel Algorithm for the Minimum Circle-Cover Problem},
journal = {Inf. Process. Lett.},
volume = {32},
number = {4},
pages = {159--165},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90037-9},
doi = {10.1016/0020-0190(89)90037-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AtallahC89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BaronU89,
author = {Gerd Baron and
Friedrich J. Urbanek},
title = {Factorial Languages with Quadratically Upper Bounded Growth Functions
and Nonlinearly Upper Bounded Subword Complexities},
journal = {Inf. Process. Lett.},
volume = {32},
number = {5},
pages = {267--269},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90055-0},
doi = {10.1016/0020-0190(89)90055-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BaronU89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BarringtonC89,
author = {David A. Mix Barrington and
James C. Corbett},
title = {On the Relative Complexity of Some Languages in {NC}},
journal = {Inf. Process. Lett.},
volume = {32},
number = {5},
pages = {251--256},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90052-5},
doi = {10.1016/0020-0190(89)90052-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BarringtonC89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BernP89,
author = {Marshall W. Bern and
Paul E. Plassmann},
title = {The Steiner Problem with Edge Lengths 1 and 2},
journal = {Inf. Process. Lett.},
volume = {32},
number = {4},
pages = {171--176},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90039-2},
doi = {10.1016/0020-0190(89)90039-2},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BernP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Biskup89,
author = {Joachim Biskup},
title = {Boyce-Codd Normal Form and Object Normal Forms},
journal = {Inf. Process. Lett.},
volume = {32},
number = {1},
pages = {29--33},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90065-3},
doi = {10.1016/0020-0190(89)90065-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Biskup89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BlassG89,
author = {Andreas Blass and
Yuri Gurevich},
title = {On Matijasevitch's Nontraditional Approach to Search Problems},
journal = {Inf. Process. Lett.},
volume = {32},
number = {1},
pages = {41--45},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90067-7},
doi = {10.1016/0020-0190(89)90067-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BlassG89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bos89,
author = {Jan van den Bos},
title = {{PROCOL:} {A} Protocol-Constrained Concurrent Object-Oriented Language},
journal = {Inf. Process. Lett.},
volume = {32},
number = {5},
pages = {221--227},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90047-1},
doi = {10.1016/0020-0190(89)90047-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bos89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BoxerM89,
author = {Laurence Boxer and
Russ Miller},
title = {A Parallel Circle-Cover Minimization Algorithm},
journal = {Inf. Process. Lett.},
volume = {32},
number = {2},
pages = {57--60},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90031-8},
doi = {10.1016/0020-0190(89)90031-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BoxerM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChakrabartiGPS89a,
author = {P. P. Chakrabarti and
Sujoy Ghose and
A. Pandey and
S. C. De Sarkar},
title = {Increasing Search Efficiency Using Multiple Heuristics},
journal = {Inf. Process. Lett.},
volume = {32},
number = {5},
pages = {275},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90057-4},
doi = {10.1016/0020-0190(89)90057-4},
timestamp = {Mon, 07 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChakrabartiGPS89a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenYC89,
author = {Y. C. Chen and
Z. C. Yen and
G. H. Chen},
title = {Using Fewer Processors to Reduce Time Complexities of Semigroup Computations},
journal = {Inf. Process. Lett.},
volume = {32},
number = {2},
pages = {89--93},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90036-7},
doi = {10.1016/0020-0190(89)90036-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenYC89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChernCL89,
author = {Maw{-}Sheng Chern and
Gen{-}Huey Chen and
Pangfeng Liu},
title = {An {LC} Branch-and-Branch Algorithm for the Module Assignment Problem},
journal = {Inf. Process. Lett.},
volume = {32},
number = {2},
pages = {61--71},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90032-X},
doi = {10.1016/0020-0190(89)90032-X},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChernCL89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChestonFHP89,
author = {Grant A. Cheston and
Arthur M. Farley and
Stephen T. Hedetniemi and
Andrzej Proskurowski},
title = {Centering a Spanning Tree of a Biconnected Graph},
journal = {Inf. Process. Lett.},
volume = {32},
number = {5},
pages = {247--250},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90051-3},
doi = {10.1016/0020-0190(89)90051-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChestonFHP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChoiK89,
author = {Hwang Kyu Choi and
Myunghwan Kim},
title = {Hybrid Join: An Improved Sort-Based Join Algorithm},
journal = {Inf. Process. Lett.},
volume = {32},
number = {2},
pages = {51--56},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90030-6},
doi = {10.1016/0020-0190(89)90030-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChoiK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ClouatreLM89,
author = {A. Clouatre and
Normand Laliberte and
T. H. Merrett},
title = {A General Implementation of Relational Recursion with Speedup Techniques
for Programmers},
journal = {Inf. Process. Lett.},
volume = {32},
number = {5},
pages = {257--262},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90053-7},
doi = {10.1016/0020-0190(89)90053-7},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ClouatreLM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CullH89,
author = {Paul Cull and
James L. Holloway},
title = {Computing fibonacci numbers quickly},
journal = {Inf. Process. Lett.},
volume = {32},
number = {3},
pages = {143--149},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90015-X},
doi = {10.1016/0020-0190(89)90015-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CullH89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Damaschke89,
author = {Peter Damaschke},
title = {The Hamiltonian Circuit Problem for Circle Graphs is NP-Complete},
journal = {Inf. Process. Lett.},
volume = {32},
number = {1},
pages = {1--2},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90059-8},
doi = {10.1016/0020-0190(89)90059-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Damaschke89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DemolombeI89,
author = {Robert Demolombe and
Arantza Illarramendi},
title = {Heuristics for Syntactial Optimization of Relational Queries},
journal = {Inf. Process. Lett.},
volume = {32},
number = {6},
pages = {313--316},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90024-0},
doi = {10.1016/0020-0190(89)90024-0},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DemolombeI89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DrysdaleJ89,
author = {Robert L. (Scot) Drysdale III and
Jerzy W. Jaromczyk},
title = {A Note on Lower Bounds for the Maximum Area and Maximum Perimeter
(kappa)k-gon Problems},
journal = {Inf. Process. Lett.},
volume = {32},
number = {6},
pages = {301--303},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90022-7},
doi = {10.1016/0020-0190(89)90022-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DrysdaleJ89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EgeciogluK89,
author = {{\"{O}}mer Egecioglu and
Bahman Kalantari},
title = {Approximating the Diameter of a Set of Points in the Euclidean Space},
journal = {Inf. Process. Lett.},
volume = {32},
number = {4},
pages = {205--211},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90045-8},
doi = {10.1016/0020-0190(89)90045-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EgeciogluK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EllisMM89,
author = {John A. Ellis and
Manrique Mata and
Gary MacGillivray},
title = {A Linear Time Algorithm for Longest (s,t)-Paths in Weighted Outer
Planar Graphs},
journal = {Inf. Process. Lett.},
volume = {32},
number = {4},
pages = {199--204},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90044-6},
doi = {10.1016/0020-0190(89)90044-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EllisMM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EverettG89,
author = {Hazel Everett and
A. Gupta},
title = {Acyclic Directed Hypercubes may have Exponential Diameter},
journal = {Inf. Process. Lett.},
volume = {32},
number = {5},
pages = {243--245},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90050-1},
doi = {10.1016/0020-0190(89)90050-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EverettG89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FeitelsonR89,
author = {Dror G. Feitelson and
Larry Rudolph},
title = {Implementation of a Wait-Free Synchronization Primitive that Solves
n-Process Consensus},
journal = {Inf. Process. Lett.},
volume = {32},
number = {2},
pages = {81--83},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90034-3},
doi = {10.1016/0020-0190(89)90034-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FeitelsonR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Francez89,
author = {Nissim Francez},
title = {Cooperating Proofs for Distributed Programs with Multiparty Interactions},
journal = {Inf. Process. Lett.},
volume = {32},
number = {5},
pages = {235--242},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90049-5},
doi = {10.1016/0020-0190(89)90049-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Francez89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GibbonsS89,
author = {Alan Gibbons and
Y. N. Srikant},
title = {A Class of Problems Efficiently Solvable on Mesh-Connected Computers
Including Dynamic Expression Evaluation},
journal = {Inf. Process. Lett.},
volume = {32},
number = {6},
pages = {305--311},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90023-9},
doi = {10.1016/0020-0190(89)90023-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GibbonsS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Goscinski89,
author = {Andrzej M. Goscinski},
title = {A synchronization algorithm for processes with dynamic priorities
in computer networks with node failures},
journal = {Inf. Process. Lett.},
volume = {32},
number = {3},
pages = {129--136},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90013-6},
doi = {10.1016/0020-0190(89)90013-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Goscinski89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gunther89,
author = {Neil J. Gunther},
title = {Path Integral Methods for Computer Performance Analysis},
journal = {Inf. Process. Lett.},
volume = {32},
number = {1},
pages = {7--13},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90061-6},
doi = {10.1016/0020-0190(89)90061-6},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gunther89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hagerup89,
author = {Torben Hagerup},
title = {Hybridsort Revisited and Parallelized},
journal = {Inf. Process. Lett.},
volume = {32},
number = {1},
pages = {35--39},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90066-5},
doi = {10.1016/0020-0190(89)90066-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hagerup89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Huang89,
author = {Shing{-}Tsaan Huang},
title = {Termination detection by using distributed snapshots},
journal = {Inf. Process. Lett.},
volume = {32},
number = {3},
pages = {113--119},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90010-0},
doi = {10.1016/0020-0190(89)90010-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Huang89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Iwano89,
author = {Kazuo Iwano},
title = {An Improvement of Goldberg, Plotkin and Vaidya's Maximal Node-Disjoint
Paths Algorithm},
journal = {Inf. Process. Lett.},
volume = {32},
number = {1},
pages = {25--27},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90064-1},
doi = {10.1016/0020-0190(89)90064-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Iwano89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Janiak89,
author = {Adam Janiak},
title = {Minimization of resource consumption under a given deadline in the
two-processor flow-shop scheduling problem},
journal = {Inf. Process. Lett.},
volume = {32},
number = {3},
pages = {101--112},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90009-4},
doi = {10.1016/0020-0190(89)90009-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Janiak89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kemp89,
author = {Rainer Kemp},
title = {A One-to-One Correspondence between two Classes of Ordered Trees},
journal = {Inf. Process. Lett.},
volume = {32},
number = {5},
pages = {229--234},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90048-3},
doi = {10.1016/0020-0190(89)90048-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kemp89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KimK89,
author = {Young J. Kim and
Gil C. Kim},
title = {Coordinator: {A} Modification to the Monitor Concept},
journal = {Inf. Process. Lett.},
volume = {32},
number = {2},
pages = {73--80},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90033-1},
doi = {10.1016/0020-0190(89)90033-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KimK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kochol89,
author = {Martin Kochol},
title = {Efficient monotone circuits for threshold functions},
journal = {Inf. Process. Lett.},
volume = {32},
number = {3},
pages = {121--122},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90011-2},
doi = {10.1016/0020-0190(89)90011-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kochol89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LaihLH89,
author = {Chi{-}Sung Laih and
Jau{-}Yien Lee and
Lein Harn},
title = {A new threshold scheme and its application in designing the conference
key distribution cryptosystem},
journal = {Inf. Process. Lett.},
volume = {32},
number = {3},
pages = {95--99},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90008-2},
doi = {10.1016/0020-0190(89)90008-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LaihLH89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LigozatB89,
author = {Gerard Ligozat and
Helene Bestougeff},
title = {On Relations Between Intervals},
journal = {Inf. Process. Lett.},
volume = {32},
number = {4},
pages = {177--182},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90040-9},
doi = {10.1016/0020-0190(89)90040-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LigozatB89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lingas89,
author = {Andrzej Lingas},
title = {Voronoi Diagrams with Barriers and the Shortest Diagonal Problem},
journal = {Inf. Process. Lett.},
volume = {32},
number = {4},
pages = {191--198},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90043-4},
doi = {10.1016/0020-0190(89)90043-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lingas89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lloyd89,
author = {Errol L. Lloyd},
title = {A Fast Algorithm for Finding Interlocking Sets},
journal = {Inf. Process. Lett.},
volume = {32},
number = {1},
pages = {47--50},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90068-9},
doi = {10.1016/0020-0190(89)90068-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lloyd89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Makinen89,
author = {Erkki M{\"{a}}kinen},
title = {On the Subtree Isomorphism Problem for Ordered Trees},
journal = {Inf. Process. Lett.},
volume = {32},
number = {5},
pages = {271--273},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90056-2},
doi = {10.1016/0020-0190(89)90056-2},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Makinen89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Matousek89,
author = {Jir{\'{\i}} Matousek},
title = {On-Line Computation of Convolutions},
journal = {Inf. Process. Lett.},
volume = {32},
number = {1},
pages = {15--16},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90062-8},
doi = {10.1016/0020-0190(89)90062-8},
timestamp = {Thu, 24 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Matousek89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Morris89,
author = {Joseph M. Morris},
title = {Well-founded induction and the invariance theorem for loops},
journal = {Inf. Process. Lett.},
volume = {32},
number = {3},
pages = {155--158},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90017-3},
doi = {10.1016/0020-0190(89)90017-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Morris89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Narasimhan89,
author = {Giri Narasimhan},
title = {A Note on the Hamiltonian Circuit Problem on Directed Path Graphs},
journal = {Inf. Process. Lett.},
volume = {32},
number = {4},
pages = {167--170},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90038-0},
doi = {10.1016/0020-0190(89)90038-0},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Narasimhan89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PadbergS89,
author = {Manfred Padberg and
Antonio Sassano},
title = {The Complexity of Matching with Bonds},
journal = {Inf. Process. Lett.},
volume = {32},
number = {6},
pages = {297--300},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90021-5},
doi = {10.1016/0020-0190(89)90021-5},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PadbergS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RichardsonG89,
author = {Stephen Richardson and
Mahadevan Ganapathi},
title = {Interprocedural analysis vs. procedure integration},
journal = {Inf. Process. Lett.},
volume = {32},
number = {3},
pages = {137--142},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90014-8},
doi = {10.1016/0020-0190(89)90014-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RichardsonG89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Roberts89,
author = {George H. Roberts},
title = {Another Note on Recursive Ascent},
journal = {Inf. Process. Lett.},
volume = {32},
number = {5},
pages = {263--266},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90054-9},
doi = {10.1016/0020-0190(89)90054-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Roberts89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SagarSA89,
author = {G. Sagar and
Anil K. Sarje and
Kamal U. Ahmed},
title = {On module assignment in two-processor distributed systems: a modified
algorithm},
journal = {Inf. Process. Lett.},
volume = {32},
number = {3},
pages = {151--153},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90016-1},
doi = {10.1016/0020-0190(89)90016-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SagarSA89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sandhu89a,
author = {Ravi S. Sandhu},
title = {The Demand Operation in the Schematic Protection Model},
journal = {Inf. Process. Lett.},
volume = {32},
number = {4},
pages = {213--219},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90046-X},
doi = {10.1016/0020-0190(89)90046-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sandhu89a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SarkarS89,
author = {Dilip Sarkar and
Ivan Stojmenovic},
title = {An Optimal Parallel Circle-Cover Algorithm},
journal = {Inf. Process. Lett.},
volume = {32},
number = {1},
pages = {3--6},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90060-4},
doi = {10.1016/0020-0190(89)90060-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SarkarS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sharir89,
author = {Micha Sharir},
title = {A Note on the Papadimitriou-Silverberg Algorithm for Planning Optimal
Piecewise-Linear Motion of a Ladder},
journal = {Inf. Process. Lett.},
volume = {32},
number = {4},
pages = {187--190},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90042-2},
doi = {10.1016/0020-0190(89)90042-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sharir89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SharmaI89,
author = {Mohan B. Sharma and
S. Sitharama Iyengar},
title = {An Efficient Distributed Depth-First-Search Algorithm},
journal = {Inf. Process. Lett.},
volume = {32},
number = {4},
pages = {183--186},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90041-0},
doi = {10.1016/0020-0190(89)90041-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SharmaI89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shiraishi89,
author = {Shuji Shiraishi},
title = {A Parallel Algorithm for the Maximum 2-Chain Edge Packing Problem},
journal = {Inf. Process. Lett.},
volume = {32},
number = {6},
pages = {277--279},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90018-5},
doi = {10.1016/0020-0190(89)90018-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shiraishi89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sistla89,
author = {A. Prasad Sistla},
title = {On Verifying that a Concurrent Program Satisfies a Nondeterministic
Specification},
journal = {Inf. Process. Lett.},
volume = {32},
number = {1},
pages = {17--23},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90063-X},
doi = {10.1016/0020-0190(89)90063-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sistla89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Skiena89,
author = {Steven Skiena},
title = {Reconstructing graphs from cut-set sizes},
journal = {Inf. Process. Lett.},
volume = {32},
number = {3},
pages = {123--127},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90012-4},
doi = {10.1016/0020-0190(89)90012-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Skiena89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Toyama89,
author = {Yoshihito Toyama},
title = {Fast Knuth-Bendix Completion with a Term Rewriting System Compiler},
journal = {Inf. Process. Lett.},
volume = {32},
number = {6},
pages = {325--328},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90026-4},
doi = {10.1016/0020-0190(89)90026-4},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Toyama89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wolfram89,
author = {David A. Wolfram},
title = {Forward Checking and Intelligent Backtracking},
journal = {Inf. Process. Lett.},
volume = {32},
number = {2},
pages = {85--87},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90035-5},
doi = {10.1016/0020-0190(89)90035-5},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Wolfram89.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-29 02:50 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:
