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/ipl3.bht:"
download as .bib file
@article{DBLP:journals/ipl/AsaiL75,
author = {H. Asai and
S. C. Lee},
title = {Design of Queuing Buffer Register Size},
journal = {Inf. Process. Lett.},
volume = {3},
number = {5},
pages = {147--152},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90029-0},
doi = {10.1016/0020-0190(75)90029-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AsaiL75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BentleyS75,
author = {Jon Louis Bentley and
Donald F. Stanat},
title = {Analysis of Range Searches in Quad Trees},
journal = {Inf. Process. Lett.},
volume = {3},
number = {6},
pages = {170--173},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90034-4},
doi = {10.1016/0020-0190(75)90034-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BentleyS75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BonoDMRV75,
author = {Ivan Dal Bono and
Mauro Diligenti and
Concetta Mosca and
Antonio Ricci and
Antonio Villani},
title = {A Simple {FORTRAN} Support for Computer-Assisted Instruction},
journal = {Inf. Process. Lett.},
volume = {3},
number = {3},
pages = {88--90},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90023-X},
doi = {10.1016/0020-0190(75)90023-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BonoDMRV75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CahitC75,
author = {Ibrahim Cahit and
R. Cahit},
title = {On the Graceful Numbering of Spanning Trees},
journal = {Inf. Process. Lett.},
volume = {3},
number = {4},
pages = {115--118},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90045-9},
doi = {10.1016/0020-0190(75)90045-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CahitC75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CameriniM75,
author = {Paolo M. Camerini and
Francesco Maffioli},
title = {Bounds for 3-Matroid Intersection Problems},
journal = {Inf. Process. Lett.},
volume = {3},
number = {3},
pages = {81--83},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90021-6},
doi = {10.1016/0020-0190(75)90021-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CameriniM75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cohen75,
author = {Jacques Cohen},
title = {Interpretation of Non-Deterministic Algorithms in Higher-Level Languages},
journal = {Inf. Process. Lett.},
volume = {3},
number = {4},
pages = {104--109},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90042-3},
doi = {10.1016/0020-0190(75)90042-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Cohen75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Crespi-ReghizziM75,
author = {Stefano Crespi{-}Reghizzi and
Dino Mandrioli},
title = {A Decidability Theorem for a Class of Vector-Addition Systems},
journal = {Inf. Process. Lett.},
volume = {3},
number = {3},
pages = {78--80},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90020-4},
doi = {10.1016/0020-0190(75)90020-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Crespi-ReghizziM75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Crespi-ReghizziM75a,
author = {Stefano Crespi{-}Reghizzi and
Dino Mandrioli},
title = {Erratum: {A} Decidability Theorem for a Class of Vector-Addition Systems},
journal = {Inf. Process. Lett.},
volume = {3},
number = {5},
pages = {164},
year = {1975},
timestamp = {Mon, 22 Oct 2012 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Crespi-ReghizziM75a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DasguptaT75,
author = {Subrata Dasgupta and
John Tartar},
title = {On the Minimization of Control Memories},
journal = {Inf. Process. Lett.},
volume = {3},
number = {3},
pages = {71--74},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90018-6},
doi = {10.1016/0020-0190(75)90018-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DasguptaT75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GalandL75,
author = {S. Galand and
G. Loncour},
title = {Structured Implementation of Symbolic Execution: {A} First Part in
a Program Verifier},
journal = {Inf. Process. Lett.},
volume = {3},
number = {4},
pages = {97--103},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90041-1},
doi = {10.1016/0020-0190(75)90041-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GalandL75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gavril75,
author = {Fanica Gavril},
title = {An Algorithm for Testing Chordality of Graphs},
journal = {Inf. Process. Lett.},
volume = {3},
number = {4},
pages = {110--112},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90043-5},
doi = {10.1016/0020-0190(75)90043-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gavril75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ghezzi75,
author = {Carlo Ghezzi},
title = {{LL(1)} Grammars Supporting an Efficient Error Handling},
journal = {Inf. Process. Lett.},
volume = {3},
number = {6},
pages = {174--176},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90035-6},
doi = {10.1016/0020-0190(75)90035-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ghezzi75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Groote75,
author = {Hans F. de Groote},
title = {On the Complexity of Quaternion Multiplication},
journal = {Inf. Process. Lett.},
volume = {3},
number = {6},
pages = {177--179},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90036-8},
doi = {10.1016/0020-0190(75)90036-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Groote75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hansen75,
author = {Per Brinch Hansen},
title = {Universal Types in Concurrent Pascal},
journal = {Inf. Process. Lett.},
volume = {3},
number = {6},
pages = {165--166},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90032-0},
doi = {10.1016/0020-0190(75)90032-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hansen75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hosono75,
author = {Chiharu Hosono},
title = {On the Cardinality of Some Lattices},
journal = {Inf. Process. Lett.},
volume = {3},
number = {3},
pages = {67--68},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90016-2},
doi = {10.1016/0020-0190(75)90016-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hosono75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kameda75,
author = {Tiko Kameda},
title = {On the Vector Representation of the Reachability in Planar Directed
Graphs},
journal = {Inf. Process. Lett.},
volume = {3},
number = {3},
pages = {75--77},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90019-8},
doi = {10.1016/0020-0190(75)90019-8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Kameda75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Keir75,
author = {Roy A. Keir},
title = {Should the Stable Rounding Rule be Radix-Dependent?},
journal = {Inf. Process. Lett.},
volume = {3},
number = {6},
pages = {188--189},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90039-3},
doi = {10.1016/0020-0190(75)90039-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Keir75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kittler75,
author = {Josef Kittler},
title = {On the Divergence and the Joshi Dependence Measure in Feature Selection},
journal = {Inf. Process. Lett.},
volume = {3},
number = {5},
pages = {135--137},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90026-5},
doi = {10.1016/0020-0190(75)90026-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kittler75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lazos75,
author = {Constantine Lazos},
title = {A Comparison of Simulation Results and a Mathematical Model of a Multiprogramming
System},
journal = {Inf. Process. Lett.},
volume = {3},
number = {5},
pages = {127--134},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90025-3},
doi = {10.1016/0020-0190(75)90025-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lazos75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Leeuwen75,
author = {Jan van Leeuwen},
title = {The Membership Question for ET0L-Languages is Polynomially Complete},
journal = {Inf. Process. Lett.},
volume = {3},
number = {5},
pages = {138--143},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90027-7},
doi = {10.1016/0020-0190(75)90027-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Leeuwen75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiptonT75,
author = {Richard J. Lipton and
Robert W. Tuttle},
title = {A Synchronization Anomaly},
journal = {Inf. Process. Lett.},
volume = {3},
number = {3},
pages = {65--66},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90015-0},
doi = {10.1016/0020-0190(75)90015-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiptonT75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pleszczynski75,
author = {Stefan Pleszczynski},
title = {On the Generation of Permutations},
journal = {Inf. Process. Lett.},
volume = {3},
number = {6},
pages = {180--183},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90037-X},
doi = {10.1016/0020-0190(75)90037-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Pleszczynski75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PreparataM75,
author = {Franco P. Preparata and
David E. Muller},
title = {The Time Required to Evaluate Division-Free Arithmetic Expressions},
journal = {Inf. Process. Lett.},
volume = {3},
number = {5},
pages = {144--146},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90028-9},
doi = {10.1016/0020-0190(75)90028-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PreparataM75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ReiserK75,
author = {John F. Reiser and
Donald E. Knuth},
title = {Evading the Drift in Floating-Point Addition},
journal = {Inf. Process. Lett.},
volume = {3},
number = {3},
pages = {84--87},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90022-8},
doi = {10.1016/0020-0190(75)90022-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ReiserK75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ReiserK75a,
author = {John F. Reiser and
Donald E. Knuth},
title = {Erratum: Evading the Drift in Floating-Point Addition},
journal = {Inf. Process. Lett.},
volume = {3},
number = {5},
pages = {164},
year = {1975},
timestamp = {Mon, 22 Oct 2012 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ReiserK75a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rem75,
author = {Martin Rem},
title = {On the Programming of Elastic Stores},
journal = {Inf. Process. Lett.},
volume = {3},
number = {6},
pages = {184--187},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90038-1},
doi = {10.1016/0020-0190(75)90038-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rem75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Robson75,
author = {J. M. Robson},
title = {A Simple Solution to the Interleaved Memory Bandwidth Problem},
journal = {Inf. Process. Lett.},
volume = {3},
number = {4},
pages = {125--126},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90048-4},
doi = {10.1016/0020-0190(75)90048-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Robson75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Solms75,
author = {Sebastiaan H. von Solms},
title = {On {T0L} Languages over Terminals},
journal = {Inf. Process. Lett.},
volume = {3},
number = {3},
pages = {69--70},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90017-4},
doi = {10.1016/0020-0190(75)90017-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Solms75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sridharan75,
author = {N. S. Sridharan},
title = {Erratum: Computer Generation of Vertex Graphs},
journal = {Inf. Process. Lett.},
volume = {3},
number = {5},
pages = {164},
year = {1975},
timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Sridharan75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Stevens75,
author = {Antony Stevens},
title = {An Elementary Computer Algorithm for the Calculation of the Coefficient
of Inbreeding},
journal = {Inf. Process. Lett.},
volume = {3},
number = {5},
pages = {153--163},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90030-7},
doi = {10.1016/0020-0190(75)90030-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Stevens75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wegbreit75,
author = {Ben Wegbreit},
title = {Retrieval from Context Trees},
journal = {Inf. Process. Lett.},
volume = {3},
number = {4},
pages = {119--120},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90046-0},
doi = {10.1016/0020-0190(75)90046-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wegbreit75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Weihrauch75,
author = {Klaus Weihrauch},
title = {Program Schemata with Polynomial Bounded Counters},
journal = {Inf. Process. Lett.},
volume = {3},
number = {3},
pages = {91--96},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90024-1},
doi = {10.1016/0020-0190(75)90024-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Weihrauch75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WolfM75,
author = {S. De Wolf and
G. De Mey},
title = {Numerical Methods for Solving Integral Equations of Potential Problems},
journal = {Inf. Process. Lett.},
volume = {3},
number = {4},
pages = {121--124},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90047-2},
doi = {10.1016/0020-0190(75)90047-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WolfM75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Yuval75,
author = {Gideon Yuval},
title = {Finding Near Neighbors in K-Dimensional Space},
journal = {Inf. Process. Lett.},
volume = {3},
number = {4},
pages = {113--114},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90044-7},
doi = {10.1016/0020-0190(75)90044-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Yuval75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zave75,
author = {Derek A. Zave},
title = {A Fast Compacting Garbage Collector},
journal = {Inf. Process. Lett.},
volume = {3},
number = {6},
pages = {167--169},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90033-2},
doi = {10.1016/0020-0190(75)90033-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zave75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Arnborg74,
author = {Stefan Arnborg},
title = {Abstract Computation Model Used for a Production Compiler},
journal = {Inf. Process. Lett.},
volume = {3},
number = {2},
pages = {46--50},
year = {1974},
url = {https://doi.org/10.1016/0020-0190(74)90023-4},
doi = {10.1016/0020-0190(74)90023-4},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Arnborg74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Campbell74,
author = {John A. Campbell},
title = {Optimal Use of Storage in a Simple Model of Garbage Collection},
journal = {Inf. Process. Lett.},
volume = {3},
number = {2},
pages = {37--38},
year = {1974},
url = {https://doi.org/10.1016/0020-0190(74)90020-9},
doi = {10.1016/0020-0190(74)90020-9},
timestamp = {Fri, 06 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Campbell74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CoopriderHCP74,
author = {Lee W. Cooprider and
F. Heymans and
Pierre{-}Jacques Courtois and
David Lorge Parnas},
title = {Information Streams Sharing a Finite Buffer: Other Solutions},
journal = {Inf. Process. Lett.},
volume = {3},
number = {1},
pages = {16--21},
year = {1974},
url = {https://doi.org/10.1016/0020-0190(74)90041-6},
doi = {10.1016/0020-0190(74)90041-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CoopriderHCP74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Deimel74,
author = {Lionel E. Deimel},
title = {Remark on the Computational Power of a Turing Machine Variant},
journal = {Inf. Process. Lett.},
volume = {3},
number = {2},
pages = {43--45},
year = {1974},
url = {https://doi.org/10.1016/0020-0190(74)90022-2},
doi = {10.1016/0020-0190(74)90022-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Deimel74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fisher74,
author = {David A. Fisher},
title = {Bounded Workspace Garbage Collection in an Address-Order Preserving
List Processing Environment},
journal = {Inf. Process. Lett.},
volume = {3},
number = {1},
pages = {29--32},
year = {1974},
url = {https://doi.org/10.1016/0020-0190(74)90044-1},
doi = {10.1016/0020-0190(74)90044-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fisher74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ibarra74,
author = {Oscar H. Ibarra},
title = {A Note on Semilinear Sets and Bounded-Reversal Multihead Pushdown
Automata},
journal = {Inf. Process. Lett.},
volume = {3},
number = {1},
pages = {25--28},
year = {1974},
url = {https://doi.org/10.1016/0020-0190(74)90043-X},
doi = {10.1016/0020-0190(74)90043-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ibarra74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jovanovich74,
author = {Antonije D. Jovanovich},
title = {Note on a Modification of the Fundamental Cycles Finding Algorithm},
journal = {Inf. Process. Lett.},
volume = {3},
number = {1},
pages = {33},
year = {1974},
url = {https://doi.org/10.1016/0020-0190(74)90045-3},
doi = {10.1016/0020-0190(74)90045-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jovanovich74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KnuthS74a,
author = {Donald E. Knuth and
Jayme Luiz Szwarcfiter},
title = {Erratum: {A} Structured Program to Generate all Topological Sorting
Arrangements},
journal = {Inf. Process. Lett.},
volume = {3},
number = {2},
pages = {64},
year = {1974},
timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KnuthS74a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kobayashi74,
author = {Kojiro Kobayashi},
title = {A Note on Extending Equivalence Theories of Algorithms},
journal = {Inf. Process. Lett.},
volume = {3},
number = {2},
pages = {54--56},
year = {1974},
url = {https://doi.org/10.1016/0020-0190(74)90025-8},
doi = {10.1016/0020-0190(74)90025-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kobayashi74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeuwenS74,
author = {Jan van Leeuwen and
Carl H. Smith},
title = {An Improved Bound for Detecting Looping Configurations in Deterministic
DPA's},
journal = {Inf. Process. Lett.},
volume = {3},
number = {1},
pages = {22--24},
year = {1974},
url = {https://doi.org/10.1016/0020-0190(74)90042-8},
doi = {10.1016/0020-0190(74)90042-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeeuwenS74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MinkerB74,
author = {Jack Minker and
Gordon J. van der Brug},
title = {The Earley Algorithm as a Problem Representation},
journal = {Inf. Process. Lett.},
volume = {3},
number = {1},
pages = {1--7},
year = {1974},
url = {https://doi.org/10.1016/0020-0190(74)90038-6},
doi = {10.1016/0020-0190(74)90038-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MinkerB74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Noshita74,
author = {Kohei Noshita},
title = {Median Selection of 9 Elements in 14 Comparisons},
journal = {Inf. Process. Lett.},
volume = {3},
number = {1},
pages = {8--12},
year = {1974},
url = {https://doi.org/10.1016/0020-0190(74)90039-8},
doi = {10.1016/0020-0190(74)90039-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Noshita74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sridharan74,
author = {N. S. Sridharan},
title = {Computer Generation of Vertex Graphs},
journal = {Inf. Process. Lett.},
volume = {3},
number = {2},
pages = {57--63},
year = {1974},
url = {https://doi.org/10.1016/0020-0190(74)90026-X},
doi = {10.1016/0020-0190(74)90026-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sridharan74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Takaoka74,
author = {Tadao Takaoka},
title = {A Note on the Ambiguity of Context-Free Grammars},
journal = {Inf. Process. Lett.},
volume = {3},
number = {2},
pages = {35--36},
year = {1974},
url = {https://doi.org/10.1016/0020-0190(74)90019-2},
doi = {10.1016/0020-0190(74)90019-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Takaoka74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tarjan74a,
author = {Robert Endre Tarjan},
title = {A New Algorithm for Finding Weak Components},
journal = {Inf. Process. Lett.},
volume = {3},
number = {1},
pages = {13--15},
year = {1974},
url = {https://doi.org/10.1016/0020-0190(74)90040-4},
doi = {10.1016/0020-0190(74)90040-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tarjan74a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tarjan74b,
author = {Robert Endre Tarjan},
title = {A Good Algorithm for Edge-Disjoint Branching},
journal = {Inf. Process. Lett.},
volume = {3},
number = {2},
pages = {51--53},
year = {1974},
url = {https://doi.org/10.1016/0020-0190(74)90024-6},
doi = {10.1016/0020-0190(74)90024-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tarjan74b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zelkowitz74,
author = {Marvin V. Zelkowitz},
title = {Structured Operating System Organization},
journal = {Inf. Process. Lett.},
volume = {3},
number = {2},
pages = {39--42},
year = {1974},
url = {https://doi.org/10.1016/0020-0190(74)90021-0},
doi = {10.1016/0020-0190(74)90021-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zelkowitz74.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 04:32 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:
