Search dblp for Publications

export results for "toc:db/journals/ipl/ipl76.bht:"

 download as .bib file

@article{DBLP:journals/ipl/AertsKE00,
  author       = {Joep Aerts and
                  Jan H. M. Korst and
                  Sebastian Egner},
  title        = {Random duplicate storage strategies for load balancing in multimedia
                  servers},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {1-2},
  pages        = {51--59},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00115-0},
  doi          = {10.1016/S0020-0190(00)00115-0},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/AertsKE00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/BeinFL00,
  author       = {Wolfgang W. Bein and
                  Rudolf Fleischer and
                  Lawrence L. Larmore},
  title        = {Limited bookmark randomized online algorithms for the paging problem},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {4-6},
  pages        = {155--162},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00140-X},
  doi          = {10.1016/S0020-0190(00)00140-X},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BeinFL00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/BespamyatnikhS00a,
  author       = {Sergei Bespamyatnikh and
                  Michael Segal},
  title        = {Enumerating longest increasing subsequences and patience sorting},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {1-2},
  pages        = {7--11},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00124-1},
  doi          = {10.1016/S0020-0190(00)00124-1},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/BespamyatnikhS00a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Borzyszkowski00,
  author       = {Tomasz Borzyszkowski},
  title        = {Generalized interpolation in {CASL}},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {1-2},
  pages        = {19--24},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00120-4},
  doi          = {10.1016/S0020-0190(00)00120-4},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Borzyszkowski00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/CaiN00,
  author       = {Jin{-}yi Cai and
                  Ajay Nerurkar},
  title        = {A note on the non-NP-hardness of approximate lattice problems under
                  general Cook reductions},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {1-2},
  pages        = {61--66},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00123-X},
  doi          = {10.1016/S0020-0190(00)00123-X},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/CaiN00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/ChungY00,
  author       = {Kuo{-}Liang Chung and
                  Wen{-}Ming Yan},
  title        = {On the number of spanning trees of a multi-complete/star related graph},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {3},
  pages        = {113--119},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00135-6},
  doi          = {10.1016/S0020-0190(00)00135-6},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/ChungY00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/ComellasOP00,
  author       = {Francesc Comellas and
                  Javier Oz{\'{o}}n and
                  Joseph G. Peters},
  title        = {Deterministic small-world communication networks},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {1-2},
  pages        = {83--90},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00118-6},
  doi          = {10.1016/S0020-0190(00)00118-6},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/ComellasOP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/DobrevSSV00,
  author       = {Stefan Dobrev and
                  Heiko Schr{\"{o}}der and
                  Ondrej S{\'{y}}kora and
                  Imrich Vrto},
  title        = {Evolutionary graph colouring},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {1-2},
  pages        = {91--94},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00125-3},
  doi          = {10.1016/S0020-0190(00)00125-3},
  timestamp    = {Wed, 15 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/DobrevSSV00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Epstein00,
  author       = {Leah Epstein},
  title        = {A note on on-line scheduling with precedence constraints on identical
                  machines},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {4-6},
  pages        = {149--153},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00141-1},
  doi          = {10.1016/S0020-0190(00)00141-1},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Epstein00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/FocardiLP00,
  author       = {Riccardo Focardi and
                  Flaminia L. Luccio and
                  David Peleg},
  title        = {Feedback vertex set in hypercubes},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {1-2},
  pages        = {1--5},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00127-7},
  doi          = {10.1016/S0020-0190(00)00127-7},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/FocardiLP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Garcia-VillalbaF00,
  author       = {L. Javier Garc{\'{\i}}a{-}Villalba and
                  Amparo F{\'{u}}ster{-}Sabater},
  title        = {On the linear complexity of the sequences generated by nonlinear filterings},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {1-2},
  pages        = {67--73},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00117-4},
  doi          = {10.1016/S0020-0190(00)00117-4},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Garcia-VillalbaF00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/HartuvS00,
  author       = {Erez Hartuv and
                  Ron Shamir},
  title        = {A clustering algorithm based on graph connectivity},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {4-6},
  pages        = {175--181},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00142-3},
  doi          = {10.1016/S0020-0190(00)00142-3},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/HartuvS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/HiguchiT00,
  author       = {Akira Higuchi and
                  Naofumi Takagi},
  title        = {A fast addition algorithm for elliptic curve arithmetic in GF(2\({}^{\mbox{n}}\))
                  using projective coordinates},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {3},
  pages        = {101--103},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00134-4},
  doi          = {10.1016/S0020-0190(00)00134-4},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/HiguchiT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/KimLY00,
  author       = {Hyun{-}Sung Kim and
                  Sung{-}Woo Lee and
                  Kee{-}Young Yoo},
  title        = {Partitioned systolic architecture for modular multiplication in GF(2\({}^{\mbox{m}}\))},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {3},
  pages        = {135--139},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00130-7},
  doi          = {10.1016/S0020-0190(00)00130-7},
  timestamp    = {Fri, 03 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/KimLY00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/LamportPW00,
  author       = {Leslie Lamport and
                  Sharon E. Perl and
                  William E. Weihl},
  title        = {When does a correct mutual exclusion algorithm guarantee mutual exclusion?},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {3},
  pages        = {131--134},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00132-0},
  doi          = {10.1016/S0020-0190(00)00132-0},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/LamportPW00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/LeeY00,
  author       = {Keon{-}Jik Lee and
                  Kee{-}Young Yoo},
  title        = {Linear systolic multiplier/squarer for fast exponentiation},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {3},
  pages        = {105--111},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00131-9},
  doi          = {10.1016/S0020-0190(00)00131-9},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/LeeY00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Li00,
  author       = {Chu Min Li},
  title        = {Equivalency reasoning to solve a class of hard {SAT} problems},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {1-2},
  pages        = {75--81},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00126-5},
  doi          = {10.1016/S0020-0190(00)00126-5},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Li00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Lopriore00,
  author       = {Lanfranco Lopriore},
  title        = {Protection in a single-address-space environment},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {1-2},
  pages        = {25--32},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00161-7},
  doi          = {10.1016/S0020-0190(00)00161-7},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Lopriore00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/ParkC00,
  author       = {Ho{-}Hyun Park and
                  Chin{-}Wan Chung},
  title        = {Complexity of estimating multi-way join result sizes for area skewed
                  spatial data},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {3},
  pages        = {121--129},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00129-0},
  doi          = {10.1016/S0020-0190(00)00129-0},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/ParkC00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/RousselR00,
  author       = {Florian Roussel and
                  Irena Rusu},
  title        = {Recognizing i-triangulated graphs in O(mn) time},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {3},
  pages        = {141--147},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00138-1},
  doi          = {10.1016/S0020-0190(00)00138-1},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/RousselR00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/SchonlauT00,
  author       = {Matthias Schonlau and
                  Martin Theus},
  title        = {Detecting masquerades in intrusion detection based on unpopular commands},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {1-2},
  pages        = {33--38},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00122-8},
  doi          = {10.1016/S0020-0190(00)00122-8},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/SchonlauT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Serra-Sagrista00,
  author       = {Joan Serra{-}Sagrist{\`{a}}},
  title        = {Enumeration of lattice points in l\({}_{\mbox{1}}\) norm},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {1-2},
  pages        = {39--44},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00119-8},
  doi          = {10.1016/S0020-0190(00)00119-8},
  timestamp    = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Serra-Sagrista00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Shparlinski00,
  author       = {Igor E. Shparlinski},
  title        = {Linear complexity of the Naor-Reingold pseudo-random function},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {3},
  pages        = {95--99},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00133-2},
  doi          = {10.1016/S0020-0190(00)00133-2},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/Shparlinski00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Tan00,
  author       = {Xuehou Tan},
  title        = {On optimal bridges between two convex regions},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {4-6},
  pages        = {163--168},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00143-5},
  doi          = {10.1016/S0020-0190(00)00143-5},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Tan00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/UeharaC00,
  author       = {Ryuhei Uehara and
                  Zhi{-}Zhong Chen},
  title        = {Parallel approximation algorithms for maximum weighted matching in
                  general graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {1-2},
  pages        = {13--17},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00128-9},
  doi          = {10.1016/S0020-0190(00)00128-9},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/UeharaC00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/XiangUT00,
  author       = {Limin Xiang and
                  Kazuo Ushijima and
                  Changjie Tang},
  title        = {Efficient loopless generation of Gray codes for k-ary trees},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {4-6},
  pages        = {169--174},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00139-3},
  doi          = {10.1016/S0020-0190(00)00139-3},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/XiangUT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/XueL00,
  author       = {Jue Xue and
                  Ju Liu},
  title        = {A network-flow-based lower bound for the minimum weighted integer
                  coloring problem},
  journal      = {Inf. Process. Lett.},
  volume       = {76},
  number       = {1-2},
  pages        = {45--50},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0020-0190(00)00121-6},
  doi          = {10.1016/S0020-0190(00)00121-6},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/XueL00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.