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/ipl49.bht:"
download as .bib file
@article{DBLP:journals/ipl/AmirFM94,
author = {Amihood Amir and
Martin Farach and
S. Muthukrishnan},
title = {Alphabet Dependence in Parameterized Matching},
journal = {Inf. Process. Lett.},
volume = {49},
number = {3},
pages = {111--115},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90086-8},
doi = {10.1016/0020-0190(94)90086-8},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AmirFM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BelbarakaS94,
author = {Mounir Belbaraka and
Ivan Stojmenovic},
title = {On Generating B-Trees with Constant Average Delay and in Lexicographic
Order},
journal = {Inf. Process. Lett.},
volume = {49},
number = {1},
pages = {27--32},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90050-7},
doi = {10.1016/0020-0190(94)90050-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BelbarakaS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BlazewiczDDS94,
author = {Jacek Blazewicz and
Paolo Dell'Olmo and
Maciej Drozdowski and
Maria Grazia Speranza},
title = {Corrigendum: Scheduling Multiprocessor Tasks on Three Dedicated Processors},
journal = {Inf. Process. Lett.},
volume = {49},
number = {5},
pages = {269--270},
year = {1994},
timestamp = {Wed, 26 Sep 2012 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BlazewiczDDS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BonetB94,
author = {Maria Luisa Bonet and
Samuel R. Buss},
title = {Size-Depth Tradeoffs for Boolean Fomulae},
journal = {Inf. Process. Lett.},
volume = {49},
number = {3},
pages = {151--155},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90093-0},
doi = {10.1016/0020-0190(94)90093-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BonetB94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BorchersG94,
author = {Al Borchers and
Prosenjit Gupta},
title = {Extending the Quadrangle Inequality to Speed-Up Dynamic Programming},
journal = {Inf. Process. Lett.},
volume = {49},
number = {6},
pages = {287--290},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90101-5},
doi = {10.1016/0020-0190(94)90101-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BorchersG94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Breslauer94,
author = {Dany Breslauer},
title = {Testing String Superprimitivity in Parallel},
journal = {Inf. Process. Lett.},
volume = {49},
number = {5},
pages = {235--241},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90060-4},
doi = {10.1016/0020-0190(94)90060-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Breslauer94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Calvert94,
author = {Kenneth L. Calvert},
title = {Eliminating Disjunctions of Leads-to Properties},
journal = {Inf. Process. Lett.},
volume = {49},
number = {4},
pages = {189--194},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90010-8},
doi = {10.1016/0020-0190(94)90010-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Calvert94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChengC94,
author = {Eddie Cheng and
William H. Cunningham},
title = {A Faster Algorithm for Computing the Strength of a Network},
journal = {Inf. Process. Lett.},
volume = {49},
number = {4},
pages = {209--212},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90013-2},
doi = {10.1016/0020-0190(94)90013-2},
timestamp = {Sat, 01 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChengC94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChepoiD94,
author = {Victor Chepoi and
Feodor F. Dragan},
title = {Computing a Median Point of a Simple Rectilinear Polygon},
journal = {Inf. Process. Lett.},
volume = {49},
number = {6},
pages = {281--285},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90100-7},
doi = {10.1016/0020-0190(94)90100-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChepoiD94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CollinD94,
author = {Zeev Collin and
Shlomi Dolev},
title = {Self-Stabilizing Depth-First Search},
journal = {Inf. Process. Lett.},
volume = {49},
number = {6},
pages = {297--301},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90103-1},
doi = {10.1016/0020-0190(94)90103-1},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CollinD94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GemmellH94,
author = {Peter Gemmell and
Mor Harchol{-}Balter},
title = {Tight Bounds on Expected Time to Add Correctly and Add Mostly Correctly},
journal = {Inf. Process. Lett.},
volume = {49},
number = {2},
pages = {77--83},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90031-0},
doi = {10.1016/0020-0190(94)90031-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GemmellH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gianuzzi94,
author = {Vittoria Gianuzzi},
title = {Distributed Termination Detection in Reducible Communication Graphs},
journal = {Inf. Process. Lett.},
volume = {49},
number = {1},
pages = {1--8},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90046-9},
doi = {10.1016/0020-0190(94)90046-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gianuzzi94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GoldmannGH94,
author = {Mikael Goldmann and
Per Grape and
Johan H{\aa}stad},
title = {On Average Time Hierarchies},
journal = {Inf. Process. Lett.},
volume = {49},
number = {1},
pages = {15--20},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90048-5},
doi = {10.1016/0020-0190(94)90048-5},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GoldmannGH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HuangHW94,
author = {Nen{-}Fu Huang and
Ching{-}Ho Huang and
Yue{-}Li Wang},
title = {A Sweepline Algorithm to Solve the Two-Center Problem},
journal = {Inf. Process. Lett.},
volume = {49},
number = {4},
pages = {171--177},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90007-8},
doi = {10.1016/0020-0190(94)90007-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HuangHW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JovanovicM94,
author = {Zoran Jovanovic and
Jelena V. Misic},
title = {Fault Tolerance of the Star Graph Interconnection Network},
journal = {Inf. Process. Lett.},
volume = {49},
number = {3},
pages = {145--150},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90092-2},
doi = {10.1016/0020-0190(94)90092-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JovanovicM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JungCH94,
author = {Min{-}Soo Jung and
Kwang{-}Moo Choe and
Taisook Han},
title = {An Efficient Computation of Right Context for LR-Based Error Repair},
journal = {Inf. Process. Lett.},
volume = {49},
number = {2},
pages = {63--71},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90029-9},
doi = {10.1016/0020-0190(94)90029-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JungCH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KakugawaFYA94,
author = {Hirotsugu Kakugawa and
Satoshi Fujita and
Masafumi Yamashita and
Tadashi Ae},
title = {A Distributed k-Mutual Exclusion Algorithm Using k-Coterie},
journal = {Inf. Process. Lett.},
volume = {49},
number = {4},
pages = {213--218},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90014-0},
doi = {10.1016/0020-0190(94)90014-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KakugawaFYA94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kanchanasut94,
author = {Kanchana Kanchanasut},
title = {A Shortest-Path Algorithm for Manhattan Graphs},
journal = {Inf. Process. Lett.},
volume = {49},
number = {1},
pages = {21--25},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90049-3},
doi = {10.1016/0020-0190(94)90049-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kanchanasut94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kann94,
author = {Viggo Kann},
title = {Maximum Bounded H-Matching is {MAX} SNP-Complete},
journal = {Inf. Process. Lett.},
volume = {49},
number = {6},
pages = {309--318},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90105-8},
doi = {10.1016/0020-0190(94)90105-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kann94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KaplanS94,
author = {Haim Kaplan and
Ron Shamir},
title = {The Domatic Number Problem on Some Perfect Graph Families},
journal = {Inf. Process. Lett.},
volume = {49},
number = {1},
pages = {51--56},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90054-X},
doi = {10.1016/0020-0190(94)90054-X},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KaplanS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Khardon94,
author = {Roni Khardon},
title = {On Using the Fourier Transform to Learn Disjoint {DNF}},
journal = {Inf. Process. Lett.},
volume = {49},
number = {5},
pages = {219--222},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90057-4},
doi = {10.1016/0020-0190(94)90057-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Khardon94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kim94,
author = {Sung Kwon Kim},
title = {The Range Co-Minima Problem},
journal = {Inf. Process. Lett.},
volume = {49},
number = {3},
pages = {117--121},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90087-6},
doi = {10.1016/0020-0190(94)90087-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kim94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KimP94,
author = {Dongseung Kim and
Joonyoung Park},
title = {Two-Way Dominant Sequence Clustering for Processor Scheduling},
journal = {Inf. Process. Lett.},
volume = {49},
number = {4},
pages = {203--208},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90012-4},
doi = {10.1016/0020-0190(94)90012-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KimP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KlopMTV94,
author = {Jan Willem Klop and
Aart Middeldorp and
Yoshihito Toyama and
Roel C. de Vrijer},
title = {Modularity of Confluence: {A} Simplified Proof},
journal = {Inf. Process. Lett.},
volume = {49},
number = {2},
pages = {101--109},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90034-5},
doi = {10.1016/0020-0190(94)90034-5},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KlopMTV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kolountzakis94,
author = {Mihail N. Kolountzakis},
title = {Selection of a Large Sum-Free Subset in Polynomial Time},
journal = {Inf. Process. Lett.},
volume = {49},
number = {5},
pages = {255--256},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90063-9},
doi = {10.1016/0020-0190(94)90063-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kolountzakis94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LadermannP94,
author = {M. Ladermann and
Holger Petersen},
title = {Notes on Looping Deterministic Two-Way Pushdown Automata},
journal = {Inf. Process. Lett.},
volume = {49},
number = {3},
pages = {123--127},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90088-4},
doi = {10.1016/0020-0190(94)90088-4},
timestamp = {Fri, 15 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LadermannP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeuchnerMS94,
author = {John H. Leuchner and
Les Miller and
Giora Slutzki},
title = {A Note on the Equivalence of a Set of Egds to a Set of FDs},
journal = {Inf. Process. Lett.},
volume = {49},
number = {4},
pages = {185--188},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90009-4},
doi = {10.1016/0020-0190(94)90009-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeuchnerMS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiC94,
author = {Tze Fen Li and
Sung Wu Chang},
title = {An Algorithm to Estimate the Fraction Defective and The Exponential
Mean Life Using Unlabeled Samples},
journal = {Inf. Process. Lett.},
volume = {49},
number = {3},
pages = {129--133},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90089-2},
doi = {10.1016/0020-0190(94)90089-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiC94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LibkinW94,
author = {Leonid Libkin and
Limsoon Wong},
title = {Conservativity of Nested Relational Calculi with Internal Generic
Functions},
journal = {Inf. Process. Lett.},
volume = {49},
number = {6},
pages = {273--280},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90099-X},
doi = {10.1016/0020-0190(94)90099-X},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LibkinW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LucaM94,
author = {Aldo de Luca and
Licia Mione},
title = {On Bispecial Factors of the Thue-Morse Word},
journal = {Inf. Process. Lett.},
volume = {49},
number = {4},
pages = {179--183},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90008-6},
doi = {10.1016/0020-0190(94)90008-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LucaM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mairson94,
author = {Harry G. Mairson},
title = {Generating Words in a Context-Free Language Uniformly at Random},
journal = {Inf. Process. Lett.},
volume = {49},
number = {2},
pages = {95--99},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90033-7},
doi = {10.1016/0020-0190(94)90033-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mairson94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Neiger94,
author = {Gil Neiger},
title = {Distributed Consensus Revisited},
journal = {Inf. Process. Lett.},
volume = {49},
number = {4},
pages = {195--201},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90011-6},
doi = {10.1016/0020-0190(94)90011-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Neiger94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NuutilaS94,
author = {Esko Nuutila and
Eljas Soisalon{-}Soininen},
title = {On Finding the Strongly Connected Components in a Directed Graph},
journal = {Inf. Process. Lett.},
volume = {49},
number = {1},
pages = {9--14},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90047-7},
doi = {10.1016/0020-0190(94)90047-7},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/NuutilaS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PandaM94,
author = {B. S. Panda and
Shreedhara Prasada Mohanty},
title = {Recognition Algorithm for Intersection Graphs of Edge Disjoint Paths
in a Tree},
journal = {Inf. Process. Lett.},
volume = {49},
number = {3},
pages = {139--143},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90091-4},
doi = {10.1016/0020-0190(94)90091-4},
timestamp = {Wed, 09 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PandaM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Paul94,
author = {Wolfgang J. Paul},
title = {A Note on Bitonic Sorting},
journal = {Inf. Process. Lett.},
volume = {49},
number = {5},
pages = {223--225},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90058-2},
doi = {10.1016/0020-0190(94)90058-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Paul94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PemmarajuS94,
author = {Sriram V. Pemmaraju and
Clifford A. Shaffer},
title = {Analysis of the Worst Case Space Complexity of a {PR} Quadtree},
journal = {Inf. Process. Lett.},
volume = {49},
number = {5},
pages = {263--267},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90065-5},
doi = {10.1016/0020-0190(94)90065-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PemmarajuS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Prodinger94,
author = {Helmut Prodinger},
title = {An Asymptotic Comment on a Paper by Analyti and Pramanik},
journal = {Inf. Process. Lett.},
volume = {49},
number = {6},
pages = {327--328},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90107-4},
doi = {10.1016/0020-0190(94)90107-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Prodinger94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rajsbaum94,
author = {Sergio Rajsbaum},
title = {Upper and Lower Bounds for Stochastic Marked Graphs},
journal = {Inf. Process. Lett.},
volume = {49},
number = {6},
pages = {291--295},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90102-3},
doi = {10.1016/0020-0190(94)90102-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rajsbaum94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ReddyL94,
author = {Hari N. Reddy and
Ernst L. Leiss},
title = {An O(log {N)} Algorithm to Solve Linear Recurrences on Hypercubes},
journal = {Inf. Process. Lett.},
volume = {49},
number = {6},
pages = {319--325},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90106-6},
doi = {10.1016/0020-0190(94)90106-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ReddyL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RheeLDL94,
author = {Chong Jye Rhee and
Y. Daniel Liang and
Sudarshan K. Dhall and
S. Lakshmivarahan},
title = {Efficient Algorithms for Finding Depth-First and Breadth-First Search
Trees in Permutation Graphs},
journal = {Inf. Process. Lett.},
volume = {49},
number = {1},
pages = {45--50},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90053-1},
doi = {10.1016/0020-0190(94)90053-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RheeLDL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SajithS94,
author = {G. Sajith and
Sanjeev Saxena},
title = {Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and
Finding Maximal Independent Sets in Rooted Trees},
journal = {Inf. Process. Lett.},
volume = {49},
number = {6},
pages = {303--308},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90104-X},
doi = {10.1016/0020-0190(94)90104-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SajithS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Saxena94,
author = {Sanjeev Saxena},
title = {Two-Coloring Linked Lists is NC1-Complete for Logarithmic Space},
journal = {Inf. Process. Lett.},
volume = {49},
number = {2},
pages = {73--76},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90030-2},
doi = {10.1016/0020-0190(94)90030-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Saxena94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShibataSO94,
author = {Yukio Shibata and
Miyuki Shirahata and
Shingo Osawa},
title = {Counting Closed Walks in Generalized de Bruijn Graphs},
journal = {Inf. Process. Lett.},
volume = {49},
number = {3},
pages = {135--138},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90090-6},
doi = {10.1016/0020-0190(94)90090-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ShibataSO94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Singh94,
author = {Gurdip Singh},
title = {Real-Time Leader Election},
journal = {Inf. Process. Lett.},
volume = {49},
number = {2},
pages = {57--61},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90028-0},
doi = {10.1016/0020-0190(94)90028-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Singh94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Steinbach94,
author = {Joachim Steinbach},
title = {Generating Polynomial Orderings},
journal = {Inf. Process. Lett.},
volume = {49},
number = {2},
pages = {85--93},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90032-9},
doi = {10.1016/0020-0190(94)90032-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Steinbach94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tel94,
author = {Gerard Tel},
title = {Maximal Matching Stabilizes in Quadratic Time},
journal = {Inf. Process. Lett.},
volume = {49},
number = {6},
pages = {271--272},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90098-1},
doi = {10.1016/0020-0190(94)90098-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tel94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TingY94,
author = {Hing{-}Fung Ting and
Andrew Chi{-}Chih Yao},
title = {A Randomized Algorithm for Finding Maximum with O((log n){\({^2}\)})
Polynomial Tests},
journal = {Inf. Process. Lett.},
volume = {49},
number = {1},
pages = {39--43},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90052-3},
doi = {10.1016/0020-0190(94)90052-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TingY94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TiwariT94,
author = {Prasoon Tiwari and
Martin Tompa},
title = {A Direct Version of Shamir and Snir's Lower Bounds on Monotone Circuit
Depth},
journal = {Inf. Process. Lett.},
volume = {49},
number = {5},
pages = {243--248},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90061-2},
doi = {10.1016/0020-0190(94)90061-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TiwariT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Veljan94,
author = {D. Veljan},
title = {Computing Values of a Polynomial with Only few Multiplications},
journal = {Inf. Process. Lett.},
volume = {49},
number = {1},
pages = {33--37},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90051-5},
doi = {10.1016/0020-0190(94)90051-5},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Veljan94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wang94,
author = {Chien{-}Min Wang},
title = {A New Routing Algorithm for Cyclic Shifts on {BRGC} Hypercubes},
journal = {Inf. Process. Lett.},
volume = {49},
number = {4},
pages = {165--169},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90006-X},
doi = {10.1016/0020-0190(94)90006-X},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wang94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WezelT94,
author = {Michiel C. van Wezel and
Gerard Tel},
title = {An Assertional Proof of Rana's Algorithm},
journal = {Inf. Process. Lett.},
volume = {49},
number = {5},
pages = {227--233},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90059-0},
doi = {10.1016/0020-0190(94)90059-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WezelT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WuuH94,
author = {Lih{-}Chyau Wuu and
Shing{-}Tsaan Huang},
title = {Identity Assignment in Uniform Synchronous Rings},
journal = {Inf. Process. Lett.},
volume = {49},
number = {5},
pages = {257--262},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90064-7},
doi = {10.1016/0020-0190(94)90064-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WuuH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangDL94,
author = {S. B. Yang and
Sudarshan K. Dhall and
S. Lakshmivarahan},
title = {A Processor Efficient {MIS} Algorithm on Random Graphs},
journal = {Inf. Process. Lett.},
volume = {49},
number = {3},
pages = {157--163},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90094-9},
doi = {10.1016/0020-0190(94)90094-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YangDL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangJ94,
author = {Kaizhong Zhang and
Tao Jiang},
title = {Some {MAX} SNP-Hard Results Concerning Unordered Labeled Trees},
journal = {Inf. Process. Lett.},
volume = {49},
number = {5},
pages = {249--254},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90062-0},
doi = {10.1016/0020-0190(94)90062-0},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangJ94.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-06 05:36 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:
