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/ipl111.bht:"
download as .bib file
@article{DBLP:journals/ipl/AcetoFGI11,
author = {Luca Aceto and
David de Frutos{-}Escrig and
Carlos Gregorio{-}Rodr{\'{\i}}guez and
Anna Ing{\'{o}}lfsd{\'{o}}ttir},
title = {Complete and ready simulation semantics are not finitely based over
BCCSP, even with a singleton alphabet},
journal = {Inf. Process. Lett.},
volume = {111},
number = {9},
pages = {408--413},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.01.015},
doi = {10.1016/J.IPL.2011.01.015},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AcetoFGI11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Adamczyk11,
author = {Marek Adamczyk},
title = {Improved analysis of the greedy algorithm for stochastic matching},
journal = {Inf. Process. Lett.},
volume = {111},
number = {15},
pages = {731--737},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.007},
doi = {10.1016/J.IPL.2011.05.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Adamczyk11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AfratiCK11,
author = {Foto N. Afrati and
Sara Cohen and
Gabriel M. Kuper},
title = {On the complexity of tree pattern containment with arithmetic comparisons},
journal = {Inf. Process. Lett.},
volume = {111},
number = {15},
pages = {754--760},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.04.014},
doi = {10.1016/J.IPL.2011.04.014},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AfratiCK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Amano11,
author = {Kazuyuki Amano},
title = {Minterm-transitive functions with asymptotically smallest block sensitivity},
journal = {Inf. Process. Lett.},
volume = {111},
number = {23-24},
pages = {1081--1084},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.09.008},
doi = {10.1016/J.IPL.2011.09.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Amano11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AndresH11,
author = {Stephan Dominique Andres and
Winfried Hochst{\"{a}}ttler},
title = {The game chromatic number and the game colouring number of classes
of oriented cactuses},
journal = {Inf. Process. Lett.},
volume = {111},
number = {5},
pages = {222--226},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.020},
doi = {10.1016/J.IPL.2010.11.020},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AndresH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ApostolicoBP11,
author = {Alberto Apostolico and
Manuel Barbares and
Cinzia Pizzi},
title = {Speedup for a periodic subgraph miner},
journal = {Inf. Process. Lett.},
volume = {111},
number = {11},
pages = {521--523},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.02.016},
doi = {10.1016/J.IPL.2011.02.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ApostolicoBP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ArevaloJLM11,
author = {Sergio Ar{\'{e}}valo and
Ernesto Jim{\'{e}}nez and
Mikel Larrea and
Luis Mengual},
title = {Communication-efficient and crash-quiescent Omega with unknown membership},
journal = {Inf. Process. Lett.},
volume = {111},
number = {4},
pages = {194--199},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.012},
doi = {10.1016/J.IPL.2010.11.012},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ArevaloJLM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ArockiarajMRR11,
author = {Micheal Arockiaraj and
Paul D. Manuel and
Indra Rajasingh and
Bharati Rajan},
title = {Wirelength of 1-fault hamiltonian graphs into wheels and fans},
journal = {Inf. Process. Lett.},
volume = {111},
number = {18},
pages = {921--925},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.06.011},
doi = {10.1016/J.IPL.2011.06.011},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ArockiarajMRR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ArriolaCLLF11,
author = {Iratxe Soraluze Arriola and
Roberto Corti{\~{n}}as and
Alberto Lafuente and
Mikel Larrea and
Felix C. Freiling},
title = {Communication-efficient failure detection and consensus in omission
environments},
journal = {Inf. Process. Lett.},
volume = {111},
number = {6},
pages = {262--268},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.12.008},
doi = {10.1016/J.IPL.2010.12.008},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ArriolaCLLF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AtallahD11,
author = {Mikhail J. Atallah and
Timothy W. Duket},
title = {Pattern matching in the Hamming distance with thresholds},
journal = {Inf. Process. Lett.},
volume = {111},
number = {14},
pages = {674--677},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.04.004},
doi = {10.1016/J.IPL.2011.04.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AtallahD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AumassonP11,
author = {Jean{-}Philippe Aumasson and
Raphael C.{-}W. Phan},
title = {On the cryptanalysis of the hash function Fugue: Partitioning and
inside-out distinguishers},
journal = {Inf. Process. Lett.},
volume = {111},
number = {11},
pages = {512--515},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.02.012},
doi = {10.1016/J.IPL.2011.02.012},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AumassonP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BajicB11,
author = {Dragana Bajic and
Alister G. Burr},
title = {Comments on "Integer {SEC-DED} codes for low power communications"
[Inform. Process. Lett. 110 {(2010)} 518-520]},
journal = {Inf. Process. Lett.},
volume = {111},
number = {9},
pages = {414--415},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.01.003},
doi = {10.1016/J.IPL.2011.01.003},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BajicB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BakhshiEFP11,
author = {Rena Bakhshi and
J{\"{o}}rg Endrullis and
Wan J. Fokkink and
Jun Pang},
title = {Fast leader election in anonymous rings with bounded expected delay},
journal = {Inf. Process. Lett.},
volume = {111},
number = {17},
pages = {864--870},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.06.003},
doi = {10.1016/J.IPL.2011.06.003},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BakhshiEFP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BecherH11,
author = {Ver{\'{o}}nica Becher and
Pablo Ariel Heiber},
title = {On extending de Bruijn sequences},
journal = {Inf. Process. Lett.},
volume = {111},
number = {18},
pages = {930--932},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.06.013},
doi = {10.1016/J.IPL.2011.06.013},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BecherH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bera11,
author = {Debajyoti Bera},
title = {A lower bound method for quantum circuits},
journal = {Inf. Process. Lett.},
volume = {111},
number = {15},
pages = {723--726},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.002},
doi = {10.1016/J.IPL.2011.05.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bera11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BerryP11,
author = {Anne Berry and
Romain Pogorelcnik},
title = {A simple algorithm to generate the minimal separators and the maximal
cliques of a chordal graph},
journal = {Inf. Process. Lett.},
volume = {111},
number = {11},
pages = {508--511},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.02.013},
doi = {10.1016/J.IPL.2011.02.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BerryP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BiedlDHLSY11,
author = {Therese Biedl and
Stephane Durocher and
Holger H. Hoos and
Shuang Luan and
Jared Saia and
Maxwell Young},
title = {A note on improving the performance of approximation algorithms for
radiation therapy},
journal = {Inf. Process. Lett.},
volume = {111},
number = {7},
pages = {326--333},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.12.011},
doi = {10.1016/J.IPL.2010.12.011},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BiedlDHLSY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bird11,
author = {Richard S. Bird},
title = {A simple division-free algorithm for computing determinants},
journal = {Inf. Process. Lett.},
volume = {111},
number = {21-22},
pages = {1072--1074},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.08.006},
doi = {10.1016/J.IPL.2011.08.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bird11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BjorklundHKK11,
author = {Andreas Bj{\"{o}}rklund and
Thore Husfeldt and
Petteri Kaski and
Mikko Koivisto},
title = {Covering and packing in linear space},
journal = {Inf. Process. Lett.},
volume = {111},
number = {21-22},
pages = {1033--1036},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.08.002},
doi = {10.1016/J.IPL.2011.08.002},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BjorklundHKK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BockerD11,
author = {Sebastian B{\"{o}}cker and
Peter Damaschke},
title = {Even faster parameterized cluster deletion and cluster editing},
journal = {Inf. Process. Lett.},
volume = {111},
number = {14},
pages = {717--721},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.003},
doi = {10.1016/J.IPL.2011.05.003},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BockerD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BogdanovS11,
author = {Andrey Bogdanov and
Kyoji Shibutani},
title = {Analysis of 3-line generalized Feistel networks with double SD-functions},
journal = {Inf. Process. Lett.},
volume = {111},
number = {13},
pages = {656--660},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.04.002},
doi = {10.1016/J.IPL.2011.04.002},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BogdanovS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BoldiV11,
author = {Paolo Boldi and
Sebastiano Vigna},
title = {E=I+T: The internal extent formula for compacted tries},
journal = {Inf. Process. Lett.},
volume = {111},
number = {7},
pages = {310--313},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.12.012},
doi = {10.1016/J.IPL.2010.12.012},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BoldiV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BolligG11,
author = {Beate Bollig and
Marc Gill{\'{e}}},
title = {Randomized OBDDs for the most significant bit of multiplication need
exponential space},
journal = {Inf. Process. Lett.},
volume = {111},
number = {4},
pages = {151--155},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.013},
doi = {10.1016/J.IPL.2010.11.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BolligG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CaceresDDHMJ11,
author = {Alan Joseph J. Caceres and
Samantha Daley and
John DeJesus and
Michael Hintze and
Diquan Moore and
Katherine St. John},
title = {Walks in phylogenetic treespace},
journal = {Inf. Process. Lett.},
volume = {111},
number = {12},
pages = {600--604},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.015},
doi = {10.1016/J.IPL.2011.03.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CaceresDDHMJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CaoBSV11,
author = {Xiang{-}Lan Cao and
Spela Brglez and
Simon Spacapan and
Elkin Vumar},
title = {On edge connectivity of direct products of graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {18},
pages = {899--902},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.06.007},
doi = {10.1016/J.IPL.2011.06.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CaoBSV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CaoVZ11,
author = {Zhenfu Cao and
Ivan Visconti and
Zongyang Zhang},
title = {On constant-round concurrent non-malleable proof systems},
journal = {Inf. Process. Lett.},
volume = {111},
number = {18},
pages = {883--890},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.06.004},
doi = {10.1016/J.IPL.2011.06.004},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CaoVZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CechlarovaJ11,
author = {Katar{\'{\i}}na Cechl{\'{a}}rov{\'{a}} and
Eva Jel{\'{\i}}nkov{\'{a}}},
title = {An efficient implementation of the equilibrium algorithm for housing
markets with duplicate houses},
journal = {Inf. Process. Lett.},
volume = {111},
number = {13},
pages = {667--670},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.04.005},
doi = {10.1016/J.IPL.2011.04.005},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CechlarovaJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chang11,
author = {Ching{-}Lueh Chang},
title = {Triggering cascades on undirected connected graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {19},
pages = {973--978},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.008},
doi = {10.1016/J.IPL.2011.07.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chang11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChapuyK11,
author = {Guillaume Chapuy and
Ines Klimann},
title = {On the supports of recognizable series over a field and a single letter
alphabet},
journal = {Inf. Process. Lett.},
volume = {111},
number = {23-24},
pages = {1096--1098},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.09.010},
doi = {10.1016/J.IPL.2011.09.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChapuyK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chen11,
author = {Xie{-}Bin Chen},
title = {Parallel construction of optimal independent spanning trees on Cartesian
product of complete graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {5},
pages = {235--238},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.018},
doi = {10.1016/J.IPL.2010.11.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chen11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChiouLY11,
author = {Che Wun Chiou and
Chiou{-}Yng Lee and
Yun{-}Chi Yeh},
title = {Multiplexer implementation of low-complexity polynomial basis multiplier
in GF(m\({}^{\mbox{2}}\)) using all one polynomial},
journal = {Inf. Process. Lett.},
volume = {111},
number = {21-22},
pages = {1044--1047},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.08.004},
doi = {10.1016/J.IPL.2011.08.004},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChiouLY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CliffordP11,
author = {Rapha{\"{e}}l Clifford and
Alexandru Popa},
title = {Maximum subset intersection},
journal = {Inf. Process. Lett.},
volume = {111},
number = {7},
pages = {323--325},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.12.003},
doi = {10.1016/J.IPL.2010.12.003},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CliffordP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CrescenziIMMRV11,
author = {Pilu Crescenzi and
Miriam Di Ianni and
Andrea Marino and
Donatella Merlini and
Gianluca Rossi and
Paola Vocca},
title = {Smooth movement and Manhattan path based Random Waypoint mobility},
journal = {Inf. Process. Lett.},
volume = {111},
number = {5},
pages = {239--246},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.12.009},
doi = {10.1016/J.IPL.2010.12.009},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CrescenziIMMRV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CrochemoreT11,
author = {Maxime Crochemore and
German Tischler},
title = {Computing Longest Previous non-overlapping Factors},
journal = {Inf. Process. Lett.},
volume = {111},
number = {6},
pages = {291--295},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.12.005},
doi = {10.1016/J.IPL.2010.12.005},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CrochemoreT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CyganK11,
author = {Marek Cygan and
Lukasz Kowalik},
title = {Channel assignment via fast zeta transform},
journal = {Inf. Process. Lett.},
volume = {111},
number = {15},
pages = {727--730},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.008},
doi = {10.1016/J.IPL.2011.05.008},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CyganK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CyganPW11,
author = {Marek Cygan and
Marcin Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Capacitated domination faster than \emph{O}(\emph{n}\({}^{\mbox{2}}\))},
journal = {Inf. Process. Lett.},
volume = {111},
number = {23-24},
pages = {1099--1103},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.09.004},
doi = {10.1016/J.IPL.2011.09.004},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CyganPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DavidPS11,
author = {Matei David and
Periklis A. Papakonstantinou and
Anastasios Sidiropoulos},
title = {How strong is Nisan's pseudo-random generator?},
journal = {Inf. Process. Lett.},
volume = {111},
number = {16},
pages = {804--808},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.04.013},
doi = {10.1016/J.IPL.2011.04.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DavidPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DixitRD11,
author = {Manoj G. Dixit and
S. Ramesh and
Pallab Dasgupta},
title = {Some results on Parametric Temporal Logic},
journal = {Inf. Process. Lett.},
volume = {111},
number = {20},
pages = {994--998},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.002},
doi = {10.1016/J.IPL.2011.07.002},
timestamp = {Thu, 12 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DixitRD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DobsonLN11,
author = {Maria Patricia Dobson and
Valeria A. Leoni and
Graciela L. Nasini},
title = {The multiple domination and limited packing problems in graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {23-24},
pages = {1108--1113},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.09.002},
doi = {10.1016/J.IPL.2011.09.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DobsonLN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DoerrF11,
author = {Benjamin Doerr and
Mahmoud Fouz},
title = {Quasi-random rumor spreading: Reducing randomness can be costly},
journal = {Inf. Process. Lett.},
volume = {111},
number = {5},
pages = {227--230},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.006},
doi = {10.1016/J.IPL.2010.11.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DoerrF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DolevDPT11,
author = {Shlomi Dolev and
Swan Dubois and
Maria Potop{-}Butucaru and
S{\'{e}}bastien Tixeuil},
title = {Stabilizing data-link over non-FIFO channels with optimal fault-resilience},
journal = {Inf. Process. Lett.},
volume = {111},
number = {18},
pages = {912--920},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.06.010},
doi = {10.1016/J.IPL.2011.06.010},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DolevDPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DrineasZ11,
author = {Petros Drineas and
Anastasios Zouzias},
title = {A note on element-wise matrix sparsification via a matrix-valued Bernstein
inequality},
journal = {Inf. Process. Lett.},
volume = {111},
number = {8},
pages = {385--389},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.01.010},
doi = {10.1016/J.IPL.2011.01.010},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DrineasZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DuX11,
author = {Zheng{-}Zhong Du and
Jun{-}Ming Xu},
title = {A note on cycle embedding in hypercubes with faulty vertices},
journal = {Inf. Process. Lett.},
volume = {111},
number = {12},
pages = {557--560},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.002},
doi = {10.1016/J.IPL.2011.03.002},
timestamp = {Wed, 27 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DuX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DuanX11,
author = {Meijiao Duan and
Jing Xu},
title = {An efficient location-based compromise-tolerant key management scheme
for sensor networks},
journal = {Inf. Process. Lett.},
volume = {111},
number = {11},
pages = {503--507},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.02.017},
doi = {10.1016/J.IPL.2011.02.017},
timestamp = {Thu, 19 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DuanX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DuarteMS11,
author = {Rafael M. Duarte and
Alexandre Mota and
Augusto Sampaio},
title = {Introducing concurrency in sequential Java via laws},
journal = {Inf. Process. Lett.},
volume = {111},
number = {3},
pages = {129--134},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.004},
doi = {10.1016/J.IPL.2010.11.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DuarteMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DuttingHW11,
author = {Paul D{\"{u}}tting and
Monika Henzinger and
Ingmar Weber},
title = {Offline file assignments for online load balancing},
journal = {Inf. Process. Lett.},
volume = {111},
number = {4},
pages = {178--183},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.022},
doi = {10.1016/J.IPL.2010.11.022},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DuttingHW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EchenimP11,
author = {Mnacho Echenim and
Nicolas Peltier},
title = {Modular instantiation schemes},
journal = {Inf. Process. Lett.},
volume = {111},
number = {20},
pages = {989--993},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.003},
doi = {10.1016/J.IPL.2011.07.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EchenimP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Esik11,
author = {Zolt{\'{a}}n {\'{E}}sik},
title = {An undecidable property of context-free linear orders},
journal = {Inf. Process. Lett.},
volume = {111},
number = {3},
pages = {107--109},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.10.018},
doi = {10.1016/J.IPL.2010.10.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Esik11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EsparzaGKL11,
author = {Javier Esparza and
Pierre Ganty and
Stefan Kiefer and
Michael Luttenberger},
title = {Parikh's theorem: {A} simple and direct automaton construction},
journal = {Inf. Process. Lett.},
volume = {111},
number = {12},
pages = {614--619},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.019},
doi = {10.1016/J.IPL.2011.03.019},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EsparzaGKL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Even-DarS11,
author = {Eyal Even{-}Dar and
Asaf Shapira},
title = {A note on maximizing the spread of influence in social networks},
journal = {Inf. Process. Lett.},
volume = {111},
number = {4},
pages = {184--187},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.015},
doi = {10.1016/J.IPL.2010.11.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Even-DarS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EvenKN11,
author = {Guy Even and
Guy Kortsarz and
Zeev Nutov},
title = {A 1.5-approximation algorithm for augmenting edge-connectivity of
a graph from 1 to 2},
journal = {Inf. Process. Lett.},
volume = {111},
number = {6},
pages = {296--300},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.12.010},
doi = {10.1016/J.IPL.2010.12.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EvenKN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FanKLMWZ11,
author = {Hao Fan and
Hal A. Kierstead and
Guizhen Liu and
Theodore Molla and
Jianliang Wu and
Xin Zhang},
title = {A note on relaxed equitable coloring of graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {21-22},
pages = {1062--1066},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.08.001},
doi = {10.1016/J.IPL.2011.08.001},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FanKLMWZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FederS11,
author = {Tom{\'{a}}s Feder and
Carlos S. Subi},
title = {Maximum gap labelings of graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {4},
pages = {169--173},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.010},
doi = {10.1016/J.IPL.2010.11.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FederS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fiedorowicz11,
author = {Anna Fiedorowicz},
title = {Acyclic edge colourings of graphs with the number of edges linearly
bounded by the number of vertices},
journal = {Inf. Process. Lett.},
volume = {111},
number = {6},
pages = {287--290},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.12.002},
doi = {10.1016/J.IPL.2010.12.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fiedorowicz11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Filmus11,
author = {Yuval Filmus},
title = {Lower bounds for context-free grammars},
journal = {Inf. Process. Lett.},
volume = {111},
number = {18},
pages = {895--898},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.06.006},
doi = {10.1016/J.IPL.2011.06.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Filmus11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FleischerX11,
author = {Rudolf Fleischer and
Xiaoming Xu},
title = {Computing minimum diameter color-spanning sets is hard},
journal = {Inf. Process. Lett.},
volume = {111},
number = {21-22},
pages = {1054--1056},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.015},
doi = {10.1016/J.IPL.2011.07.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FleischerX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FlocchiniIPS11,
author = {Paola Flocchini and
David Ilcinkas and
Andrzej Pelc and
Nicola Santoro},
title = {How many oblivious robots can explore a line},
journal = {Inf. Process. Lett.},
volume = {111},
number = {20},
pages = {1027--1031},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.018},
doi = {10.1016/J.IPL.2011.07.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FlocchiniIPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FominGL11,
author = {Fedor V. Fomin and
Petr A. Golovach and
Erik Jan van Leeuwen},
title = {Spanners of bounded degree graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {3},
pages = {142--144},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.10.021},
doi = {10.1016/J.IPL.2010.10.021},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FominGL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FominLRS11,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh},
title = {Subexponential algorithms for partial cover problems},
journal = {Inf. Process. Lett.},
volume = {111},
number = {16},
pages = {814--818},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.016},
doi = {10.1016/J.IPL.2011.05.016},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FominLRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FriezeM11,
author = {Alan M. Frieze and
P{\'{a}}ll Melsted},
title = {Randomly coloring simple hypergraphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {17},
pages = {848--853},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.06.001},
doi = {10.1016/J.IPL.2011.06.001},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FriezeM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GalJ11,
author = {Anna G{\'{a}}l and
Jing{-}Tang Jang},
title = {The size and depth of layered Boolean circuits},
journal = {Inf. Process. Lett.},
volume = {111},
number = {5},
pages = {213--217},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.023},
doi = {10.1016/J.IPL.2010.11.023},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GalJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GaoL11,
author = {Weifeng Gao and
Sanyang Liu},
title = {Improved artificial bee colony algorithm for global optimization},
journal = {Inf. Process. Lett.},
volume = {111},
number = {17},
pages = {871--882},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.06.002},
doi = {10.1016/J.IPL.2011.06.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GaoL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GaoWJ11,
author = {Min Gao and
Zhongfu Wu and
Feng Jiang},
title = {Userrank for item-based collaborative filtering recommendation},
journal = {Inf. Process. Lett.},
volume = {111},
number = {9},
pages = {440--446},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.02.003},
doi = {10.1016/J.IPL.2011.02.003},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GaoWJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gavril11,
author = {Fanica Gavril},
title = {Algorithms for induced biclique optimization problems},
journal = {Inf. Process. Lett.},
volume = {111},
number = {10},
pages = {469--473},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.02.005},
doi = {10.1016/J.IPL.2011.02.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gavril11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GeethaKCK11,
author = {S. Geetha and
V. Kabilan and
S. P. Chockalingam and
N. Kamaraj},
title = {Varying radix numeral system based adaptive image steganography},
journal = {Inf. Process. Lett.},
volume = {111},
number = {16},
pages = {792--797},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.013},
doi = {10.1016/J.IPL.2011.05.013},
timestamp = {Tue, 06 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GeethaKCK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GlabbeekGS11,
author = {Rob J. van Glabbeek and
Ursula Goltz and
Jens{-}Wolfhard Schicke},
title = {Abstract processes of place/transition systems},
journal = {Inf. Process. Lett.},
volume = {111},
number = {13},
pages = {626--633},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.013},
doi = {10.1016/J.IPL.2011.03.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GlabbeekGS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GomezGI11,
author = {Domingo G{\'{o}}mez and
Jaime Gutierrez and
{\'{A}}lvar Ibeas},
title = {On the linear complexity of the Naor-Reingold sequence},
journal = {Inf. Process. Lett.},
volume = {111},
number = {17},
pages = {854--856},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.017},
doi = {10.1016/J.IPL.2011.05.017},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GomezGI11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrabowskiFG11,
author = {Szymon Grabowski and
Simone Faro and
Emanuele Giaquinta},
title = {String matching with inversions and translocations in linear average
time (most of the time)},
journal = {Inf. Process. Lett.},
volume = {111},
number = {11},
pages = {516--520},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.02.015},
doi = {10.1016/J.IPL.2011.02.015},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GrabowskiFG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrimsonHK11,
author = {Rafael Grimson and
Joos Heintz and
Bart Kuijpers},
title = {Efficient evaluation of specific queries in constraint databases},
journal = {Inf. Process. Lett.},
volume = {111},
number = {19},
pages = {941--944},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.06.015},
doi = {10.1016/J.IPL.2011.06.015},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GrimsonHK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuLY11,
author = {Xiaofeng Gu and
Hong{-}Jian Lai and
Senmei Yao},
title = {Characterization of minimally (2, \emph{l})-connected graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {23-24},
pages = {1124--1129},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.09.012},
doi = {10.1016/J.IPL.2011.09.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuLY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuptaNG11,
author = {Kishan Chand Gupta and
Yassir Nawaz and
Guang Gong},
title = {Upper bound for algebraic immunity on a subclass of Maiorana McFarland
class of bent functions},
journal = {Inf. Process. Lett.},
volume = {111},
number = {5},
pages = {247--249},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.10.013},
doi = {10.1016/J.IPL.2010.10.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuptaNG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HanLY11,
author = {Xixian Han and
Jianzhong Li and
Donghua Yang},
title = {Supporting early pruning in top-k query processing on massive data},
journal = {Inf. Process. Lett.},
volume = {111},
number = {11},
pages = {524--532},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.003},
doi = {10.1016/J.IPL.2011.03.003},
timestamp = {Sat, 29 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HanLY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HanamuraI11,
author = {Satoshi Hanamura and
Shigeki Iwata},
title = {Posets with seven linear extensions sortable by three comparisons},
journal = {Inf. Process. Lett.},
volume = {111},
number = {8},
pages = {365--369},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.01.004},
doi = {10.1016/J.IPL.2011.01.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HanamuraI11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HerranzLR11,
author = {Javier Herranz and
Fabien Laguillaumie and
Carla R{\`{a}}fols},
title = {Relations between semantic security and anonymity in identity-based
encryption},
journal = {Inf. Process. Lett.},
volume = {111},
number = {10},
pages = {453--460},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.02.002},
doi = {10.1016/J.IPL.2011.02.002},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HerranzLR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hocquard11,
author = {Herv{\'{e}} Hocquard},
title = {Graphs with maximum degree 6 are acyclically 11-colorable},
journal = {Inf. Process. Lett.},
volume = {111},
number = {15},
pages = {748--753},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.005},
doi = {10.1016/J.IPL.2011.05.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hocquard11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HonmaAM11,
author = {Hirotoshi Honma and
Kodai Abe and
Shigeru Masuyama},
title = {Erratum and addendum to "A linear time algorithm for finding all hinge
vertices of a permutation graph" [Information Processing Letters 59
{(2)} {(1996)} 103-107]},
journal = {Inf. Process. Lett.},
volume = {111},
number = {18},
pages = {891--894},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.01.014},
doi = {10.1016/J.IPL.2011.01.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HonmaAM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HouRW11,
author = {Jianfeng Hou and
Nicolas Roussel and
Jianliang Wu},
title = {Acyclic chromatic index of planar graphs with triangles},
journal = {Inf. Process. Lett.},
volume = {111},
number = {17},
pages = {836--840},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.023},
doi = {10.1016/J.IPL.2011.05.023},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HouRW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JagerP11,
author = {Gerold J{\"{a}}ger and
Marcin Peczarski},
title = {The number of pessimistic guesses in Generalized Black-peg Mastermind},
journal = {Inf. Process. Lett.},
volume = {111},
number = {19},
pages = {933--940},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.06.009},
doi = {10.1016/J.IPL.2011.06.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JagerP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JansenS11,
author = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {A simple {OPT+1} algorithm for cutting stock under the modified integer
round-up property assumption},
journal = {Inf. Process. Lett.},
volume = {111},
number = {10},
pages = {479--482},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.02.009},
doi = {10.1016/J.IPL.2011.02.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JansenS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jiang11,
author = {Jehn{-}Ruey Jiang},
title = {Nondominated local coteries for resource allocation in grids and clouds},
journal = {Inf. Process. Lett.},
volume = {111},
number = {8},
pages = {379--384},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.01.008},
doi = {10.1016/J.IPL.2011.01.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jiang11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JungCC11,
author = {Jae{-}Yoon Jung and
Chang{-}Ho Chin and
Jorge Cardoso},
title = {An entropy-based uncertainty measure of process models},
journal = {Inf. Process. Lett.},
volume = {111},
number = {3},
pages = {135--141},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.10.022},
doi = {10.1016/J.IPL.2010.10.022},
timestamp = {Thu, 03 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/JungCC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Junosza-SzaniawskiR11,
author = {Konstanty Junosza{-}Szaniawski and
Pawel Rzazewski},
title = {On the complexity of exact algorithm for L(2, 1)-labeling of graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {14},
pages = {697--701},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.04.010},
doi = {10.1016/J.IPL.2011.04.010},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Junosza-SzaniawskiR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KatrenicS11,
author = {J{\'{a}}n Katrenic and
Ingo Schiermeyer},
title = {Improved approximation bounds for the minimum rainbow subgraph problem},
journal = {Inf. Process. Lett.},
volume = {111},
number = {3},
pages = {110--114},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.005},
doi = {10.1016/J.IPL.2010.11.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KatrenicS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KatzM11,
author = {Matthew J. Katz and
Gila Morgenstern},
title = {Settling the bound on the rectilinear link radius of a simple rectilinear
polygon},
journal = {Inf. Process. Lett.},
volume = {111},
number = {3},
pages = {103--106},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.007},
doi = {10.1016/J.IPL.2010.11.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KatzM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ketema11,
author = {Jeroen Ketema},
title = {Counterexamples in infinitary rewriting with non-fully-extended rules},
journal = {Inf. Process. Lett.},
volume = {111},
number = {13},
pages = {642--646},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.04.001},
doi = {10.1016/J.IPL.2011.04.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ketema11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KimC11,
author = {Heeheon Kim and
Yookun Cho},
title = {A new fair scheduling algorithm for periodic tasks on multiprocessors},
journal = {Inf. Process. Lett.},
volume = {111},
number = {7},
pages = {301--309},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.12.007},
doi = {10.1016/J.IPL.2010.12.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KimC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KirstenQ11,
author = {Daniel Kirsten and
Karin Quaas},
title = {Recognizability of the support of recognizable series over the semiring
of the integers is undecidable},
journal = {Inf. Process. Lett.},
volume = {111},
number = {10},
pages = {500--502},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.02.014},
doi = {10.1016/J.IPL.2011.02.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KirstenQ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KocholKSS11,
author = {Martin Kochol and
Nad'a Krivon{\'{a}}kov{\'{a}} and
Silvia Smejov{\'{a}} and
Katar{\'{\i}}na Srankov{\'{a}}},
title = {Matrix reduction in a combinatorial computation},
journal = {Inf. Process. Lett.},
volume = {111},
number = {4},
pages = {164--168},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.008},
doi = {10.1016/J.IPL.2010.11.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KocholKSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KoukouvinosPSZ11,
author = {Christos Koukouvinos and
Veronika Pillwein and
Dimitris E. Simos and
Zafeirakis Zafeirakopoulos},
title = {On the average complexity for the verification of compatible sequences},
journal = {Inf. Process. Lett.},
volume = {111},
number = {17},
pages = {825--830},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.015},
doi = {10.1016/J.IPL.2011.05.015},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KoukouvinosPSZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KrumkeT11,
author = {Sven Oliver Krumke and
Clemens Thielen},
title = {Minimum cost flows with minimum quantities},
journal = {Inf. Process. Lett.},
volume = {111},
number = {11},
pages = {533--537},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.007},
doi = {10.1016/J.IPL.2011.03.007},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KrumkeT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kshemkalyani11,
author = {Ajay D. Kshemkalyani},
title = {Repeated detection of conjunctive predicates in distributed executions},
journal = {Inf. Process. Lett.},
volume = {111},
number = {9},
pages = {447--452},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.01.016},
doi = {10.1016/J.IPL.2011.01.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kshemkalyani11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KulichK11,
author = {Tom{\'{a}}s Kulich and
Miroslava Kemenov{\'{a}}},
title = {On the paper of Pascal Schweitzer concerning similarities between
incompressibility methods and the Lov{\'{a}}sz Local Lemma},
journal = {Inf. Process. Lett.},
volume = {111},
number = {9},
pages = {436--439},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.01.013},
doi = {10.1016/J.IPL.2011.01.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KulichK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LaiLLLY11,
author = {Hong{-}Jian Lai and
Hao Li and
Ping Li and
Yanting Liang and
Senmei Yao},
title = {Mod (2p+1)-orientations in line graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {23-24},
pages = {1085--1088},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.09.005},
doi = {10.1016/J.IPL.2011.09.005},
timestamp = {Thu, 28 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LaiLLLY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lampis11,
author = {Michael Lampis},
title = {A kernel of order 2 k-c log k for vertex cover},
journal = {Inf. Process. Lett.},
volume = {111},
number = {23-24},
pages = {1089--1091},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.09.003},
doi = {10.1016/J.IPL.2011.09.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lampis11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lange11,
author = {Martin Lange},
title = {P-hardness of the emptiness problem for visibly pushdown languages},
journal = {Inf. Process. Lett.},
volume = {111},
number = {7},
pages = {338--341},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.12.013},
doi = {10.1016/J.IPL.2010.12.013},
timestamp = {Tue, 09 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Lange11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeT11,
author = {Van Bang Le and
Nguyen Ngoc Tuy},
title = {A good characterization of squares of strongly chordal split graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {3},
pages = {120--123},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.003},
doi = {10.1016/J.IPL.2010.11.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeNP11,
author = {Taehyung Lee and
Joong Chae Na and
Kunsoo Park},
title = {On-line construction of parameterized suffix trees for large alphabets},
journal = {Inf. Process. Lett.},
volume = {111},
number = {5},
pages = {201--207},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.017},
doi = {10.1016/J.IPL.2010.11.017},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeeNP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiCL11,
author = {Yin Li and
Gongliang Chen and
Jianhua Li},
title = {Speedup of bit-parallel Karatsuba multiplier in GF(2\({}^{\mbox{m}}\))
generated by trinomials},
journal = {Inf. Process. Lett.},
volume = {111},
number = {8},
pages = {390--394},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.01.005},
doi = {10.1016/J.IPL.2011.01.005},
timestamp = {Sun, 03 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiCL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiRS11,
author = {Xiaozhou Li and
Atri Rudra and
Ram Swaminathan},
title = {Flexible coloring},
journal = {Inf. Process. Lett.},
volume = {111},
number = {11},
pages = {538--540},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.004},
doi = {10.1016/J.IPL.2011.03.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiSLY11,
author = {Ruilin Li and
Bing Sun and
Chao Li and
Jianxiong You},
title = {Differential Fault Analysis on {SMS4} using a single fault},
journal = {Inf. Process. Lett.},
volume = {111},
number = {4},
pages = {156--163},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.011},
doi = {10.1016/J.IPL.2010.11.011},
timestamp = {Fri, 26 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiSLY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiTWS11,
author = {Mengshi Li and
W. J. Tang and
Q. H. Wu and
Jon R. Saunders},
title = {Paired-bacteria optimiser - {A} simple and fast algorithm},
journal = {Inf. Process. Lett.},
volume = {111},
number = {16},
pages = {809--813},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.011},
doi = {10.1016/J.IPL.2011.05.011},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiTWS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiWL11,
author = {Jing Li and
Shiying Wang and
Di Liu},
title = {Pancyclicity of ternary n-cube networks under the conditional fault
model},
journal = {Inf. Process. Lett.},
volume = {111},
number = {8},
pages = {370--374},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.01.009},
doi = {10.1016/J.IPL.2011.01.009},
timestamp = {Fri, 09 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiWL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiY11,
author = {Wenhua Li and
Jinjiang Yuan},
title = {Online scheduling on unbounded parallel-batch machines to minimize
maximum flow-time},
journal = {Inf. Process. Lett.},
volume = {111},
number = {18},
pages = {907--911},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.06.008},
doi = {10.1016/J.IPL.2011.06.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiYF11,
author = {Shisheng Li and
Jinjiang Yuan and
Baoqiang Fan},
title = {Unbounded parallel-batch scheduling with family jobs and delivery
coordination},
journal = {Inf. Process. Lett.},
volume = {111},
number = {12},
pages = {575--582},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.014},
doi = {10.1016/J.IPL.2011.03.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiYF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiangS11,
author = {Zuosong Liang and
Erfang Shan},
title = {Approximation algorithms for clique-transversal sets and clique-independent
sets in cubic graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {23-24},
pages = {1104--1107},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.09.007},
doi = {10.1016/J.IPL.2011.09.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiangS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinH11,
author = {Bertrand M. T. Lin and
F. J. Hwang},
title = {Total completion time minimization in a 2-stage differentiation flowshop
with fixed sequences per job type},
journal = {Inf. Process. Lett.},
volume = {111},
number = {5},
pages = {208--212},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.021},
doi = {10.1016/J.IPL.2010.11.021},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LinH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinHH11,
author = {Han{-}Yu Lin and
Chien{-}Lung Hsu and
Shih{-}Kun Huang},
title = {Improved convertible authenticated encryption scheme with provable
security},
journal = {Inf. Process. Lett.},
volume = {111},
number = {13},
pages = {661--666},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.021},
doi = {10.1016/J.IPL.2011.03.021},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LinHH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LouST11,
author = {Tiancheng Lou and
Xiaoming Sun and
Christophe Tartary},
title = {Bounds and trade-offs for Double-Base Number Systems},
journal = {Inf. Process. Lett.},
volume = {111},
number = {10},
pages = {488--493},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.02.008},
doi = {10.1016/J.IPL.2011.02.008},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LouST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LucarelliM11,
author = {Giorgio Lucarelli and
Ioannis Milis},
title = {Improved approximation algorithms for the Max Edge-Coloring problem},
journal = {Inf. Process. Lett.},
volume = {111},
number = {16},
pages = {819--823},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.019},
doi = {10.1016/J.IPL.2011.05.019},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LucarelliM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MaZ11,
author = {Meijie Ma and
Liying Zhu},
title = {The super connectivity of exchanged hypercubes},
journal = {Inf. Process. Lett.},
volume = {111},
number = {8},
pages = {360--364},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.01.006},
doi = {10.1016/J.IPL.2011.01.006},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MaZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MaheshwariSZ11,
author = {Anil Maheshwari and
Michiel H. M. Smid and
Norbert Zeh},
title = {Low-interference networks in metric spaces of bounded doubling dimension},
journal = {Inf. Process. Lett.},
volume = {111},
number = {23-24},
pages = {1120--1123},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.09.013},
doi = {10.1016/J.IPL.2011.09.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MaheshwariSZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MahmoodK11,
author = {Sajjad Mahmood and
Azhar Khan},
title = {An industrial study on the importance of software component documentation:
{A} system integrator's perspective},
journal = {Inf. Process. Lett.},
volume = {111},
number = {12},
pages = {583--590},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.012},
doi = {10.1016/J.IPL.2011.03.012},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MahmoodK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MalekimajdFMS11,
author = {Marzieh Malekimajd and
Mohammad Reza Hoseiny Farahabady and
Ali Movaghar and
Hamid Sarbazi{-}Azad},
title = {Pancyclicity of {OTIS} (swapped) networks based on properties of the
factor graph},
journal = {Inf. Process. Lett.},
volume = {111},
number = {23-24},
pages = {1114--1119},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.020},
doi = {10.1016/J.IPL.2011.07.020},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MalekimajdFMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MalvestutoMM11,
author = {Francesco M. Malvestuto and
Mauro Mezzini and
Marina Moscarini},
title = {Computing simple-path convex hulls in hypergraphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {5},
pages = {231--234},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.026},
doi = {10.1016/J.IPL.2010.11.026},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MalvestutoMM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MansourNV11,
author = {Toufik Mansour and
Ghalib Nassar and
Vincent Vajnovszki},
title = {Loop-free Gray code algorithm for the e-restricted growth functions},
journal = {Inf. Process. Lett.},
volume = {111},
number = {11},
pages = {541--544},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.006},
doi = {10.1016/J.IPL.2011.03.006},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MansourNV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Martin11,
author = {Barnaby Martin},
title = {Low-level dichotomy for quantified constraint satisfaction problems},
journal = {Inf. Process. Lett.},
volume = {111},
number = {20},
pages = {999--1003},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.010},
doi = {10.1016/J.IPL.2011.07.010},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Martin11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Martinez-GarciaNB11,
author = {Carles Mart{\'{\i}}nez{-}Garc{\'{\i}}a and
Guillermo Navarro{-}Arribas and
Joan Borrell},
title = {Fuzzy Role-Based Access Control},
journal = {Inf. Process. Lett.},
volume = {111},
number = {10},
pages = {483--487},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.02.010},
doi = {10.1016/J.IPL.2011.02.010},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Martinez-GarciaNB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MatsumotoKI11,
author = {Yusuke Matsumoto and
Naoyuki Kamiyama and
Keiko Imai},
title = {An approximation algorithm dependent on edge-coloring number for minimum
maximal matching problem},
journal = {Inf. Process. Lett.},
volume = {111},
number = {10},
pages = {465--468},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.02.006},
doi = {10.1016/J.IPL.2011.02.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MatsumotoKI11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MiaoZC11,
author = {Cuixia Miao and
Yuzhong Zhang and
Zhigang Cao},
title = {Bounded parallel-batch scheduling on single and multi machines for
deteriorating jobs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {16},
pages = {798--803},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.018},
doi = {10.1016/J.IPL.2011.05.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MiaoZC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MinLW11,
author = {Xiao Min and
Jing Liu and
Yuqing Wang},
title = {Optimal semi-online algorithms for scheduling problems with reassignment
on two identical machines},
journal = {Inf. Process. Lett.},
volume = {111},
number = {9},
pages = {423--428},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.01.002},
doi = {10.1016/J.IPL.2011.01.002},
timestamp = {Wed, 05 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MinLW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Minh11,
author = {Ha Quang Minh},
title = {The regularized least squares algorithm and the problem of learning
halfspaces},
journal = {Inf. Process. Lett.},
volume = {111},
number = {8},
pages = {395--401},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.01.011},
doi = {10.1016/J.IPL.2011.01.011},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Minh11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MonroyHL11,
author = {Ruy Fabila Monroy and
Clemens Huemer and
Dolores Lara},
title = {A combinatorial property on angular orders of plane point sets},
journal = {Inf. Process. Lett.},
volume = {111},
number = {12},
pages = {591--594},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.009},
doi = {10.1016/J.IPL.2011.03.009},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MonroyHL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Moody11,
author = {Dustin Moody},
title = {Using 5-isogenies to quintuple points on elliptic curves},
journal = {Inf. Process. Lett.},
volume = {111},
number = {7},
pages = {314--317},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.12.014},
doi = {10.1016/J.IPL.2010.12.014},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Moody11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Morizumi11,
author = {Hiroki Morizumi},
title = {Improved approximation algorithms for minimum AND-circuits problem
via k-set cover},
journal = {Inf. Process. Lett.},
volume = {111},
number = {5},
pages = {218--221},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.019},
doi = {10.1016/J.IPL.2010.11.019},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Morizumi11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Moser11,
author = {Philippe Moser},
title = {A zero-one SUBEXP-dimension law for {BPP}},
journal = {Inf. Process. Lett.},
volume = {111},
number = {9},
pages = {429--432},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.01.019},
doi = {10.1016/J.IPL.2011.01.019},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Moser11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mosheiov11,
author = {Gur Mosheiov},
title = {Proportionate flowshops with general position-dependent processing
times},
journal = {Inf. Process. Lett.},
volume = {111},
number = {4},
pages = {174--177},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.016},
doi = {10.1016/J.IPL.2010.11.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mosheiov11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NarayanaswamyS11,
author = {N. S. Narayanaswamy and
C. R. Subramanian},
title = {Dominating set based exact algorithms for 3-coloring},
journal = {Inf. Process. Lett.},
volume = {111},
number = {6},
pages = {251--255},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.009},
doi = {10.1016/J.IPL.2010.11.009},
timestamp = {Tue, 14 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/NarayanaswamyS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Nose11,
author = {Peter Nose},
title = {Security weaknesses of authenticated key agreement protocols},
journal = {Inf. Process. Lett.},
volume = {111},
number = {14},
pages = {687--696},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.04.007},
doi = {10.1016/J.IPL.2011.04.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Nose11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Oanea11,
author = {Olivia Oanea},
title = {Boundedness of adaptive nets is decidable},
journal = {Inf. Process. Lett.},
volume = {111},
number = {15},
pages = {738--743},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.004},
doi = {10.1016/J.IPL.2011.05.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Oanea11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Oron11,
author = {Daniel Oron},
title = {Scheduling a batching machine with convex resource consumption functions},
journal = {Inf. Process. Lett.},
volume = {111},
number = {19},
pages = {962--967},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.005},
doi = {10.1016/J.IPL.2011.07.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Oron11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/OrtinG11,
author = {Francisco Ortin and
Miguel Garc{\'{\i}}a},
title = {Union and intersection types to support both dynamic and static typing},
journal = {Inf. Process. Lett.},
volume = {111},
number = {6},
pages = {278--286},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.12.006},
doi = {10.1016/J.IPL.2010.12.006},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/OrtinG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Park11,
author = {Moonju Park},
title = {Comments on "Generalized rate monotonic schedulability bounds using
relative period ratios"},
journal = {Inf. Process. Lett.},
volume = {111},
number = {7},
pages = {334--337},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.12.015},
doi = {10.1016/J.IPL.2010.12.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Park11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PengYTH11,
author = {Yung{-}Hsing Peng and
Chang{-}Biau Yang and
Chiou{-}Ting Tseng and
Chiou{-}Yi Hor},
title = {The indexing for one-dimensional proportionally-scaled strings},
journal = {Inf. Process. Lett.},
volume = {111},
number = {7},
pages = {318--322},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.12.001},
doi = {10.1016/J.IPL.2010.12.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PengYTH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PolicritiT11,
author = {Alberto Policriti and
Alexandru I. Tomescu},
title = {Counting extensional acyclic digraphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {16},
pages = {787--791},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.014},
doi = {10.1016/J.IPL.2011.05.014},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PolicritiT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Puente11,
author = {V{\'{\i}}ctor Lav{\'{\i}}n Puente},
title = {Learning a subclass of k-quasi-Horn formulas with membership queries},
journal = {Inf. Process. Lett.},
volume = {111},
number = {11},
pages = {550--555},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.008},
doi = {10.1016/J.IPL.2011.03.008},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Puente11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PuenteH11,
author = {V{\'{\i}}ctor Lav{\'{\i}}n Puente and
Montserrat Hermo},
title = {Negative results on learning multivalued dependencies with queries},
journal = {Inf. Process. Lett.},
volume = {111},
number = {19},
pages = {968--972},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.007},
doi = {10.1016/J.IPL.2011.07.007},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PuenteH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RampersadSW11,
author = {Narad Rampersad and
Jeffrey O. Shallit and
Ming{-}wei Wang},
title = {Inverse star, borders, and palstars},
journal = {Inf. Process. Lett.},
volume = {111},
number = {9},
pages = {420--422},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.01.018},
doi = {10.1016/J.IPL.2011.01.018},
timestamp = {Mon, 09 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/RampersadSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Roman11,
author = {Adam Roman},
title = {The NP-completeness of the Road Coloring Problem},
journal = {Inf. Process. Lett.},
volume = {111},
number = {7},
pages = {342--347},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.12.016},
doi = {10.1016/J.IPL.2010.12.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Roman11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sandeep11,
author = {R. B. Sandeep},
title = {Perfectly colorable graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {19},
pages = {960--961},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.001},
doi = {10.1016/J.IPL.2011.07.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sandeep11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sarkar11,
author = {Palash Sarkar},
title = {Tweakable enciphering schemes using only the encryption function of
a block cipher},
journal = {Inf. Process. Lett.},
volume = {111},
number = {19},
pages = {945--955},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.06.014},
doi = {10.1016/J.IPL.2011.06.014},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sarkar11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SasoKN11,
author = {Takashi Saso and
Kojiro Kobayashi and
Atsuyoshi Nakamura},
title = {On the possible patterns of inputs for block sorting in the Burrows-Wheeler
transformation},
journal = {Inf. Process. Lett.},
volume = {111},
number = {12},
pages = {595--599},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.010},
doi = {10.1016/J.IPL.2011.03.010},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SasoKN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Schmidt-SchaussSM11,
author = {Manfred Schmidt{-}Schau{\ss} and
David Sabel and
Elena Machkasova},
title = {Counterexamples to applicative simulation and extensionality in non-deterministic
call-by-need lambda-calculi with letrec},
journal = {Inf. Process. Lett.},
volume = {111},
number = {14},
pages = {711--716},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.04.011},
doi = {10.1016/J.IPL.2011.04.011},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Schmidt-SchaussSM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SeidlR11,
author = {Helmut Seidl and
Andreas Reu{\ss}},
title = {Extending H\({}_{\mbox{1}}\)-clauses with disequalities},
journal = {Inf. Process. Lett.},
volume = {111},
number = {20},
pages = {1007--1013},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.011},
doi = {10.1016/J.IPL.2011.07.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SeidlR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShafieiHMS11,
author = {T. Shafiei and
Mohammad Reza Hoseiny Farahabady and
Ali Movaghar and
Hamid Sarbazi{-}Azad},
title = {On pancyclicity properties of OTIS-mesh},
journal = {Inf. Process. Lett.},
volume = {111},
number = {8},
pages = {353--359},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.027},
doi = {10.1016/J.IPL.2010.11.027},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ShafieiHMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShiNL11,
author = {Haizhong Shi and
Pan{-}feng Niu and
Jian{-}bo Lu},
title = {One conjecture of bubble-sort graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {18},
pages = {926--929},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.06.005},
doi = {10.1016/J.IPL.2011.06.005},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ShiNL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sung11,
author = {Jaechul Sung},
title = {Differential cryptanalysis of eight-round {SEED}},
journal = {Inf. Process. Lett.},
volume = {111},
number = {10},
pages = {474--478},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.02.004},
doi = {10.1016/J.IPL.2011.02.004},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Sung11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TaheriNN11,
author = {Hoda Taheri and
Peyman Neamatollahi and
Mahmoud Naghibzadeh},
title = {A hybrid token-based distributed mutual exclusion algorithm using
wraparound two-dimensional array logical topology},
journal = {Inf. Process. Lett.},
volume = {111},
number = {17},
pages = {841--847},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.021},
doi = {10.1016/J.IPL.2011.05.021},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TaheriNN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TangC11,
author = {Qiang Tang and
Liqun Chen},
title = {Extended {KCI} attack against two-party key establishment protocols},
journal = {Inf. Process. Lett.},
volume = {111},
number = {15},
pages = {744--747},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.009},
doi = {10.1016/J.IPL.2011.05.009},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TangC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TangXQ11,
author = {Chunming Tang and
Maozhi Xu and
Yanfeng Qi},
title = {Faster pairing computation on genus 2 hyperelliptic curves},
journal = {Inf. Process. Lett.},
volume = {111},
number = {10},
pages = {494--499},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.02.011},
doi = {10.1016/J.IPL.2011.02.011},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/TangXQ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ThomasianX11,
author = {Alexander Thomasian and
Jun Xu},
title = {X-code double parity array operation with two disk failures},
journal = {Inf. Process. Lett.},
volume = {111},
number = {12},
pages = {568--574},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.001},
doi = {10.1016/J.IPL.2011.03.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ThomasianX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TianFY11,
author = {Ji Tian and
Ruyan Fu and
Jinjiang Yuan},
title = {An on-line algorithm for the single machine unbounded parallel-batching
scheduling with large delivery times},
journal = {Inf. Process. Lett.},
volume = {111},
number = {21-22},
pages = {1048--1053},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.08.003},
doi = {10.1016/J.IPL.2011.08.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TianFY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsai11,
author = {Ping{-}Ying Tsai},
title = {A note on an optimal result on fault-tolerant cycle-embedding in alternating
group graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {8},
pages = {375--378},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.01.007},
doi = {10.1016/J.IPL.2011.01.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tsai11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TuZ11,
author = {Jianhua Tu and
Wenli Zhou},
title = {A factor 2 approximation algorithm for the vertex cover P\({}_{\mbox{3}}\)
problem},
journal = {Inf. Process. Lett.},
volume = {111},
number = {14},
pages = {683--686},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.04.009},
doi = {10.1016/J.IPL.2011.04.009},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TuZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VajnovszkiV11,
author = {Vincent Vajnovszki and
R{\'{e}}mi Vernay},
title = {Restricted compositions and permutations: From old to new Gray codes},
journal = {Inf. Process. Lett.},
volume = {111},
number = {13},
pages = {650--655},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.022},
doi = {10.1016/J.IPL.2011.03.022},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/VajnovszkiV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Virza11,
author = {Madars Virza},
title = {Sensitivity versus block sensitivity of Boolean functions},
journal = {Inf. Process. Lett.},
volume = {111},
number = {9},
pages = {433--435},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.02.001},
doi = {10.1016/J.IPL.2011.02.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Virza11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Vygen11,
author = {Jens Vygen},
title = {Faster algorithm for optimum Steiner trees},
journal = {Inf. Process. Lett.},
volume = {111},
number = {21-22},
pages = {1075--1079},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.08.005},
doi = {10.1016/J.IPL.2011.08.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Vygen11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangD11,
author = {Yongge Wang and
Yvo Desmedt},
title = {Edge-colored graphs with applications to homogeneous faults},
journal = {Inf. Process. Lett.},
volume = {111},
number = {13},
pages = {634--641},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.017},
doi = {10.1016/J.IPL.2011.03.017},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/WangD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangL11,
author = {Feng Wang and
Wensong Lin},
title = {Group path covering and distance two labeling of graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {13},
pages = {621--625},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.016},
doi = {10.1016/J.IPL.2011.03.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangL11a,
author = {Bo{-}Yi Wang and
Hsueh{-}I Lu},
title = {Two-dimensional homing sort},
journal = {Inf. Process. Lett.},
volume = {111},
number = {21-22},
pages = {1067--1071},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.021},
doi = {10.1016/J.IPL.2011.07.021},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangL11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangW11,
author = {Bing Wang and
Jianliang Wu},
title = {Total coloring of planar graphs with maximum degree 7},
journal = {Inf. Process. Lett.},
volume = {111},
number = {20},
pages = {1019--1021},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.012},
doi = {10.1016/J.IPL.2011.07.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangWYY11,
author = {Xu An Wang and
Jian Weng and
Xiaoyuan Yang and
Yanjiang Yang},
title = {Cryptanalysis of an identity based broadcast encryption scheme without
random oracles},
journal = {Inf. Process. Lett.},
volume = {111},
number = {10},
pages = {461--464},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.02.007},
doi = {10.1016/J.IPL.2011.02.007},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/WangWYY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WeimannP11,
author = {Oren Weimann and
David Peleg},
title = {A note on exact distance labeling},
journal = {Inf. Process. Lett.},
volume = {111},
number = {14},
pages = {671--673},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.04.006},
doi = {10.1016/J.IPL.2011.04.006},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/WeimannP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WuCW11,
author = {Chih{-}Jen Wu and
Yu{-}Wei Chen and
Yue{-}Li Wang},
title = {The minimum bandwidth required at each time slot of the fast broadcasting
scheme},
journal = {Inf. Process. Lett.},
volume = {111},
number = {20},
pages = {1014--1018},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.013},
doi = {10.1016/J.IPL.2011.07.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WuCW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WuLW11,
author = {Qian Wu and
Qiuli Lu and
Yingqian Wang},
title = {({\(\Delta\)}+1)-total-colorability of plane graphs of maximum degree
{\(\Delta\)}{\(\geq\)}6 with neither chordal 5-cycle nor chordal 6-cycle},
journal = {Inf. Process. Lett.},
volume = {111},
number = {15},
pages = {767--772},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.006},
doi = {10.1016/J.IPL.2011.05.006},
timestamp = {Fri, 21 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WuLW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Xu11,
author = {Yian Xu},
title = {On acyclic edge coloring of toroidal graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {13},
pages = {647--649},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.04.003},
doi = {10.1016/J.IPL.2011.04.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Xu11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XuCYZ11,
author = {Haifeng Xu and
Lin Chen and
Deshi Ye and
Guochuan Zhang},
title = {Scheduling on two identical machines with a speed-up resource},
journal = {Inf. Process. Lett.},
volume = {111},
number = {17},
pages = {831--835},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.022},
doi = {10.1016/J.IPL.2011.05.022},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/XuCYZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XuGX11,
author = {XueLin Xu and
Zongsheng Gao and
Ke Xu},
title = {A tighter upper bound for random {MAX} 2-SAT},
journal = {Inf. Process. Lett.},
volume = {111},
number = {3},
pages = {115--119},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.002},
doi = {10.1016/J.IPL.2010.11.002},
timestamp = {Thu, 01 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/XuGX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XuMLL11,
author = {Zhenpeng Xu and
Chaoguang Men and
Weiwei Li and
Xiang Li},
title = {Checkpoint scheduling model for optimality},
journal = {Inf. Process. Lett.},
volume = {111},
number = {19},
pages = {979--984},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.009},
doi = {10.1016/J.IPL.2011.07.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/XuMLL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YanC11,
author = {Li Yan and
Marek Chrobak},
title = {Approximation algorithms for the Fault-Tolerant Facility Placement
problem},
journal = {Inf. Process. Lett.},
volume = {111},
number = {11},
pages = {545--549},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.005},
doi = {10.1016/J.IPL.2011.03.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YanC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YanWC11,
author = {Guofeng Yan and
Jianxin Wang and
Shuhong Chen},
title = {Performance analysis for (X, S)-bottleneck cell in large-scale wireless
networks},
journal = {Inf. Process. Lett.},
volume = {111},
number = {6},
pages = {269--277},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.12.004},
doi = {10.1016/J.IPL.2010.12.004},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YanWC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangL11,
author = {Fan Yang and
Xiangwen Li},
title = {Nowhere-zero 3-flows in dihedral Cayley graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {9},
pages = {416--419},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.01.017},
doi = {10.1016/J.IPL.2011.01.017},
timestamp = {Tue, 26 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YangL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangYDL11,
author = {Erjie Yang and
Xiaofan Yang and
Qiang Dong and
Jing Li},
title = {Conditional diagnosability of hypermeshes under the comparison model},
journal = {Inf. Process. Lett.},
volume = {111},
number = {4},
pages = {188--193},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.014},
doi = {10.1016/J.IPL.2010.11.014},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YangYDL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YaoBC11,
author = {Erlin Yao and
Yungang Bao and
Mingyu Chen},
title = {What Hill-Marty model learn from and break through Amdahl's law?},
journal = {Inf. Process. Lett.},
volume = {111},
number = {23-24},
pages = {1092--1095},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.09.009},
doi = {10.1016/J.IPL.2011.09.009},
timestamp = {Mon, 11 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YaoBC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YiCL11,
author = {Chenfu Yi and
Yuhuan Chen and
Zhongliang Lu},
title = {Improved gradient-based neural networks for online solution of Lyapunov
matrix equation},
journal = {Inf. Process. Lett.},
volume = {111},
number = {16},
pages = {780--786},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.010},
doi = {10.1016/J.IPL.2011.05.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YiCL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YuanK11,
author = {Chen Yuan and
Haibin Kan},
title = {Holographic reduction for some counting problems},
journal = {Inf. Process. Lett.},
volume = {111},
number = {15},
pages = {761--766},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.012},
doi = {10.1016/J.IPL.2011.05.012},
timestamp = {Sat, 25 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YuanK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YumL11,
author = {Dae Hyun Yum and
Pil Joong Lee},
title = {On the average cost of order-preserving encryption based on hypergeometric
distribution},
journal = {Inf. Process. Lett.},
volume = {111},
number = {19},
pages = {956--959},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.004},
doi = {10.1016/J.IPL.2011.07.004},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YumL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Yuster11,
author = {Raphael Yuster},
title = {A shortest cycle for each vertex of a graph},
journal = {Inf. Process. Lett.},
volume = {111},
number = {21-22},
pages = {1057--1061},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.019},
doi = {10.1016/J.IPL.2011.07.019},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Yuster11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zalinescu11,
author = {Eugen Zalinescu},
title = {Shorter strings containing all k-element permutations},
journal = {Inf. Process. Lett.},
volume = {111},
number = {12},
pages = {605--608},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.018},
doi = {10.1016/J.IPL.2011.03.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zalinescu11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zelke11,
author = {Mariano Zelke},
title = {Intractability of min- and max-cut in streaming graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {3},
pages = {145--150},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.10.017},
doi = {10.1016/J.IPL.2010.10.017},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zelke11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zhang11,
author = {Liyu Zhang},
title = {Proof system representations of degrees of disjoint NP-pairs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {7},
pages = {348--351},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.01.001},
doi = {10.1016/J.IPL.2011.01.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zhang11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangCCTT11,
author = {Yong Zhang and
Zhuo Chang and
Francis Y. L. Chin and
Hing{-}Fung Ting and
Yung H. Tsin},
title = {Uniformly inserting points on square grid},
journal = {Inf. Process. Lett.},
volume = {111},
number = {16},
pages = {773--779},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.001},
doi = {10.1016/J.IPL.2011.05.001},
timestamp = {Thu, 22 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangCCTT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangGL11,
author = {Kejia Zhang and
Hong Gao and
Jianzhong Li},
title = {Finding multiple induced disjoint paths in general graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {20},
pages = {1022--1026},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.016},
doi = {10.1016/J.IPL.2011.07.016},
timestamp = {Mon, 31 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangGL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangL11,
author = {Xia Zhang and
Guizhen Liu},
title = {On edge covering colorings of graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {20},
pages = {1004--1006},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.014},
doi = {10.1016/J.IPL.2011.07.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangLB11,
author = {Jinshan Zhang and
Heng Liang and
Fengshan Bai},
title = {Approximating partition functions of the two-state spin system},
journal = {Inf. Process. Lett.},
volume = {111},
number = {14},
pages = {702--710},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.04.012},
doi = {10.1016/J.IPL.2011.04.012},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhangLB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangPX11,
author = {Guiqing Zhang and
Chung Keung Poon and
Yinfeng Xu},
title = {The ski-rental problem with multiple discount options},
journal = {Inf. Process. Lett.},
volume = {111},
number = {18},
pages = {903--906},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.06.012},
doi = {10.1016/J.IPL.2011.06.012},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhangPX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangW11,
author = {Xin Zhang and
Jianliang Wu},
title = {On edge colorings of 1-planar graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {3},
pages = {124--128},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.001},
doi = {10.1016/J.IPL.2010.11.001},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangXZL11,
author = {Wenming Zhang and
Yinfeng Xu and
Feifeng Zheng and
Ming Liu},
title = {Online algorithms for the general k-search problem},
journal = {Inf. Process. Lett.},
volume = {111},
number = {14},
pages = {678--682},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.04.008},
doi = {10.1016/J.IPL.2011.04.008},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangXZL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangZXL11,
author = {Yong Zhang and
Weiguo Zhang and
Weijun Xu and
Hongyi Li},
title = {A risk-reward model for the on-line leasing of depreciable equipment},
journal = {Inf. Process. Lett.},
volume = {111},
number = {6},
pages = {256--261},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.025},
doi = {10.1016/J.IPL.2010.11.025},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangZXL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhaoZ11,
author = {Chunyan Zhao and
Zhiming Zheng},
title = {Threshold behaviors of a random constraint satisfaction problem with
exact phase transitions},
journal = {Inf. Process. Lett.},
volume = {111},
number = {20},
pages = {985--988},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.006},
doi = {10.1016/J.IPL.2011.07.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhaoZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhouFJZ11,
author = {Wujun Zhou and
Jianxi Fan and
Xiaohua Jia and
Shukui Zhang},
title = {The spined cube: {A} new hypercube variant with smaller diameter},
journal = {Inf. Process. Lett.},
volume = {111},
number = {12},
pages = {561--567},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.011},
doi = {10.1016/J.IPL.2011.03.011},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhouFJZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhouJ11,
author = {Sizhong Zhou and
Jiashang Jiang},
title = {Toughness and (a, b, k)-critical graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {9},
pages = {403--407},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.01.012},
doi = {10.1016/J.IPL.2011.01.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhouJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhouX11,
author = {Shuming Zhou and
Jun{-}Ming Xu},
title = {Conditional fault tolerance of arrangement graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {21-22},
pages = {1037--1043},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.07.017},
doi = {10.1016/J.IPL.2011.07.017},
timestamp = {Wed, 27 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhouX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhuZJ11,
author = {Jianghan Zhu and
Xiaomin Zhu and
Jianqing Jiang},
title = {Improving adaptivity and fairness of processing real-time tasks with
QoS requirements on clusters through dynamic scheduling},
journal = {Inf. Process. Lett.},
volume = {111},
number = {12},
pages = {609--613},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.020},
doi = {10.1016/J.IPL.2011.03.020},
timestamp = {Wed, 12 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhuZJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZongXJZC11,
author = {Yu Zong and
Guandong Xu and
Ping Jin and
Yanchun Zhang and
Enhong Chen},
title = {HC{\_}AB: {A} new heuristic clustering algorithm based on Approximate
Backbone},
journal = {Inf. Process. Lett.},
volume = {111},
number = {17},
pages = {857--863},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.020},
doi = {10.1016/J.IPL.2011.05.020},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZongXJZC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AcetoIS10,
author = {Luca Aceto and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Joshua Sack},
title = {Resource bisimilarity and graded bisimilarity coincide},
journal = {Inf. Process. Lett.},
volume = {111},
number = {2},
pages = {68--76},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.10.019},
doi = {10.1016/J.IPL.2010.10.019},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AcetoIS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Binkele-RaibleFGL10,
author = {Daniel Binkele{-}Raible and
Henning Fernau and
Serge Gaspers and
Mathieu Liedloff},
title = {Exact exponential-time algorithms for finding bicliques},
journal = {Inf. Process. Lett.},
volume = {111},
number = {2},
pages = {64--67},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.10.020},
doi = {10.1016/J.IPL.2010.10.020},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Binkele-RaibleFGL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BuhrmanGM10,
author = {Harry Buhrman and
David Garc{\'{\i}}a{-}Soriano and
Arie Matsliah},
title = {Learning parities in the mistake-bound model},
journal = {Inf. Process. Lett.},
volume = {111},
number = {1},
pages = {16--21},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.10.009},
doi = {10.1016/J.IPL.2010.10.009},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BuhrmanGM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChoiLP10,
author = {Byung{-}Cheon Choi and
Joseph Y.{-}T. Leung and
Michael L. Pinedo},
title = {A note on makespan minimization in proportionate flow shops},
journal = {Inf. Process. Lett.},
volume = {111},
number = {2},
pages = {77--81},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.10.016},
doi = {10.1016/J.IPL.2010.10.016},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChoiLP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Farrag10,
author = {Abdel Aziz Farrag},
title = {Developing fault-tolerant distributed loops},
journal = {Inf. Process. Lett.},
volume = {111},
number = {2},
pages = {97--101},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.10.002},
doi = {10.1016/J.IPL.2010.10.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Farrag10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Havill10,
author = {Jessen T. Havill},
title = {Online malleable job scheduling for m{\textless}=3},
journal = {Inf. Process. Lett.},
volume = {111},
number = {1},
pages = {31--35},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.10.010},
doi = {10.1016/J.IPL.2010.10.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Havill10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LalR10,
author = {Akash Lal and
G. Ramalingam},
title = {Reference count analysis with shallow aliasing},
journal = {Inf. Process. Lett.},
volume = {111},
number = {2},
pages = {57--63},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.003},
doi = {10.1016/J.IPL.2010.08.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LalR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiZJX10,
author = {Chenghua Li and
Xinfang Zhang and
H. Jin and
Wen Xiang},
title = {E-passport {EAC} scheme based on Identity-Based Cryptography},
journal = {Inf. Process. Lett.},
volume = {111},
number = {1},
pages = {26--30},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.10.006},
doi = {10.1016/J.IPL.2010.10.006},
timestamp = {Thu, 21 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiZJX10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LimaPS10,
author = {Juliano B. Lima and
Daniel Panario and
Ricardo M. Campello de Souza},
title = {Public-key encryption based on Chebyshev polynomials over GF(q)},
journal = {Inf. Process. Lett.},
volume = {111},
number = {2},
pages = {51--56},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.10.011},
doi = {10.1016/J.IPL.2010.10.011},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LimaPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinH10,
author = {Chin{-}Yang Lin and
Ting{-}Wei Hou},
title = {An efficient approach to cyclic reference counting based on a coarse-grained
search},
journal = {Inf. Process. Lett.},
volume = {111},
number = {1},
pages = {1--10},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.10.004},
doi = {10.1016/J.IPL.2010.10.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LinH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuoLG10,
author = {Yiyuan Luo and
Xuejia Lai and
Zheng Gong},
title = {Pseudorandomness analysis of the (extended) Lai-Massey scheme},
journal = {Inf. Process. Lett.},
volume = {111},
number = {2},
pages = {90--96},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.10.012},
doi = {10.1016/J.IPL.2010.10.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LuoLG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pallo10,
author = {Jean Marcel Pallo},
title = {Root-restricted Kleenean rotations},
journal = {Inf. Process. Lett.},
volume = {111},
number = {1},
pages = {46--50},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.10.014},
doi = {10.1016/J.IPL.2010.10.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Pallo10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/QianX10,
author = {Haifeng Qian and
Shouhuai Xu},
title = {Non-interactive multisignatures in the plain public-key model with
efficient verification},
journal = {Inf. Process. Lett.},
volume = {111},
number = {2},
pages = {82--89},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.10.015},
doi = {10.1016/J.IPL.2010.10.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/QianX10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SchweitzerS10,
author = {Pascal Schweitzer and
Patrick Schweitzer},
title = {Connecting face hitting sets in planar graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {1},
pages = {11--15},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.10.008},
doi = {10.1016/J.IPL.2010.10.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SchweitzerS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zhang10a,
author = {Chi Zhang},
title = {An improved lower bound on query complexity for quantum {PAC} learning},
journal = {Inf. Process. Lett.},
volume = {111},
number = {1},
pages = {40--45},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.10.007},
doi = {10.1016/J.IPL.2010.10.007},
timestamp = {Wed, 15 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zhang10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangLCM10,
author = {Xindong Zhang and
Juan Liu and
Xing Chen and
Jixiang Meng},
title = {Domination number of Cartesian products of directed cycles},
journal = {Inf. Process. Lett.},
volume = {111},
number = {1},
pages = {36--39},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.10.001},
doi = {10.1016/J.IPL.2010.10.001},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangLCM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhouF10,
author = {Jin{-}Xin Zhou and
Yan{-}Quan Feng},
title = {Super-connected but not super edge-connected graphs},
journal = {Inf. Process. Lett.},
volume = {111},
number = {1},
pages = {22--25},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.10.005},
doi = {10.1016/J.IPL.2010.10.005},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhouF10.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 06:55 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:
