Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/ipl/ipl102.bht:"
@article{DBLP:journals/ipl/AvoineV07, author = {Gildas Avoine and Serge Vaudenay}, title = {How to safely close a discussion}, journal = {Inf. Process. Lett.}, volume = {102}, number = {4}, pages = {138--142}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.12.001}, doi = {10.1016/J.IPL.2006.12.001}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AvoineV07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Ayala-RinconAS07, author = {Mauricio Ayala{-}Rinc{\'{o}}n and Bruno T. de Abreu and Jos{\'{e}} de Siqueira}, title = {A variant of the Ford-Johnson algorithm that is more space efficient}, journal = {Inf. Process. Lett.}, volume = {102}, number = {5}, pages = {201--207}, year = {2007}, timestamp = {Mon, 30 Apr 2007 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Ayala-RinconAS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Ben-ZwiLN07, author = {Oren Ben{-}Zwi and Oded Lachish and Ilan Newman}, title = {Lower bounds for testing Euclidean Minimum Spanning Trees}, journal = {Inf. Process. Lett.}, volume = {102}, number = {6}, pages = {219--225}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.12.011}, doi = {10.1016/J.IPL.2006.12.011}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Ben-ZwiLN07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Brass07, author = {Peter Brass}, title = {Multidimensional heaps and complementary range searching}, journal = {Inf. Process. Lett.}, volume = {102}, number = {4}, pages = {152--155}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.12.008}, doi = {10.1016/J.IPL.2006.12.008}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Brass07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BrosenneDHW07, author = {Henrik Brosenne and Carsten Damm and Matthias Homeister and Stephan Waack}, title = {On approximation by XOR-OBDDs}, journal = {Inf. Process. Lett.}, volume = {102}, number = {1}, pages = {17--21}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.10.011}, doi = {10.1016/J.IPL.2006.10.011}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BrosenneDHW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ChanCYZZ07, author = {Joseph Wun{-}Tat Chan and Francis Y. L. Chin and Deshi Ye and Yong Zhang and Hong Zhu}, title = {Greedy online frequency allocation in cellular networks}, journal = {Inf. Process. Lett.}, volume = {102}, number = {2-3}, pages = {55--61}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.11.015}, doi = {10.1016/J.IPL.2006.11.015}, timestamp = {Mon, 04 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ChanCYZZ07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ChlebusB07, author = {Edward Chlebus and Jordy Brazier}, title = {Nonstationary Poisson modeling of web browsing session arrivals}, journal = {Inf. Process. Lett.}, volume = {102}, number = {5}, pages = {187--190}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.12.015}, doi = {10.1016/J.IPL.2006.12.015}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ChlebusB07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CostaHLN07, author = {Vaston G. Costa and Edward Hermann Haeusler and Eduardo Sany Laber and Loana Tito Nogueira}, title = {A note on the size of minimal covers}, journal = {Inf. Process. Lett.}, volume = {102}, number = {2-3}, pages = {124--126}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.10.012}, doi = {10.1016/J.IPL.2006.10.012}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/CostaHLN07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/DeoC07, author = {Narsingh Deo and Aurel Cami}, title = {Preferential deletion in dynamic models of web-like networks}, journal = {Inf. Process. Lett.}, volume = {102}, number = {4}, pages = {156--162}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.12.009}, doi = {10.1016/J.IPL.2006.12.009}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/DeoC07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Doyen07, author = {Laurent Doyen}, title = {Robust parametric reachability for timed automata}, journal = {Inf. Process. Lett.}, volume = {102}, number = {5}, pages = {208--213}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.11.018}, doi = {10.1016/J.IPL.2006.11.018}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Doyen07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Gagie07, author = {Travis Gagie}, title = {Dynamic Shannon coding}, journal = {Inf. Process. Lett.}, volume = {102}, number = {2-3}, pages = {113--117}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.09.015}, doi = {10.1016/J.IPL.2006.09.015}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Gagie07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/GoswamiDN07, author = {Partha P. Goswami and Sandip Das and Subhas C. Nandy}, title = {Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set}, journal = {Inf. Process. Lett.}, volume = {102}, number = {4}, pages = {163--168}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.12.010}, doi = {10.1016/J.IPL.2006.12.010}, timestamp = {Sun, 24 Sep 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/GoswamiDN07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/GuoHM07, author = {Jiong Guo and Falk H{\"{u}}ffner and Hannes Moser}, title = {Feedback arc set in bipartite tournaments is NP-complete}, journal = {Inf. Process. Lett.}, volume = {102}, number = {2-3}, pages = {62--65}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.11.016}, doi = {10.1016/J.IPL.2006.11.016}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/GuoHM07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Hammack07, author = {Richard H. Hammack}, title = {Minimum cycle bases of direct products of complete graphs}, journal = {Inf. Process. Lett.}, volume = {102}, number = {5}, pages = {214--218}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.12.012}, doi = {10.1016/J.IPL.2006.12.012}, timestamp = {Sun, 22 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Hammack07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Hesselink07, author = {Wim H. Hesselink}, title = {A linear-time algorithm for Euclidean feature transform sets}, journal = {Inf. Process. Lett.}, volume = {102}, number = {5}, pages = {181--186}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.12.005}, doi = {10.1016/J.IPL.2006.12.005}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Hesselink07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/HonkalaL07, author = {Iiro S. Honkala and Tero Laihonen}, title = {On a new class of identifying codes in graphs}, journal = {Inf. Process. Lett.}, volume = {102}, number = {2-3}, pages = {92--98}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.11.007}, doi = {10.1016/J.IPL.2006.11.007}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/HonkalaL07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/HuYCH07, author = {Ken S. Hu and Shyun{-}Shyun Yeoh and Chiuyuan Chen and Lih{-}Hsing Hsu}, title = {Node-pancyclicity and edge-pancyclicity of hypercube variants}, journal = {Inf. Process. Lett.}, volume = {102}, number = {1}, pages = {1--7}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.10.008}, doi = {10.1016/J.IPL.2006.10.008}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/HuYCH07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/HuangYTPA07, author = {Kuo{-}Si Huang and Chang{-}Biau Yang and Kuo{-}Tsung Tseng and Yung{-}Hsing Peng and Hsing{-}Yen Ann}, title = {Dynamic programming algorithms for the mosaic longest common subsequence problem}, journal = {Inf. Process. Lett.}, volume = {102}, number = {2-3}, pages = {99--103}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.11.006}, doi = {10.1016/J.IPL.2006.11.006}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/HuangYTPA07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/JiC07, author = {Min Ji and T. C. Edwin Cheng}, title = {An {FPTAS} for scheduling jobs with piecewise linear decreasing processing times to minimize makespan}, journal = {Inf. Process. Lett.}, volume = {102}, number = {2-3}, pages = {41--47}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.11.014}, doi = {10.1016/J.IPL.2006.11.014}, timestamp = {Fri, 26 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/JiC07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/JiangLY07, author = {Ming Jiang and Yupin Luo and Shiyuan Yang}, title = {Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm}, journal = {Inf. Process. Lett.}, volume = {102}, number = {1}, pages = {8--16}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.10.005}, doi = {10.1016/J.IPL.2006.10.005}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/JiangLY07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Kowalik07, author = {Lukasz Kowalik}, title = {Adjacency queries in dynamic sparse graphs}, journal = {Inf. Process. Lett.}, volume = {102}, number = {5}, pages = {191--195}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.12.006}, doi = {10.1016/J.IPL.2006.12.006}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Kowalik07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/KuoY07, author = {Wen{-}Hung Kuo and Dar{-}Li Yang}, title = {Single machine scheduling with past-sequence-dependent setup times and learning effects}, journal = {Inf. Process. Lett.}, volume = {102}, number = {1}, pages = {22--26}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.11.002}, doi = {10.1016/J.IPL.2006.11.002}, timestamp = {Tue, 06 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/KuoY07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LaguillaumieV07, author = {Fabien Laguillaumie and Damien Vergnaud}, title = {Multi-designated verifiers signatures: anonymity without encryption}, journal = {Inf. Process. Lett.}, volume = {102}, number = {2-3}, pages = {127--132}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.08.015}, doi = {10.1016/J.IPL.2006.08.015}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/LaguillaumieV07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LaroussinieS07, author = {Fran{\c{c}}ois Laroussinie and Jeremy Sproston}, title = {State explosion in almost-sure probabilistic reachability}, journal = {Inf. Process. Lett.}, volume = {102}, number = {6}, pages = {236--241}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2007.01.003}, doi = {10.1016/J.IPL.2007.01.003}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/LaroussinieS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Latifi07, author = {Shahram Latifi}, title = {A study of fault tolerance in star graph}, journal = {Inf. Process. Lett.}, volume = {102}, number = {5}, pages = {196--200}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.12.013}, doi = {10.1016/J.IPL.2006.12.013}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Latifi07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Lecroq07, author = {Thierry Lecroq}, title = {Fast exact string matching algorithms}, journal = {Inf. Process. Lett.}, volume = {102}, number = {6}, pages = {229--235}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2007.01.002}, doi = {10.1016/J.IPL.2007.01.002}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/Lecroq07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Lin07, author = {Min{-}Sheng Lin}, title = {Fast and simple algorithms to count the number of vertex covers in an interval graph}, journal = {Inf. Process. Lett.}, volume = {102}, number = {4}, pages = {143--146}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.12.002}, doi = {10.1016/J.IPL.2006.12.002}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Lin07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LinY07, author = {Cho{-}Chin Lin and Hao{-}Yun Yin}, title = {Bounds on the multi-clients incremental computing for homogeneous decreasing computation sequences}, journal = {Inf. Process. Lett.}, volume = {102}, number = {1}, pages = {35--40}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.11.001}, doi = {10.1016/J.IPL.2006.11.001}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/LinY07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LuccioEP07, author = {Fabrizio Luccio and Antonio Mesa Enriques and Linda Pagli}, title = {k-Restricted rotation distance between binary trees}, journal = {Inf. Process. Lett.}, volume = {102}, number = {5}, pages = {175--180}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.12.007}, doi = {10.1016/J.IPL.2006.12.007}, timestamp = {Tue, 06 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/LuccioEP07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Marti-Farre07, author = {Jaume Mart{\'{\i}}{-}Farr{\'{e}}}, title = {A note on secret sharing schemes with three homogeneous access structure}, journal = {Inf. Process. Lett.}, volume = {102}, number = {4}, pages = {133--137}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.08.016}, doi = {10.1016/J.IPL.2006.08.016}, timestamp = {Tue, 06 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Marti-Farre07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MehedyHK07, author = {Lenin Mehedy and Md. Kamrul Hasan and Mohammad Kaykobad}, title = {An improved degree based condition for Hamiltonian cycles}, journal = {Inf. Process. Lett.}, volume = {102}, number = {2-3}, pages = {108--112}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.11.013}, doi = {10.1016/J.IPL.2006.11.013}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MehedyHK07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/NagamochiK07, author = {Hiroshi Nagamochi and Yoko Kamidoi}, title = {Minimum cost subpartitions in graphs}, journal = {Inf. Process. Lett.}, volume = {102}, number = {2-3}, pages = {79--84}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.11.011}, doi = {10.1016/J.IPL.2006.11.011}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/NagamochiK07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ObradovicPR07, author = {Nenad Obradovi{\c{c}} and Joseph G. Peters and Goran Ruzic}, title = {Efficient domination in circulant graphs with two chord lengths}, journal = {Inf. Process. Lett.}, volume = {102}, number = {6}, pages = {253--258}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2007.02.004}, doi = {10.1016/J.IPL.2007.02.004}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ObradovicPR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Rampersad07, author = {Narad Rampersad}, title = {On the context-freeness of the set of words containing overlaps}, journal = {Inf. Process. Lett.}, volume = {102}, number = {2-3}, pages = {74--78}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.11.008}, doi = {10.1016/J.IPL.2006.11.008}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Rampersad07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Roy07, author = {Benjamin Van Roy}, title = {A short proof of optimality for the {MIN} cache replacement algorithm}, journal = {Inf. Process. Lett.}, volume = {102}, number = {2-3}, pages = {72--73}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.11.009}, doi = {10.1016/J.IPL.2006.11.009}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Roy07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Sedjelmaci07, author = {Sidi Mohamed Sedjelmaci}, title = {Jebelean-Weber's algorithm without spurious factors}, journal = {Inf. Process. Lett.}, volume = {102}, number = {6}, pages = {247--252}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2007.01.004}, doi = {10.1016/J.IPL.2007.01.004}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Sedjelmaci07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Sherstov07, author = {Alexander A. Sherstov}, title = {Powering requires threshold depth 3}, journal = {Inf. Process. Lett.}, volume = {102}, number = {2-3}, pages = {104--107}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.11.003}, doi = {10.1016/J.IPL.2006.11.003}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Sherstov07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Sidorowicz07, author = {Elzbieta Sidorowicz}, title = {The game chromatic number and the game colouring number of cactuses}, journal = {Inf. Process. Lett.}, volume = {102}, number = {4}, pages = {147--151}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.12.003}, doi = {10.1016/J.IPL.2006.12.003}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/Sidorowicz07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Tan07, author = {Xuehou Tan}, title = {Sweeping simple polygons with the minimum number of chain guards}, journal = {Inf. Process. Lett.}, volume = {102}, number = {2-3}, pages = {66--71}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.11.010}, doi = {10.1016/J.IPL.2006.11.010}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Tan07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Tsai07, author = {Chang{-}Hsiung Tsai}, title = {Cycles embedding in hypercubes with node failures}, journal = {Inf. Process. Lett.}, volume = {102}, number = {6}, pages = {242--246}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.12.016}, doi = {10.1016/J.IPL.2006.12.016}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Tsai07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Tsin07, author = {Yung H. Tsin}, title = {An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity}, journal = {Inf. Process. Lett.}, volume = {102}, number = {1}, pages = {27--34}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.10.010}, doi = {10.1016/J.IPL.2006.10.010}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Tsin07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Vahrenhold07, author = {Jan Vahrenhold}, title = {An in-place algorithm for Klee's measure problem in two dimensions}, journal = {Inf. Process. Lett.}, volume = {102}, number = {4}, pages = {169--174}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.12.004}, doi = {10.1016/J.IPL.2006.12.004}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Vahrenhold07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Wu07, author = {Zhilin Wu}, title = {A note on the characterization of {TL[EF]}}, journal = {Inf. Process. Lett.}, volume = {102}, number = {2-3}, pages = {48--54}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.11.012}, doi = {10.1016/J.IPL.2006.11.012}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Wu07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Xiaofang07, author = {Luo Xiaofang}, title = {The 4-choosability of toroidal graphs without intersecting triangles}, journal = {Inf. Process. Lett.}, volume = {102}, number = {2-3}, pages = {85--91}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.11.005}, doi = {10.1016/J.IPL.2006.11.005}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Xiaofang07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/XuY07, author = {Jun{-}Ming Xu and Chao Yang}, title = {Fault diameter of product graphs}, journal = {Inf. Process. Lett.}, volume = {102}, number = {6}, pages = {226--228}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2007.01.001}, doi = {10.1016/J.IPL.2007.01.001}, timestamp = {Wed, 27 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/XuY07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/YeZ07, author = {Deshi Ye and Guochuan Zhang}, title = {Maximizing the throughput of parallel jobs on hypercubes}, journal = {Inf. Process. Lett.}, volume = {102}, number = {6}, pages = {259--263}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2007.01.005}, doi = {10.1016/J.IPL.2007.01.005}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/YeZ07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/YiCKK07, author = {Kwangkeun Yi and Hosik Choi and Jaehwang Kim and Yongdai Kim}, title = {An empirical study on classification methods for alarms from a bug-finding static {C} analyzer}, journal = {Inf. Process. Lett.}, volume = {102}, number = {2-3}, pages = {118--123}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.11.004}, doi = {10.1016/J.IPL.2006.11.004}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/YiCKK07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.