default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/ipl/ipl18.bht:"
download as .bib file
@article{DBLP:journals/ipl/AliaBM84,
author = {Giuseppe Alia and
Ferruccio Barsi and
Enrico Martinelli},
title = {A Fast {VLSI} Conversion Between Binary and Residue Systems},
journal = {Inf. Process. Lett.},
volume = {18},
number = {3},
pages = {141--145},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90017-6},
doi = {10.1016/0020-0190(84)90017-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AliaBM84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AllisonN84,
author = {Donald C. S. Allison and
Mark T. Noga},
title = {The L\({}_{\mbox{1}}\) Travelling Salesman Problem},
journal = {Inf. Process. Lett.},
volume = {18},
number = {4},
pages = {195--199},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90110-8},
doi = {10.1016/0020-0190(84)90110-8},
timestamp = {Sat, 13 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AllisonN84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ApostolicoG84,
author = {Alberto Apostolico and
Raffaele Giancarlo},
title = {Pattern Matching Machine Implementation of a Fast Test for Unique
Decipherability},
journal = {Inf. Process. Lett.},
volume = {18},
number = {3},
pages = {155--158},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90020-6},
doi = {10.1016/0020-0190(84)90020-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ApostolicoG84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Atallah84,
author = {Mikhail J. Atallah},
title = {Parallel Strong Orientation of an Undirected Graph},
journal = {Inf. Process. Lett.},
volume = {18},
number = {1},
pages = {37--39},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90072-3},
doi = {10.1016/0020-0190(84)90072-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Atallah84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AtzeniM84,
author = {Paolo Atzeni and
Nicola M. Morfuni},
title = {Functional Dependencies in Relations with Null Values},
journal = {Inf. Process. Lett.},
volume = {18},
number = {4},
pages = {233--238},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90117-0},
doi = {10.1016/0020-0190(84)90117-0},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AtzeniM84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Barth84,
author = {Gerhard Barth},
title = {An Analytical Comparison of Two String Search Algorithms},
journal = {Inf. Process. Lett.},
volume = {18},
number = {5},
pages = {249--256},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90003-6},
doi = {10.1016/0020-0190(84)90003-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Barth84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Berkowitz84,
author = {Stuart J. Berkowitz},
title = {On Computing the Determinant in Small Parallel Time Using a Small
Number of Processors},
journal = {Inf. Process. Lett.},
volume = {18},
number = {3},
pages = {147--150},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90018-8},
doi = {10.1016/0020-0190(84)90018-8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Berkowitz84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Best84,
author = {Eike Best},
title = {Fairness and Conspiracies},
journal = {Inf. Process. Lett.},
volume = {18},
number = {4},
pages = {215--220},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90114-5},
doi = {10.1016/0020-0190(84)90114-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Best84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BlazewiczWD84,
author = {Jacek Blazewicz and
Jan Weglarz and
Mieczyslaw Drabowski},
title = {Scheduling Independent 2-Processor Tasks to Minimize Schedule Length},
journal = {Inf. Process. Lett.},
volume = {18},
number = {5},
pages = {267--273},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90006-1},
doi = {10.1016/0020-0190(84)90006-1},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BlazewiczWD84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChinW84,
author = {Francis Y. L. Chin and
Cao An Wang},
title = {Minimum Vertex Distance Between Separable Convex Polygons},
journal = {Inf. Process. Lett.},
volume = {18},
number = {1},
pages = {41--45},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90073-5},
doi = {10.1016/0020-0190(84)90073-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChinW84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CioniK84,
author = {Gianna Cioni and
Antoni Kreczmar},
title = {Programmed Deallocation Without Dangling Reference},
journal = {Inf. Process. Lett.},
volume = {18},
number = {4},
pages = {179--187},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90108-X},
doi = {10.1016/0020-0190(84)90108-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CioniK84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CormackH84,
author = {Gordon V. Cormack and
R. Nigel Horspool},
title = {Algorithms for Adaptive Huffman Codes},
journal = {Inf. Process. Lett.},
volume = {18},
number = {3},
pages = {159--165},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90021-8},
doi = {10.1016/0020-0190(84)90021-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CormackH84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Courcelle84,
author = {Bruno Courcelle},
title = {Some Negative Results Concerning DPDA's},
journal = {Inf. Process. Lett.},
volume = {18},
number = {5},
pages = {285--289},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90008-5},
doi = {10.1016/0020-0190(84)90008-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Courcelle84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DyerF84,
author = {Martin E. Dyer and
Alan M. Frieze},
title = {A Partitioning Algorithm for Minimum Weighted Euclidean Matching},
journal = {Inf. Process. Lett.},
volume = {18},
number = {2},
pages = {59--62},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90024-3},
doi = {10.1016/0020-0190(84)90024-3},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DyerF84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FleR84,
author = {Marie{-}Paule Fl{\'{e}} and
G{\'{e}}rard Roucairol},
title = {Multiserialization of Iterated Transactions},
journal = {Inf. Process. Lett.},
volume = {18},
number = {5},
pages = {243--247},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90002-4},
doi = {10.1016/0020-0190(84)90002-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FleR84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FriesenL84,
author = {Donald K. Friesen and
Michael A. Langston},
title = {A Storage-Size Selection Problem},
journal = {Inf. Process. Lett.},
volume = {18},
number = {5},
pages = {295--296},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90010-3},
doi = {10.1016/0020-0190(84)90010-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FriesenL84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Geist84,
author = {Robert Geist},
title = {Perception-Based Configuration Design of Computer Systems},
journal = {Inf. Process. Lett.},
volume = {18},
number = {1},
pages = {55--57},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90076-0},
doi = {10.1016/0020-0190(84)90076-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Geist84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GoodmanT84,
author = {Nathan Goodman and
Y. C. Tay},
title = {A Characterization of Multivalued Dependencies Equivalent to a Join
Dependency},
journal = {Inf. Process. Lett.},
volume = {18},
number = {5},
pages = {261--266},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90005-X},
doi = {10.1016/0020-0190(84)90005-X},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GoodmanT84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Holenderski84,
author = {Leszek Holenderski},
title = {A Note on Specifying and Verifying Concurrent Processes},
journal = {Inf. Process. Lett.},
volume = {18},
number = {2},
pages = {77--85},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90028-0},
doi = {10.1016/0020-0190(84)90028-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Holenderski84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hull84,
author = {M. Elizabeth C. Hull},
title = {A Parallel View of Stable Marriages},
journal = {Inf. Process. Lett.},
volume = {18},
number = {2},
pages = {63--66},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90025-5},
doi = {10.1016/0020-0190(84)90025-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hull84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IhmN84,
author = {Heung{-}Soon Ihm and
Simeon C. Ntafos},
title = {On Legal Path Problems in Digraphs},
journal = {Inf. Process. Lett.},
volume = {18},
number = {2},
pages = {93--98},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90030-9},
doi = {10.1016/0020-0190(84)90030-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IhmN84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jin84,
author = {Xiaolong Jin},
title = {Large Processors are Good in {VLSI} Chips},
journal = {Inf. Process. Lett.},
volume = {18},
number = {1},
pages = {47--49},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90074-7},
doi = {10.1016/0020-0190(84)90074-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jin84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kasyanov84,
author = {Victor N. Kasyanov},
title = {Loop Cleaning},
journal = {Inf. Process. Lett.},
volume = {18},
number = {1},
pages = {1--6},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90066-8},
doi = {10.1016/0020-0190(84)90066-8},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kasyanov84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Katsuno84,
author = {Hirofumi Katsuno},
title = {When Do Non-Conflict-Free Multivalued Dependency Dets Appear?},
journal = {Inf. Process. Lett.},
volume = {18},
number = {2},
pages = {87--92},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90029-2},
doi = {10.1016/0020-0190(84)90029-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Katsuno84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KreowskiR84,
author = {Hans{-}J{\"{o}}rg Kreowski and
Grzegorz Rozenberg},
title = {Note on Node-Rewriting Graph Grammars},
journal = {Inf. Process. Lett.},
volume = {18},
number = {1},
pages = {21--24},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90069-3},
doi = {10.1016/0020-0190(84)90069-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KreowskiR84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeL84,
author = {C. C. Lee and
D. T. Lee},
title = {On a Circle-Cover Minimization Problem},
journal = {Inf. Process. Lett.},
volume = {18},
number = {2},
pages = {109--115},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90033-4},
doi = {10.1016/0020-0190(84)90033-4},
timestamp = {Wed, 12 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LeeL84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lickteig84,
author = {Thomas Lickteig},
title = {A Note on Border Rank},
journal = {Inf. Process. Lett.},
volume = {18},
number = {3},
pages = {173--178},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90023-1},
doi = {10.1016/0020-0190(84)90023-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lickteig84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lifschitz84,
author = {Vladimir Lifschitz},
title = {On Verification of Programs With Goto Statements},
journal = {Inf. Process. Lett.},
volume = {18},
number = {4},
pages = {221--225},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90115-7},
doi = {10.1016/0020-0190(84)90115-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lifschitz84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Magott84,
author = {Jan Magott},
title = {Performance Evaluation of Concurrent Systems Using Petri Nets},
journal = {Inf. Process. Lett.},
volume = {18},
number = {1},
pages = {7--13},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90067-X},
doi = {10.1016/0020-0190(84)90067-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Magott84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MannilaU84,
author = {Heikki Mannila and
Esko Ukkonen},
title = {A Simple Linear-Time Algorithm for in Situ Merging},
journal = {Inf. Process. Lett.},
volume = {18},
number = {4},
pages = {203--208},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90112-1},
doi = {10.1016/0020-0190(84)90112-1},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MannilaU84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Miola84,
author = {Alfonso Miola},
title = {Algebraic Approach to p-adic Conversion of Rational Numbers},
journal = {Inf. Process. Lett.},
volume = {18},
number = {3},
pages = {167--171},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90022-X},
doi = {10.1016/0020-0190(84)90022-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Miola84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Miyano84,
author = {Satoru Miyano},
title = {Remarks on Two-Way Automata with Weak-Counters},
journal = {Inf. Process. Lett.},
volume = {18},
number = {2},
pages = {105--107},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90032-2},
doi = {10.1016/0020-0190(84)90032-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Miyano84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MoffatT84,
author = {Alistair Moffat and
Tadao Takaoka},
title = {A Priority Queue for the All Pairs Shortest Path Problem},
journal = {Inf. Process. Lett.},
volume = {18},
number = {4},
pages = {189--193},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90109-1},
doi = {10.1016/0020-0190(84)90109-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MoffatT84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Moller-NielsenS84,
author = {Peter M{\o}ller{-}Nielsen and
J{\o}rgen Staunstrup},
title = {Experiments With a Fast String Searching Algorithm},
journal = {Inf. Process. Lett.},
volume = {18},
number = {3},
pages = {129--135},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90015-2},
doi = {10.1016/0020-0190(84)90015-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Moller-NielsenS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Monien84,
author = {Burkhard Monien},
title = {Deterministic Two-Way One-Head Pushdown Automata are Very Powerful},
journal = {Inf. Process. Lett.},
volume = {18},
number = {5},
pages = {239--242},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90001-2},
doi = {10.1016/0020-0190(84)90001-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Monien84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/OhyaIM84,
author = {Takao Ohya and
Masao Iri and
Kazuo Murota},
title = {A Fast Voronoi-Diagram Algorithm With Quaternary Tree Bucketing},
journal = {Inf. Process. Lett.},
volume = {18},
number = {4},
pages = {227--231},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90116-9},
doi = {10.1016/0020-0190(84)90116-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/OhyaIM84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Remmers84,
author = {John H. Remmers},
title = {A Technique for Developing Loop Invariants},
journal = {Inf. Process. Lett.},
volume = {18},
number = {3},
pages = {137--139},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90016-4},
doi = {10.1016/0020-0190(84)90016-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Remmers84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rowe84,
author = {Neil C. Rowe},
title = {Diophantine Inference on a Statistical Database},
journal = {Inf. Process. Lett.},
volume = {18},
number = {1},
pages = {25--31},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90070-X},
doi = {10.1016/0020-0190(84)90070-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rowe84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Saoudi84,
author = {Ahmed Saoudi},
title = {Infinitary Tree Languages Recognized by omega-Automata},
journal = {Inf. Process. Lett.},
volume = {18},
number = {1},
pages = {15--19},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90068-1},
doi = {10.1016/0020-0190(84)90068-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Saoudi84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ScarioniS84,
author = {F. Scarioni and
H. G. Speranza},
title = {A Probabilistic Analysis of an Error-Correcting Algorithm for the
Towers of Hanoi Puzzle},
journal = {Inf. Process. Lett.},
volume = {18},
number = {2},
pages = {99--103},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90031-0},
doi = {10.1016/0020-0190(84)90031-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ScarioniS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Schlorer84,
author = {Jan Schl{\"{o}}rer},
title = {Insecurity of Set Controls for Statistical Databases},
journal = {Inf. Process. Lett.},
volume = {18},
number = {2},
pages = {67--71},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90026-7},
doi = {10.1016/0020-0190(84)90026-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Schlorer84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tazawa84,
author = {Shinsei Tazawa},
title = {On the Consecutive Retrieval Property for Generalized Binary Queries},
journal = {Inf. Process. Lett.},
volume = {18},
number = {5},
pages = {291--293},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90009-7},
doi = {10.1016/0020-0190(84)90009-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tazawa84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tiekenheinrich84,
author = {J{\"{u}}rgen Tiekenheinrich},
title = {A 4n-Lower Bound on the Monotone Network Complexity of a One-Output
Boolean Function},
journal = {Inf. Process. Lett.},
volume = {18},
number = {4},
pages = {201--202},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90111-X},
doi = {10.1016/0020-0190(84)90111-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tiekenheinrich84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Topor84,
author = {Rodney W. Topor},
title = {Termination Detection for Distributed Computations},
journal = {Inf. Process. Lett.},
volume = {18},
number = {1},
pages = {33--36},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90071-1},
doi = {10.1016/0020-0190(84)90071-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Topor84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Trakhtenbrot84,
author = {Mark B. Trakhtenbrot},
title = {Some Equivalent Transformations of Recursive Programs Based on Their
Schematic Properties},
journal = {Inf. Process. Lett.},
volume = {18},
number = {5},
pages = {275--283},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90007-3},
doi = {10.1016/0020-0190(84)90007-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Trakhtenbrot84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Turan84,
author = {Gy{\"{o}}rgy Tur{\'{a}}n},
title = {The Critical Complexity of Graph Properties},
journal = {Inf. Process. Lett.},
volume = {18},
number = {3},
pages = {151--153},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90019-X},
doi = {10.1016/0020-0190(84)90019-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Turan84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TurpinC84,
author = {Russell Turpin and
Brian A. Coan},
title = {Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement},
journal = {Inf. Process. Lett.},
volume = {18},
number = {2},
pages = {73--76},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90027-9},
doi = {10.1016/0020-0190(84)90027-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TurpinC84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Vardi84,
author = {Moshe Y. Vardi},
title = {A Note on Lossless Database Decompositions},
journal = {Inf. Process. Lett.},
volume = {18},
number = {5},
pages = {257--260},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90004-8},
doi = {10.1016/0020-0190(84)90004-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Vardi84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wilf84,
author = {Herbert S. Wilf},
title = {Backtrack: An {O(1)} Expected Time Algorithm for the Graph Coloring
Problem},
journal = {Inf. Process. Lett.},
volume = {18},
number = {3},
pages = {119--121},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90013-9},
doi = {10.1016/0020-0190(84)90013-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wilf84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YamasakiYDH84,
author = {Susumu Yamasaki and
Mikio Yoshida and
Shuji Doshita and
Mikito Hirata},
title = {A New Combination of Input and Unit Deductions for Horn Sentences},
journal = {Inf. Process. Lett.},
volume = {18},
number = {4},
pages = {209--213},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90113-3},
doi = {10.1016/0020-0190(84)90113-3},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YamasakiYDH84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Yodogawa84,
author = {Eiji Yodogawa},
title = {A Note on Array Grammars},
journal = {Inf. Process. Lett.},
volume = {18},
number = {1},
pages = {51--54},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90075-9},
doi = {10.1016/0020-0190(84)90075-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Yodogawa84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zemel84,
author = {Eitan Zemel},
title = {An O(n) Algorithm for the Linear Multiple Choice Knapsack Problem
and Related Problems},
journal = {Inf. Process. Lett.},
volume = {18},
number = {3},
pages = {123--128},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90014-0},
doi = {10.1016/0020-0190(84)90014-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zemel84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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-11-24 22:27 CET 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:
