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/ipl26.bht:"
download as .bib file
@article{DBLP:journals/ipl/Arbib88,
author = {Claudio Arbib},
title = {A Polynomial Characterization of Some Graph Partitioning Problems},
journal = {Inf. Process. Lett.},
volume = {26},
number = {5},
pages = {223--230},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90144-5},
doi = {10.1016/0020-0190(88)90144-5},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Arbib88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BezemL88,
author = {Marc Bezem and
Jan van Leeuwen},
title = {On Estimating the Complexity of Logarithmic Decompositions},
journal = {Inf. Process. Lett.},
volume = {26},
number = {6},
pages = {321--324},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90190-1},
doi = {10.1016/0020-0190(88)90190-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BezemL88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chan88,
author = {Tat{-}hung Chan},
title = {The Boundedness Problem for Three-Dimensional Vector Addition Systems
with States},
journal = {Inf. Process. Lett.},
volume = {26},
number = {6},
pages = {287--289},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90184-6},
doi = {10.1016/0020-0190(88)90184-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chan88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cidon88,
author = {Israel Cidon},
title = {Yet Another Distributed Depth-First-Search Algorithm},
journal = {Inf. Process. Lett.},
volume = {26},
number = {6},
pages = {301--305},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90187-1},
doi = {10.1016/0020-0190(88)90187-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Cidon88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cole88,
author = {Richard J. Cole},
title = {An Optimally Efficient Selection Algorithm},
journal = {Inf. Process. Lett.},
volume = {26},
number = {6},
pages = {295--299},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90186-X},
doi = {10.1016/0020-0190(88)90186-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Cole88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cook88,
author = {Stephen A. Cook},
title = {Short Propositional Formulas Represent Nondeterministic Computations},
journal = {Inf. Process. Lett.},
volume = {26},
number = {5},
pages = {269--270},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90152-4},
doi = {10.1016/0020-0190(88)90152-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Cook88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CulikK88,
author = {Karel Cul{\'{\i}}k II and
Juhani Karhum{\"{a}}ki},
title = {On Totalistic Systolic Networks},
journal = {Inf. Process. Lett.},
volume = {26},
number = {5},
pages = {231--236},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90145-7},
doi = {10.1016/0020-0190(88)90145-7},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CulikK88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Czaja88,
author = {Ludwik Czaja},
title = {Cause-Effect Structures},
journal = {Inf. Process. Lett.},
volume = {26},
number = {6},
pages = {313--319},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90189-5},
doi = {10.1016/0020-0190(88)90189-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Czaja88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Dymond88,
author = {Patrick W. Dymond},
title = {Input-Driven Languages are in log n Depth},
journal = {Inf. Process. Lett.},
volume = {26},
number = {5},
pages = {247--250},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90148-2},
doi = {10.1016/0020-0190(88)90148-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Dymond88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gilbert88,
author = {John R. Gilbert},
title = {Some Nested Dissection Order is Nearly Optimal},
journal = {Inf. Process. Lett.},
volume = {26},
number = {6},
pages = {325--328},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90191-3},
doi = {10.1016/0020-0190(88)90191-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gilbert88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GopalakrishnanS88,
author = {Ganesh Gopalakrishnan and
Mandayam K. Srivas},
title = {Implementing Functional Programs Using Mutable Abstract Data Types},
journal = {Inf. Process. Lett.},
volume = {26},
number = {6},
pages = {277--286},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90183-4},
doi = {10.1016/0020-0190(88)90183-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GopalakrishnanS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HinrichsNS88,
author = {Klaus H. Hinrichs and
J{\"{u}}rg Nievergelt and
Peter Schorn},
title = {Plane-Sweep Solves the Closest Pair Problem Elegantly},
journal = {Inf. Process. Lett.},
volume = {26},
number = {5},
pages = {255--261},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90150-0},
doi = {10.1016/0020-0190(88)90150-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HinrichsNS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KarlssonO88,
author = {Rolf G. Karlsson and
Mark H. Overmars},
title = {Normalized Divide-and-Conquer: {A} Scaling Technique for Solving Multi-Dimensional
Problems},
journal = {Inf. Process. Lett.},
volume = {26},
number = {6},
pages = {307--312},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90188-3},
doi = {10.1016/0020-0190(88)90188-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KarlssonO88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MaggsP88,
author = {Bruce M. Maggs and
Serge A. Plotkin},
title = {Minimum-Cost Spanning Tree as a Path-Finding Problem},
journal = {Inf. Process. Lett.},
volume = {26},
number = {6},
pages = {291--293},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90185-8},
doi = {10.1016/0020-0190(88)90185-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MaggsP88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Makinen88,
author = {Erkki M{\"{a}}kinen},
title = {On the Rotation Distance of Binary Trees},
journal = {Inf. Process. Lett.},
volume = {26},
number = {5},
pages = {271--272},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90153-6},
doi = {10.1016/0020-0190(88)90153-6},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Makinen88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Morgan88,
author = {Carroll Morgan},
title = {Data Refinement by Miracles},
journal = {Inf. Process. Lett.},
volume = {26},
number = {5},
pages = {243--246},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90147-0},
doi = {10.1016/0020-0190(88)90147-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Morgan88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Seiferas88,
author = {Joel I. Seiferas},
title = {A Variant of Ben-Or's Lower Bound for Algebraic Decision Trees},
journal = {Inf. Process. Lett.},
volume = {26},
number = {5},
pages = {273--276},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90154-8},
doi = {10.1016/0020-0190(88)90154-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Seiferas88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sieminski88,
author = {Andrzej Sieminski},
title = {Fast Decoding of the Huffman Codes},
journal = {Inf. Process. Lett.},
volume = {26},
number = {5},
pages = {237--241},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90146-9},
doi = {10.1016/0020-0190(88)90146-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sieminski88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Soisalon-SoininenT88,
author = {Eljas Soisalon{-}Soininen and
Jorma Tarhio},
title = {Looping {LR} Parsers},
journal = {Inf. Process. Lett.},
volume = {26},
number = {5},
pages = {251--253},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90149-4},
doi = {10.1016/0020-0190(88)90149-4},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Soisalon-SoininenT88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VelK88,
author = {Olivier Y. de Vel and
E. V. Krishnamurthy},
title = {An Iterative Pipelined Array Architecture for the Generalized Matrix
Inversion},
journal = {Inf. Process. Lett.},
volume = {26},
number = {5},
pages = {263--267},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90151-2},
doi = {10.1016/0020-0190(88)90151-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/VelK88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ApostolicoH87,
author = {Alberto Apostolico and
Susanne E. Hambrusch},
title = {Finding Maximum Cliques on Circular-Arc Graphs},
journal = {Inf. Process. Lett.},
volume = {26},
number = {4},
pages = {209--215},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90007-X},
doi = {10.1016/0020-0190(87)90007-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ApostolicoH87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AptBC87,
author = {Krzysztof R. Apt and
Luc Boug{\'{e}} and
Philippe Clermont},
title = {Two Normal Form Theorems for {CSP} Programs},
journal = {Inf. Process. Lett.},
volume = {26},
number = {4},
pages = {165--171},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90001-9},
doi = {10.1016/0020-0190(87)90001-9},
timestamp = {Fri, 20 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AptBC87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Babai87,
author = {L{\'{a}}szl{\'{o}} Babai},
title = {Random Oracles Separate {PSPACE} from the Polynomial-Time Hierarchy},
journal = {Inf. Process. Lett.},
volume = {26},
number = {1},
pages = {51--53},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90036-6},
doi = {10.1016/0020-0190(87)90036-6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Babai87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BaleanuT87,
author = {Cristian Baleanu and
Dan Tomescu},
title = {An Architecture for Symbolic Processing},
journal = {Inf. Process. Lett.},
volume = {26},
number = {4},
pages = {217--222},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90008-1},
doi = {10.1016/0020-0190(87)90008-1},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BaleanuT87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BermondFJ87,
author = {Jean{-}Claude Bermond and
Jean{-}Michel Fourneau and
Alain Jean{-}Marie},
title = {Equivalence of Multistage Interconnection Networks},
journal = {Inf. Process. Lett.},
volume = {26},
number = {1},
pages = {45--50},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90035-4},
doi = {10.1016/0020-0190(87)90035-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BermondFJ87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BerstelB87,
author = {Jean Berstel and
Srecko Brlek},
title = {On the Length of Word Chains},
journal = {Inf. Process. Lett.},
volume = {26},
number = {1},
pages = {23--28},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90031-7},
doi = {10.1016/0020-0190(87)90031-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BerstelB87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Berztiss87,
author = {Alfs T. Berztiss},
title = {A Notation for Distributed Operations},
journal = {Inf. Process. Lett.},
volume = {26},
number = {1},
pages = {19--21},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90030-5},
doi = {10.1016/0020-0190(87)90030-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Berztiss87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BookL87,
author = {Ronald V. Book and
Hai{-}Ning Liu},
title = {Rewriting Systems and Word Problems in a Free Partially Commutative
Monoid},
journal = {Inf. Process. Lett.},
volume = {26},
number = {1},
pages = {29--32},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90032-9},
doi = {10.1016/0020-0190(87)90032-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BookL87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Carlsson87a,
author = {Svante Carlsson},
title = {The Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues},
journal = {Inf. Process. Lett.},
volume = {26},
number = {1},
pages = {33--36},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90033-0},
doi = {10.1016/0020-0190(87)90033-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Carlsson87a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DriscollLF87,
author = {James R. Driscoll and
Sheau{-}Dong Lang and
LeRoy A. Franklin},
title = {Modeling B-Tree Insertion Activity},
journal = {Inf. Process. Lett.},
volume = {26},
number = {1},
pages = {5--18},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90029-9},
doi = {10.1016/0020-0190(87)90029-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DriscollLF87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FellowsL87,
author = {Michael R. Fellows and
Michael A. Langston},
title = {Nonconstructive Advances in Polynomial-Time Complexity},
journal = {Inf. Process. Lett.},
volume = {26},
number = {3},
pages = {155--162},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90054-8},
doi = {10.1016/0020-0190(87)90054-8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FellowsL87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GalilY87,
author = {Zvi Galil and
Moti Yung},
title = {Partitioned Encryption and Achieving Simultaneity by Partitioning},
journal = {Inf. Process. Lett.},
volume = {26},
number = {2},
pages = {81--88},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90042-1},
doi = {10.1016/0020-0190(87)90042-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GalilY87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Goodrich87,
author = {Michael T. Goodrich},
title = {Finding the Convex Hull of a Sorted Point Set in Parallel},
journal = {Inf. Process. Lett.},
volume = {26},
number = {4},
pages = {173--179},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90002-0},
doi = {10.1016/0020-0190(87)90002-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Goodrich87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuntzerP87,
author = {Ulrich G{\"{u}}ntzer and
Manfred Paul},
title = {Jump Interpolation Search Trees and Symmetric Binary Numbers},
journal = {Inf. Process. Lett.},
volume = {26},
number = {4},
pages = {193--204},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90005-6},
doi = {10.1016/0020-0190(87)90005-6},
timestamp = {Fri, 09 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GuntzerP87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuptaH87,
author = {Ajay K. Gupta and
Susanne E. Hambrusch},
title = {Optimal Three-Dimensional Layouts of Complete Binary Trees},
journal = {Inf. Process. Lett.},
volume = {26},
number = {2},
pages = {99--104},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90045-7},
doi = {10.1016/0020-0190(87)90045-7},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GuptaH87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hastad87,
author = {Johan H{\aa}stad},
title = {One-Way Permutations in {NC0}},
journal = {Inf. Process. Lett.},
volume = {26},
number = {3},
pages = {153--155},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90053-6},
doi = {10.1016/0020-0190(87)90053-6},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Hastad87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hou87,
author = {Y. Hou},
title = {Trinity Algebra and its Application to Machine Decompositions},
journal = {Inf. Process. Lett.},
volume = {26},
number = {3},
pages = {127--134},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90050-0},
doi = {10.1016/0020-0190(87)90050-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hou87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IncerpiS87,
author = {Janet Incerpi and
Robert Sedgewick},
title = {Practical Variations of Shellsort},
journal = {Inf. Process. Lett.},
volume = {26},
number = {1},
pages = {37--43},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90034-2},
doi = {10.1016/0020-0190(87)90034-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IncerpiS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JaumardS87,
author = {Brigitte Jaumard and
Bruno Simeone},
title = {On the Complexity of the Maximum Satisfiability Problem for Horn Formulas},
journal = {Inf. Process. Lett.},
volume = {26},
number = {1},
pages = {1--4},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90028-7},
doi = {10.1016/0020-0190(87)90028-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JaumardS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Magott87,
author = {Jan Magott},
title = {Performance Evaluation of Concurrent Systems Using Conflict-Free and
Persistent Petri Nets},
journal = {Inf. Process. Lett.},
volume = {26},
number = {2},
pages = {77--80},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90041-X},
doi = {10.1016/0020-0190(87)90041-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Magott87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Martin87,
author = {Ursula Martin},
title = {Extension Functions for Multiset Orderings},
journal = {Inf. Process. Lett.},
volume = {26},
number = {4},
pages = {181--186},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90003-2},
doi = {10.1016/0020-0190(87)90003-2},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Martin87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MathieuPY87,
author = {Claire Mathieu and
Claude Puech and
Hossein Yahia},
title = {Average Efficiency of Data Structures for Binary Image Processing},
journal = {Inf. Process. Lett.},
volume = {26},
number = {2},
pages = {89--93},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90043-3},
doi = {10.1016/0020-0190(87)90043-3},
timestamp = {Thu, 16 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MathieuPY87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MetivierO87,
author = {Yves M{\'{e}}tivier and
Edward Ochmanski},
title = {On Lexicographic Semi-Commutations},
journal = {Inf. Process. Lett.},
volume = {26},
number = {2},
pages = {55--59},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90037-8},
doi = {10.1016/0020-0190(87)90037-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MetivierO87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mirzaian87,
author = {Andranik Mirzaian},
title = {A Halving Technique for the Longest Stuttering Subsequence Problem},
journal = {Inf. Process. Lett.},
volume = {26},
number = {2},
pages = {71--75},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90040-8},
doi = {10.1016/0020-0190(87)90040-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mirzaian87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MoranW87,
author = {Shlomo Moran and
Yaron Wolfstahl},
title = {Extended Impossibility Results for Asynchronous Complete Networks},
journal = {Inf. Process. Lett.},
volume = {26},
number = {3},
pages = {145--151},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90052-4},
doi = {10.1016/0020-0190(87)90052-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MoranW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PinterW87,
author = {Shlomit S. Pinter and
Yaron Wolfstahl},
title = {Embedding Ternary Trees in {VLSI} Arrays},
journal = {Inf. Process. Lett.},
volume = {26},
number = {4},
pages = {187--191},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90004-4},
doi = {10.1016/0020-0190(87)90004-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PinterW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rusinowitch87,
author = {Micha{\"{e}}l Rusinowitch},
title = {On Termination of the Direct Sum of Term-Rewriting Systems},
journal = {Inf. Process. Lett.},
volume = {26},
number = {2},
pages = {65--70},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90039-1},
doi = {10.1016/0020-0190(87)90039-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rusinowitch87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SajeevO87,
author = {A. S. M. Sajeev and
J. Olszewski},
title = {Manipulation of Data Structures Without Pointers},
journal = {Inf. Process. Lett.},
volume = {26},
number = {3},
pages = {135--143},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90051-2},
doi = {10.1016/0020-0190(87)90051-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SajeevO87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShenE87,
author = {Xiaojun Shen and
Herbert Edelsbrunner},
title = {A Tight Lower Bound on the Size of Visibility Graphs},
journal = {Inf. Process. Lett.},
volume = {26},
number = {2},
pages = {61--64},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90038-X},
doi = {10.1016/0020-0190(87)90038-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ShenE87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SubramanianSA87,
author = {K. G. Subramanian and
Rani Siromoney and
P. J. Abisha},
title = {A {D0L-T0L} Public Key Cryptosystem},
journal = {Inf. Process. Lett.},
volume = {26},
number = {2},
pages = {95--97},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90044-5},
doi = {10.1016/0020-0190(87)90044-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SubramanianSA87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SykoraV87,
author = {Ondrej S{\'{y}}kora and
Imrich Vrto},
title = {Tight Chip Area Lower Bounds for String Matching},
journal = {Inf. Process. Lett.},
volume = {26},
number = {3},
pages = {117--119},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90048-2},
doi = {10.1016/0020-0190(87)90048-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SykoraV87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Szalas87,
author = {Andrzej Szalas},
title = {Arithmetical Axiomatization of First-Order Temporal Logic},
journal = {Inf. Process. Lett.},
volume = {26},
number = {3},
pages = {111--116},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90047-0},
doi = {10.1016/0020-0190(87)90047-0},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Szalas87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Takaoka87,
author = {Tadao Takaoka},
title = {A Decomposition Rule for the Hoare Logic},
journal = {Inf. Process. Lett.},
volume = {26},
number = {4},
pages = {205--208},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90006-8},
doi = {10.1016/0020-0190(87)90006-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Takaoka87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ThazhuthaveetilP87,
author = {Matthew Thazhuthaveetil and
Andrew R. Pleszkun},
title = {On the Structural Locality of Reference in {LISP} List Access Streams},
journal = {Inf. Process. Lett.},
volume = {26},
number = {2},
pages = {105--110},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90046-9},
doi = {10.1016/0020-0190(87)90046-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ThazhuthaveetilP87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhuLS87,
author = {M. Zhu and
Nan K. Loh and
Pepe Siy},
title = {Towards the Minimum Set of Primitive Relations in Temporal Logic},
journal = {Inf. Process. Lett.},
volume = {26},
number = {3},
pages = {121--126},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90049-4},
doi = {10.1016/0020-0190(87)90049-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhuLS87.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-26 11:37 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:
