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/ipl13.bht:"
download as .bib file
@article{DBLP:journals/ipl/AgrawalaT81,
author = {Ashok K. Agrawala and
Satish K. Tripathi},
title = {On the Optimality of Semidynamic Routing Schemes},
journal = {Inf. Process. Lett.},
volume = {13},
number = {1},
pages = {20--22},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90144-7},
doi = {10.1016/0020-0190(81)90144-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AgrawalaT81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AnconaG81,
author = {Massimo Ancona and
Vittoria Gianuzzi},
title = {A New Method for Implementing LR(k) Tables},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {171--176},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90052-1},
doi = {10.1016/0020-0190(81)90052-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AnconaG81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AroraS81,
author = {R. K. Arora and
N. K. Sharma},
title = {Guarded Procedure: {A} Distributed Programming Concept},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {199--203},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90058-2},
doi = {10.1016/0020-0190(81)90058-2},
timestamp = {Fri, 26 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AroraS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AtallahK81,
author = {Mikhail J. Atallah and
S. Rao Kosaraju},
title = {An Adversary-Based Lower Bound for Sorting},
journal = {Inf. Process. Lett.},
volume = {13},
number = {2},
pages = {55--57},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90031-4},
doi = {10.1016/0020-0190(81)90031-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AtallahK81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Atkinson81,
author = {M. D. Atkinson},
title = {The Cyclic Towers of Hanoi},
journal = {Inf. Process. Lett.},
volume = {13},
number = {3},
pages = {118--119},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90123-X},
doi = {10.1016/0020-0190(81)90123-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Atkinson81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BarlowES81,
author = {R. H. Barlow and
David J. Evans and
J. Shanehchi},
title = {A Parallel Merging Algorithm},
journal = {Inf. Process. Lett.},
volume = {13},
number = {3},
pages = {103--106},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90119-8},
doi = {10.1016/0020-0190(81)90119-8},
timestamp = {Tue, 13 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BarlowES81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Barth81,
author = {Gerhard Barth},
title = {An Alternative for the Implementation of the Knuth-Morris-Pratt Algorithm},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {134--137},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90042-9},
doi = {10.1016/0020-0190(81)90042-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Barth81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bertossi81,
author = {Alan A. Bertossi},
title = {The Edge Hamiltonian Path Problem is NP-Complete},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {157--159},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90048-X},
doi = {10.1016/0020-0190(81)90048-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bertossi81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bird81,
author = {Richard S. Bird},
title = {The Jogger's Problem},
journal = {Inf. Process. Lett.},
volume = {13},
number = {3},
pages = {114--117},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90122-8},
doi = {10.1016/0020-0190(81)90122-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bird81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BlumKVPY81,
author = {Manuel Blum and
Richard M. Karp and
Oliver Vornberger and
Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {The Complexity of Testing Whether a Graph is a Superconcentrator},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {164--167},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90050-8},
doi = {10.1016/0020-0190(81)90050-8},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BlumKVPY81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Book81a,
author = {Ronald V. Book},
title = {{NTS} Grammars and Church-Rosser Systems},
journal = {Inf. Process. Lett.},
volume = {13},
number = {2},
pages = {73--76},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90036-3},
doi = {10.1016/0020-0190(81)90036-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Book81a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chan81,
author = {Tat{-}hung Chan},
title = {Deciding Freeness for Program Schemes with a Single Unary Function},
journal = {Inf. Process. Lett.},
volume = {13},
number = {3},
pages = {98--102},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90118-6},
doi = {10.1016/0020-0190(81)90118-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chan81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ClerboutL81,
author = {Mireille Clerbout and
Michel Latteux},
title = {The Inclusion of {D0L} in {MULTI-RESET}},
journal = {Inf. Process. Lett.},
volume = {13},
number = {2},
pages = {45--47},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90028-4},
doi = {10.1016/0020-0190(81)90028-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ClerboutL81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DavisRT81,
author = {Robert H. Davis and
C. Rinaldi and
C. J. Trebilcock},
title = {Data Compression in Limited Capacity Microcomputer Systems},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {138--141},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90043-0},
doi = {10.1016/0020-0190(81)90043-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DavisRT81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DenningMS81,
author = {Dorothy E. Denning and
Henk Meijer and
Fred B. Schneider},
title = {More on Master Keys for Group Sharing},
journal = {Inf. Process. Lett.},
volume = {13},
number = {3},
pages = {125--126},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90125-3},
doi = {10.1016/0020-0190(81)90125-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DenningMS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EdelsbrunnerM81,
author = {Herbert Edelsbrunner and
Hermann A. Maurer},
title = {On the Intersection of Orthogonal Objects},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {177--181},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90053-3},
doi = {10.1016/0020-0190(81)90053-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EdelsbrunnerM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EhrenfeuchtR81,
author = {Andrzej Ehrenfeucht and
Grzegorz Rozenberg},
title = {On the Subword Complexity of {D0L} Languages with a Constant Distribution},
journal = {Inf. Process. Lett.},
volume = {13},
number = {3},
pages = {108--113},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90121-6},
doi = {10.1016/0020-0190(81)90121-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EhrenfeuchtR81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Filho81,
author = {Ysmar V. Silva Filho},
title = {Optimal Choice of Discriminators in a Balanced k-d Binary Search Tree},
journal = {Inf. Process. Lett.},
volume = {13},
number = {2},
pages = {67--70},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90034-X},
doi = {10.1016/0020-0190(81)90034-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Filho81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Freivalds81,
author = {Rusins Freivalds},
title = {Projections of Languages Recognizable by Probabilistic and Alternating
Finite Multitape Automata},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {195--198},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90057-0},
doi = {10.1016/0020-0190(81)90057-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Freivalds81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GoodmanS81,
author = {Nathan Goodman and
Oded Shmueli},
title = {Limitations of the Chase},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {154--156},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90047-8},
doi = {10.1016/0020-0190(81)90047-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GoodmanS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuidaS81,
author = {Giovanni Guida and
Marco Somalvico},
title = {Multi-Problem-Solving: Knowledge Representation and System Architecture},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {204--214},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90059-4},
doi = {10.1016/0020-0190(81)90059-4},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GuidaS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GunnH81,
author = {Hamish I. E. Gunn and
David M. Harland},
title = {Degrees of Constancy in Programming Languages},
journal = {Inf. Process. Lett.},
volume = {13},
number = {1},
pages = {35--38},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90147-2},
doi = {10.1016/0020-0190(81)90147-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GunnH81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hassin81,
author = {Refael Hassin},
title = {Maximum Flow in (s, t) Planar Networks},
journal = {Inf. Process. Lett.},
volume = {13},
number = {3},
pages = {107},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90120-4},
doi = {10.1016/0020-0190(81)90120-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hassin81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HoodM81,
author = {Robert Hood and
Robert Melville},
title = {Real-Time Queue Operation in Pure {LISP}},
journal = {Inf. Process. Lett.},
volume = {13},
number = {2},
pages = {50--54},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90030-2},
doi = {10.1016/0020-0190(81)90030-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HoodM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IbarraM81,
author = {Oscar H. Ibarra and
Shlomo Moran},
title = {Deterministic and Probabilistic Algorithms for Maximum Bipartite Matching
Via Fast Matrix Multiplication},
journal = {Inf. Process. Lett.},
volume = {13},
number = {1},
pages = {12--15},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90142-3},
doi = {10.1016/0020-0190(81)90142-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IbarraM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IbarraR81,
author = {Oscar H. Ibarra and
Louis E. Rosier},
title = {On the Decidability of Equivalence for Deterministic Pushdown Transducers},
journal = {Inf. Process. Lett.},
volume = {13},
number = {3},
pages = {89--93},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90116-2},
doi = {10.1016/0020-0190(81)90116-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IbarraR81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Korsh81,
author = {James F. Korsh},
title = {Greedy Binary Search Trees are Nearly Optimal},
journal = {Inf. Process. Lett.},
volume = {13},
number = {1},
pages = {16--19},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90143-5},
doi = {10.1016/0020-0190(81)90143-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Korsh81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LewisBB81,
author = {Gilbert N. Lewis and
Nancy J. Boynton and
F. Warren Burton},
title = {Expected Complexity of Fast Search with Uniformly Distributed Data},
journal = {Inf. Process. Lett.},
volume = {13},
number = {1},
pages = {4--7},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90140-X},
doi = {10.1016/0020-0190(81)90140-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LewisBB81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Makarov81,
author = {O. M. Makarov},
title = {Using Duality for the Synthesis of an Optimal Algorithm Involving
Matrix Multiplication},
journal = {Inf. Process. Lett.},
volume = {13},
number = {2},
pages = {48--49},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90029-6},
doi = {10.1016/0020-0190(81)90029-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Makarov81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Moran81,
author = {Shlomo Moran},
title = {A Note on 'Is Shortest Path Problem not Harder Than Matrix Multiplication?'},
journal = {Inf. Process. Lett.},
volume = {13},
number = {2},
pages = {85--86},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90039-9},
doi = {10.1016/0020-0190(81)90039-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Moran81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Nakamura81,
author = {Akira Nakamura},
title = {Some Remarks on One-Pebble Rectangular Array Acceptors},
journal = {Inf. Process. Lett.},
volume = {13},
number = {2},
pages = {80--84},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90038-7},
doi = {10.1016/0020-0190(81)90038-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Nakamura81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NakamuraA81,
author = {Akira Nakamura and
Kunio Aizawa},
title = {Acceptors for Isometric Parallel Context-Free Array Languages},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {182--186},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90054-5},
doi = {10.1016/0020-0190(81)90054-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/NakamuraA81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pan81,
author = {Victor Y. Pan},
title = {The Lower Bounds on the Additive Complexity of Bilinear Problems in
Terms of Some Algebraic Quantities},
journal = {Inf. Process. Lett.},
volume = {13},
number = {2},
pages = {71--72},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90035-1},
doi = {10.1016/0020-0190(81)90035-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Pan81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PapadimitriouY81a,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {The Clique Problem for Planar Graphs},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {131--133},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90041-7},
doi = {10.1016/0020-0190(81)90041-7},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PapadimitriouY81a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RamamohanaraoS81,
author = {Kotagiri Ramamohanarao and
Ron Sacks{-}Davis},
title = {Hardware Address Translation for Machines with a Large Virtual Memory},
journal = {Inf. Process. Lett.},
volume = {13},
number = {1},
pages = {23--29},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90145-9},
doi = {10.1016/0020-0190(81)90145-9},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RamamohanaraoS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Regnier81,
author = {Mireille R{\'{e}}gnier},
title = {On the Average Height of Trees in Digital Search and Dynamic Hashing},
journal = {Inf. Process. Lett.},
volume = {13},
number = {2},
pages = {64--66},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90033-8},
doi = {10.1016/0020-0190(81)90033-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Regnier81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Romani81,
author = {Francesco Romani},
title = {Author's Reply to S. Moran's Note on the Shortest Path Problem},
journal = {Inf. Process. Lett.},
volume = {13},
number = {2},
pages = {87},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90040-5},
doi = {10.1016/0020-0190(81)90040-5},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Romani81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rytter81a,
author = {Wojciech Rytter},
title = {The Dynamic Simulation of Recursive and Stack Manipulation Programs},
journal = {Inf. Process. Lett.},
volume = {13},
number = {2},
pages = {58--63},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90032-6},
doi = {10.1016/0020-0190(81)90032-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rytter81a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rytter81b,
author = {Wojciech Rytter},
title = {Time Complexity of Languages Recognized by One-Way Multihead Pushdown
Automata},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {142--144},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90044-2},
doi = {10.1016/0020-0190(81)90044-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rytter81b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rytter81c,
author = {Wojciech Rytter},
title = {A Hardest Language Recognized by Two-Way Nondeterministic Pushdown
Automata},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {145--146},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90045-4},
doi = {10.1016/0020-0190(81)90045-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rytter81c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sabelfeld81,
author = {Viktor K. Sabelfeld},
title = {Tree Equivalence of Linear Recursive Schemata is Polynomial-Time Decidable},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {147--153},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90046-6},
doi = {10.1016/0020-0190(81)90046-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sabelfeld81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Schwartz81,
author = {Jacob T. Schwartz},
title = {Finding the Minimum Distance Between Two Convex Polygons},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {168--170},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90051-X},
doi = {10.1016/0020-0190(81)90051-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Schwartz81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Senizergues81,
author = {G{\'{e}}raud S{\'{e}}nizergues},
title = {A New Class of {C.F.L.} for Which the Equivalence is Decidable},
journal = {Inf. Process. Lett.},
volume = {13},
number = {1},
pages = {30--34},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90146-0},
doi = {10.1016/0020-0190(81)90146-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Senizergues81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Siklossy81,
author = {Laurent Sikl{\'{o}}ssy},
title = {Efficient Query Evaluation in Relational Data Bases with Missing Values},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {160--163},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90049-1},
doi = {10.1016/0020-0190(81)90049-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Siklossy81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Snepscheut81,
author = {Jan L. A. van de Snepscheut},
title = {Synchronous Communication Between Asynchronous Components},
journal = {Inf. Process. Lett.},
volume = {13},
number = {3},
pages = {127--130},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90126-5},
doi = {10.1016/0020-0190(81)90126-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Snepscheut81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Storer81,
author = {James A. Storer},
title = {Constructing Full Spanning Trees for Cubic Graphs},
journal = {Inf. Process. Lett.},
volume = {13},
number = {1},
pages = {8--11},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90141-1},
doi = {10.1016/0020-0190(81)90141-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Storer81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/StoyanS81,
author = {Yu. G. Stoyan and
S. V. Smelyakov},
title = {An Approach to the Problems of Routing Optimization in the Regions
of Intricate Shape},
journal = {Inf. Process. Lett.},
volume = {13},
number = {1},
pages = {39--43},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90148-4},
doi = {10.1016/0020-0190(81)90148-4},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/StoyanS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TolleS81,
author = {Donald MacDavid Tolle and
William E. Siddall},
title = {On the Complexity of Vector Computations in Binary Tree Machines},
journal = {Inf. Process. Lett.},
volume = {13},
number = {3},
pages = {120--124},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90124-1},
doi = {10.1016/0020-0190(81)90124-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TolleS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TroyaV81,
author = {Jos{\'{e}} M. Troya and
A. Vaquero},
title = {An Approximation Algorithm for Reducing Expected Head Movement in
Linear Storage Devices},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {218--220},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90061-2},
doi = {10.1016/0020-0190(81)90061-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TroyaV81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Vitter81,
author = {Jeffrey Scott Vitter},
title = {A Shared-Memory Scheme for Coalesced Hashing},
journal = {Inf. Process. Lett.},
volume = {13},
number = {2},
pages = {77--79},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90037-5},
doi = {10.1016/0020-0190(81)90037-5},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Vitter81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WarrenFM81,
author = {Henry S. Warren Jr. and
A. Shawhan Fox and
Peter W. Markstein},
title = {Modulus Division on a Two's Complement Machine},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {215--217},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90060-0},
doi = {10.1016/0020-0190(81)90060-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WarrenFM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Watanabe81,
author = {Osamu Watanabe},
title = {A Fast Algorithm for Finding all Shortest Paths},
journal = {Inf. Process. Lett.},
volume = {13},
number = {1},
pages = {1--3},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90139-3},
doi = {10.1016/0020-0190(81)90139-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Watanabe81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Williams81,
author = {M. Howard Williams},
title = {A Systematic Test for Extended Operator Precedence},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {187--190},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90055-7},
doi = {10.1016/0020-0190(81)90055-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Williams81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Yamasaki81,
author = {Hideki Yamasaki},
title = {On Weak Persistency of Petri Nets},
journal = {Inf. Process. Lett.},
volume = {13},
number = {3},
pages = {94--97},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90117-4},
doi = {10.1016/0020-0190(81)90117-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Yamasaki81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Yasuura81,
author = {Hiroto Yasuura},
title = {Width and Depth of Combinational Logic Circuits},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {191--194},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90056-9},
doi = {10.1016/0020-0190(81)90056-9},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Yasuura81.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 10:59 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:
