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/ipl20.bht:"
download as .bib file
@article{DBLP:journals/ipl/AuzinsK85,
author = {Andrejs J. Auzins and
Efim B. Kinber},
title = {On Separation of the Emptiness and Equivalence Problems for Program
Schemes},
journal = {Inf. Process. Lett.},
volume = {20},
number = {2},
pages = {91--93},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90070-5},
doi = {10.1016/0020-0190(85)90070-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AuzinsK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Awerbuch85,
author = {Baruch Awerbuch},
title = {A New Distributed Depth-First-Search Algorithm},
journal = {Inf. Process. Lett.},
volume = {20},
number = {3},
pages = {147--150},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90083-3},
doi = {10.1016/0020-0190(85)90083-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Awerbuch85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BeauquierP85,
author = {Dani{\`{e}}le Beauquier and
Dominique Perrin},
title = {Codeterministic Automata on Infinite Words},
journal = {Inf. Process. Lett.},
volume = {20},
number = {2},
pages = {95--98},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90071-7},
doi = {10.1016/0020-0190(85)90071-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BeauquierP85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BeynonI85,
author = {W. M. Beynon and
Costas S. Iliopoulos},
title = {Computing a Basis for a Finite Abelian p-Group},
journal = {Inf. Process. Lett.},
volume = {20},
number = {3},
pages = {161--163},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90086-9},
doi = {10.1016/0020-0190(85)90086-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BeynonI85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BilardiP85,
author = {Gianfranco Bilardi and
Franco P. Preparata},
title = {The {VLSI} Optimality of the {AKS} Sorting Network},
journal = {Inf. Process. Lett.},
volume = {20},
number = {2},
pages = {55--59},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90062-6},
doi = {10.1016/0020-0190(85)90062-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BilardiP85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bitner85,
author = {James R. Bitner},
title = {Storing Matrices on Disk for Efficient Row and Column Retrieval},
journal = {Inf. Process. Lett.},
volume = {20},
number = {5},
pages = {249--254},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90027-4},
doi = {10.1016/0020-0190(85)90027-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bitner85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BookO85,
author = {Ronald V. Book and
Friedrich Otto},
title = {Cancellation Rules and Extended Word Problems},
journal = {Inf. Process. Lett.},
volume = {20},
number = {1},
pages = {5--11},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90122-X},
doi = {10.1016/0020-0190(85)90122-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BookO85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bounas85,
author = {Adam C. Bounas},
title = {Direct Determination of a 'Seed' Binary Matrix},
journal = {Inf. Process. Lett.},
volume = {20},
number = {1},
pages = {47--50},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90129-2},
doi = {10.1016/0020-0190(85)90129-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bounas85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chan85,
author = {Mee Yee Chan},
title = {A Note on Redundant Disk Modulo Allocation},
journal = {Inf. Process. Lett.},
volume = {20},
number = {3},
pages = {121--123},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90077-8},
doi = {10.1016/0020-0190(85)90077-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chan85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ColeY85,
author = {Richard Cole and
Chee{-}Keng Yap},
title = {A Parallel Median Algorithm},
journal = {Inf. Process. Lett.},
volume = {20},
number = {3},
pages = {137--139},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90080-8},
doi = {10.1016/0020-0190(85)90080-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ColeY85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Devroye85,
author = {Luc Devroye},
title = {A Note on the Expected Time Required to Construct the Outer Layer},
journal = {Inf. Process. Lett.},
volume = {20},
number = {5},
pages = {255--257},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90028-6},
doi = {10.1016/0020-0190(85)90028-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Devroye85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Duboc85,
author = {Christine Duboc},
title = {Some Properties of Commutation in Free Partially Commutative Monoids},
journal = {Inf. Process. Lett.},
volume = {20},
number = {1},
pages = {1--4},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90121-8},
doi = {10.1016/0020-0190(85)90121-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Duboc85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gils85,
author = {W. J. Van Gils},
title = {How to Cope with Faulty Processors in a Completely Connected Network
of Communicating Processors},
journal = {Inf. Process. Lett.},
volume = {20},
number = {4},
pages = {207--213},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90051-1},
doi = {10.1016/0020-0190(85)90051-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gils85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HarelP85,
author = {David Harel and
David Peleg},
title = {More on Looping vs. Repeating in Dynamic Logic},
journal = {Inf. Process. Lett.},
volume = {20},
number = {2},
pages = {87--90},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90069-9},
doi = {10.1016/0020-0190(85)90069-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HarelP85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hartmanis85,
author = {Juris Hartmanis},
title = {Independence Results About Context-Free Languages and Lower Bounds},
journal = {Inf. Process. Lett.},
volume = {20},
number = {5},
pages = {241--248},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90026-2},
doi = {10.1016/0020-0190(85)90026-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hartmanis85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Iliopoulos85,
author = {Costas S. Iliopoulos},
title = {Analysis of Algorithms on Problems in General Abelian Groups},
journal = {Inf. Process. Lett.},
volume = {20},
number = {4},
pages = {215--220},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90052-3},
doi = {10.1016/0020-0190(85)90052-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Iliopoulos85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jajodia85,
author = {Sushil Jajodia},
title = {On Equivalence of Relational and Network Database Models},
journal = {Inf. Process. Lett.},
volume = {20},
number = {1},
pages = {51--54},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90130-9},
doi = {10.1016/0020-0190(85)90130-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jajodia85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Joseph85,
author = {Mathai Joseph},
title = {On a Problem in Real-Time Computing},
journal = {Inf. Process. Lett.},
volume = {20},
number = {4},
pages = {173--177},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90045-6},
doi = {10.1016/0020-0190(85)90045-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Joseph85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kak85,
author = {Subhash C. Kak},
title = {How to Detect Tampering of Data},
journal = {Inf. Process. Lett.},
volume = {20},
number = {2},
pages = {109--110},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90074-2},
doi = {10.1016/0020-0190(85)90074-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kak85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Keil85,
author = {J. Mark Keil},
title = {Finding Hamiltonian Circuits in Interval Graphs},
journal = {Inf. Process. Lett.},
volume = {20},
number = {4},
pages = {201--206},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90050-X},
doi = {10.1016/0020-0190(85)90050-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Keil85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LodiL85,
author = {Elena Lodi and
Fabrizio Luccio},
title = {Split Sequence Hash Search},
journal = {Inf. Process. Lett.},
volume = {20},
number = {3},
pages = {131--136},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90079-1},
doi = {10.1016/0020-0190(85)90079-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LodiL85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Main85,
author = {Michael G. Main},
title = {An Infinite Square-Free co-CFL},
journal = {Inf. Process. Lett.},
volume = {20},
number = {2},
pages = {105--107},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90073-0},
doi = {10.1016/0020-0190(85)90073-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Main85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Makinen85,
author = {Erkki M{\"{a}}kinen},
title = {A Note on Undercover Relation},
journal = {Inf. Process. Lett.},
volume = {20},
number = {1},
pages = {19--21},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90124-3},
doi = {10.1016/0020-0190(85)90124-3},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Makinen85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Makinen85a,
author = {Erkki M{\"{a}}kinen},
title = {An Undecidable Problem for Context-Free Grammars},
journal = {Inf. Process. Lett.},
volume = {20},
number = {3},
pages = {141--142},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90081-X},
doi = {10.1016/0020-0190(85)90081-X},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Makinen85a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Martin85,
author = {Alain J. Martin},
title = {The Probe: An Addition to Communication Primitives},
journal = {Inf. Process. Lett.},
volume = {20},
number = {3},
pages = {125--130},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90078-X},
doi = {10.1016/0020-0190(85)90078-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Martin85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/McKeown85,
author = {Geoff P. McKeown},
title = {A Special Purpose {MIMD} Parallel Processor},
journal = {Inf. Process. Lett.},
volume = {20},
number = {1},
pages = {23--27},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90125-5},
doi = {10.1016/0020-0190(85)90125-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/McKeown85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/McLean85,
author = {John McLean},
title = {A Comment on the 'Basic Security Theorem' of Bell and LaPadula},
journal = {Inf. Process. Lett.},
volume = {20},
number = {2},
pages = {67--70},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90065-1},
doi = {10.1016/0020-0190(85)90065-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/McLean85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Meira85,
author = {Silvio Romero de Lemos Meira},
title = {A Linear Applicative Solution for the Set Union Problem},
journal = {Inf. Process. Lett.},
volume = {20},
number = {1},
pages = {43--45},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90128-0},
doi = {10.1016/0020-0190(85)90128-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Meira85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MirzaianA85,
author = {Andranik Mirzaian and
Eshrat Arjomandi},
title = {Selection in {X+Y} and Matrices With Sorted Rows and Columns},
journal = {Inf. Process. Lett.},
volume = {20},
number = {1},
pages = {13--17},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90123-1},
doi = {10.1016/0020-0190(85)90123-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MirzaianA85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Morgan85,
author = {Carroll Morgan},
title = {Global and Logical Time in Distributed Algorithms},
journal = {Inf. Process. Lett.},
volume = {20},
number = {4},
pages = {189--194},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90048-1},
doi = {10.1016/0020-0190(85)90048-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Morgan85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Njau85,
author = {Ernest C. Njau},
title = {Details of Distortions in the Computed Fourier Transforms of Signals
- Part {I:} Short Periodic Signals},
journal = {Inf. Process. Lett.},
volume = {20},
number = {3},
pages = {111--113},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90075-4},
doi = {10.1016/0020-0190(85)90075-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Njau85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Noshita85,
author = {Kohei Noshita},
title = {Translation of Turner Combinators in O(n log n) Space},
journal = {Inf. Process. Lett.},
volume = {20},
number = {2},
pages = {71--74},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90066-3},
doi = {10.1016/0020-0190(85)90066-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Noshita85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Papadimitriou85,
author = {Christos H. Papadimitriou},
title = {An Algorithm for Shortest-Path Motion in Three Dimensions},
journal = {Inf. Process. Lett.},
volume = {20},
number = {5},
pages = {259--263},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90029-8},
doi = {10.1016/0020-0190(85)90029-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Papadimitriou85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PassyT85,
author = {Solomon Passy and
Tinko Tinchev},
title = {{PDL} with Data Constants},
journal = {Inf. Process. Lett.},
volume = {20},
number = {1},
pages = {35--41},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90127-9},
doi = {10.1016/0020-0190(85)90127-9},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PassyT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Plaisted85,
author = {David A. Plaisted},
title = {The Undecidability of Self-Embedding for Term Rewriting Systems},
journal = {Inf. Process. Lett.},
volume = {20},
number = {2},
pages = {61--64},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90063-8},
doi = {10.1016/0020-0190(85)90063-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Plaisted85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RangarajanA85,
author = {K. Rangarajan and
S. Arun{-}Kumar},
title = {Fair Derivations in {E0L} Systems},
journal = {Inf. Process. Lett.},
volume = {20},
number = {4},
pages = {183--188},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90047-X},
doi = {10.1016/0020-0190(85)90047-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RangarajanA85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RaoM85,
author = {S. Upendra Rao and
Arun K. Majumdar},
title = {An Algorithm for Local Compaction of Horizontal Microprograms},
journal = {Inf. Process. Lett.},
volume = {20},
number = {1},
pages = {29--33},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90126-7},
doi = {10.1016/0020-0190(85)90126-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RaoM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Reif85,
author = {John H. Reif},
title = {Depth-First Search is Inherently Sequential},
journal = {Inf. Process. Lett.},
volume = {20},
number = {5},
pages = {229--234},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90024-9},
doi = {10.1016/0020-0190(85)90024-9},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Reif85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SantoroS85,
author = {Nicola Santoro and
Jeffrey B. Sidney},
title = {Interpolation-Binary Search},
journal = {Inf. Process. Lett.},
volume = {20},
number = {4},
pages = {179--181},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90046-8},
doi = {10.1016/0020-0190(85)90046-8},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SantoroS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShallitS85,
author = {Jeffrey O. Shallit and
Adi Shamir},
title = {Number-Theoretic Functions Which Are Equivalent to Number of Divisors},
journal = {Inf. Process. Lett.},
volume = {20},
number = {3},
pages = {151--153},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90084-5},
doi = {10.1016/0020-0190(85)90084-5},
timestamp = {Mon, 09 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ShallitS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Slusarek85,
author = {Maciej Slusarek},
title = {A Note on the Dynamic Storage Allocation Problem},
journal = {Inf. Process. Lett.},
volume = {20},
number = {5},
pages = {223--227},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90023-7},
doi = {10.1016/0020-0190(85)90023-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Slusarek85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Snepscheut85,
author = {Jan L. A. van de Snepscheut},
title = {Evaluating Expressions with a Queue},
journal = {Inf. Process. Lett.},
volume = {20},
number = {2},
pages = {65--66},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90064-X},
doi = {10.1016/0020-0190(85)90064-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Snepscheut85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sontag85,
author = {Eduardo D. Sontag},
title = {Real Addition and the Polynomial Hierarchy},
journal = {Inf. Process. Lett.},
volume = {20},
number = {3},
pages = {115--120},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90076-6},
doi = {10.1016/0020-0190(85)90076-6},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sontag85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Thatte85,
author = {Satish R. Thatte},
title = {On the Correspondence Metween Two Classes of Reduction Systems},
journal = {Inf. Process. Lett.},
volume = {20},
number = {2},
pages = {83--85},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90068-7},
doi = {10.1016/0020-0190(85)90068-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Thatte85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsin85,
author = {Yung H. Tsin},
title = {An Optimal Parallel Processor Bound in Strong Orientation of an Undirected
Graph},
journal = {Inf. Process. Lett.},
volume = {20},
number = {3},
pages = {143--146},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90082-1},
doi = {10.1016/0020-0190(85)90082-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tsin85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ukkonen85,
author = {Esko Ukkonen},
title = {Upper Bounds on the Size of LR(k) Parsers},
journal = {Inf. Process. Lett.},
volume = {20},
number = {2},
pages = {99--103},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90072-9},
doi = {10.1016/0020-0190(85)90072-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ukkonen85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Vishkin85,
author = {Uzi Vishkin},
title = {On Efficient Parallel Strong Orientation},
journal = {Inf. Process. Lett.},
volume = {20},
number = {5},
pages = {235--240},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90025-0},
doi = {10.1016/0020-0190(85)90025-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Vishkin85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Volger85,
author = {Hugo Volger},
title = {Some Results on Addition/Subtraction Chains},
journal = {Inf. Process. Lett.},
volume = {20},
number = {3},
pages = {155--160},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90085-7},
doi = {10.1016/0020-0190(85)90085-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Volger85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Welzl85,
author = {Emo Welzl},
title = {Constructing the Visibility Graph for n-Line Segments in O(n{\({^2}\)})
Time},
journal = {Inf. Process. Lett.},
volume = {20},
number = {4},
pages = {167--171},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90044-4},
doi = {10.1016/0020-0190(85)90044-4},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Welzl85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WidmayerW85,
author = {Peter Widmayer and
C. K. Wong},
title = {An Optimal Algorithm for the Maximum Alignment of Terminals},
journal = {Inf. Process. Lett.},
volume = {20},
number = {2},
pages = {75--82},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90067-5},
doi = {10.1016/0020-0190(85)90067-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WidmayerW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wise85,
author = {David S. Wise},
title = {Representing Matrices as Quadtrees for Parallel Processors},
journal = {Inf. Process. Lett.},
volume = {20},
number = {4},
pages = {195--199},
year = {1985},
url = {https://doi.org/10.1016/0020-0190(85)90049-3},
doi = {10.1016/0020-0190(85)90049-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wise85.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-01 08:00 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:
