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/ipl21.bht:"
download as .bib file
@article{DBLP:journals/ipl/AlpernS85,
author = {Bowen Alpern and
Fred B. Schneider},
title = {Defining Liveness},
journal = {Inf. Process. Lett.},
volume = {21},
number = {4},
pages = {181--185},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90056-0},
doi = {10.1016/0020-0190(85)90056-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlpernS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Atkinson85,
author = {Malcolm D. Atkinson},
title = {On Zigzag Permutations and Comparisons of Adjacent Elements},
journal = {Inf. Process. Lett.},
volume = {21},
number = {4},
pages = {187--189},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90057-2},
doi = {10.1016/0020-0190(85)90057-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Atkinson85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BiniP85,
author = {Dario Bini and
Victor Y. Pan},
title = {Fast Parallel Polynomial Division via Reduction to Triangular Toeplitz
Matrix Inversion and to Polynomial Inversion Modulo a Power},
journal = {Inf. Process. Lett.},
volume = {21},
number = {2},
pages = {79--81},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90037-7},
doi = {10.1016/0020-0190(85)90037-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BiniP85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Birkhoff85,
author = {Ingrid J. M. Birkhoff},
title = {A Direct Routing Algorithm for the Bit-Reversal Permutation on a Shuffle-Exchange
Network},
journal = {Inf. Process. Lett.},
volume = {21},
number = {5},
pages = {259--268},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90095-X},
doi = {10.1016/0020-0190(85)90095-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Birkhoff85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Budd85,
author = {Timothy A. Budd},
title = {Creation and Reflexive Rights in Grammatical Protection Systems},
journal = {Inf. Process. Lett.},
volume = {21},
number = {3},
pages = {141--145},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90019-5},
doi = {10.1016/0020-0190(85)90019-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Budd85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CodenottiRL85,
author = {Bruno Codenotti and
Francesco Romani and
Grazia Lotti},
title = {{VLSI} Implementation of Fast Solvers for Band Linear Systems With
Constant Coefficient Matrix},
journal = {Inf. Process. Lett.},
volume = {21},
number = {3},
pages = {159--163},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90022-5},
doi = {10.1016/0020-0190(85)90022-5},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CodenottiRL85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Derigs85,
author = {Ulrich Derigs},
title = {An Efficient Dijkstra-like Labeling Method for Computing Shortest
Odd/Even Paths},
journal = {Inf. Process. Lett.},
volume = {21},
number = {5},
pages = {253--258},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90094-8},
doi = {10.1016/0020-0190(85)90094-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Derigs85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Dobosiewicz85,
author = {Wlodzimierz Dobosiewicz},
title = {A Note on Natural Selection},
journal = {Inf. Process. Lett.},
volume = {21},
number = {5},
pages = {239--243},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90091-2},
doi = {10.1016/0020-0190(85)90091-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Dobosiewicz85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DurisSVT85,
author = {Pavol Duris and
Ondrej S{\'{y}}kora and
Imrich Vrto and
Clark D. Thompson},
title = {Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard
Transformations},
journal = {Inf. Process. Lett.},
volume = {21},
number = {5},
pages = {245--247},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90092-4},
doi = {10.1016/0020-0190(85)90092-4},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DurisSVT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EdelsbrunnerM85,
author = {Herbert Edelsbrunner and
Hermann A. Maurer},
title = {Finding Extreme Points in Three Dimensions and Solving the Post-Office
Problem in the Plane},
journal = {Inf. Process. Lett.},
volume = {21},
number = {1},
pages = {39--47},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90107-3},
doi = {10.1016/0020-0190(85)90107-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EdelsbrunnerM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuralnikZW85,
author = {Gerald Guralnik and
Charles Zemach and
Tony Warnock},
title = {An Algorithm for Uniform Random Sampling of Points In and On a Hypersphere},
journal = {Inf. Process. Lett.},
volume = {21},
number = {1},
pages = {17--21},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90102-4},
doi = {10.1016/0020-0190(85)90102-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuralnikZW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Guting85,
author = {Ralf Hartmut G{\"{u}}ting},
title = {Fast Dynamic Intersection Searching in a Set of Isothetic Line Segments},
journal = {Inf. Process. Lett.},
volume = {21},
number = {4},
pages = {165--171},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90054-7},
doi = {10.1016/0020-0190(85)90054-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Guting85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HermanC85,
author = {Ted Herman and
K. Mani Chandy},
title = {On Distributed Search},
journal = {Inf. Process. Lett.},
volume = {21},
number = {3},
pages = {129--133},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90017-1},
doi = {10.1016/0020-0190(85)90017-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HermanC85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hromkovic85,
author = {Juraj Hromkovic},
title = {Alternating Multicounter Machines with Constant Number of Reversals},
journal = {Inf. Process. Lett.},
volume = {21},
number = {1},
pages = {7--9},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90100-0},
doi = {10.1016/0020-0190(85)90100-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hromkovic85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hromkovic85a,
author = {Juraj Hromkovic},
title = {Linear Lower Bounds on Unbounded Fan-In Boolean Circuits},
journal = {Inf. Process. Lett.},
volume = {21},
number = {2},
pages = {71--74},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90035-3},
doi = {10.1016/0020-0190(85)90035-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hromkovic85a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HsiaoS85,
author = {Ching C. Hsiao and
Nien{-}Tsu Shen},
title = {k-Fold Bitonic Sort on a Mesh-Connected Parallel Computer},
journal = {Inf. Process. Lett.},
volume = {21},
number = {4},
pages = {207--212},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90060-2},
doi = {10.1016/0020-0190(85)90060-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HsiaoS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JaJaT85,
author = {Joseph F. J{\'{a}}J{\'{a}} and
Jean Takche},
title = {Improved Lower Bounds for Some Matrix Multiplication Problems},
journal = {Inf. Process. Lett.},
volume = {21},
number = {3},
pages = {123--127},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90016-X},
doi = {10.1016/0020-0190(85)90016-X},
timestamp = {Fri, 02 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JaJaT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JanigaK85,
author = {Ladislav Janiga and
V{\'{a}}clav Koubek},
title = {A Note on Finding Minimum Cuts in Directed Planar Networks by Parallel
Computations},
journal = {Inf. Process. Lett.},
volume = {21},
number = {2},
pages = {75--78},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90036-5},
doi = {10.1016/0020-0190(85)90036-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JanigaK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jantzen85,
author = {Matthias Jantzen},
title = {A Note on a Special One-Rule Semi-Thue System},
journal = {Inf. Process. Lett.},
volume = {21},
number = {3},
pages = {135--140},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90018-3},
doi = {10.1016/0020-0190(85)90018-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jantzen85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kaldewaij85,
author = {Anne Kaldewaij},
title = {On the Decomposition of Sequences into Ascending Subsequences},
journal = {Inf. Process. Lett.},
volume = {21},
number = {2},
pages = {69},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90034-1},
doi = {10.1016/0020-0190(85)90034-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kaldewaij85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KapurK85,
author = {Deepak Kapur and
Mukkai S. Krishnamoorthy},
title = {Worst-Case Choice for the Stable Marriage Problem},
journal = {Inf. Process. Lett.},
volume = {21},
number = {1},
pages = {27--30},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90104-8},
doi = {10.1016/0020-0190(85)90104-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KapurK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KeedyF85,
author = {James Leslie Keedy and
Bernd Freisleben},
title = {On the Efficient Use of Semaphore Primitives},
journal = {Inf. Process. Lett.},
volume = {21},
number = {4},
pages = {199--205},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90059-6},
doi = {10.1016/0020-0190(85)90059-6},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KeedyF85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kfoury85,
author = {A. J. Kfoury},
title = {The Unwind Property for Programs with Bounded Memory},
journal = {Inf. Process. Lett.},
volume = {21},
number = {5},
pages = {233--238},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90090-0},
doi = {10.1016/0020-0190(85)90090-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kfoury85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KothariR85,
author = {Suresh C. Kothari and
K. V. S. Ramarao},
title = {General Algorithms for the Address Calculation of Lexicographically
Ordered Tuples},
journal = {Inf. Process. Lett.},
volume = {21},
number = {3},
pages = {113--116},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90014-6},
doi = {10.1016/0020-0190(85)90014-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KothariR85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Laumond85,
author = {Jean{-}Paul Laumond},
title = {Enumeration of Articulation Pairs of a Planar Graph},
journal = {Inf. Process. Lett.},
volume = {21},
number = {4},
pages = {173--179},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90055-9},
doi = {10.1016/0020-0190(85)90055-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Laumond85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LautemannH85,
author = {Clemens Lautemann and
Friedhelm Meyer auf der Heide},
title = {Lower Time Bounds for Integer Programming with Two Variables},
journal = {Inf. Process. Lett.},
volume = {21},
number = {2},
pages = {101--105},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90042-0},
doi = {10.1016/0020-0190(85)90042-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LautemannH85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeC85,
author = {D. T. Lee and
Y. T. Ching},
title = {The Power of Geometric Duality Revisited},
journal = {Inf. Process. Lett.},
volume = {21},
number = {3},
pages = {117--122},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90015-8},
doi = {10.1016/0020-0190(85)90015-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeeC85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lumelsky85,
author = {Vladimir J. Lumelsky},
title = {On Fast Computation of Distance Between Line Segments},
journal = {Inf. Process. Lett.},
volume = {21},
number = {2},
pages = {55--61},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90032-8},
doi = {10.1016/0020-0190(85)90032-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lumelsky85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Magott85,
author = {Jan Magott},
title = {Performance Evaluation of Dystems of Cyclic Sequential Processes with
Mutual Exclusion Using Petri Nets},
journal = {Inf. Process. Lett.},
volume = {21},
number = {5},
pages = {229--232},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90089-4},
doi = {10.1016/0020-0190(85)90089-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Magott85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MannilaM85,
author = {Heikki Mannila and
Kurt Mehlhorn},
title = {A Fast Algorithm for Renaming a Set of Clauses as a Horn Set},
journal = {Inf. Process. Lett.},
volume = {21},
number = {5},
pages = {269--272},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90096-1},
doi = {10.1016/0020-0190(85)90096-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MannilaM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Marchetti-SpaccamelaR85,
author = {Alberto Marchetti{-}Spaccamela and
Giovanni Romano},
title = {On Different Approximation Criteria for Subset Product Problems},
journal = {Inf. Process. Lett.},
volume = {21},
number = {4},
pages = {213--218},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90061-4},
doi = {10.1016/0020-0190(85)90061-4},
timestamp = {Sun, 31 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Marchetti-SpaccamelaR85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MartinB85,
author = {Alain J. Martin and
Jerry R. Burch},
title = {Fair Mutual Exclusion with Unfair {P} and {V} Operations},
journal = {Inf. Process. Lett.},
volume = {21},
number = {2},
pages = {97--100},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90041-9},
doi = {10.1016/0020-0190(85)90041-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MartinB85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Meyer85,
author = {Bertrand Meyer},
title = {Incremental String Matching},
journal = {Inf. Process. Lett.},
volume = {21},
number = {5},
pages = {219--227},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90088-2},
doi = {10.1016/0020-0190(85)90088-2},
timestamp = {Mon, 30 Oct 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Meyer85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NegriP85,
author = {Mauro Negri and
Giuseppe Pelagatti},
title = {Join During Merge: An Improved Sort Based Algorithm},
journal = {Inf. Process. Lett.},
volume = {21},
number = {1},
pages = {11--16},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90101-2},
doi = {10.1016/0020-0190(85)90101-2},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/NegriP85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Nguyen85,
author = {Van Nguyen},
title = {The Incompleteness of Misra and Chandy's Proof Systems},
journal = {Inf. Process. Lett.},
volume = {21},
number = {2},
pages = {93--96},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90040-7},
doi = {10.1016/0020-0190(85)90040-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Nguyen85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/OhP85,
author = {Se Man Oh and
Joseph C. H. Park},
title = {A Note on Removing Loops from Table-Driven Code Generators},
journal = {Inf. Process. Lett.},
volume = {21},
number = {1},
pages = {31--34},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90105-X},
doi = {10.1016/0020-0190(85)90105-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/OhP85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pagli85,
author = {Linda Pagli},
title = {Self-Adjusting Hash Tables},
journal = {Inf. Process. Lett.},
volume = {21},
number = {1},
pages = {23--25},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90103-6},
doi = {10.1016/0020-0190(85)90103-6},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Pagli85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RauchleT85,
author = {Thomas R{\"{a}}uchle and
Sam Toueg},
title = {Exposure to Deadlock for Communicating Processes is Hard to Detect},
journal = {Inf. Process. Lett.},
volume = {21},
number = {2},
pages = {63--68},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90033-X},
doi = {10.1016/0020-0190(85)90033-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RauchleT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RobertT85,
author = {Yves Robert and
Maurice Tchuent{\'{e}}},
title = {A Systolic Array for the Longest Common Subsequence Problem},
journal = {Inf. Process. Lett.},
volume = {21},
number = {4},
pages = {191--198},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90058-4},
doi = {10.1016/0020-0190(85)90058-4},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/RobertT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Samet85,
author = {Hanan Samet},
title = {Bidirectional Coroutines},
journal = {Inf. Process. Lett.},
volume = {21},
number = {1},
pages = {1--6},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90099-7},
doi = {10.1016/0020-0190(85)90099-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Samet85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Supowit85,
author = {Kenneth J. Supowit},
title = {Decomposing a Set of Points into Chains, with Applications to Permutation
and Circle Graphs},
journal = {Inf. Process. Lett.},
volume = {21},
number = {5},
pages = {249--252},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90093-6},
doi = {10.1016/0020-0190(85)90093-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Supowit85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Thompson85,
author = {Clark D. Thompson},
title = {{VLSI} Design With Multiple Active Layers},
journal = {Inf. Process. Lett.},
volume = {21},
number = {3},
pages = {109--111},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90013-4},
doi = {10.1016/0020-0190(85)90013-4},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Thompson85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Vitanyi85,
author = {Paul M. B. Vit{\'{a}}nyi},
title = {Square Time is Optimal for Simulation of One Pushdown Store or One
Queue by an Oblivious One-Head Tape Unit},
journal = {Inf. Process. Lett.},
volume = {21},
number = {2},
pages = {87--91},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90039-0},
doi = {10.1016/0020-0190(85)90039-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Vitanyi85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Vitanyi85a,
author = {Paul M. B. Vit{\'{a}}nyi},
title = {An n\({}^{\mbox{1.618}}\) Lower Bound on the Time to Simulate One
Queue or Two Pushdown Stores by One Tape},
journal = {Inf. Process. Lett.},
volume = {21},
number = {3},
pages = {147--152},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90020-1},
doi = {10.1016/0020-0190(85)90020-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Vitanyi85a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Watjen85,
author = {Dietmar W{\"{a}}tjen},
title = {Feedback Automata and Their Languages},
journal = {Inf. Process. Lett.},
volume = {21},
number = {2},
pages = {83--86},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90038-9},
doi = {10.1016/0020-0190(85)90038-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Watjen85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wegener85,
author = {Ingo Wegener},
title = {Optimal Search With Positive Switch Cost is NP-Hard},
journal = {Inf. Process. Lett.},
volume = {21},
number = {1},
pages = {49--52},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90108-5},
doi = {10.1016/0020-0190(85)90108-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wegener85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Yoo85,
author = {Chae Woo Yoo},
title = {An Approach to the Transportation of Computer Software},
journal = {Inf. Process. Lett.},
volume = {21},
number = {3},
pages = {153--157},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90021-3},
doi = {10.1016/0020-0190(85)90021-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Yoo85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Yung85,
author = {Mordechai M. Yung},
title = {A Secure and Useful 'Keyless Cryptosystem'},
journal = {Inf. Process. Lett.},
volume = {21},
number = {1},
pages = {35--38},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90106-1},
doi = {10.1016/0020-0190(85)90106-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Yung85.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-06-05 06:24 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:
