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/ipl27.bht:"
download as .bib file
@article{DBLP:journals/ipl/AtallahFK88,
author = {Mikhail J. Atallah and
Greg N. Frederickson and
S. Rao Kosaraju},
title = {Sorting with Efficient Use of Special-Purpose Sorters},
journal = {Inf. Process. Lett.},
volume = {27},
number = {1},
pages = {13--15},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90075-0},
doi = {10.1016/0020-0190(88)90075-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AtallahFK88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Baader88,
author = {Franz Baader},
title = {A Note on Unification Type Zero},
journal = {Inf. Process. Lett.},
volume = {27},
number = {2},
pages = {91--93},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90098-1},
doi = {10.1016/0020-0190(88)90098-1},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Baader88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BalakrishnanSMBL88,
author = {M. Balakrishnan and
S. Sutarwala and
Arun K. Majumdar and
Dilip K. Banerji and
James G. Linders},
title = {A Semantic Approach for Modular Synthesis of {VLSI} Systems},
journal = {Inf. Process. Lett.},
volume = {27},
number = {1},
pages = {1--7},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90073-7},
doi = {10.1016/0020-0190(88)90073-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BalakrishnanSMBL88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BaronaigienR88,
author = {Dominique Roelants van Baronaigien and
Frank Ruskey},
title = {Generating t-ary Trees in A-Order},
journal = {Inf. Process. Lett.},
volume = {27},
number = {4},
pages = {205--213},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90027-0},
doi = {10.1016/0020-0190(88)90027-0},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BaronaigienR88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BermanB88,
author = {Joel Berman and
Willem J. Blok},
title = {Positive Boolean Dependencies},
journal = {Inf. Process. Lett.},
volume = {27},
number = {3},
pages = {147--150},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90070-1},
doi = {10.1016/0020-0190(88)90070-1},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BermanB88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bertossi88,
author = {Alan A. Bertossi},
title = {Parallel Circle-Cover Algorithms},
journal = {Inf. Process. Lett.},
volume = {27},
number = {3},
pages = {133--139},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90068-3},
doi = {10.1016/0020-0190(88)90068-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bertossi88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bodlaender88,
author = {Hans L. Bodlaender},
title = {A Better Lower Bound For Distributed Leader Finding in Bidirectional,
Asynchronous Rings of Processors},
journal = {Inf. Process. Lett.},
volume = {27},
number = {6},
pages = {287--290},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90215-3},
doi = {10.1016/0020-0190(88)90215-3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bodlaender88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BugraraP88,
author = {Khaled M. Bugrara and
Paul Walton Purdom Jr.},
title = {An Exponential Lower Bound for the Pure Literal Rule},
journal = {Inf. Process. Lett.},
volume = {27},
number = {4},
pages = {215--219},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90028-2},
doi = {10.1016/0020-0190(88)90028-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BugraraP88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChandranR88,
author = {Sharat Chandran and
Azriel Rosenfeld},
title = {Order Statistics on a Hypercube},
journal = {Inf. Process. Lett.},
volume = {27},
number = {3},
pages = {129--132},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90067-1},
doi = {10.1016/0020-0190(88)90067-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChandranR88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangC88,
author = {Chin{-}Chen Chang and
C. H. Chang},
title = {An Ordered Minimal Perfect Hashing Scheme with Single Parameter},
journal = {Inf. Process. Lett.},
volume = {27},
number = {2},
pages = {79--83},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90096-8},
doi = {10.1016/0020-0190(88)90096-8},
timestamp = {Tue, 23 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChangC88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chlebus88,
author = {Bogdan S. Chlebus},
title = {A Parallel Bucket Sort},
journal = {Inf. Process. Lett.},
volume = {27},
number = {2},
pages = {57--61},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90092-0},
doi = {10.1016/0020-0190(88)90092-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chlebus88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CookL88,
author = {Stephen A. Cook and
Michael Luby},
title = {A Simple Parallel Algorithm for Finding a Satisfying Truth Assignment
to a 2-CNF Formula},
journal = {Inf. Process. Lett.},
volume = {27},
number = {3},
pages = {141--145},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90069-5},
doi = {10.1016/0020-0190(88)90069-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CookL88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EsfahanianH88,
author = {Abdol{-}Hossein Esfahanian and
S. Louis Hakimi},
title = {On Computing a Conditional Edge-Connectivity of a Graph},
journal = {Inf. Process. Lett.},
volume = {27},
number = {4},
pages = {195--199},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90025-7},
doi = {10.1016/0020-0190(88)90025-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EsfahanianH88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FaigleS88,
author = {Ulrich Faigle and
Rainer Schrader},
title = {On the Convergence of Stationary Distributions in Simulated Annealing
Algorithms},
journal = {Inf. Process. Lett.},
volume = {27},
number = {4},
pages = {189--194},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90024-5},
doi = {10.1016/0020-0190(88)90024-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FaigleS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fernandez-Baca88,
author = {David Fern{\'{a}}ndez{-}Baca},
title = {Nonserial Dynamic Programming Formulations of Satisfiability},
journal = {Inf. Process. Lett.},
volume = {27},
number = {6},
pages = {323--326},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90221-9},
doi = {10.1016/0020-0190(88)90221-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fernandez-Baca88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Frieze88,
author = {Alan M. Frieze},
title = {On the Random Construction of Heaps},
journal = {Inf. Process. Lett.},
volume = {27},
number = {2},
pages = {103--109},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90101-9},
doi = {10.1016/0020-0190(88)90101-9},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Frieze88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GabowT88,
author = {Harold N. Gabow and
Robert Endre Tarjan},
title = {A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest},
journal = {Inf. Process. Lett.},
volume = {27},
number = {5},
pages = {259--263},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90089-0},
doi = {10.1016/0020-0190(88)90089-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GabowT88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GibbonsIR88,
author = {Alan Gibbons and
Amos Israeli and
Wojciech Rytter},
title = {Parallel O(log n) Time Edge-Colouring of Trees and Halin Graphs},
journal = {Inf. Process. Lett.},
volume = {27},
number = {1},
pages = {43--51},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90080-4},
doi = {10.1016/0020-0190(88)90080-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GibbonsIR88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HolenderskiS88,
author = {Leszek Holenderski and
Andrzej Szalas},
title = {Propositional Description of Finite Cause-Effect Structures},
journal = {Inf. Process. Lett.},
volume = {27},
number = {3},
pages = {111--117},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90064-6},
doi = {10.1016/0020-0190(88)90064-6},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HolenderskiS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HsuM88,
author = {Meichun Hsu and
Stuart E. Madnick},
title = {Shifting Timestamps for Concurrency Control in an Information Hierarchy},
journal = {Inf. Process. Lett.},
volume = {27},
number = {6},
pages = {291--297},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90216-5},
doi = {10.1016/0020-0190(88)90216-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HsuM88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Huang88,
author = {Xiaoqiu Huang},
title = {A Lower Bound for the Edit-Distance Problem Under an Arbitrary Cost
Function},
journal = {Inf. Process. Lett.},
volume = {27},
number = {6},
pages = {319--321},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90220-7},
doi = {10.1016/0020-0190(88)90220-7},
timestamp = {Thu, 28 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Huang88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ItanoSHY88,
author = {Kozo Itano and
Yutaka Sato and
Hidemi Hirai and
Tomoyoshi Yamagata},
title = {An Incremental Pattern Matching Algorithm for the Pipelined Lexical
Scanner},
journal = {Inf. Process. Lett.},
volume = {27},
number = {5},
pages = {253--258},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90088-9},
doi = {10.1016/0020-0190(88)90088-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ItanoSHY88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JohnsonP88,
author = {David S. Johnson and
Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {On Generating All Maximal Independent Sets},
journal = {Inf. Process. Lett.},
volume = {27},
number = {3},
pages = {119--123},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90065-8},
doi = {10.1016/0020-0190(88)90065-8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/JohnsonP88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Josephs88,
author = {Mark B. Josephs},
title = {The Data Refinement Calculator for {Z} Specifications},
journal = {Inf. Process. Lett.},
volume = {27},
number = {1},
pages = {29--33},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90078-6},
doi = {10.1016/0020-0190(88)90078-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Josephs88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JungM88,
author = {Hermann Jung and
Kurt Mehlhorn},
title = {Parallel Algorithms for Computing Maximal Independent Sets in Trees
and for Updating Minimum Spanning Trees},
journal = {Inf. Process. Lett.},
volume = {27},
number = {5},
pages = {227--236},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90084-1},
doi = {10.1016/0020-0190(88)90084-1},
timestamp = {Fri, 22 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/JungM88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KooT88,
author = {Richard Koo and
Sam Toueg},
title = {Effects of Message Loss on the Termination of Distributed Protocols},
journal = {Inf. Process. Lett.},
volume = {27},
number = {4},
pages = {181--188},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90023-3},
doi = {10.1016/0020-0190(88)90023-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KooT88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Krishnaprasad88,
author = {Krishnaprasad Thirunarayan},
title = {On the Computability of Circumscription},
journal = {Inf. Process. Lett.},
volume = {27},
number = {5},
pages = {237--243},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90085-3},
doi = {10.1016/0020-0190(88)90085-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Krishnaprasad88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Krvanek88,
author = {Mirko Krvanek},
title = {The Complexity of Ultrametric Partitions on Graphs},
journal = {Inf. Process. Lett.},
volume = {27},
number = {5},
pages = {265--270},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90090-7},
doi = {10.1016/0020-0190(88)90090-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Krvanek88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kumar88,
author = {Ashok Kumar and
Vishv M. Malhotra},
title = {A New Computation Rule for Prolog},
journal = {Inf. Process. Lett.},
volume = {27},
number = {5},
pages = {249--252},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90087-7},
doi = {10.1016/0020-0190(88)90087-7},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kumar88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kutten88,
author = {Shay Kutten},
title = {Optimal Fault-Tolerant Distributed Construction of a Spanning Forest},
journal = {Inf. Process. Lett.},
volume = {27},
number = {6},
pages = {299--307},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90217-7},
doi = {10.1016/0020-0190(88)90217-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kutten88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lea88,
author = {Doug Lea},
title = {Digital and Hilbert k-d Trees},
journal = {Inf. Process. Lett.},
volume = {27},
number = {1},
pages = {35--41},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90079-8},
doi = {10.1016/0020-0190(88)90079-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lea88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeszcylowskiBM88,
author = {Jacek Leszczylowski and
Staffan Bonnier and
Jan Maluszynski},
title = {Logic Programming with External Procedures: Introducing S-Unification},
journal = {Inf. Process. Lett.},
volume = {27},
number = {3},
pages = {159--165},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90072-5},
doi = {10.1016/0020-0190(88)90072-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeszcylowskiBM88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Li88,
author = {Ming Li},
title = {A Separator Theorem for One-Dimensional Graphs Under Linear Mapping},
journal = {Inf. Process. Lett.},
volume = {27},
number = {1},
pages = {9--11},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90074-9},
doi = {10.1016/0020-0190(88)90074-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Li88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiuN88,
author = {Robin Liu and
Simeon C. Ntafos},
title = {On Decomposing Polygons into Uniformly Monotone Parts},
journal = {Inf. Process. Lett.},
volume = {27},
number = {2},
pages = {85--89},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90097-X},
doi = {10.1016/0020-0190(88)90097-X},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiuN88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LucaV88,
author = {Aldo de Luca and
Stefano Varricchio},
title = {On the Factors of the Thue-Morse Word on Three Symbols},
journal = {Inf. Process. Lett.},
volume = {27},
number = {6},
pages = {281--285},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90214-1},
doi = {10.1016/0020-0190(88)90214-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LucaV88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lyon88,
author = {Gordon Lyon},
title = {A Tagless Marking That is Linear Over Subtrees},
journal = {Inf. Process. Lett.},
volume = {27},
number = {1},
pages = {23--28},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90077-4},
doi = {10.1016/0020-0190(88)90077-4},
timestamp = {Mon, 08 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lyon88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Matousek88,
author = {Jir{\'{\i}} Matousek},
title = {Line Arrangements and Range Search},
journal = {Inf. Process. Lett.},
volume = {27},
number = {6},
pages = {275--280},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90213-X},
doi = {10.1016/0020-0190(88)90213-X},
timestamp = {Thu, 24 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Matousek88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mehlhorn88,
author = {Kurt Mehlhorn},
title = {A Faster Approximation Algorithm for the Steiner Problem in Graphs},
journal = {Inf. Process. Lett.},
volume = {27},
number = {3},
pages = {125--128},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90066-X},
doi = {10.1016/0020-0190(88)90066-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mehlhorn88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Miyano88,
author = {Satoru Miyano},
title = {A Parallelizable Lexicographically First Maximal Edge-Induced Subgraph
Problem},
journal = {Inf. Process. Lett.},
volume = {27},
number = {2},
pages = {75--78},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90095-6},
doi = {10.1016/0020-0190(88)90095-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Miyano88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Orlowska88,
author = {Ewa Orlowska},
title = {Proof System for Weakest Prespecification},
journal = {Inf. Process. Lett.},
volume = {27},
number = {6},
pages = {309--313},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90218-9},
doi = {10.1016/0020-0190(88)90218-9},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Orlowska88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PattersonS88,
author = {Nicholas J. Patterson and
Kenneth J. Supowit},
title = {Finding the Vertices Nearest to a Point in a Hypercube},
journal = {Inf. Process. Lett.},
volume = {27},
number = {2},
pages = {99--102},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90100-7},
doi = {10.1016/0020-0190(88)90100-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PattersonS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RamalingamR88,
author = {G. Ramalingam and
C. Pandu Rangan},
title = {Total Domination in Interval Graphs Revisited},
journal = {Inf. Process. Lett.},
volume = {27},
number = {1},
pages = {17--21},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90076-2},
doi = {10.1016/0020-0190(88)90076-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RamalingamR88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RamalingamR88a,
author = {G. Ramalingam and
C. Pandu Rangan},
title = {A Unified Approach to Domination Problems on Interval Graphs},
journal = {Inf. Process. Lett.},
volume = {27},
number = {5},
pages = {271--274},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90091-9},
doi = {10.1016/0020-0190(88)90091-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RamalingamR88a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RamaraoDM88,
author = {K. V. S. Ramarao and
Robert Daley and
Rami G. Melhem},
title = {Message Complexity of the Set Intersection Problem},
journal = {Inf. Process. Lett.},
volume = {27},
number = {4},
pages = {169--174},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90021-X},
doi = {10.1016/0020-0190(88)90021-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RamaraoDM88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rohnert88,
author = {Hans Rohnert},
title = {Time and Space Efficient Algorithms for Shortest Paths Between Convex
Polygons},
journal = {Inf. Process. Lett.},
volume = {27},
number = {4},
pages = {175--179},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90022-1},
doi = {10.1016/0020-0190(88)90022-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rohnert88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sandhu88,
author = {Ravi S. Sandhu},
title = {Cryptographic Implementation of a Tree Hierarchy for Access Control},
journal = {Inf. Process. Lett.},
volume = {27},
number = {2},
pages = {95--98},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90099-3},
doi = {10.1016/0020-0190(88)90099-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sandhu88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Savage88,
author = {Carla D. Savage},
title = {Recognizing Majority on a One-Way Mesh},
journal = {Inf. Process. Lett.},
volume = {27},
number = {5},
pages = {221--225},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90083-X},
doi = {10.1016/0020-0190(88)90083-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Savage88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SinghalY88,
author = {Mukesh Singhal and
Yelena Yesha},
title = {A Polynomial Algorithm for Computation of the Probability of Conflicts
in a Database Under Arbitrary Data Access Distribution},
journal = {Inf. Process. Lett.},
volume = {27},
number = {2},
pages = {69--74},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90094-4},
doi = {10.1016/0020-0190(88)90094-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SinghalY88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sridhar88,
author = {M. A. Sridhar},
title = {On the Connectivity of the De Bruijn Graph},
journal = {Inf. Process. Lett.},
volume = {27},
number = {6},
pages = {315--318},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90219-0},
doi = {10.1016/0020-0190(88)90219-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sridhar88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Szepietowski88,
author = {Andrzej Szepietowski},
title = {Remarks on Languages Acceptable in log n Space},
journal = {Inf. Process. Lett.},
volume = {27},
number = {4},
pages = {201--203},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90026-9},
doi = {10.1016/0020-0190(88)90026-9},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Szepietowski88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsin88,
author = {Yung H. Tsin},
title = {On Handling Vertex Deletion in Updating Spanning Trees},
journal = {Inf. Process. Lett.},
volume = {27},
number = {4},
pages = {167--168},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90020-8},
doi = {10.1016/0020-0190(88)90020-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tsin88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Watanabe88,
author = {Osamu Watanabe},
title = {On Hardness of One-Way Functions},
journal = {Inf. Process. Lett.},
volume = {27},
number = {3},
pages = {151--157},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90071-3},
doi = {10.1016/0020-0190(88)90071-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Watanabe88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Weems88,
author = {Bob P. Weems},
title = {A Study of Page Arrangements for Extendible Hashing},
journal = {Inf. Process. Lett.},
volume = {27},
number = {5},
pages = {245--248},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90086-5},
doi = {10.1016/0020-0190(88)90086-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Weems88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Witaszek88,
author = {Jacek Witaszek},
title = {A Practical Method for Finding the Optimum Postponement Transformation
for LR(k) Parsers},
journal = {Inf. Process. Lett.},
volume = {27},
number = {2},
pages = {63--67},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90093-2},
doi = {10.1016/0020-0190(88)90093-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Witaszek88.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-27 13:52 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:
