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/ipl15.bht:"
download as .bib file
@article{DBLP:journals/ipl/BalcazarD82,
author = {Jos{\'{e}} L. Balc{\'{a}}zar and
Josep D{\'{\i}}az},
title = {A Note on a Theorem by Ladner},
journal = {Inf. Process. Lett.},
volume = {15},
number = {2},
pages = {84--86},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90113-2},
doi = {10.1016/0020-0190(82)90113-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BalcazarD82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BeckerDDHKKMNRW82,
author = {Michael Becker and
W. Degenhardt and
J{\"{u}}rgen Doenhardt and
Stefan Hertel and
Gerd Kaninke and
W. Kerber and
Kurt Mehlhorn and
Stefan N{\"{a}}her and
Hans Rohnert and
Thomas Winter},
title = {A Probabilistic Algorithm for Vertex Connectivity of Graphs},
journal = {Inf. Process. Lett.},
volume = {15},
number = {3},
pages = {135--136},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90046-1},
doi = {10.1016/0020-0190(82)90046-1},
timestamp = {Thu, 23 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BeckerDDHKKMNRW82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BergstraT82,
author = {Jan A. Bergstra and
John V. Tucker},
title = {Two Theorems About the Completeness of Hoare's Logic},
journal = {Inf. Process. Lett.},
volume = {15},
number = {4},
pages = {143--149},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90095-3},
doi = {10.1016/0020-0190(82)90095-3},
timestamp = {Fri, 12 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BergstraT82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BermondDQ82,
author = {Jean{-}Claude Bermond and
Charles Delorme and
Jean{-}Jacques Quisquater},
title = {Tables of Large Graphs with Given Degree and Diameter},
journal = {Inf. Process. Lett.},
volume = {15},
number = {1},
pages = {10--13},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90076-X},
doi = {10.1016/0020-0190(82)90076-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BermondDQ82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BronDS82,
author = {Coenraad Bron and
E. J. Dijkstra and
S. Doaitse Swierstra},
title = {A Memory-Management Unit for the Optimal Exploitation of a Small Address
Space},
journal = {Inf. Process. Lett.},
volume = {15},
number = {1},
pages = {20--22},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90078-3},
doi = {10.1016/0020-0190(82)90078-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BronDS82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CeriP82,
author = {Stefano Ceri and
Giuseppe Pelagatti},
title = {A Solution Method for the Non-Additive Resource Allocation Problem
in Distributed System Design},
journal = {Inf. Process. Lett.},
volume = {15},
number = {4},
pages = {174--178},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90100-4},
doi = {10.1016/0020-0190(82)90100-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CeriP82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cheung82,
author = {To{-}Yat Cheung},
title = {A Statistical Model for Estimating the Number of Records in a Relational
Database},
journal = {Inf. Process. Lett.},
volume = {15},
number = {3},
pages = {115--118},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90042-4},
doi = {10.1016/0020-0190(82)90042-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Cheung82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CulikW82,
author = {Karel Cul{\'{\i}}k II and
Derick Wood},
title = {A Note on Some Tree Similarity Measures},
journal = {Inf. Process. Lett.},
volume = {15},
number = {1},
pages = {39--42},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90083-7},
doi = {10.1016/0020-0190(82)90083-7},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CulikW82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DijkstraG82,
author = {Edsger W. Dijkstra and
A. J. M. van Gasteren},
title = {An Introduction to Three Algorithms for Sorting in Situ},
journal = {Inf. Process. Lett.},
volume = {15},
number = {3},
pages = {129--134},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90045-X},
doi = {10.1016/0020-0190(82)90045-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DijkstraG82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EastmanZ82,
author = {Caroline M. Eastman and
Maria Zemankova},
title = {Partially Specified Nearest Neighbor Searches Using k-d Trees},
journal = {Inf. Process. Lett.},
volume = {15},
number = {2},
pages = {53--56},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90106-5},
doi = {10.1016/0020-0190(82)90106-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EastmanZ82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FarleyP82,
author = {Arthur M. Farley and
Andrzej Proskurowski},
title = {Directed Maximal-Cut Problems},
journal = {Inf. Process. Lett.},
volume = {15},
number = {5},
pages = {238--241},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90125-9},
doi = {10.1016/0020-0190(82)90125-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FarleyP82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GohR82,
author = {L. Goh and
Doron Rotem},
title = {Recognition of Perfect Elimination Bipartite Graphs},
journal = {Inf. Process. Lett.},
volume = {15},
number = {4},
pages = {179--182},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90101-6},
doi = {10.1016/0020-0190(82)90101-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GohR82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GoldbergPB82,
author = {Allen Goldberg and
Paul Walton Purdom Jr. and
Cynthia A. Brown},
title = {Average Time Analyses of Simplified Davis-Putnam Procedures},
journal = {Inf. Process. Lett.},
volume = {15},
number = {2},
pages = {72--75},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90110-7},
doi = {10.1016/0020-0190(82)90110-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GoldbergPB82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GonzalezJ82,
author = {Teofilo F. Gonzalez and
Donald B. Johnson},
title = {Sorting Numbers in Linear Expected Time and Optimal Extra Space},
journal = {Inf. Process. Lett.},
volume = {15},
number = {3},
pages = {119--124},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90043-6},
doi = {10.1016/0020-0190(82)90043-6},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GonzalezJ82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GreenbergLPG82,
author = {Albert G. Greenberg and
Richard E. Ladner and
Mike Paterson and
Zvi Galil},
title = {Efficient Parallel Algorithms for Linear Recurrence Computation},
journal = {Inf. Process. Lett.},
volume = {15},
number = {1},
pages = {31--35},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90081-3},
doi = {10.1016/0020-0190(82)90081-3},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GreenbergLPG82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Highnam82,
author = {Peter T. Highnam},
title = {The Aars of a Polygon},
journal = {Inf. Process. Lett.},
volume = {15},
number = {5},
pages = {196--198},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90116-8},
doi = {10.1016/0020-0190(82)90116-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Highnam82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HoshiY82,
author = {Mamoru Hoshi and
Toshitsugu Yuba},
title = {A Counter Example to a Monotonicity Property of k-d Trees},
journal = {Inf. Process. Lett.},
volume = {15},
number = {4},
pages = {169--173},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90099-0},
doi = {10.1016/0020-0190(82)90099-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HoshiY82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Imai82,
author = {Hiroshi Imai},
title = {Finding Connected Components of an Intersection Graph of Squares in
the Euclidean Plane},
journal = {Inf. Process. Lett.},
volume = {15},
number = {3},
pages = {125--128},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90044-8},
doi = {10.1016/0020-0190(82)90044-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Imai82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/InoueTT82,
author = {Katsushi Inoue and
Itsuo Takanami and
Hiroshi Taniguchi},
title = {A Note on Alternating On-Line Turing Machines},
journal = {Inf. Process. Lett.},
volume = {15},
number = {4},
pages = {164--168},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90098-9},
doi = {10.1016/0020-0190(82)90098-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/InoueTT82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JouannaudL82,
author = {Jean{-}Pierre Jouannaud and
Pierre Lescanne},
title = {On Multiset Orderings},
journal = {Inf. Process. Lett.},
volume = {15},
number = {2},
pages = {57--63},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90107-7},
doi = {10.1016/0020-0190(82)90107-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JouannaudL82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KorczynskiW82,
author = {Waldemar Korczynski and
J{\'{o}}zef Winkowski},
title = {A Communication Concept for Distributed Systems},
journal = {Inf. Process. Lett.},
volume = {15},
number = {3},
pages = {111--114},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90041-2},
doi = {10.1016/0020-0190(82)90041-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KorczynskiW82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Leipala82,
author = {Timo Leip{\"{a}}l{\"{a}}},
title = {On Optimal Multilevel Indexed Sequential Files},
journal = {Inf. Process. Lett.},
volume = {15},
number = {5},
pages = {191--195},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90115-6},
doi = {10.1016/0020-0190(82)90115-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Leipala82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Leung82,
author = {Clement H. C. Leung},
title = {Optimal Database Reorganisation: Some Practical Difficulties},
journal = {Inf. Process. Lett.},
volume = {15},
number = {1},
pages = {23--27},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90079-5},
doi = {10.1016/0020-0190(82)90079-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Leung82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Levy82,
author = {Leon S. Levy},
title = {An Improved List-Searching Algorithm},
journal = {Inf. Process. Lett.},
volume = {15},
number = {1},
pages = {43--45},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90084-9},
doi = {10.1016/0020-0190(82)90084-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Levy82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LewisS82,
author = {Harry R. Lewis and
Richard Statman},
title = {Unifiability is Complete for co-NLogSpace},
journal = {Inf. Process. Lett.},
volume = {15},
number = {5},
pages = {220--222},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90121-1},
doi = {10.1016/0020-0190(82)90121-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LewisS82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuccioP82,
author = {Fabrizio Luccio and
Linda Pagli},
title = {A Linear Algorithm to Determine Minimal Spanning Forests in Chain
Graphs},
journal = {Inf. Process. Lett.},
volume = {15},
number = {1},
pages = {1--4},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90074-6},
doi = {10.1016/0020-0190(82)90074-6},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LuccioP82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuekerW82,
author = {George S. Lueker and
Dan E. Willard},
title = {A Data Structure for Dynamic Range Queries},
journal = {Inf. Process. Lett.},
volume = {15},
number = {5},
pages = {209--213},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90119-3},
doi = {10.1016/0020-0190(82)90119-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LuekerW82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lukaszewicz82,
author = {Leon Lukaszewicz},
title = {Universal Grammars},
journal = {Inf. Process. Lett.},
volume = {15},
number = {2},
pages = {76--80},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90111-9},
doi = {10.1016/0020-0190(82)90111-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lukaszewicz82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Main82,
author = {Michael G. Main},
title = {Permutations Are Not Context-Free: An Application of the Interchange
Lemma},
journal = {Inf. Process. Lett.},
volume = {15},
number = {2},
pages = {68--71},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90109-0},
doi = {10.1016/0020-0190(82)90109-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Main82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Manacher82,
author = {Glenn K. Manacher},
title = {Steady-Paced-Output and Fractional-On-Line Algorithms on a {RAM}},
journal = {Inf. Process. Lett.},
volume = {15},
number = {2},
pages = {47--52},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90105-3},
doi = {10.1016/0020-0190(82)90105-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Manacher82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Morris82,
author = {F. Lockwood Morris},
title = {Another Compacting Garbage Collector},
journal = {Inf. Process. Lett.},
volume = {15},
number = {4},
pages = {139--142},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90094-1},
doi = {10.1016/0020-0190(82)90094-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Morris82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mostowski82,
author = {Andrzej Wlodzimierz Mostowski},
title = {Determinancy of Sinking Automata on Infinite Trees and Inequalities
Between Various Rabin's Pair Indices},
journal = {Inf. Process. Lett.},
volume = {15},
number = {4},
pages = {159--163},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90097-7},
doi = {10.1016/0020-0190(82)90097-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mostowski82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Motoki82,
author = {Tatsuya Motoki},
title = {A Note on Upper Bounds for the Selection Problem},
journal = {Inf. Process. Lett.},
volume = {15},
number = {5},
pages = {214--219},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90120-X},
doi = {10.1016/0020-0190(82)90120-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Motoki82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MuluszynskiN82,
author = {Jan Maluszynski and
J{\o}rgen Fischer Nilsson},
title = {Grammatical Unification},
journal = {Inf. Process. Lett.},
volume = {15},
number = {4},
pages = {150--158},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90096-5},
doi = {10.1016/0020-0190(82)90096-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MuluszynskiN82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Nijholt82a,
author = {Anton Nijholt},
title = {On the Relationship Between the LL(k) and LR(k) Grammars},
journal = {Inf. Process. Lett.},
volume = {15},
number = {3},
pages = {97--101},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90038-2},
doi = {10.1016/0020-0190(82)90038-2},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Nijholt82a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ReddyBP82a,
author = {P. G. Reddy and
Subhash Bhalla and
Bandreddi E. Prasad},
title = {Robust, Centralized Certifier Based Concurrency Control for Distributed
Databases},
journal = {Inf. Process. Lett.},
volume = {15},
number = {3},
pages = {105--110},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90040-0},
doi = {10.1016/0020-0190(82)90040-0},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ReddyBP82a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rytter82,
author = {Wojciech Rytter},
title = {A Note on Two-Way Nondeterministic Pushdown Automata},
journal = {Inf. Process. Lett.},
volume = {15},
number = {1},
pages = {5--9},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90075-8},
doi = {10.1016/0020-0190(82)90075-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rytter82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rytter82a,
author = {Wojciech Rytter},
title = {Time Complexity of Unambiguous Path Systems},
journal = {Inf. Process. Lett.},
volume = {15},
number = {3},
pages = {102--104},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90039-4},
doi = {10.1016/0020-0190(82)90039-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rytter82a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Schorr82,
author = {Amir Schorr},
title = {Fast Algorithm for Sparse Matrix Multiplication},
journal = {Inf. Process. Lett.},
volume = {15},
number = {2},
pages = {87--89},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90114-4},
doi = {10.1016/0020-0190(82)90114-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Schorr82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sharir82,
author = {Micha Sharir},
title = {Fast Composition of Sparse Maps},
journal = {Inf. Process. Lett.},
volume = {15},
number = {4},
pages = {183--185},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90102-8},
doi = {10.1016/0020-0190(82)90102-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sharir82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Slater82,
author = {Peter J. Slater},
title = {A Linear Algorithm for the Number of Degree Constrained Subforests
of a Tree},
journal = {Inf. Process. Lett.},
volume = {15},
number = {4},
pages = {186--188},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90103-X},
doi = {10.1016/0020-0190(82)90103-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Slater82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Spyratos82,
author = {Michael Spyratos},
title = {A Homomorphism Theorem for Data Base Mappings},
journal = {Inf. Process. Lett.},
volume = {15},
number = {3},
pages = {91--96},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90037-0},
doi = {10.1016/0020-0190(82)90037-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Spyratos82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/StockmeyerV82,
author = {Larry J. Stockmeyer and
Vijay V. Vazirani},
title = {NP-Completeness of Some Generalizations of the Maximum Matching Problem},
journal = {Inf. Process. Lett.},
volume = {15},
number = {1},
pages = {14--19},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90077-1},
doi = {10.1016/0020-0190(82)90077-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/StockmeyerV82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Stout82,
author = {Quentin F. Stout},
title = {Drawing Straight Lines with a Pyramid Cellular Automaton},
journal = {Inf. Process. Lett.},
volume = {15},
number = {5},
pages = {233--237},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90124-7},
doi = {10.1016/0020-0190(82)90124-7},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Stout82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Syslo82,
author = {Maciej M. Syslo},
title = {A Labeling Algorithm to Recognize a Line Digraph and Output its Root
Graph},
journal = {Inf. Process. Lett.},
volume = {15},
number = {1},
pages = {28--30},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90080-1},
doi = {10.1016/0020-0190(82)90080-1},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Syslo82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Szepietowski82,
author = {Andrzej Szepietowski},
title = {A Finite 5-Pebble-Automaton Can Search Every Maze},
journal = {Inf. Process. Lett.},
volume = {15},
number = {5},
pages = {199--204},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90117-X},
doi = {10.1016/0020-0190(82)90117-X},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Szepietowski82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tamminen82,
author = {Markku Tamminen},
title = {Extendible Hashing with Overflow},
journal = {Inf. Process. Lett.},
volume = {15},
number = {5},
pages = {227--232},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90123-5},
doi = {10.1016/0020-0190(82)90123-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tamminen82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Walsh82,
author = {Timothy R. Walsh},
title = {The Towers of Hanoi Revisited: Moving the Rings by Counting the Moves},
journal = {Inf. Process. Lett.},
volume = {15},
number = {2},
pages = {64--67},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90108-9},
doi = {10.1016/0020-0190(82)90108-9},
timestamp = {Fri, 30 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Walsh82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wang82,
author = {Patrick Shen{-}Pei Wang},
title = {A New Hierarchy of Two-Dimensional Array Languages},
journal = {Inf. Process. Lett.},
volume = {15},
number = {5},
pages = {223--226},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90122-3},
doi = {10.1016/0020-0190(82)90122-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wang82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wegener82,
author = {Ingo Wegener},
title = {Best Possible Asymptotic Bounds on the Depth of Monotone Functions
in Multivalued Logic},
journal = {Inf. Process. Lett.},
volume = {15},
number = {2},
pages = {81--83},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90112-0},
doi = {10.1016/0020-0190(82)90112-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wegener82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wegner82,
author = {Lutz M. Wegner},
title = {Sorting a Linked List with Equal Keys},
journal = {Inf. Process. Lett.},
volume = {15},
number = {5},
pages = {205--208},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90118-1},
doi = {10.1016/0020-0190(82)90118-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wegner82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Winkler82,
author = {Peter M. Winkler},
title = {On Computability of the Mean Deviation},
journal = {Inf. Process. Lett.},
volume = {15},
number = {1},
pages = {36--38},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90082-5},
doi = {10.1016/0020-0190(82)90082-5},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Winkler82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-06-06 03:55 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:
