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/ipl64.bht:"
download as .bib file
@article{DBLP:journals/ipl/AaronG97,
author = {Eric Aaron and
David Gries},
title = {Formal Justification of Underspecification for {S5}},
journal = {Inf. Process. Lett.},
volume = {64},
number = {3},
pages = {115--121},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00165-8},
doi = {10.1016/S0020-0190(97)00165-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AaronG97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AcetoI97,
author = {Luca Aceto and
Anna Ing{\'{o}}lfsd{\'{o}}ttir},
title = {A Characterization of Finitary Bisimulation},
journal = {Inf. Process. Lett.},
volume = {64},
number = {3},
pages = {127--134},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00163-4},
doi = {10.1016/S0020-0190(97)00163-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AcetoI97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AgrawalEA97,
author = {Divyakant Agrawal and
{\"{O}}mer Egecioglu and
Amr El Abbadi},
title = {Billiard Quorums on the Grid},
journal = {Inf. Process. Lett.},
volume = {64},
number = {1},
pages = {9--16},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00145-2},
doi = {10.1016/S0020-0190(97)00145-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AgrawalEA97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlbersM97,
author = {Susanne Albers and
Michael Mitzenmacher},
title = {Revisiting the Counter Algorithms for List Update},
journal = {Inf. Process. Lett.},
volume = {64},
number = {3},
pages = {155--160},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00160-9},
doi = {10.1016/S0020-0190(97)00160-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlbersM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlonsoRS97,
author = {Laurent Alonso and
Jean{-}Luc R{\'{e}}my and
Ren{\'{e}} Schott},
title = {Uniform Generation of a Schr{\"{o}}der Tree},
journal = {Inf. Process. Lett.},
volume = {64},
number = {6},
pages = {305--308},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00174-9},
doi = {10.1016/S0020-0190(97)00174-9},
timestamp = {Thu, 08 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlonsoRS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlstrupSS97,
author = {Stephen Alstrup and
Jens P. Secher and
Maz Spork},
title = {Optimal On-Line Decremental Connectivity in Trees},
journal = {Inf. Process. Lett.},
volume = {64},
number = {4},
pages = {161--164},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00170-1},
doi = {10.1016/S0020-0190(97)00170-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlstrupSS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ArnoldKK97,
author = {Andr{\'{e}} Arnold and
Mathias Kanta and
Daniel Krob},
title = {Recognizable Subsets of the Two Letter Plactic Monoid},
journal = {Inf. Process. Lett.},
volume = {64},
number = {2},
pages = {53--59},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00157-9},
doi = {10.1016/S0020-0190(97)00157-9},
timestamp = {Wed, 04 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ArnoldKK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bagchi97,
author = {Anindo Bagchi},
title = {Route Selection with Multiple Metrics},
journal = {Inf. Process. Lett.},
volume = {64},
number = {4},
pages = {203--205},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00144-0},
doi = {10.1016/S0020-0190(97)00144-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bagchi97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BaruahGPSAJ97,
author = {Sanjoy K. Baruah and
Johannes Gehrke and
C. Greg Plaxton and
Ion Stoica and
Hussein M. Abdel{-}Wahab and
Kevin Jeffay},
title = {Fair On-Line Scheduling of a Dynamic Set of Tasks on a Single Resource},
journal = {Inf. Process. Lett.},
volume = {64},
number = {1},
pages = {43--51},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00149-X},
doi = {10.1016/S0020-0190(97)00149-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BaruahGPSAJ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BelogayCMS97,
author = {E. Belogay and
Carlos Cabrelli and
Ursula Molter and
Ron Shonkwiler},
title = {Calculating the Hausdorff Distance Between Curves},
journal = {Inf. Process. Lett.},
volume = {64},
number = {1},
pages = {17--22},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00140-3},
doi = {10.1016/S0020-0190(97)00140-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BelogayCMS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BertinoCS97,
author = {Elisa Bertino and
Barbara Catania and
Boris Shidlovsky},
title = {Towards Optimal Two-Dimensional Indexing for Constraint Databases},
journal = {Inf. Process. Lett.},
volume = {64},
number = {1},
pages = {1--8},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00146-4},
doi = {10.1016/S0020-0190(97)00146-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BertinoCS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BoldiV97,
author = {Paolo Boldi and
Sebastiano Vigna},
title = {Minimal Sense of Direction and Decision Problems for Cayley Graphs},
journal = {Inf. Process. Lett.},
volume = {64},
number = {6},
pages = {299--303},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00187-7},
doi = {10.1016/S0020-0190(97)00187-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BoldiV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CesatiT97,
author = {Marco Cesati and
Luca Trevisan},
title = {On the Efficiency of Polynomial Time Approximation Schemes},
journal = {Inf. Process. Lett.},
volume = {64},
number = {4},
pages = {165--171},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00164-6},
doi = {10.1016/S0020-0190(97)00164-6},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CesatiT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangC97,
author = {Hung{-}Yi Chang and
Rong{-}Jaye Chen},
title = {Embedding Cycles in {IEH} Graphs},
journal = {Inf. Process. Lett.},
volume = {64},
number = {1},
pages = {23--27},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00147-6},
doi = {10.1016/S0020-0190(97)00147-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChangC97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangY97,
author = {Ye{-}In Chang and
Bi{-}Yen Yang},
title = {Efficient Access Methods for Image Databases},
journal = {Inf. Process. Lett.},
volume = {64},
number = {2},
pages = {95--105},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00151-8},
doi = {10.1016/S0020-0190(97)00151-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChangY97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CoffmanFGG97,
author = {Edward G. Coffman Jr. and
Leopold Flatto and
Edgar N. Gilbert and
Albert G. Greenberg},
title = {An Approximate Model of Processor Communication Rings Under Heavy
Load},
journal = {Inf. Process. Lett.},
volume = {64},
number = {2},
pages = {61--67},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00159-2},
doi = {10.1016/S0020-0190(97)00159-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CoffmanFGG97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Coupry97,
author = {Laurent Coupry},
title = {A Simple Linear Algorithm for the Edge-Disjoint (s, t)-Paths Problem
in Undirected Planar Graphs},
journal = {Inf. Process. Lett.},
volume = {64},
number = {2},
pages = {83--86},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00153-1},
doi = {10.1016/S0020-0190(97)00153-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Coupry97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DaiIK97,
author = {Yang Dai and
Kazuo Iwano and
Naoki Katoh},
title = {A New Probabilistic Analysis of Karger's Randomized Algorithm for
Minimum Cut Problems},
journal = {Inf. Process. Lett.},
volume = {64},
number = {5},
pages = {255--261},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00175-0},
doi = {10.1016/S0020-0190(97)00175-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DaiIK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DehneG97,
author = {Frank K. H. A. Dehne and
Katia S. Guimar{\~{a}}es},
title = {Exact and Approximate Computational Geometry Solutions of an Unrestricted
Point Set Stereo Matching Problem},
journal = {Inf. Process. Lett.},
volume = {64},
number = {3},
pages = {107--114},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00168-3},
doi = {10.1016/S0020-0190(97)00168-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DehneG97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DomingoTW97,
author = {Carlos Domingo and
Tatsuie Tsukiji and
Osamu Watanabe},
title = {Partial Occam's Razor and its Applications},
journal = {Inf. Process. Lett.},
volume = {64},
number = {4},
pages = {179--185},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00169-5},
doi = {10.1016/S0020-0190(97)00169-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DomingoTW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EdalatSW97,
author = {Abbas Edalat and
David W. N. Sharp and
Lyndon While},
title = {Bounding the Attractor of an {IFS}},
journal = {Inf. Process. Lett.},
volume = {64},
number = {4},
pages = {197--202},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00156-7},
doi = {10.1016/S0020-0190(97)00156-7},
timestamp = {Fri, 02 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EdalatSW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EfratS97,
author = {Alon Efrat and
Otfried Schwarzkopf},
title = {Separating and Shattering Long Line Segments},
journal = {Inf. Process. Lett.},
volume = {64},
number = {6},
pages = {309--314},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00188-9},
doi = {10.1016/S0020-0190(97)00188-9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EfratS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FlouretL97,
author = {Marianne Flouret and
{\'{E}}ric Laugerotte},
title = {Noncommutative Minimization Algorithms},
journal = {Inf. Process. Lett.},
volume = {64},
number = {3},
pages = {123--126},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00162-2},
doi = {10.1016/S0020-0190(97)00162-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FlouretL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GolicSSD97,
author = {Jovan Dj. Golic and
Mahmoud Salmasizadeh and
Leonie Simpson and
Ed Dawson},
title = {Fast Correlation Attacks on Nonlinear Filter Generators},
journal = {Inf. Process. Lett.},
volume = {64},
number = {1},
pages = {37--42},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00148-8},
doi = {10.1016/S0020-0190(97)00148-8},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GolicSSD97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrafK97,
author = {Thomas Graf and
V. Kamakoti},
title = {Sparse Dominance Queries for Many Points in Optimal Time and Space},
journal = {Inf. Process. Lett.},
volume = {64},
number = {6},
pages = {287--291},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00181-6},
doi = {10.1016/S0020-0190(97)00181-6},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GrafK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuptaJS97,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid},
title = {A Technique for Adding Range Restrictions to Generalized Searching
Problems},
journal = {Inf. Process. Lett.},
volume = {64},
number = {5},
pages = {263--269},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00183-X},
doi = {10.1016/S0020-0190(97)00183-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuptaJS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hirata97,
author = {Kouichi Hirata},
title = {Constructing Simply Recursive Programs from a Finite Set of Good Examples},
journal = {Inf. Process. Lett.},
volume = {64},
number = {5},
pages = {225--230},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00185-3},
doi = {10.1016/S0020-0190(97)00185-3},
timestamp = {Wed, 06 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Hirata97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IyengarC97,
author = {Vikram Iyengar and
Krishnendu Chakrabarty},
title = {An Efficient Finite-State Machine Implementation of Huffman Decoders},
journal = {Inf. Process. Lett.},
volume = {64},
number = {6},
pages = {271--275},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00176-2},
doi = {10.1016/S0020-0190(97)00176-2},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/IyengarC97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KabadiA97,
author = {Santosh N. Kabadi and
Yash P. Aneja},
title = {An Efficient, Strongly Polynomial, epsilon-Approximation Schemes},
journal = {Inf. Process. Lett.},
volume = {64},
number = {4},
pages = {173--177},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00142-7},
doi = {10.1016/S0020-0190(97)00142-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KabadiA97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KovalyovS97,
author = {Mikhail Y. Kovalyov and
Yakov M. Shafransky},
title = {Batch Scheduling with Deadlines on Parallel Machines: An NP-Hard Case},
journal = {Inf. Process. Lett.},
volume = {64},
number = {2},
pages = {69--74},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00154-3},
doi = {10.1016/S0020-0190(97)00154-3},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KovalyovS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KulkarniA97,
author = {Sandeep S. Kulkarni and
Anish Arora},
title = {Multitolerant Barrier Synchronization},
journal = {Inf. Process. Lett.},
volume = {64},
number = {1},
pages = {29--36},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00143-9},
doi = {10.1016/S0020-0190(97)00143-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KulkarniA97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeK97,
author = {Gyung{-}Ok Lee and
Do{-}Hyung Kim},
title = {Characterization of Extended LR(k) Grammars},
journal = {Inf. Process. Lett.},
volume = {64},
number = {2},
pages = {75--82},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00152-X},
doi = {10.1016/S0020-0190(97)00152-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeeK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinC97,
author = {Min{-}Sheng Lin and
Deng{-}Jyi Chen},
title = {The Computational Complexity of the Reliability Problem on Distributed
Systems},
journal = {Inf. Process. Lett.},
volume = {64},
number = {3},
pages = {143--147},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00150-6},
doi = {10.1016/S0020-0190(97)00150-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LinC97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mitrana97,
author = {Victor Mitrana},
title = {Primitive Morphisms},
journal = {Inf. Process. Lett.},
volume = {64},
number = {6},
pages = {277--281},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00178-6},
doi = {10.1016/S0020-0190(97)00178-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mitrana97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MokE97,
author = {Wai Yin Mok and
David W. Embley},
title = {On Improving Dependency Implication Algorithms},
journal = {Inf. Process. Lett.},
volume = {64},
number = {3},
pages = {135--141},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00158-0},
doi = {10.1016/S0020-0190(97)00158-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MokE97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NardelliMS97a,
author = {Enrico Nardelli and
Vincenzo Mastrobuoni and
Alesiano Santomo},
title = {Computing a Poset from its Realizer},
journal = {Inf. Process. Lett.},
volume = {64},
number = {3},
pages = {149--154},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00166-X},
doi = {10.1016/S0020-0190(97)00166-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/NardelliMS97a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Queinnec97,
author = {Christian Queinnec},
title = {Fast and Compact Dispatching for Dynamic Object-Oriented Languages},
journal = {Inf. Process. Lett.},
volume = {64},
number = {6},
pages = {315--321},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00192-0},
doi = {10.1016/S0020-0190(97)00192-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Queinnec97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RabiS97,
author = {Muhammad Rabi and
Alan T. Sherman},
title = {An Observation on Associative One-Way Functions in Complexity Theory},
journal = {Inf. Process. Lett.},
volume = {64},
number = {5},
pages = {239--244},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00186-5},
doi = {10.1016/S0020-0190(97)00186-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RabiS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ReingoldUG97,
author = {Edward M. Reingold and
Kenneth J. Urban and
David Gries},
title = {{K-M-P} String Matching Revisited},
journal = {Inf. Process. Lett.},
volume = {64},
number = {5},
pages = {217--223},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00173-7},
doi = {10.1016/S0020-0190(97)00173-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ReingoldUG97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RheeW97,
author = {Injong Rhee and
Jennifer L. Welch},
title = {Time Bounds on Synchronization in a Periodic Distributed System},
journal = {Inf. Process. Lett.},
volume = {64},
number = {2},
pages = {87--93},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00155-5},
doi = {10.1016/S0020-0190(97)00155-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RheeW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShokrollahiSS97,
author = {Mohammad Amin Shokrollahi and
Daniel A. Spielman and
Volker Stemann},
title = {A Remark on Matrix Rigidity},
journal = {Inf. Process. Lett.},
volume = {64},
number = {6},
pages = {283--285},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00190-7},
doi = {10.1016/S0020-0190(97)00190-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ShokrollahiSS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Slavik97,
author = {Petr Slav{\'{\i}}k},
title = {Improved Performance of the Greedy Algorithm for Partial Cover},
journal = {Inf. Process. Lett.},
volume = {64},
number = {5},
pages = {251--254},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00182-8},
doi = {10.1016/S0020-0190(97)00182-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Slavik97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tyszkiewicz97,
author = {Jerzy Tyszkiewicz},
title = {A Note on the Kolmogorov Data Complexity and Nonuniform Logical Definitions},
journal = {Inf. Process. Lett.},
volume = {64},
number = {4},
pages = {187--195},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00172-5},
doi = {10.1016/S0020-0190(97)00172-5},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Tyszkiewicz97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VelosoV97,
author = {Paulo A. S. Veloso and
Sheila R. M. Veloso},
title = {On Methods for Safe Introduction of Operations},
journal = {Inf. Process. Lett.},
volume = {64},
number = {5},
pages = {231--238},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00161-0},
doi = {10.1016/S0020-0190(97)00161-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/VelosoV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wierzbowska97,
author = {Izabela Wierzbowska},
title = {Checker for Data Structures which Sort Elements},
journal = {Inf. Process. Lett.},
volume = {64},
number = {5},
pages = {245--249},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00167-1},
doi = {10.1016/S0020-0190(97)00167-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wierzbowska97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Woeginger97,
author = {Gerhard J. Woeginger},
title = {There is no Asymptotic {PTAS} for Two-Dimensional Vector Packing},
journal = {Inf. Process. Lett.},
volume = {64},
number = {6},
pages = {293--297},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00179-8},
doi = {10.1016/S0020-0190(97)00179-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Woeginger97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZenzoBM97,
author = {Silvano Di Zenzo and
Paolo Bottoni and
Piero Mussio},
title = {A Notion of Information Related to Computation},
journal = {Inf. Process. Lett.},
volume = {64},
number = {4},
pages = {207--215},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00171-3},
doi = {10.1016/S0020-0190(97)00171-3},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZenzoBM97.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-04 01:40 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:
