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/ipl65.bht:"
download as .bib file
@article{DBLP:journals/ipl/Ait-BouziadK98,
author = {Ahmed Ait{-}Bouziad and
Helen Kassel},
title = {An Inproved Algorithm for Retrieving Fuzzy Information from Two Systems},
journal = {Inf. Process. Lett.},
volume = {65},
number = {2},
pages = {63--66},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00220-2},
doi = {10.1016/S0020-0190(97)00220-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ait-BouziadK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AmirW98,
author = {Yair Amir and
Avishai Wool},
title = {Optimal Availability Quorum Systems: Theory and Practice},
journal = {Inf. Process. Lett.},
volume = {65},
number = {5},
pages = {223--228},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00017-9},
doi = {10.1016/S0020-0190(98)00017-9},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AmirW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AnderssonE98,
author = {Gunnar Andersson and
Lars Engebretsen},
title = {Better Approximation Algorithms for {SET} {SPLITTING} and {NOT-ALL-EQUAL}
{SAT}},
journal = {Inf. Process. Lett.},
volume = {65},
number = {6},
pages = {305--311},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00021-0},
doi = {10.1016/S0020-0190(98)00021-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AnderssonE98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AryaR98,
author = {Sunil Arya and
H. Ramesh},
title = {A 2.5-Factor Approximation Algorithm for the \emph{k}-MST Problem},
journal = {Inf. Process. Lett.},
volume = {65},
number = {3},
pages = {117--118},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00010-6},
doi = {10.1016/S0020-0190(98)00010-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AryaR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BalasubramanianFR98,
author = {R. Balasubramanian and
Michael R. Fellows and
Venkatesh Raman},
title = {An Improved Fixed-Parameter Algorithm for Vertex Cover},
journal = {Inf. Process. Lett.},
volume = {65},
number = {3},
pages = {163--168},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00213-5},
doi = {10.1016/S0020-0190(97)00213-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BalasubramanianFR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Biedl98,
author = {Therese C. Biedl},
title = {Relating Bends and Size in Orthogonal Graph Drawings},
journal = {Inf. Process. Lett.},
volume = {65},
number = {2},
pages = {111--115},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00207-X},
doi = {10.1016/S0020-0190(97)00207-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Biedl98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BlundoSV98,
author = {Carlo Blundo and
Alfredo De Santis and
Ugo Vaccaro},
title = {On Secret Sharing Schemes},
journal = {Inf. Process. Lett.},
volume = {65},
number = {1},
pages = {25--32},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00194-4},
doi = {10.1016/S0020-0190(97)00194-4},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BlundoSV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BoseBL98,
author = {Prosenjit Bose and
Jonathan F. Buss and
Anna Lubiw},
title = {Pattern Matching for Permutations},
journal = {Inf. Process. Lett.},
volume = {65},
number = {5},
pages = {277--283},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00209-3},
doi = {10.1016/S0020-0190(97)00209-3},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BoseBL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BshoutyTW98,
author = {Nader H. Bshouty and
Christino Tamon and
David K. Wilson},
title = {On Learning width Two Branching Programs},
journal = {Inf. Process. Lett.},
volume = {65},
number = {4},
pages = {217--222},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00204-4},
doi = {10.1016/S0020-0190(97)00204-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BshoutyTW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangH98,
author = {Jou{-}Ming Chang and
Chin{-}Wen Ho},
title = {The Recognition of Geodetically Connected Graphs},
journal = {Inf. Process. Lett.},
volume = {65},
number = {2},
pages = {81--88},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00201-9},
doi = {10.1016/S0020-0190(97)00201-9},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChangH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangTVC98,
author = {Kaijung Chang and
Yan Huat Tan and
Yaakov L. Varol and
Jiang{-}Hsing Chu},
title = {A Study on Interleaving Versus Segmentation},
journal = {Inf. Process. Lett.},
volume = {65},
number = {6},
pages = {319--324},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00022-2},
doi = {10.1016/S0020-0190(98)00022-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChangTVC98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangY98,
author = {Yaw{-}Wen Chang and
Chang{-}Biau Yang},
title = {A Parallel Algorithm for Circulant Tridiagonal Linear Systems},
journal = {Inf. Process. Lett.},
volume = {65},
number = {6},
pages = {331--337},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00018-0},
doi = {10.1016/S0020-0190(98)00018-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChangY98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChaudhuriGR98,
author = {Shiva Chaudhuri and
Naveen Garg and
R. Ravi},
title = {The \emph{p}-Neighbor \emph{k}-Center Problem},
journal = {Inf. Process. Lett.},
volume = {65},
number = {3},
pages = {131--134},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00224-X},
doi = {10.1016/S0020-0190(97)00224-X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChaudhuriGR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chen98,
author = {Wen{-}Huei Chen},
title = {Test Sequence Generation from the Protocol Data Portion Based on the
Selecting Chinese Postman Algorithm},
journal = {Inf. Process. Lett.},
volume = {65},
number = {5},
pages = {261--268},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00208-1},
doi = {10.1016/S0020-0190(97)00208-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chen98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenD98,
author = {Danny Z. Chen and
Ovidiu Daescu},
title = {Maintaining Visibility of a Polygon with a Moving Point of View},
journal = {Inf. Process. Lett.},
volume = {65},
number = {5},
pages = {269--275},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00211-1},
doi = {10.1016/S0020-0190(97)00211-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenD98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChengD98,
author = {T. C. Edwin Cheng and
Qing Ding},
title = {The Complexity of Scheduling Starting Time Dependent Tasks with Release
Times},
journal = {Inf. Process. Lett.},
volume = {65},
number = {2},
pages = {75--79},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00195-6},
doi = {10.1016/S0020-0190(97)00195-6},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChengD98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DahlhausMM98,
author = {Elias Dahlhaus and
Paul D. Manuel and
Mirka Miller},
title = {Maximum \emph{h}-Colourable Subgraph Problem in Balanced Graphs},
journal = {Inf. Process. Lett.},
volume = {65},
number = {6},
pages = {301--303},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00019-2},
doi = {10.1016/S0020-0190(98)00019-2},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DahlhausMM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Dasgupta98,
author = {Pallab Dasgupta},
title = {Agreement under Faulty Interfaces},
journal = {Inf. Process. Lett.},
volume = {65},
number = {3},
pages = {125--129},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00202-0},
doi = {10.1016/S0020-0190(97)00202-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Dasgupta98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DellOlmoKST98,
author = {Paolo Dell'Olmo and
Hans Kellerer and
Maria Grazia Speranza and
Zsolt Tuza},
title = {A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins},
journal = {Inf. Process. Lett.},
volume = {65},
number = {5},
pages = {229--233},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00216-0},
doi = {10.1016/S0020-0190(97)00216-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DellOlmoKST98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DervosML98,
author = {Dimitrios Dervos and
Yannis Manolopoulos and
Panagiotis Linardis},
title = {Comparison of Signature File Models with Superimposed Coding},
journal = {Inf. Process. Lett.},
volume = {65},
number = {2},
pages = {101--106},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00210-X},
doi = {10.1016/S0020-0190(97)00210-X},
timestamp = {Tue, 09 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DervosML98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DessmarkGL98,
author = {Anders Dessmark and
Oscar Garrido and
Andrzej Lingas},
title = {A Note on Parallel Complexity of Maximum \emph{f}-Matching},
journal = {Inf. Process. Lett.},
volume = {65},
number = {2},
pages = {107--109},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00196-8},
doi = {10.1016/S0020-0190(97)00196-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DessmarkGL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Devroye98,
author = {Luc Devroye},
title = {On the Richness of the Collection of Subtrees in Random Binary Search
Trees},
journal = {Inf. Process. Lett.},
volume = {65},
number = {4},
pages = {195--199},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00206-8},
doi = {10.1016/S0020-0190(97)00206-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Devroye98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DunneM98,
author = {Paul E. Dunne and
Michele Zito},
title = {An Inproved Upper Bound on the Non-3-Colourability Threshold},
journal = {Inf. Process. Lett.},
volume = {65},
number = {1},
pages = {17--23},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00193-2},
doi = {10.1016/S0020-0190(97)00193-2},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DunneM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FrankGW98,
author = {Jeremy Frank and
Ian P. Gent and
Toby Walsh},
title = {Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian
Circuit as a Case Study},
journal = {Inf. Process. Lett.},
volume = {65},
number = {5},
pages = {241--245},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00222-6},
doi = {10.1016/S0020-0190(97)00222-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FrankGW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrabnerP98,
author = {Peter J. Grabner and
Helmut Prodinger},
title = {An Asymptotic Study of a Recursion Occurring in the Analysis of an
Algorithm on Broadcast Communication},
journal = {Inf. Process. Lett.},
volume = {65},
number = {2},
pages = {89--93},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00225-1},
doi = {10.1016/S0020-0190(97)00225-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GrabnerP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Guan98,
author = {D. J. Guan},
title = {An Optimal Message Routing Algorithm for Double-Loop Networks},
journal = {Inf. Process. Lett.},
volume = {65},
number = {5},
pages = {255--260},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00013-1},
doi = {10.1016/S0020-0190(98)00013-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Guan98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HemaspaandraR98,
author = {Edith Hemaspaandra and
J{\"{o}}rg Rothe},
title = {Recognizing when Greed can Approximate Maximum Independent Sets is
Complete for Parallel Access to {NP}},
journal = {Inf. Process. Lett.},
volume = {65},
number = {3},
pages = {151--156},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00219-6},
doi = {10.1016/S0020-0190(97)00219-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HemaspaandraR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Herrmann98,
author = {Philippe Herrmann},
title = {Timed Automata and Recognizability},
journal = {Inf. Process. Lett.},
volume = {65},
number = {6},
pages = {313--318},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00217-2},
doi = {10.1016/S0020-0190(97)00217-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Herrmann98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Horng98,
author = {Gwoboa Horng},
title = {An Active Attack on Protocols for Server-Aided {RSA} Signature Computation},
journal = {Inf. Process. Lett.},
volume = {65},
number = {2},
pages = {71--73},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00198-1},
doi = {10.1016/S0020-0190(97)00198-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Horng98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HuangL98,
author = {Shing{-}Tsaan Huang and
Tzong{-}Jye Liu},
title = {Four-State Stabilizing Phase Clock for Unidirectional Rings of Odd
Size},
journal = {Inf. Process. Lett.},
volume = {65},
number = {6},
pages = {325--329},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00006-4},
doi = {10.1016/S0020-0190(98)00006-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HuangL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HwangW98,
author = {Tzonelih Hwang and
Chih{-}Hung Wang},
title = {Arbetrated Unconditionally Secure Authentication Scheme with Multi-Senders},
journal = {Inf. Process. Lett.},
volume = {65},
number = {4},
pages = {189--193},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00011-8},
doi = {10.1016/S0020-0190(98)00011-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HwangW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IsraeliS98,
author = {Amos Israeli and
Asaf Shirazi},
title = {The Time Complexity of Updating Snapshot Memories},
journal = {Inf. Process. Lett.},
volume = {65},
number = {1},
pages = {33--40},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00189-0},
doi = {10.1016/S0020-0190(97)00189-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IsraeliS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KannLP98,
author = {Viggo Kann and
Jens Lagergren and
Alessandro Panconesi},
title = {Approximate Max \emph{k}-Cut with Subgraph Guarantee},
journal = {Inf. Process. Lett.},
volume = {65},
number = {3},
pages = {145--150},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00005-2},
doi = {10.1016/S0020-0190(98)00005-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KannLP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KimK98,
author = {Heung{-}Taek Kim and
Myoung{-}Ho Kim},
title = {Starvation-Free Secure Multiversion Concurrency Control},
journal = {Inf. Process. Lett.},
volume = {65},
number = {5},
pages = {247--253},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00014-3},
doi = {10.1016/S0020-0190(98)00014-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KimK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KnapikP98,
author = {Teodor Knapik and
{\'{E}}tienne Payet},
title = {The Full Quotient and its Closure Property for Regular Languages},
journal = {Inf. Process. Lett.},
volume = {65},
number = {2},
pages = {57--62},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00218-4},
doi = {10.1016/S0020-0190(97)00218-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KnapikP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KorshL98,
author = {James F. Korsh and
Seymour Lipschutz},
title = {Shifts and Loopless Generation of \emph{k}-Ary Trees},
journal = {Inf. Process. Lett.},
volume = {65},
number = {5},
pages = {235--240},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00215-9},
doi = {10.1016/S0020-0190(97)00215-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KorshL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LakhalL98,
author = {Jamel Lakhal and
Luc Litzler},
title = {A Polynomial Algorithm for the Extendability Problem in Bipartite
Graphs},
journal = {Inf. Process. Lett.},
volume = {65},
number = {1},
pages = {11--16},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00177-4},
doi = {10.1016/S0020-0190(97)00177-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LakhalL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Larsen98,
author = {Kim S. Larsen},
title = {Regular Expressions with Nested Levels of Back Referencing Form a
Hierarchy},
journal = {Inf. Process. Lett.},
volume = {65},
number = {4},
pages = {169--172},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00007-6},
doi = {10.1016/S0020-0190(98)00007-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Larsen98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LungoNPS98,
author = {Alberto Del Lungo and
Maurice Nivat and
Renzo Pinzani and
L. Sorri},
title = {The Medians of Discrete Sets},
journal = {Inf. Process. Lett.},
volume = {65},
number = {6},
pages = {293--299},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00020-9},
doi = {10.1016/S0020-0190(98)00020-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LungoNPS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mahmoud98,
author = {Hosam M. Mahmoud},
title = {On Rotations in Fringe-Balanced Binary Trees},
journal = {Inf. Process. Lett.},
volume = {65},
number = {1},
pages = {41--46},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00184-1},
doi = {10.1016/S0020-0190(97)00184-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mahmoud98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/McCune98,
author = {William McCune},
title = {Automatic Proofs and Counterexamples for Some Ortholattice Identities},
journal = {Inf. Process. Lett.},
volume = {65},
number = {6},
pages = {285--291},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00015-5},
doi = {10.1016/S0020-0190(98)00015-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/McCune98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MolvaT98,
author = {Refik Molva and
Gene Tsudik},
title = {Secret Sets and Applications},
journal = {Inf. Process. Lett.},
volume = {65},
number = {1},
pages = {47--55},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)80449-8},
doi = {10.1016/S0020-0190(97)80449-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MolvaT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NawrockiCC98,
author = {Jerzy R. Nawrocki and
Adam Czajka and
Wojciech Complak},
title = {Scheduling Cyclic Tasks with Binary Periods},
journal = {Inf. Process. Lett.},
volume = {65},
number = {4},
pages = {173--178},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00221-X},
doi = {10.1016/S0020-0190(98)00221-X},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/NawrockiCC98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NikolopoulosR98,
author = {Stavros D. Nikolopoulos and
Panos Rondogiannis},
title = {On the Number of Spanning Trees of Multi-Star Related Graphs},
journal = {Inf. Process. Lett.},
volume = {65},
number = {4},
pages = {183--188},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00008-8},
doi = {10.1016/S0020-0190(98)00008-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/NikolopoulosR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/OdijkM98,
author = {Michiel A. Odijk and
Hans van Maaren},
title = {Improved Solutions to the Steiner Triple Covering Problem},
journal = {Inf. Process. Lett.},
volume = {65},
number = {2},
pages = {67--69},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)80440-1},
doi = {10.1016/S0020-0190(97)80440-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/OdijkM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PoonZC98,
author = {Chung Keung Poon and
Binhai Zhu and
Francis Y. L. Chin},
title = {A Polynomial Time Solution for Labeling a Rectlinear Map},
journal = {Inf. Process. Lett.},
volume = {65},
number = {4},
pages = {201--207},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00002-7},
doi = {10.1016/S0020-0190(98)00002-7},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PoonZC98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RamanRR98,
author = {Venkatesh Raman and
Bala Ravikumar and
S. Srinivasa Rao},
title = {A Simplified NP-Complete {MAXSAT} Problem},
journal = {Inf. Process. Lett.},
volume = {65},
number = {1},
pages = {1--6},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00223-8},
doi = {10.1016/S0020-0190(97)00223-8},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RamanRR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RyanS98,
author = {Peter Y. A. Ryan and
Steve A. Schneider},
title = {An Attack on a Recursive Authentication Protocol. {A} Cautionary Tale},
journal = {Inf. Process. Lett.},
volume = {65},
number = {1},
pages = {7--10},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00180-4},
doi = {10.1016/S0020-0190(97)00180-4},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/RyanS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SegalK98,
author = {Michael Segal and
Klara Kedem},
title = {Enclosing k Points in the Smallest Axis Parallel Rectangle},
journal = {Inf. Process. Lett.},
volume = {65},
number = {2},
pages = {95--99},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00212-3},
doi = {10.1016/S0020-0190(97)00212-3},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SegalK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShmueliS98,
author = {Oded Shmueli and
Kurt A. Shoens},
title = {Data Sufficiency for Queries on Cache},
journal = {Inf. Process. Lett.},
volume = {65},
number = {4},
pages = {209--216},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00205-6},
doi = {10.1016/S0020-0190(97)00205-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ShmueliS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SonLCS98,
author = {Jung Je Son and
Jong In Lim and
Seongtaek Chee and
Soo Hak Sung},
title = {Global Avalanche Characteristics and Nonlinearity of Balanced Boolean
Functions},
journal = {Inf. Process. Lett.},
volume = {65},
number = {3},
pages = {139--144},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00009-X},
doi = {10.1016/S0020-0190(98)00009-X},
timestamp = {Thu, 17 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SonLCS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VedanthamI98,
author = {Sundarajan Vedantham and
S. Sitharama Iyengar},
title = {The Bandwidth Allocation Problem in the {ATM} Network Model is NP-Complete},
journal = {Inf. Process. Lett.},
volume = {65},
number = {4},
pages = {179--182},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00226-9},
doi = {10.1016/S0020-0190(98)00226-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/VedanthamI98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangHH98,
author = {Jeng{-}Jung Wang and
Chun{-}Nan Hung and
Lih{-}Hsing Hsu},
title = {Optimal 1-Hamiltonian Graphs},
journal = {Inf. Process. Lett.},
volume = {65},
number = {3},
pages = {157--161},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00004-0},
doi = {10.1016/S0020-0190(98)00004-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangHH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WuCL98,
author = {Q. S. Wu and
Kun{-}Mao Chao and
Richard C. T. Lee},
title = {The NPO-Completeness of the Longest Hamiltonian Cycle Problem},
journal = {Inf. Process. Lett.},
volume = {65},
number = {3},
pages = {119--123},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00003-9},
doi = {10.1016/S0020-0190(98)00003-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WuCL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XiangU98,
author = {Limin Xiang and
Kazuo Ushijima},
title = {{ANSV} Problem on BSRs},
journal = {Inf. Process. Lett.},
volume = {65},
number = {3},
pages = {135--138},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00214-7},
doi = {10.1016/S0020-0190(97)00214-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/XiangU98.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-04-25 12:24 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:
