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/ipl24.bht:"
download as .bib file
@article{DBLP:journals/ipl/Akman87,
author = {Varol Akman},
title = {An Algorithm for Determining an Opaque Minimal Forest of a Convex
Polygon},
journal = {Inf. Process. Lett.},
volume = {24},
number = {3},
pages = {193--198},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90185-2},
doi = {10.1016/0020-0190(87)90185-2},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Akman87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlexandrakisB87,
author = {Athanasios Alexandrakis and
Symeon Bozapalidis},
title = {Weighted Grammars and Kleene's Theorem},
journal = {Inf. Process. Lett.},
volume = {24},
number = {1},
pages = {1--4},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90190-6},
doi = {10.1016/0020-0190(87)90190-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlexandrakisB87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AndersonM87,
author = {Richard J. Anderson and
Ernst W. Mayr},
title = {Parallelism and the Maximal Path Problem},
journal = {Inf. Process. Lett.},
volume = {24},
number = {2},
pages = {121--126},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90105-0},
doi = {10.1016/0020-0190(87)90105-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AndersonM87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Anstee87,
author = {Richard P. Anstee},
title = {A Polynomial Algorithm for b-Matchings: An Alternative Approach},
journal = {Inf. Process. Lett.},
volume = {24},
number = {3},
pages = {153--157},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90178-5},
doi = {10.1016/0020-0190(87)90178-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Anstee87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ArvindB87,
author = {Vikraman Arvind and
Somenath Biswas},
title = {An O(n{\({^2}\)}) Algorithm for the Satisfiability Problem of a Subset
of Propositional Sentences in {CNF} That Includes All Horn Sentences},
journal = {Inf. Process. Lett.},
volume = {24},
number = {1},
pages = {67--69},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90200-6},
doi = {10.1016/0020-0190(87)90200-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ArvindB87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AsanoAI87,
author = {Takao Asano and
Tetsuo Asano and
Hiroshi Imai},
title = {Shortest Path Between Two Simple Polygons},
journal = {Inf. Process. Lett.},
volume = {24},
number = {5},
pages = {285--288},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90150-5},
doi = {10.1016/0020-0190(87)90150-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AsanoAI87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AtkinsonC87,
author = {M. D. Atkinson and
H. W. Chang},
title = {Computing the Number of Mergings with Constraints},
journal = {Inf. Process. Lett.},
volume = {24},
number = {5},
pages = {289--292},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90151-7},
doi = {10.1016/0020-0190(87)90151-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AtkinsonC87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BajantriS87,
author = {M. Bajantri and
David B. Skillicorn},
title = {A Fast Multiprocessor Message Passing Implementation},
journal = {Inf. Process. Lett.},
volume = {24},
number = {6},
pages = {381--389},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90115-3},
doi = {10.1016/0020-0190(87)90115-3},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BajantriS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bernstein87,
author = {Arthur J. Bernstein},
title = {Predicate Transfer and Timeout in Message Passing Systems},
journal = {Inf. Process. Lett.},
volume = {24},
number = {1},
pages = {43--52},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90197-9},
doi = {10.1016/0020-0190(87)90197-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bernstein87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BiniP87,
author = {Dario Bini and
Victor Y. Pan},
title = {A Logarithmic Boolean Time Algorithm for Parallel Polynomial Division},
journal = {Inf. Process. Lett.},
volume = {24},
number = {4},
pages = {233--237},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90139-6},
doi = {10.1016/0020-0190(87)90139-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BiniP87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BirdH87,
author = {Richard S. Bird and
John Hughes},
title = {The alpha-beta Algorithm: An Exercise in Program Transformation},
journal = {Inf. Process. Lett.},
volume = {24},
number = {1},
pages = {53--57},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90198-0},
doi = {10.1016/0020-0190(87)90198-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BirdH87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BlazewiczF87,
author = {Jacek Blazewicz and
Gerd Finke},
title = {Minimizing Mean Weighted Execution Time Loss on Identical and Uniform
Processors},
journal = {Inf. Process. Lett.},
volume = {24},
number = {4},
pages = {259--263},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90145-1},
doi = {10.1016/0020-0190(87)90145-1},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BlazewiczF87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BlumerEHW87,
author = {Anselm Blumer and
Andrzej Ehrenfeucht and
David Haussler and
Manfred K. Warmuth},
title = {Occam's Razor},
journal = {Inf. Process. Lett.},
volume = {24},
number = {6},
pages = {377--380},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90114-1},
doi = {10.1016/0020-0190(87)90114-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BlumerEHW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Carlsson87,
author = {Svante Carlsson},
title = {A Variant of Heapsort with Almost Optimal Number of Comparisons},
journal = {Inf. Process. Lett.},
volume = {24},
number = {4},
pages = {247--250},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90142-6},
doi = {10.1016/0020-0190(87)90142-6},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Carlsson87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CastanDL87,
author = {Michel Castan and
M.{-}H. Durand and
Michel Lema{\^{\i}}tre},
title = {A Set of Combinators for Abstraction in Linear Space},
journal = {Inf. Process. Lett.},
volume = {24},
number = {3},
pages = {183--188},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90183-9},
doi = {10.1016/0020-0190(87)90183-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CastanDL87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangGR87,
author = {Ernest J. H. Chang and
Gaston H. Gonnet and
Doron Rotem},
title = {On the Costs of Self-Stabilization},
journal = {Inf. Process. Lett.},
volume = {24},
number = {5},
pages = {311--316},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90155-4},
doi = {10.1016/0020-0190(87)90155-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChangGR87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChrobakR87,
author = {Marek Chrobak and
Wojciech Rytter},
title = {Remarks on String-Matching and One-Way Multihead Automata},
journal = {Inf. Process. Lett.},
volume = {24},
number = {5},
pages = {325--329},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90157-8},
doi = {10.1016/0020-0190(87)90157-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChrobakR87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Dillencourt87,
author = {Michael B. Dillencourt},
title = {Traveling Salesman Cycles are not Always Subgraphs of Delaunay Triangulations
or of Minimum Weight Triangulations},
journal = {Inf. Process. Lett.},
volume = {24},
number = {5},
pages = {339--342},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90160-8},
doi = {10.1016/0020-0190(87)90160-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Dillencourt87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EdelsbrunnerO87,
author = {Herbert Edelsbrunner and
Mark H. Overmars},
title = {Zooming by Repeated Range Detection},
journal = {Inf. Process. Lett.},
volume = {24},
number = {6},
pages = {413--417},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90120-7},
doi = {10.1016/0020-0190(87)90120-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EdelsbrunnerO87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Edenbrandt87,
author = {Anders Edenbrandt},
title = {Chordal Graph Recognition is in {NC}},
journal = {Inf. Process. Lett.},
volume = {24},
number = {4},
pages = {239--241},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90140-2},
doi = {10.1016/0020-0190(87)90140-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Edenbrandt87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Emerson87,
author = {E. Allen Emerson},
title = {Uniform Inevitability is Tree Automaton Ineffable},
journal = {Inf. Process. Lett.},
volume = {24},
number = {2},
pages = {77--79},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90097-4},
doi = {10.1016/0020-0190(87)90097-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Emerson87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EvansY87,
author = {David J. Evans and
W. S. Yousif},
title = {Explicit Solution of Block Tridiagonal Systems of Linear Equations},
journal = {Inf. Process. Lett.},
volume = {24},
number = {3},
pages = {207--209},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90188-8},
doi = {10.1016/0020-0190(87)90188-8},
timestamp = {Tue, 13 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/EvansY87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FeijenGG87,
author = {W. H. J. Feijen and
A. J. M. van Gasteren and
David Gries},
title = {In-situ Inversion of a Cyclic Permutation},
journal = {Inf. Process. Lett.},
volume = {24},
number = {1},
pages = {11--14},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90192-X},
doi = {10.1016/0020-0190(87)90192-X},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FeijenGG87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Field87,
author = {Dan Field},
title = {A Note on a New Data Structure for in-the-Past Queries},
journal = {Inf. Process. Lett.},
volume = {24},
number = {2},
pages = {95--96},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90100-1},
doi = {10.1016/0020-0190(87)90100-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Field87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FinkelM87,
author = {Raphael A. Finkel and
Hari Madduri},
title = {An Efficient Deadlock Avoidance Algorithm},
journal = {Inf. Process. Lett.},
volume = {24},
number = {1},
pages = {25--30},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90195-5},
doi = {10.1016/0020-0190(87)90195-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FinkelM87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FraserH87,
author = {Christopher W. Fraser and
David R. Hanson},
title = {Optimization of Argument Evaluation Order},
journal = {Inf. Process. Lett.},
volume = {24},
number = {6},
pages = {391--395},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90116-5},
doi = {10.1016/0020-0190(87)90116-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FraserH87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Golumbic87,
author = {Martin Charles Golumbic},
title = {A General Method for Avoiding Cycling in a Network},
journal = {Inf. Process. Lett.},
volume = {24},
number = {4},
pages = {251--253},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90143-8},
doi = {10.1016/0020-0190(87)90143-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Golumbic87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gottlob87,
author = {Georg Gottlob},
title = {Subsumption and Implication},
journal = {Inf. Process. Lett.},
volume = {24},
number = {2},
pages = {109--111},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90103-7},
doi = {10.1016/0020-0190(87)90103-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gottlob87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gottlob87a,
author = {Georg Gottlob},
title = {On the Size of Nonredundant FD-Covers},
journal = {Inf. Process. Lett.},
volume = {24},
number = {6},
pages = {355--360},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90110-4},
doi = {10.1016/0020-0190(87)90110-4},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gottlob87a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Grazon87,
author = {Anne Grazon},
title = {An Infinite Word Language Which is Not co-CFL},
journal = {Inf. Process. Lett.},
volume = {24},
number = {2},
pages = {81--85},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90098-6},
doi = {10.1016/0020-0190(87)90098-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Grazon87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Grune87,
author = {Dick Grune},
title = {How to Compare the Incomparable},
journal = {Inf. Process. Lett.},
volume = {24},
number = {3},
pages = {177--181},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90182-7},
doi = {10.1016/0020-0190(87)90182-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Grune87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HazariZ87,
author = {Cyrus Hazari and
Hussein Zedan},
title = {A Distributed Algorithm for Distributed Termination},
journal = {Inf. Process. Lett.},
volume = {24},
number = {5},
pages = {293--297},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90152-9},
doi = {10.1016/0020-0190(87)90152-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HazariZ87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HirschbergV87,
author = {Daniel S. Hirschberg and
Dennis J. Volper},
title = {Improved Update/Query Algorithms for the Interval Valuation Problem},
journal = {Inf. Process. Lett.},
volume = {24},
number = {5},
pages = {307--310},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90154-2},
doi = {10.1016/0020-0190(87)90154-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HirschbergV87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HoareH87,
author = {C. A. R. Hoare and
Jifeng He},
title = {The Weakest Prespecification},
journal = {Inf. Process. Lett.},
volume = {24},
number = {2},
pages = {127--132},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90106-2},
doi = {10.1016/0020-0190(87)90106-2},
timestamp = {Mon, 21 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HoareH87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hochschild87,
author = {Peter H. Hochschild},
title = {Multiple Cuts, Input Repetition, and {VLSI} Complexity},
journal = {Inf. Process. Lett.},
volume = {24},
number = {1},
pages = {19--24},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90194-3},
doi = {10.1016/0020-0190(87)90194-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hochschild87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HorspoolL87,
author = {R. Nigel Horspool and
Michael R. Levy},
title = {Correctness of an Extended Operator-Precedence Parsing Algorithm},
journal = {Inf. Process. Lett.},
volume = {24},
number = {4},
pages = {265--273},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90146-3},
doi = {10.1016/0020-0190(87)90146-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HorspoolL87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Huynh87,
author = {Dung T. Huynh},
title = {On Solving Hard Problems by Polynomial-Size Circuits},
journal = {Inf. Process. Lett.},
volume = {24},
number = {3},
pages = {171--176},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90181-5},
doi = {10.1016/0020-0190(87)90181-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Huynh87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KennawayS87,
author = {Richard Kennaway and
M. Ronan Sleep},
title = {Variable Abstraction in O(n log n) Space},
journal = {Inf. Process. Lett.},
volume = {24},
number = {5},
pages = {343--349},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90161-X},
doi = {10.1016/0020-0190(87)90161-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KennawayS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KimC87,
author = {Taenam Kim and
Kyung{-}Yong Chwa},
title = {An O(n log n log log n) Parallel Maximum Matching Algorithm for Bipartite
Graphs},
journal = {Inf. Process. Lett.},
volume = {24},
number = {1},
pages = {15--17},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90193-1},
doi = {10.1016/0020-0190(87)90193-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KimC87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Koch87,
author = {Gregers Koch},
title = {Automating the Semantic Component},
journal = {Inf. Process. Lett.},
volume = {24},
number = {5},
pages = {299--305},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90153-0},
doi = {10.1016/0020-0190(87)90153-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Koch87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Korel87,
author = {Bogdan Korel},
title = {The Program Dependence Graph in Static Program Testing},
journal = {Inf. Process. Lett.},
volume = {24},
number = {2},
pages = {103--108},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90102-5},
doi = {10.1016/0020-0190(87)90102-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Korel87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Krentel87,
author = {Mark W. Krentel},
title = {A Note on the Transaction Backout Problem},
journal = {Inf. Process. Lett.},
volume = {24},
number = {3},
pages = {149--152},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90177-3},
doi = {10.1016/0020-0190(87)90177-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Krentel87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kubale87,
author = {Marek Kubale},
title = {The Complexity of Scheduling Independent Two-Processor Tasks on Dedicated
Processors},
journal = {Inf. Process. Lett.},
volume = {24},
number = {3},
pages = {141--147},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90176-1},
doi = {10.1016/0020-0190(87)90176-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kubale87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KurtzOR87,
author = {Stuart A. Kurtz and
Michael J. O'Donnell and
James S. Royer},
title = {How to Prove Representation-Independent Independence Results},
journal = {Inf. Process. Lett.},
volume = {24},
number = {1},
pages = {5--10},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90191-8},
doi = {10.1016/0020-0190(87)90191-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KurtzOR87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Leijenhorst87,
author = {D. C. Van Leijenhorst},
title = {A Note on the Formula Size of the "mod k" Functions},
journal = {Inf. Process. Lett.},
volume = {24},
number = {4},
pages = {223--224},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90137-2},
doi = {10.1016/0020-0190(87)90137-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Leijenhorst87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeijenhorstW87,
author = {D. C. Van Leijenhorst and
Theo P. van der Weide},
title = {On a Recursion Connected with Tree Balancing Algorithms},
journal = {Inf. Process. Lett.},
volume = {24},
number = {3},
pages = {189--192},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90184-0},
doi = {10.1016/0020-0190(87)90184-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeijenhorstW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MadlenerO87,
author = {Klaus Madlener and
Friedrich Otto},
title = {Using String-Rewriting for Solving the Word Problem for Finitely Presented
Groups},
journal = {Inf. Process. Lett.},
volume = {24},
number = {5},
pages = {281--284},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90149-9},
doi = {10.1016/0020-0190(87)90149-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MadlenerO87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MarieT87,
author = {Raymond A. Marie and
Kishor S. Trivedi},
title = {A Note on the Effect of Preemptive Policies on the Stability of a
Priority Queue},
journal = {Inf. Process. Lett.},
volume = {24},
number = {6},
pages = {397--401},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90117-7},
doi = {10.1016/0020-0190(87)90117-7},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MarieT87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/McCollP87,
author = {William F. McColl and
Mike Paterson},
title = {The Planar Realization of Boolean Functions},
journal = {Inf. Process. Lett.},
volume = {24},
number = {3},
pages = {165--170},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90180-3},
doi = {10.1016/0020-0190(87)90180-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/McCollP87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Meira87,
author = {Silvio Romero de Lemos Meira},
title = {Strict Combinators},
journal = {Inf. Process. Lett.},
volume = {24},
number = {4},
pages = {255--258},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90144-X},
doi = {10.1016/0020-0190(87)90144-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Meira87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Muller87,
author = {Heinrich M{\"{u}}ller},
title = {Sorting Numbers Using Limited Systolic Coprocessors},
journal = {Inf. Process. Lett.},
volume = {24},
number = {6},
pages = {351--354},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90109-8},
doi = {10.1016/0020-0190(87)90109-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Muller87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Parberry87,
author = {Ian Parberry},
title = {An Improved Simulation of Space and Reversal Bounded Deterministic
Turing Machines by Width and Depth Bounded Uniform Circuits},
journal = {Inf. Process. Lett.},
volume = {24},
number = {6},
pages = {363--367},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90112-8},
doi = {10.1016/0020-0190(87)90112-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Parberry87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PawagiGR87,
author = {Shaunak Pawagi and
P. S. Gopalakrishnan and
I. V. Ramakrishnan},
title = {Computing Dominators in Parallel},
journal = {Inf. Process. Lett.},
volume = {24},
number = {4},
pages = {217--221},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90136-0},
doi = {10.1016/0020-0190(87)90136-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PawagiGR87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pitt87,
author = {Leonard Pitt},
title = {A Note on Extending Knuth's Tree Estimator to Directed Acyclic Graphs},
journal = {Inf. Process. Lett.},
volume = {24},
number = {3},
pages = {203--206},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90187-6},
doi = {10.1016/0020-0190(87)90187-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Pitt87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ramanan87,
author = {Prakash V. Ramanan},
title = {Obtaining Lower Bounds Using Artificial Components},
journal = {Inf. Process. Lett.},
volume = {24},
number = {4},
pages = {243--246},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90141-4},
doi = {10.1016/0020-0190(87)90141-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ramanan87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Raynal87,
author = {Michel Raynal},
title = {A Distributed Algorithm to Prevent Mutual Drift Between n Logical
Clocks},
journal = {Inf. Process. Lett.},
volume = {24},
number = {3},
pages = {199--202},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90186-4},
doi = {10.1016/0020-0190(87)90186-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Raynal87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ReyW87,
author = {Claudio Rey and
Rabab K. Ward},
title = {On Determining the On-Line Minimax Linear Fit to a Discrete Point
Set in the Plane},
journal = {Inf. Process. Lett.},
volume = {24},
number = {2},
pages = {97--101},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90101-3},
doi = {10.1016/0020-0190(87)90101-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ReyW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RoussilleD87,
author = {M. Roussille and
Pierre Dufour},
title = {Generation of Convex Polygons with Individual Angular Constraints},
journal = {Inf. Process. Lett.},
volume = {24},
number = {3},
pages = {159--164},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90179-7},
doi = {10.1016/0020-0190(87)90179-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RoussilleD87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ruby87,
author = {Jonathan Ruby},
title = {A Liveness Property of a Parallel Algorithm},
journal = {Inf. Process. Lett.},
volume = {24},
number = {4},
pages = {275--277},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90147-5},
doi = {10.1016/0020-0190(87)90147-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ruby87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SametSW87,
author = {Hanan Samet and
Clifford A. Shaffer and
Robert E. Webber},
title = {Digitizing the Plane with Cells of Nonuniform Size},
journal = {Inf. Process. Lett.},
volume = {24},
number = {6},
pages = {369--375},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90113-X},
doi = {10.1016/0020-0190(87)90113-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SametSW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SassaIN87,
author = {Masataka Sassa and
Harushi Ishizuka and
Ikuo Nakata},
title = {ECLR-Attributed Grammars: {A} Practical Class of LR-Attributed Grammars},
journal = {Inf. Process. Lett.},
volume = {24},
number = {1},
pages = {31--41},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90196-7},
doi = {10.1016/0020-0190(87)90196-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SassaIN87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SassaN87,
author = {Masataka Sassa and
Ikuo Nakata},
title = {A Simple Realization of LR-Parsers for Regular Right Part Grammars},
journal = {Inf. Process. Lett.},
volume = {24},
number = {2},
pages = {113--120},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90104-9},
doi = {10.1016/0020-0190(87)90104-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SassaN87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Slusarek87,
author = {Maciej Slusarek},
title = {An Off-Line Storage Allocation Algorithm},
journal = {Inf. Process. Lett.},
volume = {24},
number = {2},
pages = {71--75},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90096-2},
doi = {10.1016/0020-0190(87)90096-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Slusarek87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Snepscheut87,
author = {Jan L. A. van de Snepscheut},
title = {"Algorithms for On-the-Fly Garbage Collection" Revisited},
journal = {Inf. Process. Lett.},
volume = {24},
number = {4},
pages = {211--216},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90135-9},
doi = {10.1016/0020-0190(87)90135-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Snepscheut87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sridhar87,
author = {M. K. Sridhar},
title = {A New Algorithm for Parallel Solution of Linear Equations},
journal = {Inf. Process. Lett.},
volume = {24},
number = {6},
pages = {407--412},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90119-0},
doi = {10.1016/0020-0190(87)90119-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sridhar87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Szepietowski87,
author = {Andrzej Szepietowski},
title = {There are no Fully Space Constructible Functions Between log log n
and log n},
journal = {Inf. Process. Lett.},
volume = {24},
number = {6},
pages = {361--362},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90111-6},
doi = {10.1016/0020-0190(87)90111-6},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Szepietowski87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Szwarcfiter87,
author = {Jayme Luiz Szwarcfiter},
title = {A Note on the Computation of the k-Closure of a Graph},
journal = {Inf. Process. Lett.},
volume = {24},
number = {4},
pages = {279--280},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90148-7},
doi = {10.1016/0020-0190(87)90148-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Szwarcfiter87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tennent87,
author = {Robert D. Tennent},
title = {A Note on Undefined Expression Values in Programming Logics},
journal = {Inf. Process. Lett.},
volume = {24},
number = {5},
pages = {331--333},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90158-X},
doi = {10.1016/0020-0190(87)90158-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tennent87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ValentineD87,
author = {Mark Valentine and
Robert H. Davis},
title = {The Automated Solution of Logic Puzzles},
journal = {Inf. Process. Lett.},
volume = {24},
number = {5},
pages = {317--324},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90156-6},
doi = {10.1016/0020-0190(87)90156-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ValentineD87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WidmayerW87,
author = {Peter Widmayer and
Derick Wood},
title = {Time- and Space-Optimal Contour Computation for a Set of Rectangles},
journal = {Inf. Process. Lett.},
volume = {24},
number = {5},
pages = {335--338},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90159-1},
doi = {10.1016/0020-0190(87)90159-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WidmayerW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wolfson87,
author = {Ouri Wolfson},
title = {Concurrent Execution of Transaction Copies},
journal = {Inf. Process. Lett.},
volume = {24},
number = {2},
pages = {87--93},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90099-8},
doi = {10.1016/0020-0190(87)90099-8},
timestamp = {Sat, 19 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wolfson87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wright87,
author = {William E. Wright},
title = {A Note on External Sorting Using Almost Single Input Buffering},
journal = {Inf. Process. Lett.},
volume = {24},
number = {6},
pages = {403--405},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90118-9},
doi = {10.1016/0020-0190(87)90118-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wright87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YannakakisG87,
author = {Mihalis Yannakakis and
Fanica Gavril},
title = {The Maximum k-Colorable Subgraph Problem for Chordal Graphs},
journal = {Inf. Process. Lett.},
volume = {24},
number = {2},
pages = {133--137},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90107-4},
doi = {10.1016/0020-0190(87)90107-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YannakakisG87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YubaH87,
author = {Toshitsugu Yuba and
Mamoru Hoshi},
title = {Binary Search Networks: {A} New Method for Key Searching},
journal = {Inf. Process. Lett.},
volume = {24},
number = {1},
pages = {59--65},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90199-2},
doi = {10.1016/0020-0190(87)90199-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YubaH87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZubairM87,
author = {Mohammad Zubair and
B. B. Madan},
title = {Time Efficient Systolic Architecture for Matrix * Vector Multiplication},
journal = {Inf. Process. Lett.},
volume = {24},
number = {4},
pages = {225--231},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90138-4},
doi = {10.1016/0020-0190(87)90138-4},
timestamp = {Mon, 06 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZubairM87.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-25 11:43 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:
