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/ipl110.bht:"
download as .bib file
@article{DBLP:journals/ipl/AbbasiHR10,
author = {Sarmad Abbasi and
Patrick Healy and
Aimal Rextin},
title = {Improving the running time of embedded upward planarity testing},
journal = {Inf. Process. Lett.},
volume = {110},
number = {7},
pages = {274--278},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.02.004},
doi = {10.1016/J.IPL.2010.02.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AbbasiHR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Abu-Khzam10,
author = {Faisal N. Abu{-}Khzam},
title = {An improved kernelization algorithm for r-Set Packing},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {621--624},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.020},
doi = {10.1016/J.IPL.2010.04.020},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Abu-Khzam10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AfratiDG10,
author = {Foto N. Afrati and
Matthew Damigos and
Manolis Gergatsoulis},
title = {Query containment under bag and bag-set semantics},
journal = {Inf. Process. Lett.},
volume = {110},
number = {10},
pages = {360--369},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.02.017},
doi = {10.1016/J.IPL.2010.02.017},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AfratiDG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Akutsu10,
author = {Tatsuya Akutsu},
title = {A bisection algorithm for grammar-based compression of ordered trees},
journal = {Inf. Process. Lett.},
volume = {110},
number = {18-19},
pages = {815--820},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.004},
doi = {10.1016/J.IPL.2010.07.004},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Akutsu10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlonFPT10,
author = {Noga Alon and
Michal Feldman and
Ariel D. Procaccia and
Moshe Tennenholtz},
title = {A note on competitive diffusion through social networks},
journal = {Inf. Process. Lett.},
volume = {110},
number = {6},
pages = {221--225},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.12.009},
doi = {10.1016/J.IPL.2009.12.009},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlonFPT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Amano10,
author = {Shun'ichi Amano},
title = {On the coNP hardness of computing certain answers over locally specified
incomplete DOM-trees},
journal = {Inf. Process. Lett.},
volume = {110},
number = {17},
pages = {753--756},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.06.001},
doi = {10.1016/J.IPL.2010.06.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Amano10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AmtoftACHL10,
author = {Torben Amtoft and
Kelly Androutsopoulos and
David Clark and
Mark Harman and
Zheng Li},
title = {An alternative characterization of weak order dependence},
journal = {Inf. Process. Lett.},
volume = {110},
number = {21},
pages = {939--943},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.023},
doi = {10.1016/J.IPL.2010.07.023},
timestamp = {Wed, 28 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AmtoftACHL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AnandC10,
author = {Santhanakrishnan Anand and
Rajarathnam Chandramouli},
title = {A network flow based approach for network selection in dynamic spectrum
access networks},
journal = {Inf. Process. Lett.},
volume = {110},
number = {3},
pages = {104--107},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.11.001},
doi = {10.1016/J.IPL.2009.11.001},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AnandC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AndradeMNAC10,
author = {Ermeson C. Andrade and
Paulo Romero Martins Maciel and
Bruno Costa e Silva Nogueira and
Carlos Ara{\'{u}}jo and
Gustavo Rau de Almeida Callou},
title = {A COTS-based approach for estimating performance and energy consumption
of embedded real-time systems},
journal = {Inf. Process. Lett.},
volume = {110},
number = {14-15},
pages = {525--534},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.025},
doi = {10.1016/J.IPL.2010.04.025},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AndradeMNAC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Aravind10,
author = {Alex A. Aravind},
title = {Highly-fair bakery algorithm using symmetric tokens},
journal = {Inf. Process. Lett.},
volume = {110},
number = {23},
pages = {1055--1060},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.09.004},
doi = {10.1016/J.IPL.2010.09.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Aravind10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AsahiroMMY10,
author = {Yuichi Asahiro and
Eiji Miyano and
Shuichi Miyazaki and
Takuro Yoshimuta},
title = {Weighted nearest neighbor algorithms for the graph exploration problem
on cycles},
journal = {Inf. Process. Lett.},
volume = {110},
number = {3},
pages = {93--98},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.10.013},
doi = {10.1016/J.IPL.2009.10.013},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AsahiroMMY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BackerK10,
author = {Jonathan Backer and
J. Mark Keil},
title = {Constant factor approximation algorithms for the densest k-subgraph
problem on proper interval graphs and bipartite permutation graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {635--638},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.011},
doi = {10.1016/J.IPL.2010.05.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BackerK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BaeLC10,
author = {Sang Won Bae and
Chunseok Lee and
Sunghee Choi},
title = {On exact solutions to the Euclidean bottleneck Steiner tree problem},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {672--678},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.014},
doi = {10.1016/J.IPL.2010.05.014},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BaeLC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Baer10,
author = {Michael B. Baer},
title = {Alphabetic coding with exponential costs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {4},
pages = {139--142},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.11.008},
doi = {10.1016/J.IPL.2009.11.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Baer10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BagheriR10,
author = {Alireza Bagheri and
Mohammadreza Razzazi},
title = {Planar straight-line point-set embedding of trees with partial embeddings},
journal = {Inf. Process. Lett.},
volume = {110},
number = {12-13},
pages = {521--523},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.019},
doi = {10.1016/J.IPL.2010.04.019},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BagheriR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BaileyL10,
author = {James Bailey and
Elsa Loekito},
title = {Efficient incremental mining of contrast patterns in changing data},
journal = {Inf. Process. Lett.},
volume = {110},
number = {3},
pages = {88--92},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.10.012},
doi = {10.1016/J.IPL.2009.10.012},
timestamp = {Tue, 16 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BaileyL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BalcerzakN10,
author = {Marcin Balcerzak and
Damian Niwinski},
title = {Two-way deterministic automata with two reversals are exponentially
more succinct than with one reversal},
journal = {Inf. Process. Lett.},
volume = {110},
number = {10},
pages = {396--398},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.03.008},
doi = {10.1016/J.IPL.2010.03.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BalcerzakN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BarilV10,
author = {Jean{-}Luc Baril and
R{\'{e}}mi Vernay},
title = {Whole mirror duplication-random loss model and pattern avoiding permutations},
journal = {Inf. Process. Lett.},
volume = {110},
number = {11},
pages = {474--480},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.016},
doi = {10.1016/J.IPL.2010.04.016},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BarilV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Barrus10,
author = {Michael D. Barrus},
title = {Antimagic labeling and canonical decomposition of graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {7},
pages = {261--263},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.01.006},
doi = {10.1016/J.IPL.2010.01.006},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Barrus10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BartoschekHMRV10,
author = {Christoph Bartoschek and
Stephan Held and
Jens Ma{\ss}berg and
Dieter Rautenbach and
Jens Vygen},
title = {The repeater tree construction problem},
journal = {Inf. Process. Lett.},
volume = {110},
number = {24},
pages = {1079--1083},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.016},
doi = {10.1016/J.IPL.2010.08.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BartoschekHMRV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BertiniLM10,
author = {Luciano Bertini and
Julius C. B. Leite and
Daniel Moss{\'{e}}},
title = {Power and performance control of soft real-time web server clusters},
journal = {Inf. Process. Lett.},
volume = {110},
number = {17},
pages = {767--773},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.06.013},
doi = {10.1016/J.IPL.2010.06.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BertiniLM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BeyersdorffGL10,
author = {Olaf Beyersdorff and
Nicola Galesi and
Massimo Lauria},
title = {A lower bound for the pigeonhole principle in tree-like Resolution
by asymmetric Prover-Delayer games},
journal = {Inf. Process. Lett.},
volume = {110},
number = {23},
pages = {1074--1077},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.09.007},
doi = {10.1016/J.IPL.2010.09.007},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BeyersdorffGL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BezemNR10,
author = {Marc Bezem and
Robert Nieuwenhuis and
Enric Rodr{\'{\i}}guez{-}Carbonell},
title = {Hard problems in max-algebra, control theory, hypergraphs and other
areas},
journal = {Inf. Process. Lett.},
volume = {110},
number = {4},
pages = {133--138},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.11.007},
doi = {10.1016/J.IPL.2009.11.007},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BezemNR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BjorklundHKK10,
author = {Andreas Bj{\"{o}}rklund and
Thore Husfeldt and
Petteri Kaski and
Mikko Koivisto},
title = {Evaluation of permanents in rings and semirings},
journal = {Inf. Process. Lett.},
volume = {110},
number = {20},
pages = {867--870},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.005},
doi = {10.1016/J.IPL.2010.07.005},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BjorklundHKK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bogdanov10,
author = {Andrey Bogdanov},
title = {On the differential and linear efficiency of balanced Feistel networks},
journal = {Inf. Process. Lett.},
volume = {110},
number = {20},
pages = {861--866},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.016},
doi = {10.1016/J.IPL.2010.07.016},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Bogdanov10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bollig10,
author = {Beate Bollig},
title = {Exponential space complexity for OBDD-based reachability analysis},
journal = {Inf. Process. Lett.},
volume = {110},
number = {21},
pages = {924--927},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.022},
doi = {10.1016/J.IPL.2010.07.022},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bollig10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BonizzoniVDP10,
author = {Paola Bonizzoni and
Gianluca Della Vedova and
Riccardo Dondi and
Yuri Pirola},
title = {Variants of constrained longest common subsequence},
journal = {Inf. Process. Lett.},
volume = {110},
number = {20},
pages = {877--881},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.015},
doi = {10.1016/J.IPL.2010.07.015},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BonizzoniVDP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BonnetR10,
author = {Fran{\c{c}}ois Bonnet and
Michel Raynal},
title = {A simple proof of the necessity of the failure detector Sigma to implement
an atomic register in asynchronous message-passing systems},
journal = {Inf. Process. Lett.},
volume = {110},
number = {4},
pages = {153--157},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.11.011},
doi = {10.1016/J.IPL.2009.11.011},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BonnetR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrassN10,
author = {Peter Brass and
Hyeon{-}Suk Na},
title = {Finding the maximum bounded intersection of k out of n halfplanes},
journal = {Inf. Process. Lett.},
volume = {110},
number = {3},
pages = {113--115},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.11.003},
doi = {10.1016/J.IPL.2009.11.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrassN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangCL10,
author = {Maw{-}Shang Chang and
Hsiao{-}Han Chung and
Chuang{-}Chieh Lin},
title = {An improved algorithm for the red-blue hitting set problem with the
consecutive ones property},
journal = {Inf. Process. Lett.},
volume = {110},
number = {20},
pages = {845--848},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.010},
doi = {10.1016/J.IPL.2010.07.010},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChangCL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangHR10,
author = {Gerard Jennhwa Chang and
Jianfeng Hou and
Nicolas Roussel},
title = {On the total choosability of planar graphs and of sparse graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {20},
pages = {849--853},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.007},
doi = {10.1016/J.IPL.2010.07.007},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChangHR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangKL10,
author = {Chan{-}Wei Chang and
David Kuo and
Hsing{-}Ching Lin},
title = {Ranking numbers of graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {711--716},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.025},
doi = {10.1016/J.IPL.2010.05.025},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChangKL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Charron-BostHW10,
author = {Bernadette Charron{-}Bost and
Martin Hutle and
Josef Widder},
title = {In search of lost time},
journal = {Inf. Process. Lett.},
volume = {110},
number = {21},
pages = {928--933},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.017},
doi = {10.1016/J.IPL.2010.07.017},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Charron-BostHW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chen10,
author = {Xie{-}Bin Chen},
title = {Unpaired many-to-many vertex-disjoint path covers of a class of bipartite
graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {6},
pages = {203--205},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.12.004},
doi = {10.1016/J.IPL.2009.12.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chen10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chen10a,
author = {Xie{-}Bin Chen},
title = {Cycles passing through a prescribed path in a hypercube with faulty
edges},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {625--629},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.015},
doi = {10.1016/J.IPL.2010.05.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chen10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chen10b,
author = {Xie{-}Bin Chen},
title = {Edge-fault-tolerant diameter and bipanconnectivity of hypercubes},
journal = {Inf. Process. Lett.},
volume = {110},
number = {24},
pages = {1088--1092},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.09.012},
doi = {10.1016/J.IPL.2010.09.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chen10b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenL10,
author = {Liqun Chen and
Jiangtao Li},
title = {A note on the Chen-Morrissey-Smart {DAA} scheme},
journal = {Inf. Process. Lett.},
volume = {110},
number = {12-13},
pages = {485--488},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.017},
doi = {10.1016/J.IPL.2010.04.017},
timestamp = {Mon, 25 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenWW10,
author = {Ing{-}Ray Chen and
Yating Wang and
Ding{-}Chau Wang},
title = {Reliability of wireless sensors with code attestation for intrusion
detection},
journal = {Inf. Process. Lett.},
volume = {110},
number = {17},
pages = {778--786},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.06.007},
doi = {10.1016/J.IPL.2010.06.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenWW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChevalierR10,
author = {Yannick Chevalier and
Micha{\"{e}}l Rusinowitch},
title = {Compiling and securing cryptographic protocols},
journal = {Inf. Process. Lett.},
volume = {110},
number = {3},
pages = {116--122},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.11.004},
doi = {10.1016/J.IPL.2009.11.004},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChevalierR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChristensenRJ10,
author = {Kenneth J. Christensen and
Allen Roginsky and
Miguel Jimeno},
title = {A new analysis of the false positive rate of a Bloom filter},
journal = {Inf. Process. Lett.},
volume = {110},
number = {21},
pages = {944--949},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.024},
doi = {10.1016/J.IPL.2010.07.024},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChristensenRJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CiZZWY10,
author = {Yi{-}Wei Ci and
Zhan Zhang and
De{-}Cheng Zuo and
Zhibo Wu and
Xiao{-}Zong Yang},
title = {Dependency mining-based causal message logging},
journal = {Inf. Process. Lett.},
volume = {110},
number = {5},
pages = {182--187},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.12.001},
doi = {10.1016/J.IPL.2009.12.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CiZZWY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CiprianoG10,
author = {Christopher C. Cipriano and
Teofilo F. Gonzalez},
title = {Multicasting in the hypercube, chord and binomial graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {17},
pages = {774--777},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.06.009},
doi = {10.1016/J.IPL.2010.06.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CiprianoG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ClementDPIM10,
author = {Julien Cl{\'{e}}ment and
Xavier D{\'{e}}fago and
Maria Gradinariu Potop{-}Butucaru and
Taisuke Izumi and
St{\'{e}}phane Messika},
title = {The cost of probabilistic agreement in oblivious robot networks},
journal = {Inf. Process. Lett.},
volume = {110},
number = {11},
pages = {431--438},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.006},
doi = {10.1016/J.IPL.2010.04.006},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ClementDPIM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CliffordP10,
author = {Rapha{\"{e}}l Clifford and
Ely Porat},
title = {A filtering algorithm for k-mismatch with don't cares},
journal = {Inf. Process. Lett.},
volume = {110},
number = {22},
pages = {1021--1025},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.012},
doi = {10.1016/J.IPL.2010.08.012},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CliffordP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CliffordS10,
author = {Rapha{\"{e}}l Clifford and
Benjamin Sach},
title = {Permuted function matching},
journal = {Inf. Process. Lett.},
volume = {110},
number = {22},
pages = {1012--1015},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.017},
doi = {10.1016/J.IPL.2010.08.017},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CliffordS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CohenGLS10,
author = {Elad Cohen and
Martin Charles Golumbic and
Marina Lipshteyn and
Michal Stern},
title = {On the bi-enhancement of chordal-bipartite probe graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {5},
pages = {193--197},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.12.003},
doi = {10.1016/J.IPL.2009.12.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CohenGLS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ColantonioP10,
author = {Alessandro Colantonio and
Roberto Di Pietro},
title = {Concise: Compressed 'n' Composable Integer Set},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {644--650},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.018},
doi = {10.1016/J.IPL.2010.05.018},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ColantonioP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CrespelleG10,
author = {Christophe Crespelle and
Philippe Gambette},
title = {Unrestricted and complete Breadth-First Search of trapezoid graphs
in O(n) time},
journal = {Inf. Process. Lett.},
volume = {110},
number = {12-13},
pages = {497--502},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.03.015},
doi = {10.1016/J.IPL.2010.03.015},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CrespelleG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CrowstonGJ10,
author = {Robert Crowston and
Gregory Z. Gutin and
Mark Jones},
title = {Note on Max Lin-2 above Average},
journal = {Inf. Process. Lett.},
volume = {110},
number = {11},
pages = {451--454},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.010},
doi = {10.1016/J.IPL.2010.04.010},
timestamp = {Thu, 05 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CrowstonGJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Csuhaj-VarjuV10,
author = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Gy{\"{o}}rgy Vaszil},
title = {Scattered context grammars generate any recursively enumerable language
with two nonterminals},
journal = {Inf. Process. Lett.},
volume = {110},
number = {20},
pages = {902--907},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.008},
doi = {10.1016/J.IPL.2010.07.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Csuhaj-VarjuV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cucu-GrosjeanG10,
author = {Liliana Cucu{-}Grosjean and
Jo{\"{e}}l Goossens},
title = {Predictability of Fixed-Job Priority schedulers on heterogeneous multiprocessor
real-time systems},
journal = {Inf. Process. Lett.},
volume = {110},
number = {10},
pages = {399--402},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.03.009},
doi = {10.1016/J.IPL.2010.03.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Cucu-GrosjeanG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DasFMS10,
author = {Anita Das and
Mathew C. Francis and
Rogers Mathew and
N. Sadagopan},
title = {Non-contractible non-edges in 2-connected graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {23},
pages = {1044--1048},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.09.005},
doi = {10.1016/J.IPL.2010.09.005},
timestamp = {Mon, 09 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DasFMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DelicW10,
author = {Dejan Delic and
Changping Wang},
title = {Upper signed k-domination in a general graph},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {662--665},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.019},
doi = {10.1016/J.IPL.2010.05.019},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DelicW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DemenkovKKY10,
author = {Evgeny Demenkov and
Arist Kojevnikov and
Alexander S. Kulikov and
Grigory Yaroslavtsev},
title = {New upper bounds on the Boolean circuit complexity of symmetric functions},
journal = {Inf. Process. Lett.},
volume = {110},
number = {7},
pages = {264--267},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.01.007},
doi = {10.1016/J.IPL.2010.01.007},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DemenkovKKY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DidimoEL10,
author = {Walter Didimo and
Peter Eades and
Giuseppe Liotta},
title = {A characterization of complete bipartite {RAC} graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {687--691},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.023},
doi = {10.1016/J.IPL.2010.05.023},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DidimoEL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DingWQ10,
author = {Guiguang Ding and
Jianmin Wang and
Kai Qin},
title = {A visual word weighting scheme based on emerging itemsets for video
annotation},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {692--696},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.027},
doi = {10.1016/J.IPL.2010.05.027},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DingWQ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DongX10,
author = {Wei Dong and
Baogang Xu},
title = {Some results on acyclic edge coloring of plane graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {20},
pages = {887--892},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.019},
doi = {10.1016/J.IPL.2010.07.019},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DongX10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DongY10,
author = {Qiang Dong and
Xiaofan Yang},
title = {Embedding a long fault-free cycle in a crossed cube with more faulty
nodes},
journal = {Inf. Process. Lett.},
volume = {110},
number = {11},
pages = {464--468},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.014},
doi = {10.1016/J.IPL.2010.04.014},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DongY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DornT10,
author = {Sebastian D{\"{o}}rn and
Thomas Thierauf},
title = {A note on the search for k elements via quantum walk},
journal = {Inf. Process. Lett.},
volume = {110},
number = {22},
pages = {975--978},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.004},
doi = {10.1016/J.IPL.2010.08.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DornT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DunkelmanK10,
author = {Orr Dunkelman and
Nathan Keller},
title = {The effects of the omission of last round's MixColumns on {AES}},
journal = {Inf. Process. Lett.},
volume = {110},
number = {8-9},
pages = {304--308},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.02.007},
doi = {10.1016/J.IPL.2010.02.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DunkelmanK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DurianHPT10,
author = {Branislav Durian and
Jan Holub and
Hannu Peltola and
Jorma Tarhio},
title = {Improving practical exact string matching},
journal = {Inf. Process. Lett.},
volume = {110},
number = {4},
pages = {148--152},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.11.010},
doi = {10.1016/J.IPL.2009.11.010},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DurianHPT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DvorakW10,
author = {Wolfgang Dvor{\'{a}}k and
Stefan Woltran},
title = {Complexity of semi-stable and stage semantics in argumentation frameworks},
journal = {Inf. Process. Lett.},
volume = {110},
number = {11},
pages = {425--430},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.005},
doi = {10.1016/J.IPL.2010.04.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DvorakW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EftekhariFMA10,
author = {Armin Eftekhari and
Mohamad Forouzanfar and
Hamid Abrishami Moghaddam and
Javad Alirezaie},
title = {Block-wise 2D kernel {PCA/LDA} for face recognition},
journal = {Inf. Process. Lett.},
volume = {110},
number = {17},
pages = {761--766},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.06.006},
doi = {10.1016/J.IPL.2010.06.006},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/EftekhariFMA10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Elmasry10,
author = {Amr Elmasry},
title = {The longest almost-increasing subsequence},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {655--658},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.022},
doi = {10.1016/J.IPL.2010.05.022},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Elmasry10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EmekFKR10,
author = {Yuval Emek and
Pierre Fraigniaud and
Amos Korman and
Adi Ros{\'{e}}n},
title = {On the additive constant of the k-server Work Function Algorithm},
journal = {Inf. Process. Lett.},
volume = {110},
number = {24},
pages = {1120--1123},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.09.003},
doi = {10.1016/J.IPL.2010.09.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EmekFKR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EpsteinL10,
author = {Leah Epstein and
Asaf Levin},
title = {Randomized algorithms for online bounded bidding},
journal = {Inf. Process. Lett.},
volume = {110},
number = {12-13},
pages = {503--506},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.03.016},
doi = {10.1016/J.IPL.2010.03.016},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EpsteinL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ezra10,
author = {Esther Ezra},
title = {A note about weak epsilon-nets for axis-parallel boxes in d-space},
journal = {Inf. Process. Lett.},
volume = {110},
number = {18-19},
pages = {835--840},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.06.005},
doi = {10.1016/J.IPL.2010.06.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ezra10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FakcharoenpholK10,
author = {Jittat Fakcharoenphol and
Boonserm Kijsirikul},
title = {Short proofs for online multiclass prediction on graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {8-9},
pages = {309--311},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.02.008},
doi = {10.1016/J.IPL.2010.02.008},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FakcharoenpholK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fischer10,
author = {Johannes Fischer},
title = {Wee {LCP}},
journal = {Inf. Process. Lett.},
volume = {110},
number = {8-9},
pages = {317--320},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.02.010},
doi = {10.1016/J.IPL.2010.02.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fischer10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FischerH10,
author = {Johannes Fischer and
Daniel H. Huson},
title = {New common ancestor problems in trees and directed acyclic graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {8-9},
pages = {331--335},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.02.014},
doi = {10.1016/J.IPL.2010.02.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FischerH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FominGGKS10,
author = {Fedor V. Fomin and
Serge Gaspers and
Petr A. Golovach and
Dieter Kratsch and
Saket Saurabh},
title = {Parameterized algorithm for eternal vertex cover},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {702--706},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.029},
doi = {10.1016/J.IPL.2010.05.029},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FominGGKS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FrancescoLMV10,
author = {Nicoletta De Francesco and
Giuseppe Lettieri and
Luca Martini and
Gigliola Vaglini},
title = {Partial model checking via abstract interpretation},
journal = {Inf. Process. Lett.},
volume = {110},
number = {3},
pages = {99--103},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.10.014},
doi = {10.1016/J.IPL.2009.10.014},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FrancescoLMV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Frati10,
author = {Fabrizio Frati},
title = {A note on isosceles planar graph drawing},
journal = {Inf. Process. Lett.},
volume = {110},
number = {12-13},
pages = {507--509},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.001},
doi = {10.1016/J.IPL.2010.04.001},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Frati10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fredriksson10,
author = {Kimmo Fredriksson},
title = {On building minimal automaton for subset matching queries},
journal = {Inf. Process. Lett.},
volume = {110},
number = {24},
pages = {1093--1098},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.09.014},
doi = {10.1016/J.IPL.2010.09.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fredriksson10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FreivaldsYS10,
author = {Rusins Freivalds and
Abuzer Yakaryilmaz and
A. C. Cem Say},
title = {A new family of nonstochastic languages},
journal = {Inf. Process. Lett.},
volume = {110},
number = {10},
pages = {410--413},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.03.011},
doi = {10.1016/J.IPL.2010.03.011},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FreivaldsYS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FreschiB10,
author = {Valerio Freschi and
Alessandro Bogliolo},
title = {A faster algorithm for the computation of string convolutions using
{LZ78} parsing},
journal = {Inf. Process. Lett.},
volume = {110},
number = {14-15},
pages = {609--613},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.010},
doi = {10.1016/J.IPL.2010.05.010},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FreschiB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fu10,
author = {Jung{-}Sheng Fu},
title = {Edge-fault-tolerant vertex-pancyclicity of augmented cubes},
journal = {Inf. Process. Lett.},
volume = {110},
number = {11},
pages = {439--443},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.009},
doi = {10.1016/J.IPL.2010.04.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fu10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FuCNY10,
author = {Ruyan Fu and
T. C. Edwin Cheng and
C. T. Ng and
Jinjiang Yuan},
title = {Online scheduling on two parallel-batching machines with limited restarts
to minimize the makespan},
journal = {Inf. Process. Lett.},
volume = {110},
number = {11},
pages = {444--450},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.008},
doi = {10.1016/J.IPL.2010.04.008},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FuCNY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FuLMQ10,
author = {Shaojing Fu and
Chao Li and
Kanta Matsuura and
Longjiang Qu},
title = {Enumeration of balanced symmetric functions over GF(p)},
journal = {Inf. Process. Lett.},
volume = {110},
number = {14-15},
pages = {544--548},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.018},
doi = {10.1016/J.IPL.2010.04.018},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FuLMQ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GamzuS10,
author = {Iftah Gamzu and
Danny Segev},
title = {A polylogarithmic approximation for computing non-metric terminal
Steiner trees},
journal = {Inf. Process. Lett.},
volume = {110},
number = {18-19},
pages = {826--829},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.006},
doi = {10.1016/J.IPL.2010.07.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GamzuS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GeladeN10,
author = {Wouter Gelade and
Frank Neven},
title = {Optimizing the Region Algebra is PSPACE-complete},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {639--643},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.006},
doi = {10.1016/J.IPL.2010.05.006},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GeladeN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gluck10,
author = {Robert Gl{\"{u}}ck},
title = {Self-generating program specializers},
journal = {Inf. Process. Lett.},
volume = {110},
number = {17},
pages = {787--793},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.020},
doi = {10.1016/J.IPL.2010.05.020},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gluck10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GneccoS10,
author = {Giorgio Gnecco and
Marcello Sanguineti},
title = {On spectral windows in supervised learning from data},
journal = {Inf. Process. Lett.},
volume = {110},
number = {23},
pages = {1031--1036},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.011},
doi = {10.1016/J.IPL.2010.08.011},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GneccoS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrigorescuJR10,
author = {Elena Grigorescu and
Kyomin Jung and
Ronitt Rubinfeld},
title = {A local decision test for sparse polynomials},
journal = {Inf. Process. Lett.},
volume = {110},
number = {20},
pages = {898--901},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.012},
doi = {10.1016/J.IPL.2010.07.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GrigorescuJR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GroultPR10,
author = {Richard Groult and
{\'{E}}lise Prieur and
Gw{\'{e}}na{\"{e}}l Richomme},
title = {Counting distinct palindromes in a word in linear time},
journal = {Inf. Process. Lett.},
volume = {110},
number = {20},
pages = {908--912},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.018},
doi = {10.1016/J.IPL.2010.07.018},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GroultPR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrunerS10,
author = {Stefan Gruner and
Theunis J. Steyn},
title = {Deadlock-freeness of hexagonal systolic arrays},
journal = {Inf. Process. Lett.},
volume = {110},
number = {14-15},
pages = {539--543},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.021},
doi = {10.1016/J.IPL.2010.04.021},
timestamp = {Mon, 20 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GrunerS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GueronK10,
author = {Shay Gueron and
Michael E. Kounavis},
title = {Efficient implementation of the Galois Counter Mode using a carry-less
multiplier and a fast reduction algorithm},
journal = {Inf. Process. Lett.},
volume = {110},
number = {14-15},
pages = {549--553},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.011},
doi = {10.1016/J.IPL.2010.04.011},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GueronK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GulavaniCNR10,
author = {Bhargav S. Gulavani and
Supratik Chakraborty and
Aditya V. Nori and
Sriram K. Rajamani},
title = {Refining abstract interpretations},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {666--671},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.021},
doi = {10.1016/J.IPL.2010.05.021},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GulavaniCNR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuoCHJCCSH10,
author = {Deke Guo and
Hanhua Chen and
Yuan He and
Hai Jin and
Chao Chen and
Honghui Chen and
Zhen Shu and
Guangqi Huang},
title = {KCube: {A} novel architecture for interconnection networks},
journal = {Inf. Process. Lett.},
volume = {110},
number = {18-19},
pages = {821--825},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.06.010},
doi = {10.1016/J.IPL.2010.06.010},
timestamp = {Thu, 24 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuoCHJCCSH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuoQG10,
author = {Litao Guo and
Chengfu Qin and
Xiaofeng Guo},
title = {Super connectivity of Kronecker products of graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {659--661},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.013},
doi = {10.1016/J.IPL.2010.05.013},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GuoQG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GutinY10,
author = {Gregory Z. Gutin and
Anders Yeo},
title = {Note on maximal bisection above tight lower bound},
journal = {Inf. Process. Lett.},
volume = {110},
number = {21},
pages = {966--969},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.001},
doi = {10.1016/J.IPL.2010.08.001},
timestamp = {Thu, 22 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GutinY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Guttmann-BeckH10,
author = {Nili Guttmann{-}Beck and
Refael Hassin},
title = {On two restricted ancestors tree problems},
journal = {Inf. Process. Lett.},
volume = {110},
number = {14-15},
pages = {570--575},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.002},
doi = {10.1016/J.IPL.2010.05.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Guttmann-BeckH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Halldorsson10,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Online coloring of hypergraphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {10},
pages = {370--372},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.03.001},
doi = {10.1016/J.IPL.2010.03.001},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Halldorsson10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HanPYZL10,
author = {Xin Han and
Chao Peng and
Deshi Ye and
Dahai Zhang and
Yan Lan},
title = {Dynamic bin packing with unit fraction items revisited},
journal = {Inf. Process. Lett.},
volume = {110},
number = {23},
pages = {1049--1054},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.09.002},
doi = {10.1016/J.IPL.2010.09.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HanPYZL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HarjuN10,
author = {Tero Harju and
Dirk Nowotka},
title = {Cyclically repetition-free words on small alphabets},
journal = {Inf. Process. Lett.},
volume = {110},
number = {14-15},
pages = {591--595},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.005},
doi = {10.1016/J.IPL.2010.05.005},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HarjuN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HeggernesM10,
author = {Pinar Heggernes and
Daniel Meister},
title = {Hardness and approximation of minimum distortion embeddings},
journal = {Inf. Process. Lett.},
volume = {110},
number = {8-9},
pages = {312--316},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.02.009},
doi = {10.1016/J.IPL.2010.02.009},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HeggernesM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hougardy10,
author = {Stefan Hougardy},
title = {The Floyd-Warshall algorithm on graphs with negative cycles},
journal = {Inf. Process. Lett.},
volume = {110},
number = {8-9},
pages = {279--281},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.02.001},
doi = {10.1016/J.IPL.2010.02.001},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Hougardy10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HuangHTL10,
author = {Yen{-}Lin Huang and
Cheng{-}Chen Huang and
Chuan Yi Tang and
Chin Lung Lu},
title = {An improved algorithm for sorting by block-interchanges based on permutation
groups},
journal = {Inf. Process. Lett.},
volume = {110},
number = {8-9},
pages = {345--350},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.03.003},
doi = {10.1016/J.IPL.2010.03.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HuangHTL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HungLT10,
author = {Regant Y. S. Hung and
Lap{-}Kei Lee and
Hing{-}Fung Ting},
title = {Finding frequent items over sliding windows with constant update time},
journal = {Inf. Process. Lett.},
volume = {110},
number = {7},
pages = {257--260},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.01.027},
doi = {10.1016/J.IPL.2009.01.027},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HungLT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IchimuraS10,
author = {Akira Ichimura and
Maiko Shigeno},
title = {A new parameter for a broadcast algorithm with locally bounded Byzantine
faults},
journal = {Inf. Process. Lett.},
volume = {110},
number = {12-13},
pages = {514--517},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.003},
doi = {10.1016/J.IPL.2010.04.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IchimuraS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IerselSS10,
author = {Leo van Iersel and
Charles Semple and
Mike A. Steel},
title = {Locating a tree in a phylogenetic network},
journal = {Inf. Process. Lett.},
volume = {110},
number = {23},
pages = {1037--1043},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.027},
doi = {10.1016/J.IPL.2010.07.027},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/IerselSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IwamaZ10,
author = {Kazuo Iwama and
Guochuan Zhang},
title = {Online knapsack with resource augmentation},
journal = {Inf. Process. Lett.},
volume = {110},
number = {22},
pages = {1016--1020},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.013},
doi = {10.1016/J.IPL.2010.08.013},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/IwamaZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IwasakiK10,
author = {Tatsuya Iwasaki and
Keiichi Kaneko},
title = {Fault-tolerant routing in burnt pancake graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {14-15},
pages = {535--538},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.023},
doi = {10.1016/J.IPL.2010.04.023},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IwasakiK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JainKS10,
author = {Rahul Jain and
Hartmut Klauck and
Miklos Santha},
title = {Optimal direct sum results for deterministic and randomized decision
tree complexity},
journal = {Inf. Process. Lett.},
volume = {110},
number = {20},
pages = {893--897},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.020},
doi = {10.1016/J.IPL.2010.07.020},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/JainKS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JainOS10,
author = {Sanjay Jain and
Yuh Shin Ong and
Frank Stephan},
title = {Regular patterns, regular languages and context-free languages},
journal = {Inf. Process. Lett.},
volume = {110},
number = {24},
pages = {1114--1119},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.09.010},
doi = {10.1016/J.IPL.2010.09.010},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JainOS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JiC10,
author = {Min Ji and
T. C. Edwin Cheng},
title = {Scheduling with job-dependent learning effects and multiple rate-modifying
activities},
journal = {Inf. Process. Lett.},
volume = {110},
number = {11},
pages = {460--463},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.015},
doi = {10.1016/J.IPL.2010.04.015},
timestamp = {Fri, 26 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JiC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JonssonT10,
author = {Peter Jonsson and
Johan Thapper},
title = {Approximating integer programs with positive right-hand sides},
journal = {Inf. Process. Lett.},
volume = {110},
number = {10},
pages = {351--355},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.02.011},
doi = {10.1016/J.IPL.2010.02.011},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JonssonT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jordan10,
author = {Tibor Jord{\'{a}}n},
title = {Generically globally rigid zeolites in the plane},
journal = {Inf. Process. Lett.},
volume = {110},
number = {18-19},
pages = {841--844},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.06.011},
doi = {10.1016/J.IPL.2010.06.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jordan10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Junosza-SzaniawskiR10,
author = {Konstanty Junosza{-}Szaniawski and
Lukasz Rozej},
title = {Game chromatic number of graphs with locally bounded number of cycles},
journal = {Inf. Process. Lett.},
volume = {110},
number = {17},
pages = {757--760},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.06.004},
doi = {10.1016/J.IPL.2010.06.004},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Junosza-SzaniawskiR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KatajainenR10,
author = {Jyrki Katajainen and
S. Srinivasa Rao},
title = {A compact data structure for representing a dynamic multiset},
journal = {Inf. Process. Lett.},
volume = {110},
number = {23},
pages = {1061--1066},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.007},
doi = {10.1016/J.IPL.2010.08.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KatajainenR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KellerM10,
author = {Nathan Keller and
Stephen D. Miller},
title = {Distinguishing attacks on stream ciphers based on arrays of pseudo-random
words},
journal = {Inf. Process. Lett.},
volume = {110},
number = {4},
pages = {129--132},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.11.006},
doi = {10.1016/J.IPL.2009.11.006},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KellerM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KenkreV10,
author = {Sreyash Kenkre and
Sundar Vishwanathan},
title = {Approximation algorithms for the Bipartite Multicut problem},
journal = {Inf. Process. Lett.},
volume = {110},
number = {8-9},
pages = {282--287},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.02.002},
doi = {10.1016/J.IPL.2010.02.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KenkreV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kim10,
author = {Chong Hee Kim},
title = {New fault attacks using Jacobi symbol and application to regular right-to-left
algorithms},
journal = {Inf. Process. Lett.},
volume = {110},
number = {20},
pages = {882--886},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.013},
doi = {10.1016/J.IPL.2010.07.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kim10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KohlerL10,
author = {Henning K{\"{o}}hler and
Sebastian Link},
title = {Armstrong axioms and Boyce-Codd-Heath Normal Form under bag semantics},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {717--724},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.06.002},
doi = {10.1016/J.IPL.2010.06.002},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KohlerL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KolbeZP10,
author = {Dashiell Kolbe and
Qiang Zhu and
Sakti Pramanik},
title = {Reducing non-determinism of k-NN searching in non-ordered discrete
data spaces},
journal = {Inf. Process. Lett.},
volume = {110},
number = {10},
pages = {420--423},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.03.013},
doi = {10.1016/J.IPL.2010.03.013},
timestamp = {Tue, 05 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KolbeZP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KolpakovKO10,
author = {Roman Kolpakov and
Gregory Kucherov and
Pascal Ochem},
title = {On maximal repetitions of arbitrary exponent},
journal = {Inf. Process. Lett.},
volume = {110},
number = {7},
pages = {252--256},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.01.005},
doi = {10.1016/J.IPL.2010.01.005},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KolpakovKO10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KozmaLS10,
author = {Gady Kozma and
Zvi Lotker and
Gideon Stupp},
title = {On the connectivity threshold for general uniform metric spaces},
journal = {Inf. Process. Lett.},
volume = {110},
number = {10},
pages = {356--359},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.02.015},
doi = {10.1016/J.IPL.2010.02.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KozmaLS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KulikS10,
author = {Ariel Kulik and
Hadas Shachnai},
title = {There is no {EPTAS} for two-dimensional knapsack},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {707--710},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.031},
doi = {10.1016/J.IPL.2010.05.031},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KulikS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KundiAI10,
author = {Dur{-}e{-}Shahwar Kundi and
Arshad Aziz and
Nassar Ikram},
title = {Resource efficient implementation of T-Boxes in {AES} on Virtex-5
{FPGA}},
journal = {Inf. Process. Lett.},
volume = {110},
number = {10},
pages = {373--377},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.03.004},
doi = {10.1016/J.IPL.2010.03.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KundiAI10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LaiL10,
author = {Peng{-}Jen Lai and
Wen{-}Chiung Lee},
title = {Single-machine scheduling with a nonlinear deterioration function},
journal = {Inf. Process. Lett.},
volume = {110},
number = {11},
pages = {455--459},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.012},
doi = {10.1016/J.IPL.2010.04.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LaiL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lazic10,
author = {Ranko Lazic},
title = {The reachability problem for branching vector addition systems requires
doubly-exponential space},
journal = {Inf. Process. Lett.},
volume = {110},
number = {17},
pages = {740--745},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.06.008},
doi = {10.1016/J.IPL.2010.06.008},
timestamp = {Thu, 22 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lazic10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lee10,
author = {Jae Moon Lee},
title = {An efficient algorithm to find k-nearest neighbors in flocking behavior},
journal = {Inf. Process. Lett.},
volume = {110},
number = {14-15},
pages = {576--579},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.024},
doi = {10.1016/J.IPL.2010.04.024},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lee10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeLK10,
author = {Byoung{-}Hoon Lee and
Sung{-}Hwa Lim and
Jai{-}Hoon Kim},
title = {Scalable real-time monitoring system for ubiquitous smart space},
journal = {Inf. Process. Lett.},
volume = {110},
number = {8-9},
pages = {294--299},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.02.005},
doi = {10.1016/J.IPL.2010.02.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeeLK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeP10,
author = {Jooyoung Lee and
Je Hong Park},
title = {Preimage resistance of LPmkr with r=m-1},
journal = {Inf. Process. Lett.},
volume = {110},
number = {14-15},
pages = {602--608},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.009},
doi = {10.1016/J.IPL.2010.05.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeeP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LenaM10,
author = {Pietro di Lena and
Luciano Margara},
title = {Optimal global alignment of signals by maximization of Pearson correlation},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {679--686},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.024},
doi = {10.1016/J.IPL.2010.05.024},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LenaM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Li10,
author = {Ruijuan Li},
title = {A Fan-type result on k-ordered graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {651--654},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.017},
doi = {10.1016/J.IPL.2010.05.017},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Li10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiCCL10,
author = {Yin Li and
Gongliang Chen and
Yi{-}yang Chen and
Jianhua Li},
title = {An extension of {TYT} inversion algorithm in polynomial basis},
journal = {Inf. Process. Lett.},
volume = {110},
number = {8-9},
pages = {300--303},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.02.006},
doi = {10.1016/J.IPL.2010.02.006},
timestamp = {Sun, 03 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiCCL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiWS10,
author = {Hui Li and
Chuankun Wu and
Jun Sun},
title = {A general compiler for password-authenticated group key exchange protocol},
journal = {Inf. Process. Lett.},
volume = {110},
number = {4},
pages = {160--167},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.11.013},
doi = {10.1016/J.IPL.2009.11.013},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiWS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiZ10,
author = {Xiuying Li and
Zhao Zhang},
title = {Two algorithms for minimum 2-connected r-hop dominating set},
journal = {Inf. Process. Lett.},
volume = {110},
number = {22},
pages = {986--991},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.008},
doi = {10.1016/J.IPL.2010.08.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LibkinS10,
author = {Leonid Libkin and
Cristina Sirangelo},
title = {Disjoint pattern matching and implication in strings},
journal = {Inf. Process. Lett.},
volume = {110},
number = {4},
pages = {143--147},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.11.009},
doi = {10.1016/J.IPL.2009.11.009},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LibkinS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Libura10,
author = {Marek Libura},
title = {A note on robustness tolerances for combinatorial optimization problems},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {725--729},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.06.003},
doi = {10.1016/J.IPL.2010.06.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Libura10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinL10,
author = {Lan Lin and
Yixun Lin},
title = {Two models of two-dimensional bandwidth problems},
journal = {Inf. Process. Lett.},
volume = {110},
number = {11},
pages = {469--473},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.013},
doi = {10.1016/J.IPL.2010.04.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LinL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinYHC10,
author = {Jia{-}Cian Lin and
Jinn{-}Shyong Yang and
Chiun{-}Chieh Hsu and
Jou{-}Ming Chang},
title = {Independent spanning trees vs. edge-disjoint spanning trees in locally
twisted cubes},
journal = {Inf. Process. Lett.},
volume = {110},
number = {10},
pages = {414--419},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.03.012},
doi = {10.1016/J.IPL.2010.03.012},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LinYHC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Liu10,
author = {Shuli Liu},
title = {On toughness and fractional (g, f, n)-critical graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {10},
pages = {378--382},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.03.005},
doi = {10.1016/J.IPL.2010.03.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Liu10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiuL10,
author = {Di Liu and
Jing Li},
title = {Many-to-many n-disjoint path covers in n-dimensional hypercubes},
journal = {Inf. Process. Lett.},
volume = {110},
number = {14-15},
pages = {580--584},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.004},
doi = {10.1016/J.IPL.2010.05.004},
timestamp = {Fri, 09 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiuL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiuL10a,
author = {Tsung{-}Hao Liu and
Hsueh{-}I Lu},
title = {Minimum cycle bases of weighted outerplanar graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {21},
pages = {970--974},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.005},
doi = {10.1016/J.IPL.2010.08.005},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiuL10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiuWL10,
author = {Feng Liu and
Chuan Kun Wu and
Xi Jun Lin},
title = {A new definition of the contrast of visual cryptography scheme},
journal = {Inf. Process. Lett.},
volume = {110},
number = {7},
pages = {241--246},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.01.003},
doi = {10.1016/J.IPL.2010.01.003},
timestamp = {Tue, 22 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiuWL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiuZ10,
author = {Hong Liu and
Daming Zhu},
title = {Parameterized complexity of control problems in Maximin election},
journal = {Inf. Process. Lett.},
volume = {110},
number = {10},
pages = {383--388},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.03.006},
doi = {10.1016/J.IPL.2010.03.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiuZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiuZCM10,
author = {Juan Liu and
Xindong Zhang and
Xing Chen and
Jixiang Meng},
title = {On domination number of Cartesian product of directed cycles},
journal = {Inf. Process. Lett.},
volume = {110},
number = {5},
pages = {171--173},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.11.005},
doi = {10.1016/J.IPL.2009.11.005},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiuZCM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lucas10,
author = {Joan M. Lucas},
title = {An improved kernel size for rotation distance in binary trees},
journal = {Inf. Process. Lett.},
volume = {110},
number = {12-13},
pages = {481--484},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.022},
doi = {10.1016/J.IPL.2010.04.022},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lucas10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuccioEP10,
author = {Fabrizio Luccio and
Antonio Mesa Enriques and
Linda Pagli},
title = {Lower bounds on the rotation distance of binary trees},
journal = {Inf. Process. Lett.},
volume = {110},
number = {21},
pages = {934--938},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.025},
doi = {10.1016/J.IPL.2010.07.025},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LuccioEP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mannaa10,
author = {Bassel Mannaa},
title = {Cluster editing problem for points on the real line: {A} polynomial
time algorithm},
journal = {Inf. Process. Lett.},
volume = {110},
number = {21},
pages = {961--965},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.002},
doi = {10.1016/J.IPL.2010.08.002},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mannaa10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MartinL10,
author = {Cristian Mart{\'{\i}}n and
Mikel Larrea},
title = {A simple and communication-efficient Omega algorithm in the crash-recovery
model},
journal = {Inf. Process. Lett.},
volume = {110},
number = {3},
pages = {83--87},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.10.011},
doi = {10.1016/J.IPL.2009.10.011},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MartinL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MelkmanTA10,
author = {Avraham A. Melkman and
Takeyuki Tamura and
Tatsuya Akutsu},
title = {Determining a singleton attractor of an {AND/OR} Boolean network in
O(1.587\({}^{\mbox{n}}\)) time},
journal = {Inf. Process. Lett.},
volume = {110},
number = {14-15},
pages = {565--569},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.001},
doi = {10.1016/J.IPL.2010.05.001},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MelkmanTA10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MiaoL10,
author = {Huifang Miao and
Guoping Lin},
title = {Strong orientations of complete k-partite graphs achieving the strong
diameter},
journal = {Inf. Process. Lett.},
volume = {110},
number = {6},
pages = {206--210},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.12.005},
doi = {10.1016/J.IPL.2009.12.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MiaoL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Montanaro10,
author = {Ashley Montanaro},
title = {Nonadaptive quantum query complexity},
journal = {Inf. Process. Lett.},
volume = {110},
number = {24},
pages = {1110--1113},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.09.009},
doi = {10.1016/J.IPL.2010.09.009},
timestamp = {Sat, 24 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Montanaro10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MontassierRZ10,
author = {Micka{\"{e}}l Montassier and
Andr{\'{e}} Raspaud and
Xuding Zhu},
title = {Decomposition of sparse graphs into two forests, one having bounded
maximum degree},
journal = {Inf. Process. Lett.},
volume = {110},
number = {20},
pages = {913--916},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.009},
doi = {10.1016/J.IPL.2010.07.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MontassierRZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MoosaR10,
author = {Tanaeem M. Moosa and
M. Sohel Rahman},
title = {Indexing permutations for binary strings},
journal = {Inf. Process. Lett.},
volume = {110},
number = {18-19},
pages = {795--798},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.06.012},
doi = {10.1016/J.IPL.2010.06.012},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MoosaR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MubayiT10,
author = {Dhruv Mubayi and
Gy{\"{o}}rgy Tur{\'{a}}n},
title = {Finding bipartite subgraphs efficiently},
journal = {Inf. Process. Lett.},
volume = {110},
number = {5},
pages = {174--177},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.11.015},
doi = {10.1016/J.IPL.2009.11.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MubayiT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NandyMB10,
author = {Subhas C. Nandy and
Krishnendu Mukhopadhyaya and
Bhargab B. Bhattacharya},
title = {Recognition of largest empty orthoconvex polygon in a point set},
journal = {Inf. Process. Lett.},
volume = {110},
number = {17},
pages = {746--752},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.028},
doi = {10.1016/J.IPL.2010.05.028},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/NandyMB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NashG10,
author = {Nicholas Nash and
David Gregg},
title = {An output sensitive algorithm for computing a maximum independent
set of a circle graph},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {630--634},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.016},
doi = {10.1016/J.IPL.2010.05.016},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/NashG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/OhlebuschG10,
author = {Enno Ohlebusch and
Simon Gog},
title = {Efficient algorithms for the all-pairs suffix-prefix problem and the
all-pairs substring-prefix problem},
journal = {Inf. Process. Lett.},
volume = {110},
number = {3},
pages = {123--128},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.10.015},
doi = {10.1016/J.IPL.2009.10.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/OhlebuschG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PandaP10,
author = {B. S. Panda and
Dinabandhu Pradhan},
title = {Locally connected spanning trees in cographs, complements of bipartite
graphs and doubly chordal graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {23},
pages = {1067--1073},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.09.008},
doi = {10.1016/J.IPL.2010.09.008},
timestamp = {Wed, 09 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PandaP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ParkCK10,
author = {Jonghun Park and
Byung{-}Cheon Choi and
Kwanho Kim},
title = {A vector space approach to tag cloud similarity ranking},
journal = {Inf. Process. Lett.},
volume = {110},
number = {12-13},
pages = {489--496},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.03.014},
doi = {10.1016/J.IPL.2010.03.014},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ParkCK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pelc10,
author = {Andrzej Pelc},
title = {Fault-tolerant strategies in the Iterated Prisoner's Dilemma},
journal = {Inf. Process. Lett.},
volume = {110},
number = {10},
pages = {389--395},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.03.007},
doi = {10.1016/J.IPL.2010.03.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Pelc10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PengYHA10,
author = {Yung{-}Hsing Peng and
Chang{-}Biau Yang and
Kuo{-}Si Huang and
Hsing{-}Yen Ann},
title = {Efficient indexing algorithms for one-dimensional discretely-scaled
strings},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {730--734},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.012},
doi = {10.1016/J.IPL.2010.05.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PengYHA10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rackham10,
author = {Tom Rackham},
title = {The complexity of changing colourings with bounded maximum degree},
journal = {Inf. Process. Lett.},
volume = {110},
number = {17},
pages = {735--739},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.026},
doi = {10.1016/J.IPL.2010.05.026},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rackham10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RadonjicV10,
author = {Aleksandar Radonjic and
Vladimir Vujicic},
title = {Integer {SEC-DED} codes for low power communications},
journal = {Inf. Process. Lett.},
volume = {110},
number = {12-13},
pages = {518--520},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.004},
doi = {10.1016/J.IPL.2010.04.004},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RadonjicV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RampersadS10,
author = {Narad Rampersad and
Jeffrey O. Shallit},
title = {Detecting patterns in finite regular and context-free languages},
journal = {Inf. Process. Lett.},
volume = {110},
number = {3},
pages = {108--112},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.11.002},
doi = {10.1016/J.IPL.2009.11.002},
timestamp = {Mon, 09 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/RampersadS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RohH10,
author = {Dongyoung Roh and
Sang Geun Hahn},
title = {On the bit security of the weak Diffie-Hellman problem},
journal = {Inf. Process. Lett.},
volume = {110},
number = {18-19},
pages = {799--802},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.001},
doi = {10.1016/J.IPL.2010.07.001},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RohH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RohJSKL10,
author = {Hyun{-}Gul Roh and
Myeongjae Jeon and
Euiseong Seo and
Jinsoo Kim and
Joonwon Lee},
title = {Log' version vector: Logging version vectors concisely in dynamic
replication},
journal = {Inf. Process. Lett.},
volume = {110},
number = {14-15},
pages = {614--620},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.026},
doi = {10.1016/J.IPL.2010.04.026},
timestamp = {Wed, 13 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RohJSKL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RousselZ10,
author = {Nicolas Roussel and
Xuding Zhu},
title = {Total coloring of planar graphs of maximum degree eight},
journal = {Inf. Process. Lett.},
volume = {110},
number = {8-9},
pages = {321--324},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.02.012},
doi = {10.1016/J.IPL.2010.02.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RousselZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SakaiO10,
author = {Masahiko Sakai and
Mizuhito Ogawa},
title = {Weakly-non-overlapping non-collapsing shallow term rewriting systems
are confluent},
journal = {Inf. Process. Lett.},
volume = {110},
number = {18-19},
pages = {810--814},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.06.015},
doi = {10.1016/J.IPL.2010.06.015},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SakaiO10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SarkarM10,
author = {Santanu Sarkar and
Subhamoy Maitra},
title = {Cryptanalysis of {RSA} with two decryption exponents},
journal = {Inf. Process. Lett.},
volume = {110},
number = {5},
pages = {178--181},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.11.016},
doi = {10.1016/J.IPL.2009.11.016},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SarkarM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SarkarM10a,
author = {Santanu Sarkar and
Subhamoy Maitra},
title = {Cryptanalysis of {RSA} with more than one decryption exponent},
journal = {Inf. Process. Lett.},
volume = {110},
number = {8-9},
pages = {336--340},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.02.016},
doi = {10.1016/J.IPL.2010.02.016},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SarkarM10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Saxena10,
author = {Sanjeev Saxena},
title = {On finding fundamental cut sets},
journal = {Inf. Process. Lett.},
volume = {110},
number = {4},
pages = {168--170},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.11.014},
doi = {10.1016/J.IPL.2009.11.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Saxena10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Schmidt-SchaussS10,
author = {Manfred Schmidt{-}Schau{\ss} and
David Sabel},
title = {Closures of may-, should- and must-convergences for contextual equivalence},
journal = {Inf. Process. Lett.},
volume = {110},
number = {6},
pages = {232--235},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.01.001},
doi = {10.1016/J.IPL.2010.01.001},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Schmidt-SchaussS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Service10,
author = {Travis C. Service},
title = {A No Free Lunch theorem for multi-objective optimization},
journal = {Inf. Process. Lett.},
volume = {110},
number = {21},
pages = {917--923},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.026},
doi = {10.1016/J.IPL.2010.07.026},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Service10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShenMLBC10,
author = {Yang Shen and
Lizhuang Ma and
Hai Liu and
Yanxia Bao and
Zhihua Chen},
title = {Detecting and extracting natural snow from videos},
journal = {Inf. Process. Lett.},
volume = {110},
number = {24},
pages = {1124--1130},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.10.003},
doi = {10.1016/J.IPL.2010.10.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ShenMLBC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SimonS10,
author = {Hans Ulrich Simon and
Bal{\'{a}}zs Sz{\"{o}}r{\'{e}}nyi},
title = {One-inclusion hypergraph density revisited},
journal = {Inf. Process. Lett.},
volume = {110},
number = {8-9},
pages = {341--344},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.03.002},
doi = {10.1016/J.IPL.2010.03.002},
timestamp = {Fri, 08 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SimonS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sorenson10,
author = {Jonathan P. Sorenson},
title = {A randomized sublinear time parallel {GCD} algorithm for the {EREW}
{PRAM}},
journal = {Inf. Process. Lett.},
volume = {110},
number = {5},
pages = {198--201},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.12.008},
doi = {10.1016/J.IPL.2009.12.008},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sorenson10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SzalachowskiKK10,
author = {Pawel Szalachowski and
Bogdan Ksiezopolski and
Zbigniew Kotulski},
title = {CMAC, {CCM} and {GCM/GMAC:} Advanced modes of operation of symmetric
block ciphers in wireless sensor networks},
journal = {Inf. Process. Lett.},
volume = {110},
number = {7},
pages = {247--251},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.01.004},
doi = {10.1016/J.IPL.2010.01.004},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SzalachowskiKK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TaoCXT10,
author = {Jiping Tao and
Zhijun Chao and
Yugeng Xi and
Ye Tao},
title = {An optimal semi-online algorithm for a single machine scheduling problem
with bounded processing time},
journal = {Inf. Process. Lett.},
volume = {110},
number = {8-9},
pages = {325--330},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.02.013},
doi = {10.1016/J.IPL.2010.02.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TaoCXT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Vallee10,
author = {Thierry Vall{\'{e}}e},
title = {Normal eulerian clique-covering and hamiltonicity},
journal = {Inf. Process. Lett.},
volume = {110},
number = {16},
pages = {697--701},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.030},
doi = {10.1016/J.IPL.2010.05.030},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Vallee10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VidaliNP10,
author = {Janos Vidali and
Peter Nose and
Enes Pasalic},
title = {Collisions for variants of the {BLAKE} hash function},
journal = {Inf. Process. Lett.},
volume = {110},
number = {14-15},
pages = {585--590},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.007},
doi = {10.1016/J.IPL.2010.05.007},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/VidaliNP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Walczak10,
author = {Bartosz Walczak},
title = {A simple representation of subwords of the Fibonacci word},
journal = {Inf. Process. Lett.},
volume = {110},
number = {21},
pages = {956--960},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.006},
doi = {10.1016/J.IPL.2010.08.006},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Walczak10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangMLN10,
author = {Shuaiqiang Wang and
Jun Ma and
Jiming Liu and
Xiaofei Niu},
title = {Evolving choice structures for genetic programming},
journal = {Inf. Process. Lett.},
volume = {110},
number = {20},
pages = {871--876},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.014},
doi = {10.1016/J.IPL.2010.07.014},
timestamp = {Fri, 19 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/WangMLN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangNFC10,
author = {Jianxin Wang and
Dan Ning and
Qilong Feng and
Jianer Chen},
title = {An improved kernelization for P\({}_{\mbox{2}}\)-packing},
journal = {Inf. Process. Lett.},
volume = {110},
number = {5},
pages = {188--192},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.12.002},
doi = {10.1016/J.IPL.2009.12.002},
timestamp = {Fri, 21 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangNFC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangS10,
author = {Xiaorong Wang and
Hongbo Shi},
title = {A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes},
journal = {Inf. Process. Lett.},
volume = {110},
number = {22},
pages = {992--997},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.009},
doi = {10.1016/J.IPL.2010.08.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wijsen10,
author = {Jef Wijsen},
title = {A remark on the complexity of consistent conjunctive query answering
under primary key violations},
journal = {Inf. Process. Lett.},
volume = {110},
number = {21},
pages = {950--955},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.021},
doi = {10.1016/J.IPL.2010.07.021},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wijsen10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WuJS10,
author = {Zong{-}Da Wu and
Tao Jiang and
Wu{-}Jie Su},
title = {Efficient computation of shortest absent words in a genomic sequence},
journal = {Inf. Process. Lett.},
volume = {110},
number = {14-15},
pages = {596--601},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.008},
doi = {10.1016/J.IPL.2010.05.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WuJS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Xiao10,
author = {Mingyu Xiao},
title = {Finding minimum 3-way cuts in hypergraphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {14-15},
pages = {554--558},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.05.003},
doi = {10.1016/J.IPL.2010.05.003},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Xiao10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XiaoPCHW10,
author = {Wenjun Xiao and
Behrooz Parhami and
Weidong Chen and
Mingxin He and
Wenhong Wei},
title = {Fully symmetric swapped networks based on bipartite cluster connectivity},
journal = {Inf. Process. Lett.},
volume = {110},
number = {6},
pages = {211--215},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.12.006},
doi = {10.1016/J.IPL.2009.12.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/XiaoPCHW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XuZ10,
author = {Qiwen Xu and
Naijun Zhan},
title = {Rate monotonic scheduling re-analysed},
journal = {Inf. Process. Lett.},
volume = {110},
number = {6},
pages = {226--231},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.12.010},
doi = {10.1016/J.IPL.2009.12.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/XuZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YamanakaN10,
author = {Katsuhisa Yamanaka and
Shin{-}Ichi Nakano},
title = {A compact encoding of plane triangulations with efficient query supports},
journal = {Inf. Process. Lett.},
volume = {110},
number = {18-19},
pages = {803--809},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.06.014},
doi = {10.1016/J.IPL.2010.06.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YamanakaN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangDT10,
author = {Xiaofan Yang and
Qiang Dong and
Yuan Yan Tang},
title = {Embedding meshes/tori in faulty crossed cubes},
journal = {Inf. Process. Lett.},
volume = {110},
number = {14-15},
pages = {559--564},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.007},
doi = {10.1016/J.IPL.2010.04.007},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YangDT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangLG10,
author = {Weihua Yang and
Hengzhe Li and
Xiaofeng Guo},
title = {A kind of conditional fault tolerance of (n, k)-star graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {22},
pages = {1007--1011},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.015},
doi = {10.1016/J.IPL.2010.08.015},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YangLG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangLM10,
author = {Weihua Yang and
Hengzhe Li and
Jixiang Meng},
title = {Conditional connectivity of Cayley graphs generated by transposition
trees},
journal = {Inf. Process. Lett.},
volume = {110},
number = {23},
pages = {1027--1030},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.09.001},
doi = {10.1016/J.IPL.2010.09.001},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YangLM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YontaTN10,
author = {Paulin Melatagia Yonta and
Maurice Tchuent{\'{e}} and
Ren{\'{e}} Ndoundam},
title = {Routing automorphisms of the hypercube},
journal = {Inf. Process. Lett.},
volume = {110},
number = {20},
pages = {854--860},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.002},
doi = {10.1016/J.IPL.2010.07.002},
timestamp = {Wed, 25 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YontaTN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YuBMZZ10,
author = {Cui Yu and
James Bailey and
Julian Montefusco and
Rui Zhang and
Jiling Zhong},
title = {Enhancing the B\({}^{\mbox{+}}\)-tree by dynamic node popularity caching},
journal = {Inf. Process. Lett.},
volume = {110},
number = {7},
pages = {268--273},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.01.008},
doi = {10.1016/J.IPL.2010.01.008},
timestamp = {Tue, 16 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YuBMZZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YuSGY10,
author = {Lingfei Yu and
Kun She and
Haigang Gong and
Changyuan Yu},
title = {Price of anarchy in parallel processing},
journal = {Inf. Process. Lett.},
volume = {110},
number = {8-9},
pages = {288--293},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.02.003},
doi = {10.1016/J.IPL.2010.02.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YuSGY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZemkeJN10,
author = {Andrew Zemke and
Sandra James and
Darren A. Narayan},
title = {Greedy algorithms for generalized k-rankings of paths},
journal = {Inf. Process. Lett.},
volume = {110},
number = {22},
pages = {979--985},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.011},
doi = {10.1016/J.IPL.2010.07.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZemkeJN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangC10,
author = {Guo{-}Qiang Zhang and
Licong Cui},
title = {A set coverage problem},
journal = {Inf. Process. Lett.},
volume = {110},
number = {4},
pages = {158--159},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.11.012},
doi = {10.1016/J.IPL.2009.11.012},
timestamp = {Sat, 24 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhangC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangKXY10,
author = {Yunong Zhang and
Zhende Ke and
Peng Xu and
Chenfu Yi},
title = {Time-varying square roots finding via Zhang dynamics versus gradient
dynamics and the former's link and new explanation to Newton-Raphson
iteration},
journal = {Inf. Process. Lett.},
volume = {110},
number = {24},
pages = {1103--1109},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.09.013},
doi = {10.1016/J.IPL.2010.09.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangKXY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangV10,
author = {Xiandong Zhang and
Steef L. van de Velde},
title = {On-line two-machine job shop scheduling with time lags},
journal = {Inf. Process. Lett.},
volume = {110},
number = {12-13},
pages = {510--513},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.002},
doi = {10.1016/J.IPL.2010.04.002},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhangV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangW10,
author = {Jingwen Zhang and
Yingqian Wang},
title = {(Delta+1)-total-colorability of plane graphs with maximum degree Delta
at least 6 and without adjacent short cycles},
journal = {Inf. Process. Lett.},
volume = {110},
number = {18-19},
pages = {830--834},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.07.003},
doi = {10.1016/J.IPL.2010.07.003},
timestamp = {Fri, 21 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangXY10,
author = {Zhao Zhang and
Wei Xiong and
Weihua Yang},
title = {A kind of conditional fault tolerance of alternating group graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {22},
pages = {998--1002},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.010},
doi = {10.1016/J.IPL.2010.08.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangXY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangZH10,
author = {Meng Zhang and
Yi Zhang and
Liang Hu},
title = {A faster algorithm for matching a set of patterns with variable length
don't cares},
journal = {Inf. Process. Lett.},
volume = {110},
number = {6},
pages = {216--220},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.12.007},
doi = {10.1016/J.IPL.2009.12.007},
timestamp = {Thu, 31 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhangZH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangZH10a,
author = {Meng Zhang and
Yi Zhang and
Liang Hu},
title = {Pattern matching with wildcards using words of shorter length},
journal = {Inf. Process. Lett.},
volume = {110},
number = {24},
pages = {1099--1102},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.09.011},
doi = {10.1016/J.IPL.2010.09.011},
timestamp = {Thu, 31 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhangZH10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhouHXS10,
author = {Zhenghua Zhou and
Zhi Hu and
Maozhi Xu and
Wangan Song},
title = {Efficient 3-dimensional {GLV} method for faster point multiplication
on some {GLS} elliptic curves},
journal = {Inf. Process. Lett.},
volume = {110},
number = {22},
pages = {1003--1006},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.08.014},
doi = {10.1016/J.IPL.2010.08.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhouHXS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhouX10,
author = {Shuming Zhou and
Wenjun Xiao},
title = {Conditional diagnosability of alternating group networks},
journal = {Inf. Process. Lett.},
volume = {110},
number = {10},
pages = {403--409},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.03.010},
doi = {10.1016/J.IPL.2010.03.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhouX10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZivkovicGH10,
author = {Ales Zivkovic and
Uros Goljat and
Marjan Hericko},
title = {Improving the usability of the source code quality index with interchangeable
metrics sets},
journal = {Inf. Process. Lett.},
volume = {110},
number = {6},
pages = {236--240},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.01.002},
doi = {10.1016/J.IPL.2010.01.002},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZivkovicGH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zhang10,
title = {On 3-choosability of planar graphs with neither adjacent triangles
nor 5-, 6- and 9-cycles},
journal = {Inf. Process. Lett.},
volume = {110},
number = {24},
pages = {1084--1087},
year = {2010},
note = {Withdrawn.},
url = {https://doi.org/10.1016/j.ipl.2010.09.006},
doi = {10.1016/J.IPL.2010.09.006},
timestamp = {Mon, 09 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zhang10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AdamusOSWZ09,
author = {Lech Adamus and
Beata Orchel and
Artur Szymanski and
A. Pawel Wojda and
Malgorzata Zwonek},
title = {A note on t-complementing permutations for graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {2},
pages = {44--45},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.10.004},
doi = {10.1016/J.IPL.2009.10.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AdamusOSWZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlmeidaK09,
author = {Jorge Almeida and
Ondrej Kl{\'{\i}}ma},
title = {A counterexample to a conjecture concerning concatenation hierarchies},
journal = {Inf. Process. Lett.},
volume = {110},
number = {1},
pages = {4--7},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.09.011},
doi = {10.1016/J.IPL.2009.09.011},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlmeidaK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CadaKRR09,
author = {Roman Cada and
Tom{\'{a}}s Kaiser and
Moshe Rosenfeld and
Zdenek Ryj{\'{a}}cek},
title = {Disjoint Hamilton cycles in the star graph},
journal = {Inf. Process. Lett.},
volume = {110},
number = {1},
pages = {30--35},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.10.001},
doi = {10.1016/J.IPL.2009.10.001},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CadaKRR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chen09b,
author = {Xie{-}Bin Chen},
title = {Hamiltonian paths and cycles passing through a prescribed path in
hypercubes},
journal = {Inf. Process. Lett.},
volume = {110},
number = {2},
pages = {77--82},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.10.010},
doi = {10.1016/J.IPL.2009.10.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chen09b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenLZ09,
author = {Lei Chen and
Changhong Lu and
Zhenbing Zeng},
title = {A linear-time algorithm for paired-domination problem in strongly
chordal graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {1},
pages = {20--23},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.09.014},
doi = {10.1016/J.IPL.2009.09.014},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenLZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DeursenR09,
author = {Ton van Deursen and
Sasa Radomirovic},
title = {On a new formal proof model for {RFID} location privacy},
journal = {Inf. Process. Lett.},
volume = {110},
number = {2},
pages = {57--61},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.10.007},
doi = {10.1016/J.IPL.2009.10.007},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DeursenR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GaberRH09,
author = {Mohamed Medhat Gaber and
Uwe R{\"{o}}hm and
Karel Herink},
title = {An analytical study of central and in-network data processing for
wireless sensor networks},
journal = {Inf. Process. Lett.},
volume = {110},
number = {2},
pages = {62--70},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.10.008},
doi = {10.1016/J.IPL.2009.10.008},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GaberRH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HrubesY09,
author = {Pavel Hrubes and
Amir Yehudayoff},
title = {Monotone separations for constant degree polynomials},
journal = {Inf. Process. Lett.},
volume = {110},
number = {1},
pages = {1--3},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.09.003},
doi = {10.1016/J.IPL.2009.09.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HrubesY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HsiehKC09,
author = {Sun{-}Yuan Hsieh and
Che{-}Nan Kuo and
Hsin{-}Hung Chou},
title = {A further result on fault-free cycles in faulty folded hypercubes},
journal = {Inf. Process. Lett.},
volume = {110},
number = {2},
pages = {41--43},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.10.003},
doi = {10.1016/J.IPL.2009.10.003},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HsiehKC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeLP09a,
author = {Kangbok Lee and
Joseph Y.{-}T. Leung and
Michael L. Pinedo},
title = {A note on graph balancing problems with restrictions},
journal = {Inf. Process. Lett.},
volume = {110},
number = {1},
pages = {24--29},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.09.015},
doi = {10.1016/J.IPL.2009.09.015},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LeeLP09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MaL09,
author = {Meijie Ma and
Baodong Liu},
title = {Cycles embedding in exchanged hypercubes},
journal = {Inf. Process. Lett.},
volume = {110},
number = {2},
pages = {71--76},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.10.009},
doi = {10.1016/J.IPL.2009.10.009},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MaL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Okubo09,
author = {Fumiya Okubo},
title = {A note on the descriptional complexity of semi-conditional grammars},
journal = {Inf. Process. Lett.},
volume = {110},
number = {1},
pages = {36--40},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.10.002},
doi = {10.1016/J.IPL.2009.10.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Okubo09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PaiCW09,
author = {Kung{-}Jui Pai and
Jou{-}Ming Chang and
Yue{-}Li Wang},
title = {Upper bounds on the queuenumber of k-ary n-cubes},
journal = {Inf. Process. Lett.},
volume = {110},
number = {2},
pages = {50--56},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.10.006},
doi = {10.1016/J.IPL.2009.10.006},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PaiCW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Papakonstantinou09,
author = {Periklis A. Papakonstantinou},
title = {A note on width-parameterized {SAT:} An exact machine-model characterization},
journal = {Inf. Process. Lett.},
volume = {110},
number = {1},
pages = {8--12},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.09.012},
doi = {10.1016/J.IPL.2009.09.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Papakonstantinou09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Yeh09,
author = {Jyh{-}haw Yeh},
title = {Enforcing non-hierarchical access policies by hierarchical key assignment
schemes},
journal = {Inf. Process. Lett.},
volume = {110},
number = {2},
pages = {46--49},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.10.005},
doi = {10.1016/J.IPL.2009.10.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Yeh09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangC09b,
author = {Jialin Zhang and
Wei Chen},
title = {Implementing uniform reliable broadcast with binary consensus in systems
with fair-lossy links},
journal = {Inf. Process. Lett.},
volume = {110},
number = {1},
pages = {13--19},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.09.013},
doi = {10.1016/J.IPL.2009.09.013},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhangC09b.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-19 04:27 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:
