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/ipl38.bht:"
download as .bib file
@article{DBLP:journals/ipl/AcketaZ91,
author = {Dragan M. Acketa and
Jovisa D. Zunic},
title = {On the Number of Linear Partitions of the (m, n)-Grid},
journal = {Inf. Process. Lett.},
volume = {38},
number = {3},
pages = {163--168},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90240-I},
doi = {10.1016/0020-0190(91)90240-I},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AcketaZ91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlvarezG91,
author = {Carme {\`{A}}lvarez and
Joaquim Gabarr{\'{o}}},
title = {The Parallel Complexity of Two Problems on Concurrency},
journal = {Inf. Process. Lett.},
volume = {38},
number = {2},
pages = {61--70},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90224-6},
doi = {10.1016/0020-0190(91)90224-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlvarezG91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Basart91,
author = {Josep M. Basart},
title = {Some Upper Bounds for Minimal Trees},
journal = {Inf. Process. Lett.},
volume = {38},
number = {4},
pages = {209--213},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90102-N},
doi = {10.1016/0020-0190(91)90102-N},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Basart91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BradfordJ91,
author = {James H. Bradford and
T. A. Jenkyns},
title = {On the Inadequacy of Tournament Algorithms for the {N-SCS} Problem},
journal = {Inf. Process. Lett.},
volume = {38},
number = {4},
pages = {169--171},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90094-X},
doi = {10.1016/0020-0190(91)90094-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BradfordJ91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CaiH91,
author = {Jin{-}yi Cai and
Lane A. Hemachandra},
title = {A Note on Enumarative Counting},
journal = {Inf. Process. Lett.},
volume = {38},
number = {4},
pages = {215--219},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90103-O},
doi = {10.1016/0020-0190(91)90103-O},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CaiH91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenDA91,
author = {Calvin Ching{-}Yuen Chen and
Sajal K. Das and
Selim G. Akl},
title = {A Unified Approach to Parallel Depth-First Traversals of General Trees},
journal = {Inf. Process. Lett.},
volume = {38},
number = {1},
pages = {49--55},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90214-3},
doi = {10.1016/0020-0190(91)90214-3},
timestamp = {Tue, 10 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenDA91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cheng91,
author = {Xu Cheng},
title = {A Graph Transformation Algorithm for Concurrency Control in a Partitioned
Database},
journal = {Inf. Process. Lett.},
volume = {38},
number = {1},
pages = {43--48},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90213-2},
doi = {10.1016/0020-0190(91)90213-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Cheng91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChrobakL91,
author = {Marek Chrobak and
Lawrence L. Larmore},
title = {A Note on the Server Problem and a Benevolent Adversary},
journal = {Inf. Process. Lett.},
volume = {38},
number = {4},
pages = {173--175},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90095-Y},
doi = {10.1016/0020-0190(91)90095-Y},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChrobakL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CrochemoreR91,
author = {Maxime Crochemore and
Wojciech Rytter},
title = {Efficient Parallel Algorithms to Test Square-Freeness and Factorize
Strings},
journal = {Inf. Process. Lett.},
volume = {38},
number = {2},
pages = {57--60},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90223-5},
doi = {10.1016/0020-0190(91)90223-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CrochemoreR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Danzig91,
author = {Peter B. Danzig},
title = {A Cooperative Game with Applications to Computer Networks},
journal = {Inf. Process. Lett.},
volume = {38},
number = {6},
pages = {283--289},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90083-T},
doi = {10.1016/0020-0190(91)90083-T},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Danzig91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DielissenK91,
author = {Victor J. Dielissen and
Anne Kaldewaij},
title = {Rectangular Partition is Polynomial in Two Dimensions but NP-Complete
in Three},
journal = {Inf. Process. Lett.},
volume = {38},
number = {1},
pages = {1--6},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90207-X},
doi = {10.1016/0020-0190(91)90207-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DielissenK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ElmagarmidD91,
author = {Ahmed K. Elmagarmid and
Weimin Du},
title = {Integrity Aspects of Quasi Serializability},
journal = {Inf. Process. Lett.},
volume = {38},
number = {1},
pages = {23--28},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90210-9},
doi = {10.1016/0020-0190(91)90210-9},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ElmagarmidD91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fernandez-BacaW91,
author = {David Fern{\'{a}}ndez{-}Baca and
Mark A. Williams},
title = {On Matroids and Hierarchical Graphs},
journal = {Inf. Process. Lett.},
volume = {38},
number = {3},
pages = {117--121},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90232-7},
doi = {10.1016/0020-0190(91)90232-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fernandez-BacaW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Floren91,
author = {Rolf Floren},
title = {A Note on "A Faster Approximation Algorithm for the Steiner Problem
in Graphs"},
journal = {Inf. Process. Lett.},
volume = {38},
number = {4},
pages = {177--178},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90096-Z},
doi = {10.1016/0020-0190(91)90096-Z},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Floren91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FotouhiP91,
author = {Farshad Fotouhi and
Sakti Pramanik},
title = {Problem of Optimizing the Number of Block Accesses in Performing Relational
Join is NP-Hard},
journal = {Inf. Process. Lett.},
volume = {38},
number = {5},
pages = {271--275},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90070-X},
doi = {10.1016/0020-0190(91)90070-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FotouhiP91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gasarch91,
author = {William I. Gasarch},
title = {On Selecting the k Largest with Restricted Quadratic Queries},
journal = {Inf. Process. Lett.},
volume = {38},
number = {4},
pages = {193--195},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90099-4},
doi = {10.1016/0020-0190(91)90099-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gasarch91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Goldberg91,
author = {Andrew V. Goldberg},
title = {Processor-Efficient Implementation of a Maximum Flow Algorithm},
journal = {Inf. Process. Lett.},
volume = {38},
number = {4},
pages = {179--185},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90097-2},
doi = {10.1016/0020-0190(91)90097-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Goldberg91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GoralcikGK91,
author = {Pavel Goralcik and
A. Goralcikov{\'{a}} and
V{\'{a}}clav Koubek},
title = {Alternation with a Pebble},
journal = {Inf. Process. Lett.},
volume = {38},
number = {1},
pages = {7--13},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90208-Y},
doi = {10.1016/0020-0190(91)90208-Y},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GoralcikGK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HambruschL91,
author = {Susanne E. Hambrusch and
Michael Luby},
title = {Parallel Asynchronous Connected Components in a Mesh},
journal = {Inf. Process. Lett.},
volume = {38},
number = {5},
pages = {257--263},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90068-S},
doi = {10.1016/0020-0190(91)90068-S},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HambruschL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Herley91,
author = {Kieran T. Herley},
title = {A Note on the Token Distribution Problem},
journal = {Inf. Process. Lett.},
volume = {38},
number = {6},
pages = {329--334},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90090-5},
doi = {10.1016/0020-0190(91)90090-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Herley91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hershberger91,
author = {John Hershberger},
title = {A New Data Structure for Shortest Path Queries in a Simple Polygon},
journal = {Inf. Process. Lett.},
volume = {38},
number = {5},
pages = {231--235},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90064-O},
doi = {10.1016/0020-0190(91)90064-O},
timestamp = {Wed, 03 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Hershberger91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HorngCF91,
author = {Shi{-}Jinn Horng and
Wen{-}Tsuen Chen and
Ming{-}Yi Fang},
title = {Optimal Speed-Up Algorithms for Template Matching on {SIMD} Hypercube
Multiprocessors with Restricted Local Memory},
journal = {Inf. Process. Lett.},
volume = {38},
number = {1},
pages = {29--37},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90211-Y},
doi = {10.1016/0020-0190(91)90211-Y},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HorngCF91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Irani91,
author = {Sandy Irani},
title = {Two Results on the List Update Problem},
journal = {Inf. Process. Lett.},
volume = {38},
number = {6},
pages = {301--306},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90086-W},
doi = {10.1016/0020-0190(91)90086-W},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Irani91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KalamboukisM91,
author = {T. Z. Kalamboukis and
S. L. Mantzaris},
title = {Towards Optimal Distributed Election on Chordal Rings},
journal = {Inf. Process. Lett.},
volume = {38},
number = {5},
pages = {265--270},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90069-T},
doi = {10.1016/0020-0190(91)90069-T},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KalamboukisM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KaoT91,
author = {Ming{-}Yang Kao and
Stephen R. Tate},
title = {Online Matching with Blocked Input},
journal = {Inf. Process. Lett.},
volume = {38},
number = {3},
pages = {113--116},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90231-6},
doi = {10.1016/0020-0190(91)90231-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KaoT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kennedy91,
author = {Robert Kennedy},
title = {Parallel Cardinality Stacks and an Application},
journal = {Inf. Process. Lett.},
volume = {38},
number = {6},
pages = {295--299},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90085-V},
doi = {10.1016/0020-0190(91)90085-V},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kennedy91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KimP91,
author = {Myoung{-}Ho Kim and
Sakti Pramanik},
title = {The {FX} Distribution Method for Parallel Processing of Partial Match
Queries},
journal = {Inf. Process. Lett.},
volume = {38},
number = {5},
pages = {243--252},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90066-Q},
doi = {10.1016/0020-0190(91)90066-Q},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KimP91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Langemyr91,
author = {Lars Langemyr},
title = {Circuits for Computing the {GCD} of Two Polynomials Over an Algebraic
Number Field},
journal = {Inf. Process. Lett.},
volume = {38},
number = {3},
pages = {129--134},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90234-9},
doi = {10.1016/0020-0190(91)90234-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Langemyr91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Latifi91,
author = {Shahram Latifi},
title = {Distributed Subcube Identification Algorithms for Reliable Hypercupes},
journal = {Inf. Process. Lett.},
volume = {38},
number = {6},
pages = {315--321},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90088-Y},
doi = {10.1016/0020-0190(91)90088-Y},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Latifi91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeC91a,
author = {Myung{-}Joon Lee and
Kwang{-}Moo Choe},
title = {Corrigenda: SLR(k) Covering for LR(k) Grammars},
journal = {Inf. Process. Lett.},
volume = {38},
number = {5},
pages = {281},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90073-Q},
doi = {10.1016/0020-0190(91)90073-Q},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeeC91a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeissR91,
author = {Ernst L. Leiss and
Hari N. Reddy},
title = {Embedding Complete Binary Trees Into Hypercubes},
journal = {Inf. Process. Lett.},
volume = {38},
number = {4},
pages = {197--199},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90100-V},
doi = {10.1016/0020-0190(91)90100-V},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeissR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lingas91,
author = {Andrzej Lingas},
title = {Bit Complexity of Matrix Products},
journal = {Inf. Process. Lett.},
volume = {38},
number = {5},
pages = {237--242},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90065-P},
doi = {10.1016/0020-0190(91)90065-P},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lingas91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuoKCN91,
author = {Kenneth Luo and
William Klostermeyer and
Yuan{-}Chieh Chow and
Richard E. Newman{-}Wolfe},
title = {Optimal Deadlock Resolutions in Edge-Disjoint Reducible Wait-For Graphs},
journal = {Inf. Process. Lett.},
volume = {38},
number = {6},
pages = {307--313},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90087-X},
doi = {10.1016/0020-0190(91)90087-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LuoKCN91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Manzini91,
author = {Giovanni Manzini},
title = {Radix Sort on the Hypercube},
journal = {Inf. Process. Lett.},
volume = {38},
number = {2},
pages = {77--81},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90226-8},
doi = {10.1016/0020-0190(91)90226-8},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Manzini91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Martel91,
author = {Charles U. Martel},
title = {Self-Adjusting Multi-Way Search Trees},
journal = {Inf. Process. Lett.},
volume = {38},
number = {3},
pages = {135--141},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90235-A},
doi = {10.1016/0020-0190(91)90235-A},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Martel91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Matousek91,
author = {Jir{\'{\i}} Matousek},
title = {Computing Dominances in En},
journal = {Inf. Process. Lett.},
volume = {38},
number = {5},
pages = {277--278},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90071-O},
doi = {10.1016/0020-0190(91)90071-O},
timestamp = {Thu, 24 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Matousek91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Meidanis91,
author = {Joao Meidanis},
title = {Lower Bounds for Arithmetic Problems},
journal = {Inf. Process. Lett.},
volume = {38},
number = {2},
pages = {83--87},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90227-9},
doi = {10.1016/0020-0190(91)90227-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Meidanis91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Messeguer91,
author = {Xavier Messeguer},
title = {Dynamic Behaviour in Updating Process Over {BST} of Size Two with
Probabilistic Deletion Algorithms},
journal = {Inf. Process. Lett.},
volume = {38},
number = {2},
pages = {89--100},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90228-A},
doi = {10.1016/0020-0190(91)90228-A},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Messeguer91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Minsker91,
author = {Steven Minsker},
title = {The Towers of Antwerpen Problem},
journal = {Inf. Process. Lett.},
volume = {38},
number = {2},
pages = {107--111},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90230-F},
doi = {10.1016/0020-0190(91)90230-F},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Minsker91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Misra91,
author = {Jayadev Misra},
title = {Phase Synchronization},
journal = {Inf. Process. Lett.},
volume = {38},
number = {2},
pages = {101--105},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90229-B},
doi = {10.1016/0020-0190(91)90229-B},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Misra91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mnuk91,
author = {Michal Mnuk},
title = {A div(n) Depth Bollean Circuit for Smooth Modular Inverse},
journal = {Inf. Process. Lett.},
volume = {38},
number = {3},
pages = {153--156},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90238-D},
doi = {10.1016/0020-0190(91)90238-D},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mnuk91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Nawrocki91,
author = {Jerzy R. Nawrocki},
title = {Conflict Detection and Resolution in a Lexical Analyzer Generator},
journal = {Inf. Process. Lett.},
volume = {38},
number = {6},
pages = {323--328},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90089-Z},
doi = {10.1016/0020-0190(91)90089-Z},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Nawrocki91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PramanikDBF91,
author = {P. Pramanik and
Pradip K. Das and
A. K. Bandyopadhyay and
D. Q. M. Fay},
title = {A Deadlock-Free Communication Kernel for Loop Architecture},
journal = {Inf. Process. Lett.},
volume = {38},
number = {3},
pages = {157--161},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90239-E},
doi = {10.1016/0020-0190(91)90239-E},
timestamp = {Mon, 29 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PramanikDBF91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Preparata91,
author = {Franco P. Preparata},
title = {Inverting a Vandermonde Matrix in Minimum Parallel Time},
journal = {Inf. Process. Lett.},
volume = {38},
number = {6},
pages = {291--294},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90084-U},
doi = {10.1016/0020-0190(91)90084-U},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Preparata91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RajanarayananI91,
author = {Subbiah Rajanarayanan and
S. Sitharama Iyengar},
title = {A New Optimal Distributed Algorithm for the Set Intersection Problem},
journal = {Inf. Process. Lett.},
volume = {38},
number = {3},
pages = {143--148},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90236-B},
doi = {10.1016/0020-0190(91)90236-B},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RajanarayananI91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rote91,
author = {G{\"{u}}nter Rote},
title = {Computing the Minimum Hausdorff Distance Between Two Point Sets on
a Line Under Translation},
journal = {Inf. Process. Lett.},
volume = {38},
number = {3},
pages = {123--127},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90233-8},
doi = {10.1016/0020-0190(91)90233-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rote91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RoteWZW91,
author = {G{\"{u}}nter Rote and
Gerhard J. Woeginger and
Binhai Zhu and
Zhengyan Wang},
title = {Counting k-Subsets and Convex k-gons in the Plane},
journal = {Inf. Process. Lett.},
volume = {38},
number = {3},
pages = {149--151},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90237-C},
doi = {10.1016/0020-0190(91)90237-C},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RoteWZW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RytterS91,
author = {Wojciech Rytter and
Ahmed Saoudi},
title = {On the Complexity of the Recognition of Parallel 2D-Image Languages},
journal = {Inf. Process. Lett.},
volume = {38},
number = {5},
pages = {225--229},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90063-N},
doi = {10.1016/0020-0190(91)90063-N},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RytterS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sakkinen91,
author = {Markku Sakkinen},
title = {Selftype is a Special Case},
journal = {Inf. Process. Lett.},
volume = {38},
number = {4},
pages = {221--224},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90104-P},
doi = {10.1016/0020-0190(91)90104-P},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sakkinen91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shonkwiler91,
author = {Ron Shonkwiler},
title = {Computing the Hausdorff Set Distance in Linear Time for Any L{\_}p
Point Distance},
journal = {Inf. Process. Lett.},
volume = {38},
number = {4},
pages = {201--207},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90101-M},
doi = {10.1016/0020-0190(91)90101-M},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shonkwiler91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shoup91,
author = {Victor Shoup},
title = {Smoothness and Factoring Polynomials Over Finite Fields},
journal = {Inf. Process. Lett.},
volume = {38},
number = {1},
pages = {39--42},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90212-Z},
doi = {10.1016/0020-0190(91)90212-Z},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shoup91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SiklossyT91,
author = {Laurent Sikl{\'{o}}ssy and
Eduard Tulp},
title = {The Space Reduction Method: {A} Method to Reduce the Size of Search
Spaces},
journal = {Inf. Process. Lett.},
volume = {38},
number = {4},
pages = {187--192},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90098-3},
doi = {10.1016/0020-0190(91)90098-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SiklossyT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Snyder91a,
author = {Timothy Law Snyder},
title = {Corrigendum: Lower Bounds for Rectilinear Steiner Trees},
journal = {Inf. Process. Lett.},
volume = {38},
number = {5},
pages = {279},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90072-P},
doi = {10.1016/0020-0190(91)90072-P},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Snyder91a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Stojmenovic91,
author = {Ivan Stojmenovic},
title = {Bisections and Ham-Sandwich Cuts of Convex Polygons and Polyhedra},
journal = {Inf. Process. Lett.},
volume = {38},
number = {1},
pages = {15--21},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90209-Z},
doi = {10.1016/0020-0190(91)90209-Z},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Stojmenovic91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Woeginger91,
author = {Gerhard J. Woeginger},
title = {On Minimizing the Sum of k Tardinesses},
journal = {Inf. Process. Lett.},
volume = {38},
number = {5},
pages = {253--256},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90067-R},
doi = {10.1016/0020-0190(91)90067-R},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Woeginger91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Yen91,
author = {Hsu{-}Chun Yen},
title = {A Polynomial Time Algorithm to Decide Pairwise Concurrency of Transitions
for 1-Bounded Conflict-Free Petri Nets},
journal = {Inf. Process. Lett.},
volume = {38},
number = {2},
pages = {71--76},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90225-7},
doi = {10.1016/0020-0190(91)90225-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Yen91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zivkovic91,
author = {Dejan Zivkovic},
title = {A Fast Algorithm for Finding the Compact Sets},
journal = {Inf. Process. Lett.},
volume = {38},
number = {6},
pages = {339--342},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90092-V},
doi = {10.1016/0020-0190(91)90092-V},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zivkovic91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zuckerman91,
author = {David Zuckerman},
title = {On the Time to Traverse all Edges of a Graph},
journal = {Inf. Process. Lett.},
volume = {38},
number = {6},
pages = {335--337},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90091-U},
doi = {10.1016/0020-0190(91)90091-U},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zuckerman91.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-25 07:42 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:
