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/ipl1.bht:"
download as .bib file
@article{DBLP:journals/ipl/Anderssen72,
author = {Robert S. Anderssen},
title = {A Refinement Procedure for Pure Random Search},
journal = {Inf. Process. Lett.},
volume = {1},
number = {5},
pages = {197--200},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90038-5},
doi = {10.1016/0020-0190(72)90038-5},
timestamp = {Fri, 01 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Anderssen72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Baker72,
author = {John L. Baker},
title = {An Unintentional Omission from {ALGOL} 68},
journal = {Inf. Process. Lett.},
volume = {1},
number = {6},
pages = {244--245},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90020-8},
doi = {10.1016/0020-0190(72)90020-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Baker72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bayer72,
author = {Rudolf Bayer},
title = {Oriented Balanced Trees and Equivalence Relations},
journal = {Inf. Process. Lett.},
volume = {1},
number = {6},
pages = {226--228},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90016-6},
doi = {10.1016/0020-0190(72)90016-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bayer72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Brandstetter72,
author = {A. Brandstetter},
title = {Storage Requirements in Stochastic Data Acquisition Systems},
journal = {Inf. Process. Lett.},
volume = {1},
number = {6},
pages = {217--219},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90014-2},
doi = {10.1016/0020-0190(72)90014-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Brandstetter72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BranquartCDL72,
author = {Paul Branquart and
Jean{-}Pierre Cardinael and
Jean{-}Paul Delescaille and
Johan Lewi},
title = {A Context-Free Syntax of {ALGOL} 68},
journal = {Inf. Process. Lett.},
volume = {1},
number = {4},
pages = {141--148},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90047-6},
doi = {10.1016/0020-0190(72)90047-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BranquartCDL72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bron72,
author = {Coenraad Bron},
title = {Outline of a Machine Without Branch Instructions},
journal = {Inf. Process. Lett.},
volume = {1},
number = {3},
pages = {117--119},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90011-7},
doi = {10.1016/0020-0190(72)90011-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bron72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CarrollFG72,
author = {John M. Carroll and
William Fraser and
Gregory Gill},
title = {Automatic Content Analysis in an On-Line Environment},
journal = {Inf. Process. Lett.},
volume = {1},
number = {4},
pages = {134--140},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90046-4},
doi = {10.1016/0020-0190(72)90046-4},
timestamp = {Mon, 27 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CarrollFG72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chroust72,
author = {Gerhard Chroust},
title = {Expression Evaluation with Minimum Average Working Storage},
journal = {Inf. Process. Lett.},
volume = {1},
number = {3},
pages = {111--114},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90009-9},
doi = {10.1016/0020-0190(72)90009-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chroust72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DamT72,
author = {Andries van Dam and
Frank Wm. Tompa},
title = {Software Data Paging and Segmentation for Complex Systems},
journal = {Inf. Process. Lett.},
volume = {1},
number = {3},
pages = {80--86},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90003-8},
doi = {10.1016/0020-0190(72)90003-8},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DamT72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Dijkstra72,
author = {Edsger W. Dijkstra},
title = {Information Streams Sharing a Finite Buffer},
journal = {Inf. Process. Lett.},
volume = {1},
number = {5},
pages = {179--180},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90034-8},
doi = {10.1016/0020-0190(72)90034-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Dijkstra72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Engelfriet72,
author = {Joost Engelfriet},
title = {A Note on Infinite Trees},
journal = {Inf. Process. Lett.},
volume = {1},
number = {6},
pages = {229--232},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90017-8},
doi = {10.1016/0020-0190(72)90017-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Engelfriet72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Findler72,
author = {Nicholas V. Findler},
title = {Short Note on a Heuristic Search Strategy in Long-Term Memory Networks},
journal = {Inf. Process. Lett.},
volume = {1},
number = {5},
pages = {191--196},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90037-3},
doi = {10.1016/0020-0190(72)90037-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Findler72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Graham72,
author = {Ronald L. Graham},
title = {An Efficient Algorithm for Determining the Convex Hull of a Finite
Planar Set},
journal = {Inf. Process. Lett.},
volume = {1},
number = {4},
pages = {132--133},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90045-2},
doi = {10.1016/0020-0190(72)90045-2},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Graham72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gries72,
author = {David Gries},
title = {Programming by Induction},
journal = {Inf. Process. Lett.},
volume = {1},
number = {3},
pages = {100--107},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90007-5},
doi = {10.1016/0020-0190(72)90007-5},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Gries72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Horowitz72,
author = {Ellis Horowitz},
title = {A Fast Method for Interpolation Using Preconditioning},
journal = {Inf. Process. Lett.},
volume = {1},
number = {4},
pages = {157--163},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90050-6},
doi = {10.1016/0020-0190(72)90050-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Horowitz72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Horowitz72a,
author = {Ellis Horowitz},
title = {Errata: {A} Fast Method for Interpolation Using Preconditioning},
journal = {Inf. Process. Lett.},
volume = {1},
number = {5},
pages = {216},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90043-9},
doi = {10.1016/0020-0190(72)90043-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Horowitz72a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KnuthF72,
author = {Donald E. Knuth and
Robert W. Floyd},
title = {Errata: Notes on Avoiding "go to" Statements},
journal = {Inf. Process. Lett.},
volume = {1},
number = {4},
pages = {177},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90054-3},
doi = {10.1016/0020-0190(72)90054-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KnuthF72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KnuthK72,
author = {Donald E. Knuth and
E. B. Kaehler},
title = {An Experiment in Optimal Sorting},
journal = {Inf. Process. Lett.},
volume = {1},
number = {4},
pages = {173--176},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90053-1},
doi = {10.1016/0020-0190(72)90053-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KnuthK72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kral72,
author = {Jaroslav Kr{\'{a}}l},
title = {A New Additive Pseudorandom Number Generator for Extremely Short Word-Lengths},
journal = {Inf. Process. Lett.},
volume = {1},
number = {4},
pages = {164--167},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90051-8},
doi = {10.1016/0020-0190(72)90051-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kral72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kral72a,
author = {Jaroslav Kr{\'{a}}l},
title = {Errata: {A} New Additive Pseudorandom Number Generator for Extremely
Short Word-Lengths},
journal = {Inf. Process. Lett.},
volume = {1},
number = {5},
pages = {216},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90042-7},
doi = {10.1016/0020-0190(72)90042-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kral72a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KrepyshevP72,
author = {G. B. Krepyshev and
Ya. A. Pollack},
title = {Synthesis of a Discrete-Time Optimal Filter Algorithm with Reduced
Sensitivity to Deviations of a Priori Statistics},
journal = {Inf. Process. Lett.},
volume = {1},
number = {5},
pages = {211--215},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90041-5},
doi = {10.1016/0020-0190(72)90041-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KrepyshevP72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mayoh72,
author = {Brian H. Mayoh},
title = {Recursion and Stacks},
journal = {Inf. Process. Lett.},
volume = {1},
number = {3},
pages = {115--116},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90010-5},
doi = {10.1016/0020-0190(72)90010-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mayoh72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MolchanovN72,
author = {I. N. Molchanov and
L. D. Nikolenko},
title = {On an Approach to Integrating Boundary Problems With a Non-Unique
Solution},
journal = {Inf. Process. Lett.},
volume = {1},
number = {4},
pages = {168--172},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90052-X},
doi = {10.1016/0020-0190(72)90052-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MolchanovN72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MolchanovS72,
author = {I. N. Molchanov and
N. I. Stepanets},
title = {Iterative Methods for Solving Difference Equations of the Theory of
Elasticity not Depending on the Spacing of the Difference Set},
journal = {Inf. Process. Lett.},
volume = {1},
number = {5},
pages = {205--210},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90040-3},
doi = {10.1016/0020-0190(72)90040-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MolchanovS72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NievergeltPWY72,
author = {J{\"{u}}rg Nievergelt and
J. Pradels and
C. K. Wong and
P. C. Yue},
title = {Bounds on the Weighted Path Length of Binary Trees},
journal = {Inf. Process. Lett.},
volume = {1},
number = {6},
pages = {220--225},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90015-4},
doi = {10.1016/0020-0190(72)90015-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/NievergeltPWY72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/OgilvieO72,
author = {John C. Ogilvie and
C. L. Olson},
title = {On the Use of Complete Subgraphs in Cluster Analysis},
journal = {Inf. Process. Lett.},
volume = {1},
number = {3},
pages = {76--79},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90002-6},
doi = {10.1016/0020-0190(72)90002-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/OgilvieO72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ReddyBEJNRW72,
author = {Raj Reddy and
W. Broadley and
Lee D. Erman and
R. Johnsson and
J. Newcomer and
George G. Robertson and
J. Wright},
title = {{XCRIBL} - {A} Hardcopy Scan Line Graphics System for Document Generation},
journal = {Inf. Process. Lett.},
volume = {1},
number = {6},
pages = {246--251},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90021-X},
doi = {10.1016/0020-0190(72)90021-X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ReddyBEJNRW72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rozenberg72,
author = {Grzegorz Rozenberg},
title = {The Equivalence Problem for Deterministic T0L-Systems is Undecidable},
journal = {Inf. Process. Lett.},
volume = {1},
number = {5},
pages = {201--204},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90039-7},
doi = {10.1016/0020-0190(72)90039-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rozenberg72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rozenberg72a,
author = {Grzegorz Rozenberg},
title = {Direct Proofs of the Undecidability of the Equivalence Problem for
Sentential Forms of Linear Context-Free Grammars and the Equivalence
Problem for 0L Systems},
journal = {Inf. Process. Lett.},
volume = {1},
number = {6},
pages = {233--235},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90018-X},
doi = {10.1016/0020-0190(72)90018-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rozenberg72a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rozenberg72b,
author = {Grzegorz Rozenberg},
title = {Errata: The Equivalence Problem for Deterministic T0L-Systems is Undecidable},
journal = {Inf. Process. Lett.},
volume = {1},
number = {6},
pages = {252},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90022-1},
doi = {10.1016/0020-0190(72)90022-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rozenberg72b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Siklossy72,
author = {Laurent Sikl{\'{o}}ssy},
title = {Fast and Read-Only Algorithms for Traversing Trees Without an Auxiliary
Stack},
journal = {Inf. Process. Lett.},
volume = {1},
number = {4},
pages = {149--152},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90048-8},
doi = {10.1016/0020-0190(72)90048-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Siklossy72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Solntseff72,
author = {Nicholas Solntseff},
title = {A Classification of Extensible Programming Languages},
journal = {Inf. Process. Lett.},
volume = {1},
number = {3},
pages = {91--96},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90005-1},
doi = {10.1016/0020-0190(72)90005-1},
timestamp = {Thu, 25 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Solntseff72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SolntseffY72,
author = {Nicholas Solntseff and
A. Yezerski},
title = {{ECT} - An Extensible-Contractable Translator System},
journal = {Inf. Process. Lett.},
volume = {1},
number = {3},
pages = {97--99},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90006-3},
doi = {10.1016/0020-0190(72)90006-3},
timestamp = {Thu, 25 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SolntseffY72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tarjan72,
author = {Robert Endre Tarjan},
title = {Determining Whether a Groupoid is a Group},
journal = {Inf. Process. Lett.},
volume = {1},
number = {3},
pages = {120--124},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90012-9},
doi = {10.1016/0020-0190(72)90012-9},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Tarjan72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Toussaint72,
author = {Godfried T. Toussaint},
title = {Feature Evaluation with Quadratic Mutual Information},
journal = {Inf. Process. Lett.},
volume = {1},
number = {4},
pages = {153--156},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90049-X},
doi = {10.1016/0020-0190(72)90049-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Toussaint72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsichritzis72,
author = {Dennis Tsichritzis},
title = {Protection in Operating Systems},
journal = {Inf. Process. Lett.},
volume = {1},
number = {4},
pages = {127--131},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90044-0},
doi = {10.1016/0020-0190(72)90044-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tsichritzis72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tzafestas72,
author = {Spyros G. Tzafestas},
title = {Input-Output Modeling and Identification of Linear Automata},
journal = {Inf. Process. Lett.},
volume = {1},
number = {3},
pages = {69--75},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90001-4},
doi = {10.1016/0020-0190(72)90001-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tzafestas72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tzafestas72a,
author = {Spyros G. Tzafestas},
title = {Design Parameters for a Multiserver Processing Buffering System with
Feedback},
journal = {Inf. Process. Lett.},
volume = {1},
number = {6},
pages = {236--243},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90019-1},
doi = {10.1016/0020-0190(72)90019-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tzafestas72a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VantilborghL72,
author = {Hendrik Vantilborgh and
Axel van Lamsweerde},
title = {On an Extension of Dijkstra's Semaphore Primitives},
journal = {Inf. Process. Lett.},
volume = {1},
number = {5},
pages = {181--186},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90035-X},
doi = {10.1016/0020-0190(72)90035-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/VantilborghL72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Varney72,
author = {Robert C. Varney},
title = {Priority Processes Used for Scheduling Within a Tree Structured Operating
System},
journal = {Inf. Process. Lett.},
volume = {1},
number = {5},
pages = {187--190},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90036-1},
doi = {10.1016/0020-0190(72)90036-1},
timestamp = {Tue, 30 Mar 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Varney72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Whale72,
author = {J. F. Whale},
title = {The Critical Value of the Basic Parameter of a Nonlinear Differential
Equation},
journal = {Inf. Process. Lett.},
volume = {1},
number = {3},
pages = {87--90},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90004-X},
doi = {10.1016/0020-0190(72)90004-X},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Whale72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zimmer72,
author = {Rainer Zimmer},
title = {Soft Precedence},
journal = {Inf. Process. Lett.},
volume = {1},
number = {3},
pages = {108--110},
year = {1972},
url = {https://doi.org/10.1016/0020-0190(72)90008-7},
doi = {10.1016/0020-0190(72)90008-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zimmer72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BorodinM71,
author = {Allan Borodin and
J. Ian Munro},
title = {Evaluating Polynomials at Many Points},
journal = {Inf. Process. Lett.},
volume = {1},
number = {2},
pages = {66--68},
year = {1971},
url = {https://doi.org/10.1016/0020-0190(71)90009-3},
doi = {10.1016/0020-0190(71)90009-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BorodinM71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CavinessPR71,
author = {Bob F. Caviness and
P. L. Pollack and
C. M. Rubald},
title = {An Existence Lemma for Canonical Forms in Symbolic Mathematics},
journal = {Inf. Process. Lett.},
volume = {1},
number = {2},
pages = {45--46},
year = {1971},
url = {https://doi.org/10.1016/0020-0190(71)90003-2},
doi = {10.1016/0020-0190(71)90003-2},
timestamp = {Tue, 29 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CavinessPR71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Corneil71,
author = {Derek G. Corneil},
title = {An n{\({^2}\)} Algorithm for Determining the Bridges of a Graph},
journal = {Inf. Process. Lett.},
volume = {1},
number = {2},
pages = {51--55},
year = {1971},
url = {https://doi.org/10.1016/0020-0190(71)90005-6},
doi = {10.1016/0020-0190(71)90005-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Corneil71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DuncanZ71,
author = {Fraser G. Duncan and
D. Zissos},
title = {Programmed Simulation of Sequential Circuits},
journal = {Inf. Process. Lett.},
volume = {1},
number = {1},
pages = {4--6},
year = {1971},
url = {https://doi.org/10.1016/0020-0190(71)90012-3},
doi = {10.1016/0020-0190(71)90012-3},
timestamp = {Thu, 03 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DuncanZ71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gelenbe71,
author = {Erol Gelenbe},
title = {The Two-Thirds Rule for Dynamic Storage Allocation Under Equilibrium},
journal = {Inf. Process. Lett.},
volume = {1},
number = {2},
pages = {59--60},
year = {1971},
url = {https://doi.org/10.1016/0020-0190(71)90007-X},
doi = {10.1016/0020-0190(71)90007-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gelenbe71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HenhaplJ71,
author = {Wolfgang Henhapl and
Cliff B. Jones},
title = {A Run-Time Mechanism for Referencing Variables},
journal = {Inf. Process. Lett.},
volume = {1},
number = {1},
pages = {14--16},
year = {1971},
url = {https://doi.org/10.1016/0020-0190(71)90015-9},
doi = {10.1016/0020-0190(71)90015-9},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HenhaplJ71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HopcroftT71,
author = {John E. Hopcroft and
Robert Endre Tarjan},
title = {A V{\({^2}\)} Algorithm for Determining Isomorphism of Planar Graphs},
journal = {Inf. Process. Lett.},
volume = {1},
number = {1},
pages = {32--34},
year = {1971},
url = {https://doi.org/10.1016/0020-0190(71)90019-6},
doi = {10.1016/0020-0190(71)90019-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HopcroftT71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Karlgren71,
author = {Hans Karlgren},
title = {Stacking Without Really Stacking When Reducing Categorical Expressions},
journal = {Inf. Process. Lett.},
volume = {1},
number = {1},
pages = {21--22},
year = {1971},
url = {https://doi.org/10.1016/0020-0190(71)90017-2},
doi = {10.1016/0020-0190(71)90017-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Karlgren71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KnuthF71,
author = {Donald E. Knuth and
Robert W. Floyd},
title = {Notes on Avoiding "go to" Statements},
journal = {Inf. Process. Lett.},
volume = {1},
number = {1},
pages = {23--31},
year = {1971},
url = {https://doi.org/10.1016/0020-0190(71)90018-4},
doi = {10.1016/0020-0190(71)90018-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KnuthF71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Maurer71,
author = {Hermann A. Maurer},
title = {The Solution of a Problem by Ginsburg},
journal = {Inf. Process. Lett.},
volume = {1},
number = {1},
pages = {7--10},
year = {1971},
url = {https://doi.org/10.1016/0020-0190(71)90013-5},
doi = {10.1016/0020-0190(71)90013-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Maurer71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Merrett71,
author = {T. H. Merrett},
title = {General Programs for Management Systems},
journal = {Inf. Process. Lett.},
volume = {1},
number = {1},
pages = {17--20},
year = {1971},
url = {https://doi.org/10.1016/0020-0190(71)90016-0},
doi = {10.1016/0020-0190(71)90016-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Merrett71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MilgramR71,
author = {David L. Milgram and
Azriel Rosenfeld},
title = {A Note on Scattered Context Grammars},
journal = {Inf. Process. Lett.},
volume = {1},
number = {2},
pages = {47--50},
year = {1971},
url = {https://doi.org/10.1016/0020-0190(71)90004-4},
doi = {10.1016/0020-0190(71)90004-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MilgramR71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Munro71,
author = {J. Ian Munro},
title = {Efficient Determination of the Transitive Closure of a Directed Graph},
journal = {Inf. Process. Lett.},
volume = {1},
number = {2},
pages = {56--58},
year = {1971},
url = {https://doi.org/10.1016/0020-0190(71)90006-8},
doi = {10.1016/0020-0190(71)90006-8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Munro71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Salton71,
author = {Gerard Salton},
title = {The Performance of Interactive Information Retrieval},
journal = {Inf. Process. Lett.},
volume = {1},
number = {2},
pages = {35--41},
year = {1971},
url = {https://doi.org/10.1016/0020-0190(71)90001-9},
doi = {10.1016/0020-0190(71)90001-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Salton71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Scheidig71,
author = {H. Scheidig},
title = {Representation and Equality of Modes},
journal = {Inf. Process. Lett.},
volume = {1},
number = {2},
pages = {61--65},
year = {1971},
url = {https://doi.org/10.1016/0020-0190(71)90008-1},
doi = {10.1016/0020-0190(71)90008-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Scheidig71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Stacey71,
author = {G. M. Stacey},
title = {The Role of Virtual Memory in the Handling of Application Files},
journal = {Inf. Process. Lett.},
volume = {1},
number = {1},
pages = {1--3},
year = {1971},
url = {https://doi.org/10.1016/0020-0190(71)90011-1},
doi = {10.1016/0020-0190(71)90011-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Stacey71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsichritzis71,
author = {Dennis Tsichritzis},
title = {A Note on Comparison of Subrecursive Hierarchies},
journal = {Inf. Process. Lett.},
volume = {1},
number = {2},
pages = {42--44},
year = {1971},
url = {https://doi.org/10.1016/0020-0190(71)90002-0},
doi = {10.1016/0020-0190(71)90002-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tsichritzis71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZissosD71,
author = {D. Zissos and
Fraser G. Duncan},
title = {Programmed Simulation of Race Hazards in Sequential Circuits},
journal = {Inf. Process. Lett.},
volume = {1},
number = {1},
pages = {11--13},
year = {1971},
url = {https://doi.org/10.1016/0020-0190(71)90014-7},
doi = {10.1016/0020-0190(71)90014-7},
timestamp = {Thu, 03 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZissosD71.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-24 15:23 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:
