@article{Lin-Hou/10,
AUTHOR = {Lin, Chin-Yang and Hou, Ting-Wei},
TITLE = {An efficient approach to cyclic reference counting based on a coarse-grained search},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {1},
PAGES = {1-10},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {garbage collection, reference counting, cyclic data structure, algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51726VR-1/2/2a3a20cc5a3edd0a551292d742454e7b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Schweitzer-Schweitzer/10,
AUTHOR = {Schweitzer, Pascal and Schweitzer, Patrick},
TITLE = {Connecting face hitting sets in planar graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {1},
PAGES = {11-15},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, planar graph, face hitting set},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51726VR-3/2/f7039f8cf1ed77cc641e3f81ee53512c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Buhrman-Garcia-Soriano-Matsliah/10,
AUTHOR = {Buhrman, Harry and Garc{\'{i}}a-Soriano, David and Matsliah, Arie},
TITLE = {Learning parities in the mistake-bound model},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {1},
PAGES = {16-21},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {on-line algorithms, parities, mistake-bound, attribute-efficient learning},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51726VR-4/2/c43e1f3ee63fd26bb1e00ebc3f8b897e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhou-Feng/10,
AUTHOR = {Zhou, Jin-Xin and Feng, Yan-Quan},
TITLE = {Super-connected but not super edge-connected graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {1},
PAGES = {22-25},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, connectivity, super-[kappa], super-[lambda]},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51696YH-2/2/ffebd7f721730ff81f08897d23451d9e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Zhang-Jin-Xiang/10,
AUTHOR = {Li, C.H. and Zhang, X.F. and Jin, H. and Xiang, W.},
TITLE = {E-passport EAC scheme based on Identity-Based Cryptography},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {1},
PAGES = {26-30},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {e-passport security, extended access control, identity-based cryptography, safety/security in digital systems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51696YH-3/2/cbd56ea45d980b1f245b23212170c343},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Havill/10,
AUTHOR = {Havill, Jessen T.},
TITLE = {Online malleable job scheduling for $m\le 3$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {1},
PAGES = {31-35},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {online algorithms, scheduling, parallel jobs},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51726VR-5/2/1b3356536f5227eb2072604954082a2a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Liu-Chen-Meng/10,
AUTHOR = {Zhang, Xindong and Liu, Juan and Chen, Xing and Meng, Jixiang},
TITLE = {Domination number of Cartesian products of directed cycles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {1},
PAGES = {36-39},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cartesian product, domination number, efficient dominating set, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-517J2BW-1/2/bf4644bc43846db688e4156b0f205cca},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang/10c,
AUTHOR = {Zhang, Chi},
TITLE = {An improved lower bound on query complexity for quantum PAC learning},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {1},
PAGES = {40-45},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {pac (probably approximately correct) learning, lower bound, quantum algorithm, vc dimension, computational complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51726VR-2/2/5eaf2e3b449d6fbf72a0faa733201309},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pallo/10,
AUTHOR = {Pallo, Jean Marcel},
TITLE = {Root-restricted Kleenean rotations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {1},
PAGES = {46-50},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, kleene theorem, restricted rotation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-519219M-3/2/1d1c0daffdf47ddfcb508875837390e4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lima-Panario-Campello_de_Souza/10,
AUTHOR = {Lima, J.B. and Panario, D. and Campello de Souza, R.M.},
TITLE = {Public-key encryption based on Chebyshev polynomials over GF$(q)$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {2},
PAGES = {51-56},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {chebyshev polynomials, finite fields, cryptography, public-key encryption},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51962XH-1/2/d57d821f1336bb54adc14fc9955e5e76},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lal-Ramalingam/10,
AUTHOR = {Lal, Akash and Ramalingam, G.},
TITLE = {Reference count analysis with shallow aliasing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {2},
PAGES = {57-63},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal methods, program correctness, static analysis, affine-relation analysis, alias analysis, typestate verification},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50SGPJ6-1/2/540949b902f03928f19798484c1ec601},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Binkele-Raible-Fernau-Gaspers-Liedloff/10,
AUTHOR = {Binkele-Raible, Daniel and Fernau, Henning and Gaspers, Serge and Liedloff, Mathieu},
TITLE = {Exact exponential-time algorithms for finding bicliques},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {2},
PAGES = {64-67},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, exact exponential-time algorithms, np-hard problem, complete bipartite subgraphs},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51BNWXD-3/2/5ab46a4e241ae9a37d165dc35bdf986c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Aceto-Ingolfsdottir-Sack/10,
AUTHOR = {Aceto, Luca and Ingolfsdottir, Anna and Sack, Joshua},
TITLE = {Resource bisimilarity and graded bisimilarity coincide},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {2},
PAGES = {68-76},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {concurrency, resource bisimilarity, graded bisimilarity, graded modal logic, kripke frames, coalgebras},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51BNWXD-2/2/1276f9d2a6a3777a04fe46ef9ad61b12},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Choi-Leung-Pinedo/10,
AUTHOR = {Choi, Byung-Cheon and Leung, Joseph Y.-T. and Pinedo, Michael L.},
TITLE = {A note on makespan minimization in proportionate flow shops},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {2},
PAGES = {77-81},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51BYSDN-1/2/bcbf57590f1057bc061ed0746b7ce8b1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Qian-Xu/10,
AUTHOR = {Qian, Haifeng and Xu, Shouhuai},
TITLE = {Non-interactive multisignatures in the plain public-key model with efficient verification},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {2},
PAGES = {82-89},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, multisignature, computational diffie-hellman (cdh) with bilinear maps (co-cdh), discrete logarithm (dl), decisional diffie-hellman (ddh), plain public-key model, random oracle model},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51BHHB2-1/2/611d4fc127f6b77b9faafa25fc49922d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Luo-Lai-Gong/10,
AUTHOR = {Luo, Yiyuan and Lai, Xuejia and Gong, Zheng},
TITLE = {Pseudorandomness analysis of the (extended) Lai-Massey scheme},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {2},
PAGES = {90-96},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, pseudorandomness, strong pseudorandomness, lai-massey scheme},
URL = {http://www.sciencedirect.com/science/article/B6V0F-519219M-1/2/58c1a0e36af36d2eaf3185cdfa68270e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Farrag/10,
AUTHOR = {Farrag, A.A.},
TITLE = {Developing fault-tolerant distributed loops},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {2},
PAGES = {97-101},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {networks, graphs, distributed loops, fault-tolerance},
URL = {http://www.sciencedirect.com/science/article/B6V0F-517S7YB-1/2/22f0ca7647c678b78fcac5ff9ae3ff8b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Katz-Morgenstern/11,
AUTHOR = {Katz, Matthew J. and Morgenstern, Gila},
TITLE = {Settling the bound on the rectilinear link radius of a simple rectilinear polygon},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {3},
PAGES = {103-106},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, combinatorial geometry, rectilinear link-distance},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51FNPH4-1/2/fdca61df39a92acd411d87cf2703b01b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Esik/11,
AUTHOR = {{\'E}sik, Z.},
TITLE = {An undecidable property of context-free linear orders},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {3},
PAGES = {107-109},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, context-free language, lexicographic ordering, decidability},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51BNWXD-1/2/14354448122725658ac0b9b1b4a3ab25},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Katrenic-Schiermeyer/11,
AUTHOR = {Katreni{\v{c}}, J{\'a}n and Schiermeyer, Ingo},
TITLE = {Improved approximation bounds for the minimum rainbow subgraph problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {3},
PAGES = {110-114},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {rainbow subgraph, approximation, algorithm, np-hard},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51F25T9-3/2/b1589f5e1d082ed0e18266b21b91b306},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xu-Gao-Xu/11,
AUTHOR = {Xu, XueLin and Gao, ZongSheng and Xu, Ke},
TITLE = {A tighter upper bound for random MAX 2-SAT},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {3},
PAGES = {115-119},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {max 2-sat, upper bound, first-moment argument, computational complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51F25T9-2/2/9a0de9e6842bc42c2c804c4f115611ad},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Le-Nguyen/11,
AUTHOR = {Le, Van Bang and Nguyen, Ngoc Tuy},
TITLE = {A good characterization of squares of strongly chordal split graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {3},
PAGES = {120-123},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph powers, squares of split graphs, good characterizations, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51FGT4W-1/2/7f52dbbe13c71e5421e9cfb7c5ee2731},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Wu/11a,
AUTHOR = {Zhang, Xin and Wu, Jian-Liang},
TITLE = {On edge colorings of 1-planar graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {3},
PAGES = {124-128},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {1-planar graph, edge-coloring, discharging, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51F25T9-1/2/ff9333b780dae11d737db7f53060bed4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Duarte-Mota-Sampaio/11,
AUTHOR = {Duarte, Rafael and Mota, Alexandre and Sampaio, Augusto},
TITLE = {Introducing concurrency in sequential Java via laws},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {3},
PAGES = {129-134},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal methods, concurrency, parallel processing, performance evaluation, program correctness},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51F7PV4-1/2/804edce35c3c81f9aa19ec3b39761e12},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jung-Chin-Cardoso/11,
AUTHOR = {Jung, Jae-Yoon and Chin, Chang-Ho and Cardoso, Jorge},
TITLE = {An entropy-based uncertainty measure of process models},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {3},
PAGES = {135-141},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {concurrency, real-time system, entropy, process uncertainty, process measure},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51D1617-1/2/79231312ae138037fb475a9450b28b33},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fomin-Golovach-van_Leeuwen/11,
AUTHOR = {Fomin, Fedor V. and Golovach, Petr A. and van Leeuwen, Erik Jan},
TITLE = {Spanners of bounded degree graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {3},
PAGES = {142-144},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, graph spanners, fixed-parameter tractability, np-hardness},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51BNWXD-4/2/65d712e8584147c499f9db577747a3a5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zelke/11,
AUTHOR = {Zelke, Mariano},
TITLE = {Intractability of min- and max-cut in streaming graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {3},
PAGES = {145-150},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, streaming algorithms, intractability, min-cut, max-cut},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51BHHB2-2/2/9669b35486538ccf0e0268b5a4b4e0a2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bollig-Gille/11,
AUTHOR = {Bollig, Beate and Gill{\'e}, Marc},
TITLE = {Randomized OBDDs for the most significant bit of multiplication need exponential space},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {4},
PAGES = {151-155},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, randomized algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51JPWX3-1/2/5cc96a071b5847f4692807b3cbed8d0c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Sun-Li-You/11,
AUTHOR = {Li, Ruilin and Sun, Bing and Li, Chao and You, Jianxiong},
TITLE = {Differential fault analysis on SMS4 using a single fault},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {4},
PAGES = {156-163},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cyptography, fault attacks, differential fault analysis, block cipher, sms4},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51J9DPK-4/2/d3caa6b9147dce941cdb81d5b251cb59},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kochol-Krivonakova-Smejova-Srankova/11,
AUTHOR = {Kochol, Martin and Krivo{\v{n}}{\'a}kov{\'a}, Nad'a and Smejov{\'a}, Silvia and {\v{S}}rankov{\'a}, Katar{\'{i}}na},
TITLE = {Matrix reduction in a combinatorial computation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {4},
PAGES = {164-168},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, rank of a matrix, nowhere-zero 5-flow, girth of a graph},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51J9DPK-2/2/0596c7ea44bd5b04e975b92a94af0e19},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Feder-Subi/11,
AUTHOR = {Feder, Tom{\'a}s and Subi, Carlos},
TITLE = {Maximum gap labelings of graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {4},
PAGES = {169-173},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, maximum gap in graph, minimum edge deletion bipartition, graceful labelling of trees},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51J9DPK-3/2/0f0920daebcae9a24802cc1a8f2ad97d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mosheiov/11,
AUTHOR = {Mosheiov, Gur},
TITLE = {Proportionate flowshops with general position-dependent processing times},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {4},
PAGES = {174-177},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, proportionate flowshop, makespan, position-dependent processing times},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51JPWX3-2/2/bfe2df420d0c103b8f72729da7979a8d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dutting-Henzinger-Weber/11,
AUTHOR = {D{\"u}tting, Paul and Henzinger, Monika and Weber, Ingmar},
TITLE = {Offline file assignments for online load balancing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {4},
PAGES = {178-183},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {load balancing, on-line algorithms, information retrieval, file distribution},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51KK972-4/2/5ccf220685bec6f1553e10b17a5e3278},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Even-Dar-Shapira/11,
AUTHOR = {Even-Dar, Eyal and Shapira, Asaf},
TITLE = {A note on maximizing the spread of influence in social networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {4},
PAGES = {184-187},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, analysis of algorithms, approximation algorithms, social network, voter model, spread maximization},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51KK972-1/2/5719adece3043476ccd64acc15997208},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yang-Yang-Dong-Li/11,
AUTHOR = {Yang, Erjie and Yang, Xiaofan and Dong, Qiang and Li, Jing},
TITLE = {Conditional diagnosability of hypermeshes under the comparison model},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {4},
PAGES = {188-193},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, optical interconnection, conditional diagnosability, comparison model, hypermesh},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51JXFP6-1/2/e04ff42f3a8a48aa989cae34ce13a5b4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Arevalo-Jimenez-Larrea-Mengual/11,
AUTHOR = {Ar{\'e}valo, Sergio and Jim{\'e}nez, Ernesto and Larrea, Mikel and Mengual, Luis},
TITLE = {Communication-efficient and crash-quiescent Omega with unknown membership},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {4},
PAGES = {194-199},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed computing, fault tolerance, unreliable failure detectors},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51J9DPK-5/2/f31c49e4e0e9767e857ba15ee2059b41},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lee-Na-Park/11,
AUTHOR = {Lee, Taehyung and Na, Joong Chae and Park, Kunsoo},
TITLE = {On-line construction of parameterized suffix trees for large alphabets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {5},
PAGES = {201-207},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithm, data structures, design of algorithms, randomized algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51JXFP6-2/2/654ce181c0e2954e47c693439ca190bf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Hwang/11,
AUTHOR = {Lin, Bertrand M.T. and Hwang, F.J.},
TITLE = {Total completion time minimization in a 2-stage differentiation flowshop with fixed sequences per job type},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {5},
PAGES = {208-212},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, scheduling, differentiation flowshop, fixed sequences, dynamic programming},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51KK972-3/2/d71f59189be2cfdf557b584036581caa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gal-Jang/11,
AUTHOR = {G{\'a}l, Anna and Jang, Jing-Tang},
TITLE = {The size and depth of layered Boolean circuits},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {5},
PAGES = {213-217},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, boolean circuits, circuit size, circuit depth, pebble games},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51KK972-5/2/872fb275a7e112c625740261858284a3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Morizumi/11,
AUTHOR = {Morizumi, Hiroki},
TITLE = {Improved approximation algorithms for minimum AND-circuits problem via $k$-set cover},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {5},
PAGES = {218-221},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, circuit minimization problem, k-set cover},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51JXFP6-3/2/536d8023d22c1c7ee4224a49467f7431},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Andres-Hochstattler/11,
AUTHOR = {Andres, Stephan Dominique and Hochst{\"a}ttler, Winfried},
TITLE = {The game chromatic number and the game colouring number of classes of oriented cactuses},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {5},
PAGES = {222-226},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, graph algorithms, game chromatic number, game colouring number, digraph colouring game},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51KK972-2/2/1e594382e8693dc719492f00f91cc8e7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Doerr-Fouz/11,
AUTHOR = {Doerr, Benjamin and Fouz, Mahmoud},
TITLE = {Quasi-random rumor spreading: Reducing randomness can be costly},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {5},
PAGES = {227-230},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {randomness in computation, broadcasting in networks, quasi-randomness, randomized algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51J9DPK-1/2/ea5efaa6cfec529e20cb55abf63d9b5c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Malvestuto-Mezzini-Moscarini/11,
AUTHOR = {Malvestuto, Francesco M. and Mezzini, Mauro and Moscarini, Marina},
TITLE = {Computing simple-path convex hulls in hypergraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {5},
PAGES = {231-234},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, simple-path convexity, simple-path convex hull, totally balanced hypergraphs},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51M60GT-2/2/c55720ece012a4a47aad44813d4c5bd3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen/11,
AUTHOR = {Chen, Xie-Bin},
TITLE = {Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {5},
PAGES = {235-238},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {independent spanning trees, fault-tolerant broadcasting, parallel algorithms, cartesian product, generalized base-b hypercube},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51N22D0-1/2/f84c001d9186f32e3599eaf0a429bd35},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Crescenzi-Di_Ianni-Marino-Merlini-Rossi-Vocca/11,
AUTHOR = {Crescenzi, Pilu and Di Ianni, Miriam and Marino, Andrea and Merlini, Donatella and Rossi, Gianluca and Vocca, Paola},
TITLE = {Smooth movement and Manhattan path based Random Waypoint mobility},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {5},
PAGES = {239-246},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, mobility models, network topology},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51N22D0-6/2/b85004e4cfd0bcab3b8286c8eeeed5b5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gupta-Nawaz-Gong/11,
AUTHOR = {Gupta, Kishan Chand and Nawaz, Yassir and Gong, Guang},
TITLE = {Upper bound for algebraic immunity on a subclass of Maiorana McFarland class of bent functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {5},
PAGES = {247-249},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, algebraic immunity, bent functions, nonlinearity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-519219M-2/2/2bc41df2f9f710781523bd86bb99b6ff},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Narayanaswamy-Subramanian/11,
AUTHOR = {Narayanaswamy, N.S. and Subramanian, C.R.},
TITLE = {Dominating set based exact algorithms for 3-coloring},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {6},
PAGES = {251-255},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, design of algorithms, graph coloring, 3-coloring, exact algorithms, exponential time algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51H707C-1/2/fccf2947f9ac48f814f8e19b654c68d3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Zhang-Xu-Li/11,
AUTHOR = {Zhang, Yong and Zhang, Weiguo and Xu, Weijun and Li, Hongyi},
TITLE = {A risk-reward model for the on-line leasing of depreciable equipment},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {6},
PAGES = {256-261},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {on-line algorithms, risk-reward model, depreciable equipment},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51M60GT-1/2/514fcc290796b4f52424ad9c8f106f70},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Soraluze-Cortinas-Lafuente-Larrea-Freiling/11,
AUTHOR = {Soraluze, Iratxe and Corti{\~n}as, Roberto and Lafuente, Alberto and Larrea, Mikel and Freiling, Felix},
TITLE = {Communication-efficient failure detection and consensus in omission environments},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {6},
PAGES = {262-268},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed computing, fault tolerance, consensus, failure detector, general omission model, communication efficiency},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51N22D0-5/2/6a81f701f22b52609ea5bb4cef734d8e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yan-Wang-Chen/11,
AUTHOR = {Yan, Guofeng and Wang, Jianxin and Chen, Shuhong},
TITLE = {Performance analysis for $X, S$-bottleneck cell in large-scale wireless networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {6},
PAGES = {269-277},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {probabilistic analysis, wireless networks, quasi-birth-death models, bottleneck cell, performance evaluation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51NNPJ9-1/2/6dd01b5577acc886fb83d51d32a07239},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ortin-Garcia/11,
AUTHOR = {Ortin, Francisco and Garc{\'{i}}a, Miguel},
TITLE = {Union and intersection types to support both dynamic and static typing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {6},
PAGES = {278-286},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {programming languages, program specification, compilers, formal languages, type systems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51PH1G2-1/2/2aaa69cd45c68dc2df989436a30a03f5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fiedorowicz/11,
AUTHOR = {Fiedorowicz, Anna},
TITLE = {Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {6},
PAGES = {287-290},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {acyclic edge colouring, combinatorial problems, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51N22D0-2/2/6a851616a408ff18d15b859809a7fcff},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Crochemore-Tischler/11,
AUTHOR = {Crochemore, Maxime and Tischler, German},
TITLE = {Computing Longest Previous non-overlapping Factors},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {6},
PAGES = {291-295},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, longest previous factor, suffix array, ziv-lempel factorisation, text compression, detection of repetitions},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51N22D0-4/2/3f1879fea62ce6f25fd23cc953899c4e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Even-Kortsarz-Nutov/11,
AUTHOR = {Even, Guy and Kortsarz, Guy and Nutov, Zeev},
TITLE = {A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {6},
PAGES = {296-300},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {tree augmentation, laminar family, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51NNPJ9-2/2/401e8801da2bf37398570b5a49c5a121},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kim-Cho/11,
AUTHOR = {Kim, Heeheon and Cho, Yookun},
TITLE = {A new fair scheduling algorithm for periodic tasks on multiprocessors},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {7},
PAGES = {301-309},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {real-time systems, periodic tasks, multiprocessors, least laxity first algorithm, pfair schedules},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51N7RVW-1/2/7ba1bff0a0cf514cd281ed2854bbc761},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Boldi-Vigna/11,
AUTHOR = {Boldi, Paolo and Vigna, Sebastiano},
TITLE = {$E=I+T$: The internal extent formula for compacted tries},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {7},
PAGES = {310-313},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data structures, compacted tries, binary trees, internal path formula},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51R4SWD-1/2/d79f5dc345a61d464baebf20eb9b0a06},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Moody/11,
AUTHOR = {Moody, Dustin},
TITLE = {Using 5-isogenies to quintuple points on elliptic curves},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {7},
PAGES = {314-317},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, elliptic curves, isogenies, point multiplication},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51S25KG-2/2/1d544ca741e6e8d87ab0fd894a9598e5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Peng-Yang-Tseng-Hor/11,
AUTHOR = {Peng, Yung-Hsing and Yang, Chang-Biau and Tseng, Chiou-Ting and Hor, Chiou-Yi},
TITLE = {The indexing for one-dimensional proportionally-scaled strings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {7},
PAGES = {318-322},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, string matching, scale, proportional},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51S25KG-1/2/6f09133cf2bc6ddfd67950b9c85d9c0b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Clifford-Popa/11,
AUTHOR = {Clifford, Rapha{\"e}l and Popa, Alexandru},
TITLE = {Maximum subset intersection},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {7},
PAGES = {323-325},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51N22D0-3/2/cb68b4701941fb72e00369a506878dfa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Biedl-Durocher-Hoos-Luan-Saia-Young/11,
AUTHOR = {Biedl, Therese and Durocher, Stephane and Hoos, Holger H. and Luan, Shuang and Saia, Jared and Young, Maxwell},
TITLE = {A note on improving the performance of approximation algorithms for radiation therapy},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {7},
PAGES = {326-333},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, radiation therapy},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51PH1G2-2/2/32ff0d1a26ef1986170855685d7a434f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Park/11,
AUTHOR = {Park, Moonju},
TITLE = {Comments on ``Generalized rate monotonic schedulability bounds using relative period ratios''},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {7},
PAGES = {334-337},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {real-time systems, scheduling, real-time scheduling, rate-monotonic analysis, schedulability test},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51TGG78-1/2/82d9b745e48a33dac05d67d8c7678e68},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lange/11,
AUTHOR = {Lange, Martin},
TITLE = {$P$-hardness of the emptiness problem for visibly pushdown languages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {7},
PAGES = {338-341},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51S6XF5-1/2/3e8bd9fe69d3944e201f5938e2411327},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Roman/11,
AUTHOR = {Roman, Adam},
TITLE = {The $NP$-completeness of the Road Coloring Problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {7},
PAGES = {342-347},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, synchronization, road coloring problem},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51V5GPM-1/2/5a33dd100fb3c513e23c29c933bcf632},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang/11,
AUTHOR = {Zhang, Liyu},
TITLE = {Proof system representations of degrees of disjoint $NP$-pairs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {7},
PAGES = {348-351},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, degrees of disjoint np-pairs, propositional proof systems, canonical np-pairs},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51W6DT7-1/2/cc997471cd571ff47bc9ca772093b2fa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shafiei-Hoseiny-Farahabady-Movaghar-Sarbazi-Azad/11,
AUTHOR = {Shafiei, T. and Hoseiny-Farahabady, M.R. and Movaghar, A. and Sarbazi-Azad, H.},
TITLE = {On pancyclicity properties of OTIS-mesh},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {8},
PAGES = {353-359},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, pancyclicity, otis-mesh, embedding, path, cycle},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51M60GT-3/2/52881055f819e2edeb8d459ec6151e96},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ma-Zhu/11,
AUTHOR = {Ma, Meijie and Zhu, Liying},
TITLE = {The super connectivity of exchanged hypercubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {8},
PAGES = {360-364},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, exchanged hypercube, connectivity, super connectivity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51XH9CW-1/2/563057f3c08dd68dc5b5afdddb0bf6fe},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hanamura-Iwata/11,
AUTHOR = {Hanamura, Satoshi and Iwata, Shigeki},
TITLE = {Posets with seven linear extensions sortable by three comparisons},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {8},
PAGES = {365-369},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, linear extension, sorting, comparison},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51WV082-1/2/bfbdcb35dad2a4687d52dfd510862c94},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Wang-Liu/11,
AUTHOR = {Li, Jing and Wang, Shiying and Liu, Di},
TITLE = {Pancyclicity of ternary $n$-cube networks under the conditional fault model},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {8},
PAGES = {370-374},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, fault-tolerant, ternary n-cubes, conditional edge-faults, pancyclicity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51XY09J-3/2/1c39b88dbbc4354552de05b0c9eba1d2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tsai/11,
AUTHOR = {Tsai, Ping-Ying},
TITLE = {A note on an optimal result on fault-tolerant cycle-embedding in alternating group graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {8},
PAGES = {375-378},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {hamiltonicity, pancyclicity, fault-tolerance, networks, alternating group graphs},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51XY09J-1/2/4f08fab4634b945af80b41a96aa91fc7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jiang/11,
AUTHOR = {Jiang, Jehn-Ruey},
TITLE = {Nondominated local coteries for resource allocation in grids and clouds},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {8},
PAGES = {379-384},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {mutual exclusion, resource allocation, distributed computing, coteries, quorums, nondomination},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51XY09J-2/2/421dbc0004d53209b5af0a7cc461daa3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Drineas-Zouzias/11,
AUTHOR = {Drineas, Petros and Zouzias, Anastasios},
TITLE = {A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {8},
PAGES = {385-389},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {matrix-valued bernstein bounds, matrix sparsification, algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51YYP2J-1/2/027a0764ef89112c00f1b92b7b448cd4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Chen-Li/11,
AUTHOR = {Li, Yin and Chen, Gong-liang and Li, Jian-hua},
TITLE = {Speedup of bit-parallel Karatsuba multiplier in $GF(2^m)$ generated by trinomials},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {8},
PAGES = {390-394},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {karatsuba, bit-parallel multiplier, cryptography, trinomial},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51WV082-2/2/373d9de3fb70c33afc65cc9aae243e00},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Minh/11,
AUTHOR = {Minh, Ha Quang},
TITLE = {The regularized least squares algorithm and the problem of learning halfspaces},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {8},
PAGES = {395-401},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, analysis of algorithms, computational learning theory, halfspaces, regularized least squares algorithm, kernel},
URL = {http://www.sciencedirect.com/science/article/B6V0F-520J9CY-1/2/d6babe962fe2abe83ba6124c036a110c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhou-Jiang/11,
AUTHOR = {Zhou, Sizhong and Jiang, Jiashang},
TITLE = {Toughness and $(a,b,k)$-critical graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {9},
PAGES = {403-407},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, graph, minimum degree, toughness, [a,b]-factor, (a,b,k)-critical graph},
URL = {http://www.sciencedirect.com/science/article/B6V0F-520J9CY-2/2/84ed150c9f970812f3cc11436b9e6f7e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Aceto-de_Frutos_Escrig-Gregorio-Rodriguez-Ingolfsdottir/11,
AUTHOR = {Aceto, Luca and de Frutos Escrig, David and Gregorio-Rodr{\'{i}}guez, Carlos and Ingolfsdottir, Anna},
TITLE = {Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {9},
PAGES = {408-413},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {concurrency, process algebra, complete simulation, ready simulation, equational logic, non-finitely based algebras},
URL = {http://www.sciencedirect.com/science/article/B6V0F-521NWGG-1/2/dbbb2edcd7124a2cf0803e538b1a4d2d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bajic-Burr/11,
AUTHOR = {Bajic, Dragana and Burr, Alister},
TITLE = {Comments on ``Integer SEC-DED codes for low power communications''},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {9},
PAGES = {414-415},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, integer error control codes, sec-ded codes},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51YBTM9-1/2/cfcfa7ddc4d9a707c95c87c3fd950f23},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {Originally in Inf.~Process.~Lett., Vol. 110, 2010, No. 12-13, 518-520},
}
@article{Yang-Li/11a,
AUTHOR = {Yang, Fan and Li, Xiangwen},
TITLE = {Nowhere-zero 3-flows in dihedral Cayley graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {9},
PAGES = {416-419},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, nowhere-zero 3-flows, dihedral groups, cayley graphs},
URL = {http://www.sciencedirect.com/science/article/B6V0F-522SHNR-1/2/2092da3af42c414dc591294b1d89f5ec},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rampersad-Shallit-Wang/11,
AUTHOR = {Rampersad, Narad and Shallit, Jeffrey and Wang, Ming-wei},
TITLE = {Inverse star, borders, and palstars},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {9},
PAGES = {420-422},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {kleene star, regular language, formal language, context-free language, palstar, prime palstar, shuffle},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5230PX1-2/2/5424289fefcee1d311d9593349779f4f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Min-Liu-Wang/11,
AUTHOR = {Min, Xiao and Liu, Jing and Wang, Yuqing},
TITLE = {Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {9},
PAGES = {423-428},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, reassignment, competitive ratio, optimal algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5230PX1-1/2/8926798bbdd3ed6735d2c45b9f65eec1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Moser/11,
AUTHOR = {Moser, Philippe},
TITLE = {A zero-one SUBEXP-dimension law for BPP},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {9},
PAGES = {429-432},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, complexity theory, resource-bounded measure, resource-bounded dimension, derandomization},
URL = {http://www.sciencedirect.com/science/article/B6V0F-523CDTM-1/2/e16a2849c6dfaf753ee98d04a6feb750},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Virza/11,
AUTHOR = {Virza, Madars},
TITLE = {Sensitivity versus block sensitivity of Boolean functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {9},
PAGES = {433-435},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, combinatorial problems, sensitivity, block sensitivity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-523M8J0-2/2/1715353063ad9060bfbfb23dc3c1c17a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kulich-Kemenova/11,
AUTHOR = {Kulich, Tom{\'a}{\v{s}} and Keme{\v{n}}ov{\'a}, Miroslava},
TITLE = {On the paper of Pascal Schweitzer concerning similarities between incompressibility methods and the Lov{\'a}sz Local Lemma},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {9},
PAGES = {436-439},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {incompressibility, lov{\'o}sz local lemma, ramsey theory, data compression, algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-520TJVX-1/2/44346e6f8fb7172d377a5e6608397acc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gao-Wu-Jiang/11,
AUTHOR = {Gao, Min and Wu, Zhongfu and Jiang, Feng},
TITLE = {Userrank for item-based collaborative filtering recommendation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {9},
PAGES = {440-446},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, personalized recommendation, userrank, collaboration filtering, item-based filtering},
URL = {http://www.sciencedirect.com/science/article/B6V0F-524WF94-1/2/4b6396b9dde02506a2c2c0c846bba6e0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kshemkalyani/11,
AUTHOR = {Kshemkalyani, Ajay D.},
TITLE = {Repeated detection of conjunctive predicates in distributed executions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {9},
PAGES = {447-452},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed computing, predicate detection, intervals, monitoring, causality, global state},
URL = {http://www.sciencedirect.com/science/article/B6V0F-523M8J0-1/2/a7d0e782e3966b3859e53584a9ca4e20},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Herranz-Laguillaumie-Rafols/11,
AUTHOR = {Herranz, Javier and Laguillaumie, Fabien and R{\`a}fols, Carla},
TITLE = {Relations between semantic security and anonymity in identity-based encryption},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {10},
PAGES = {453-460},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, identity-based encryption, selective/adaptive adversaries, semantic security, anonymity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-524N9JR-1/2/950860e87535108a4f5b99f3915964a7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Weng-Yang-Yang/11,
AUTHOR = {Wang, Xu An and Weng, Jian and Yang, Xiaoyuan and Yang, Yanjiang},
TITLE = {Cryptanalysis of an identity based broadcast encryption scheme without random oracles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {10},
PAGES = {461-464},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, identity based broadcast encryption, chosen-ciphertext attack, chosen-plaintext attack},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5265SCW-1/2/24492b17167238e3be2ee79ab4097d05},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Matsumoto-Kamiyama-Imai/11,
AUTHOR = {Matsumoto, Yusuke and Kamiyama, Naoyuki and Imai, Keiko},
TITLE = {An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {10},
PAGES = {465-468},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, matching, edge-coloring},
URL = {http://www.sciencedirect.com/science/article/B6V0F-525YP94-2/2/8f0868f7a6c3c0b99d2d9cda358ec780},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gavril/11,
AUTHOR = {Gavril, Fanica},
TITLE = {Algorithms for induced biclique optimization problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {10},
PAGES = {469-473},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, induced biclique, induced balanced biclique, polygon-circle graph, interval-filament graph, protein-protein-interaction},
URL = {http://www.sciencedirect.com/science/article/B6V0F-525YP94-1/2/09091a6011249f8aecc91ff5c138d9ea},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sung/11,
AUTHOR = {Sung, Jaechul},
TITLE = {Differential cryptanalysis of eight-round SEED},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {10},
PAGES = {474-478},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, cryptanalysis, block cipher, seed},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5259C96-1/2/a1282d16b3368a81f682359d3f23e912},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jansen-Solis-Oba/11,
AUTHOR = {Jansen, Klaus and Solis-Oba, Roberto},
TITLE = {A simple $OPT+1$ algorithm for cutting stock under the modified integer round-up property assumption},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {10},
PAGES = {479-482},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cutting stock, algorithms, modified integer round-up property},
URL = {http://www.sciencedirect.com/science/article/B6V0F-527GJF3-1/2/851586abb5c9008d426dd232047f0e03},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Martinez-Garcia-Navarro-Arribas-Borrell/11,
AUTHOR = {Mart{\'{i}}nez-Garc{\'{i}}a, Carles and Navarro-Arribas, Guillermo and Borrell, Joan},
TITLE = {Fuzzy role-based access control},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {10},
PAGES = {483-487},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {safety/security in digital systems, databases, role-based access control, uncertainty},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5281T12-2/2/77baad0482bbcc49805ea05cdede0f70},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lou-Sun-Tartary/11,
AUTHOR = {Lou, Tiancheng and Sun, Xiaoming and Tartary, Christophe},
TITLE = {Bounds and trade-offs for Double-Base Number Systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {10},
PAGES = {488-493},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, elliptic curve cryptography, scalar multiplication, double-base number system, double-base chain},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5281T12-1/2/4c04a5ce4a768ff5b6d983310cad4f2e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tang-Xu-Qi/11,
AUTHOR = {Tang, Chunming and Xu, Maozhi and Qi, Yanfeng},
TITLE = {Faster pairing computation on genus 2 hyperelliptic curves},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {10},
PAGES = {494-499},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, genus 2 hyperelliptic curves, pairing-based cryptography, efficiently computable endomorphisms, pairing computation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-52890JB-1/2/d2d30c02e5bd49e954a65eecb60f4998},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kirsten-Quaas/11,
AUTHOR = {Kirsten, D. and Quaas, K.},
TITLE = {Recognizability of the support of recognizable series over the semiring of the integers is undecidable},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {10},
PAGES = {500-502},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, formal power series, weighted automata, post[modifier letter apostrophe]s correspondence problem, supports},
URL = {http://www.sciencedirect.com/science/article/B6V0F-528YXCH-2/2/960e676feff364c58f07658aa29a90c1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Duan-Xu/11,
AUTHOR = {Duan, Mei-jiao and Xu, Jing},
TITLE = {An efficient location-based compromise-tolerant key management scheme for sensor networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {11},
PAGES = {503-507},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, wireless sensor networks, security in digital systems, key management, location},
URL = {http://www.sciencedirect.com/science/article/B6V0F-529671D-1/2/c9b6d51c7db4dad7e51f568ec944ccb0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Berry-Pogorelcnik/11,
AUTHOR = {Berry, Anne and Pogorelcnik, Romain},
TITLE = {A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {11},
PAGES = {508-511},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, lexbfs, mcs, minimal separator, maximal clique, moplex ordering},
URL = {http://www.sciencedirect.com/science/article/B6V0F-529CNRH-1/2/d18fd2affe049b0c0ff2700fe1385c34},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Aumasson-Phan/11,
AUTHOR = {Aumasson, Jean-Philippe and Phan, Raphael C.-W.},
TITLE = {On the cryptanalysis of the hash function fugue: Partitioning and inside-out distinguishers},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {11},
PAGES = {512-515},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, hash functions, cryptanalysis, fugue},
URL = {http://www.sciencedirect.com/science/article/B6V0F-528YXCH-1/2/0cc704e02fc03bb1ad5b50fa923189b2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Grabowski-Faro-Giaquinta/11,
AUTHOR = {Grabowski, Szymon and Faro, Simone and Giaquinta, Emanuele},
TITLE = {String matching with inversions and translocations in linear average time (most of the time)},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {11},
PAGES = {516-520},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximate string matching, algorithms, bioinformatics},
URL = {http://www.sciencedirect.com/science/article/B6V0F-528YXCH-3/2/3cf2ec7e459c7a4565162302bc8270b0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Apostolico-Barbares-Pizzi/11,
AUTHOR = {Apostolico, Alberto and Barbares, Manuel and Pizzi, Cinzia},
TITLE = {Speedup for a periodic subgraph miner},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {11},
PAGES = {521-523},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, analysis of algorithms, dynamic networks, periodic graph},
URL = {http://www.sciencedirect.com/science/article/B6V0F-529V176-1/2/f68d0fe3854a44bc60feacd9d60211d8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Han-Li-Yang/11,
AUTHOR = {Han, Xixian and Li, Jianzhong and Yang, Donghua},
TITLE = {Supporting early pruning in top-$k$ query processing on massive data},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {11},
PAGES = {524-532},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {massive data, top-k, tkep, early pruning, databases},
URL = {http://www.sciencedirect.com/science/article/B6V0F-52BGCVN-1/2/09dd21a1942f7493aa15ef0edaad2c30},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Krumke-Thielen/11,
AUTHOR = {Krumke, Sven O. and Thielen, Clemens},
TITLE = {Minimum cost flows with minimum quantities},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {11},
PAGES = {533-537},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {minimum cost flow, computational complexity, approximation scheme},
URL = {http://www.sciencedirect.com/science/article/B6V0F-52BPK5N-2/2/313c0a6c147610792774d46a015e7dd4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {see Erratum in Inf.~Process.~Lett., Vol. 112, 2012, No. 13, 523-524},
}
@article{Li-Rudra-Swaminathan/11,
AUTHOR = {Li, Xiaozhou and Rudra, Atri and Swaminathan, Ram},
TITLE = {Flexible coloring},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {11},
PAGES = {538-540},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, graph algorithms, graph coloring, hardness of approximation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-52BPK5N-1/2/532917ae2aa4a968493bde6ed2539960},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mansour-Nassar-Vajnovszki/11,
AUTHOR = {Mansour, Toufik and Nassar, Ghalib and Vajnovszki, Vincent},
TITLE = {Loop-free Gray code algorithm for the $\bf e$-restricted growth functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {11},
PAGES = {541-544},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, gray codes, loop-free algorithms, partitions, e-restricted growth functions},
URL = {http://www.sciencedirect.com/science/article/B6V0F-52BWW25-1/2/49438a54d16d119fc279f2e38b940191},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yan-Chrobak/11,
AUTHOR = {Yan, Li and Chrobak, Marek},
TITLE = {Approximation algorithms for the Fault-Tolerant Facility Placement problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {11},
PAGES = {545-549},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-52C3K5R-1/2/2762c5ea0c2a26c4d39305cd4e514e68},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lavin_Puente/11,
AUTHOR = {Lav{\'{i}}n Puente, V{\'{i}}ctor},
TITLE = {Learning a subclass of $k$-quasi-Horn formulas with membership queries},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {11},
PAGES = {550-555},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {query learning, boolean formulas, theory of computation},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011000718},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Du-Xu/11,
AUTHOR = {Du, Zheng-Zhong and Xu, Jun-Ming},
TITLE = {A note on cycle embedding in hypercubes with faulty vertices},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {12},
PAGES = {557-560},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorics, cycle, graph, hypercube, fault tolerance},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011000652},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhou-Fan-Jia-Zhang/11,
AUTHOR = {Zhou, Wujun and Fan, Jianxi and Jia, Xiaohua and Zhang, Shukui},
TITLE = {The spined cube: A new hypercube variant with smaller diameter},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {12},
PAGES = {561-567},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection network, bc graph, spined cube, diameter},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011000743},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Thomasian-Xu/11,
AUTHOR = {Thomasian, Alexander and Xu, Jun},
TITLE = {$X$-code double parity array operation with two disk failures},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {12},
PAGES = {568-574},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {disk arrays, erasure coding, raid, performance analysis, fault tolerance, performance evaluation},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011000640},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Yuan-Fan/11,
AUTHOR = {Li, Shisheng and Yuan, Jinjiang and Fan, Baoqiang},
TITLE = {Unbounded parallel-batch scheduling with family jobs and delivery coordination},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {12},
PAGES = {575-582},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {parallel-batch scheduling, family jobs, batch delivery, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011000779},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mahmood-Khan/11,
AUTHOR = {Mahmood, Sajjad and Khan, Azhar},
TITLE = {An industrial study on the importance of software component documentation: A system integrator's perspective},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {12},
PAGES = {583-590},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {software engineering, component based systems, software components, integration, component documentation},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011000755},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fabila-Monroy-Huemer-Lara/11,
AUTHOR = {Fabila-Monroy, Ruy and Huemer, Clemens and Lara, Dolores},
TITLE = {A combinatorial property on angular orders of plane point sets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {12},
PAGES = {591-594},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, point set, convex angle, star-shaped polygon},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901100072X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Saso-Kobayashi-Nakamura/11,
AUTHOR = {Saso, Takashi and Kobayashi, Kojiro and Nakamura, Atsuyoshi},
TITLE = {On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {12},
PAGES = {595-599},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {burrows-wheeler transformation, block sorting, suffix arrays, data compression, analysis of algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011000731},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Caceres-Daley-DeJesus-Hintze-Moore-John/11,
AUTHOR = {Caceres, Alan Joseph J. and Daley, Samantha and DeJesus, John and Hintze, Michael and Moore, Diquan and John, Katherine St.},
TITLE = {Walks in phylogenetic treespace},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {12},
PAGES = {600-604},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, computational biology, tree metrics, phylogenetics},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011000780},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zalinescu/11,
AUTHOR = {Z{\v{a}}linescu, Eugen},
TITLE = {Shorter strings containing all $k$-element permutations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {12},
PAGES = {605-608},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, permutations, subsequences},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011000810},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhu-Zhu-Jiang/11,
AUTHOR = {Zhu, Jianghan and Zhu, Xiaomin and Jiang, Jianqing},
TITLE = {Improving adaptivity and fairness of processing real-time tasks with QoS requirements on clusters through dynamic scheduling},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {12},
PAGES = {609-613},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cluster, real-time, scheduling, adaptivity, fairness},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011000834},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Esparza-Ganty-Kiefer-Luttenberger/11,
AUTHOR = {Esparza, Javier and Ganty, Pierre and Kiefer, Stefan and Luttenberger, Michael},
TITLE = {Parikh's theorem: A simple and direct automaton construction},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {12},
PAGES = {614-619},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, context-free language, regular language, parikh image},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011000822},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Lin/11,
AUTHOR = {Wang, Feng and Lin, Wensong},
TITLE = {Group path covering and distance two labeling of graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {13},
PAGES = {621-625},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, l(d,1)-labeling, l'(d,1)-labeling, path covering, t-group path covering, bipartite graph},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011000792},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{van_Glabbeek-Goltz-Schicke/11,
AUTHOR = {van Glabbeek, Rob J. and Goltz, Ursula and Schicke, Jens-Wolfhard},
TITLE = {Abstract processes of place/transition systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {13},
PAGES = {626-633},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {concurrency, petri nets, p/t systems, causal semantics, processes},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011000767},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Desmedt/11,
AUTHOR = {Wang, Yongge and Desmedt, Yvo},
TITLE = {Edge-colored graphs with applications to homogeneous faults},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {13},
PAGES = {634-641},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graphs, network security, network reliability, homogeneous faults, fault tolerance},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011000809},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ketema/11,
AUTHOR = {Ketema, Jeroen},
TITLE = {Counterexamples in infinitary rewriting with non-fully-extended rules},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {13},
PAGES = {642-646},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {programming calculi, infinitary rewriting, higher-order rewriting},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011000925},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xu/11,
AUTHOR = {Xu, Yian},
TITLE = {On acyclic edge coloring of toroidal graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {13},
PAGES = {647-649},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithm, acyclic edge coloring, maximum degree, toroidal graphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001037},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vajnovszki-Vernay/11,
AUTHOR = {Vajnovszki, V. and Vernay, R.},
TITLE = {Restricted compositions and permutations: From old to new Gray codes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {13},
PAGES = {650-655},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, gray codes, (bounded) compositions of an integer, permutations, inversion table},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011000913},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bogdanov-Shibutani/11,
AUTHOR = {Bogdanov, Andrey and Shibutani, Kyoji},
TITLE = {Analysis of 3-line generalized Feistel networks with double SD-functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {13},
PAGES = {656-660},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, block ciphers, generalized feistel networks, substitution diffusion networks, differential and linear cryptanalysis, efficiency, impossible differential},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011000937},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Hsu-Huang/11,
AUTHOR = {Lin, Han-Yu and Hsu, Chien-Lung and Huang, Shih-Kun},
TITLE = {Improved convertible authenticated encryption scheme with provable security},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {13},
PAGES = {661-666},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, convertible, authenticated encryption, elgamal system, provable security, random oracle model},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011000846},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cechlarova-Jelinkova/11,
AUTHOR = {Cechl{\'a}rov{\'a}, Katar{\'{i}}na and Jel{\'{i}}nkov{\'a}, Eva},
TITLE = {An efficient implementation of the equilibrium algorithm for housing markets with duplicate houses},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {13},
PAGES = {667-670},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {housing market, economic equilibrium, algorithm},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001050},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Weimann-Peleg/11,
AUTHOR = {Weimann, Oren and Peleg, David},
TITLE = {A note on exact distance labeling},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {14},
PAGES = {671-673},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {labeling schemes, shortest paths, graph algorithms, distributed systems},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001062},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Atallah-Duket/11,
AUTHOR = {Atallah, Mikhail J. and Duket, Timothy W.},
TITLE = {Pattern matching in the Hamming distance with thresholds},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {14},
PAGES = {674-677},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, pattern matching, convolution, hamming distance},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001049},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Xu-Zheng-Liu/11,
AUTHOR = {Zhang, Wenming and Xu, Yinfeng and Zheng, Feifeng and Liu, Ming},
TITLE = {Online algorithms for the general $k$-search problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {14},
PAGES = {678-682},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {time series search, one-way trading, online algorithm, competitive ratio},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001141},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tu-Zhou/11,
AUTHOR = {Tu, Jianhua and Zhou, Wenli},
TITLE = {A factor 2 approximation algorithm for the vertex cover $P_3$ problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {14},
PAGES = {683-686},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial optimization, approximation algorithm, vertex cover pn problem},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001153},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nose/11,
AUTHOR = {Nose, Peter},
TITLE = {Security weaknesses of authenticated key agreement protocols},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {14},
PAGES = {687-696},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, authentication, key agreement, key exchange, two-party, three-party, tripartite, bilinear pairing},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001074},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Junosza-Szaniawski-Rzazewski/11,
AUTHOR = {Junosza-Szaniawski, Konstanty and Rz{\c{a}}{\.z}ewski, Pawe{\l}},
TITLE = {On the complexity of exact algorithm for $L(2,1)$-labeling of graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {14},
PAGES = {697-701},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, combinatorial problems, graph algorithms, l(2,1)-labeling, graph coloring model, exact algorithm},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001165},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Liang-Bai/11,
AUTHOR = {Zhang, Jinshan and Liang, Heng and Bai, Fengshan},
TITLE = {Approximating partition functions of the two-state spin system},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {14},
PAGES = {702-710},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, two-state spin system, ising model, gibbs measure, uniqueness of gibbs measure, fptas, strong correlation decay},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001189},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Schmidt-Schauss-Sabel-Machkasova/11,
AUTHOR = {Schmidt-Schau{\ss}, Manfred and Sabel, David and Machkasova, Elena},
TITLE = {Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {14},
PAGES = {711-716},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {contextual semantics, formal semantics, programming calculi, program correctness},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001177},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bocker-Damaschke/11,
AUTHOR = {B{\'o}cker, Sebastian and Damaschke, Peter},
TITLE = {Even faster parameterized cluster deletion and cluster editing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {14},
PAGES = {717-721},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, cluster editing, parameterized complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001232},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bera/11,
AUTHOR = {Bera, Debajyoti},
TITLE = {A lower bound method for quantum circuits},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {15},
PAGES = {723-726},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, quantum circuit, circuit complexity theory, lower bound, parity function},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001220},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cygan-Kowalik/11,
AUTHOR = {Cygan, Marek and Kowalik, {\L}ukasz},
TITLE = {Channel assignment via fast zeta transform},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {15},
PAGES = {727-730},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, channel assignment, inclusion-exclusion, exact algorithm, l(2,1)-labeling},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001281},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Adamczyk/11,
AUTHOR = {Adamczyk, Marek},
TITLE = {Improved analysis of the greedy algorithm for stochastic matching},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {15},
PAGES = {731-737},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, approximation algorithms, stochastic optimization},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901100127X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Oanea/11,
AUTHOR = {Oanea, Olivia},
TITLE = {Boundedness of adaptive nets is decidable},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {15},
PAGES = {738-743},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {adaptive nets, boundedness, decidability, theory of computation},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001244},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tang-Chen/11,
AUTHOR = {Tang, Qiang and Chen, Liqun},
TITLE = {Extended KCI attack against two-party key establishment protocols},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {15},
PAGES = {744-747},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, key establishment, kci attack, extended kci attack},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001293},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hocquard/11,
AUTHOR = {Hocquard, Herv{\'e}},
TITLE = {Graphs with maximum degree 6 are acyclically 11-colorable},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {15},
PAGES = {748-753},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, graph coloring, bounded degree graphs, acyclic coloring},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001256},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Afrati-Cohen-Kuper/11,
AUTHOR = {Afrati, Foto N. and Cohen, Sara and Kuper, Gabriel},
TITLE = {On the complexity of tree pattern containment with arithmetic comparisons},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {15},
PAGES = {754-760},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {databases, query containment, tree patterns, xpath queries, arithmetic comparisons},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001207},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yuan-Kan/11,
AUTHOR = {Yuan, Chen and Kan, Haibin},
TITLE = {Holographic reduction for some counting problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {15},
PAGES = {761-766},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, holographic reduction, dichotomy, \#p},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001402},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wu-Lu-Wang/11,
AUTHOR = {Wu, Qian and Lu, Qiuli and Wang, Yingqian},
TITLE = {$(\Delta+1)$-total-colorability of plane graphs of maximum degree $\Delta \ge 6$, with neither chordal 5-cycle nor chordal 6-cycle},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {15},
PAGES = {767-772},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, plane graph, total coloring, maximum degree, chordal cycle},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001268},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Chang-Chin-Ting-Tsin/11,
AUTHOR = {Zhang, Yong and Chang, Zhuo and Chin, Francis Y.L. and Ting, Hing-Fung and Tsin, Yung H.},
TITLE = {Uniformly inserting points on square grid},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {16},
PAGES = {773-779},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, computational geometry, grid, point insertion, uniformity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001219},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yi-Chen-Lu/11,
AUTHOR = {Yi, Chenfu and Chen, Yuhuan and Lu, Zhongliang},
TITLE = {Improved gradient-based neural networks for online solution of Lyapunov matrix equation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {16},
PAGES = {780-786},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, online algorithms, parallel processing, real-time systems, gradient-based neural networks, activation function, lyapunov equation, global convergence},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001384},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Policriti-Tomescu/11,
AUTHOR = {Policriti, Alberto and Tomescu, Alexandru I.},
TITLE = {Counting extensional acyclic digraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {16},
PAGES = {787-791},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {extensional digraph, transitive set, recurrence formula, automorphism group, combinatorial problems, set theory},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001426},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Geetha-Kabilan-Chockalingam-Kamaraj/11,
AUTHOR = {Geetha, S. and Kabilan, V. and Chockalingam, S.P. and Kamaraj, N.},
TITLE = {Varying radix numeral system based adaptive image steganography},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {16},
PAGES = {792-797},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, security in digital systems, adaptive data hiding, image steganography, information security, varying radices},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001414},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Miao-Zhang-Cao/11,
AUTHOR = {Miao, Cuixia and Zhang, Yuzhong and Cao, Zhigang},
TITLE = {Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {16},
PAGES = {798-803},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, parallel-batch scheduling, deteriorating job, np-hard, fully polynomial time approximation scheme (fptas)},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001529},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{David-Papakonstantinou-Sidiropoulos/11,
AUTHOR = {David, Matei and Papakonstantinou, Periklis A. and Sidiropoulos, Anastasios},
TITLE = {How strong is Nisan's pseudo-random generator?},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {16},
PAGES = {804-808},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, nisan[modifier letter apostrophe]s pseudo-random generator, derandomization, space bounded},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001190},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Tang-Wu-Saunders/11,
AUTHOR = {Li, M.S. and Tang, W.J. and Wu, Q.H. and Saunders, J.R.},
TITLE = {Paired-bacteria optimiser --- A simple and fast algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {16},
PAGES = {809-813},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, theory of computation, pseudo gradient, quorum sensing, optimisation},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001396},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fomin-Lokshtanov-Raman-Saurabh/11,
AUTHOR = {Fomin, Fedor V. and Lokshtanov, Daniel and Raman, Venkatesh and Saurabh, Saket},
TITLE = {Subexponential algorithms for partial cover problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {16},
PAGES = {814-818},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, parameterized algorithms, subexponential algorithms, partial cover problems, partial dominating set},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901100144X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lucarelli-Milis/11,
AUTHOR = {Lucarelli, Giorgio and Milis, Ioannis},
TITLE = {Improved approximation algorithms for the Max Edge-Coloring problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {16},
PAGES = {819-823},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, max edge-coloring, trees, bipartite and general graphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001530},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Koukouvinos-Pillwein-Simos-Zafeirakopoulos/11,
AUTHOR = {Koukouvinos, Christos and Pillwein, Veronika and Simos, Dimitris E. and Zafeirakopoulos, Zafeirakis},
TITLE = {On the average complexity for the verification of compatible sequences},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {17},
PAGES = {825-830},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {sequences, periodic autocorrelation function, non-periodic autocorrelation function, complexity, algorithms, average-case analysis, symbolic computation},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001438},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xu-Chen-Ye-Zhang/11,
AUTHOR = {Xu, Haifeng and Chen, Lin and Ye, Deshi and Zhang, Guochuan},
TITLE = {Scheduling on two identical machines with a speed-up resource},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {17},
PAGES = {831-835},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, fptas, online algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001566},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hou-Roussel-Wu/11,
AUTHOR = {Hou, Jianfeng and Roussel, Nicolas and Wu, Jianliang},
TITLE = {Acyclic chromatic index of planar graphs with triangles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {17},
PAGES = {836-840},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, acyclic edge coloring, planar graph, distance between triangles},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001578},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Taheri-Neamatollahi-Naghibzadeh/11,
AUTHOR = {Taheri, Hoda and Neamatollahi, Peyman and Naghibzadeh, Mahmoud},
TITLE = {A hybrid token-based distributed mutual exclusion algorithm using wraparound two-dimensional array logical topology},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {17},
PAGES = {841-847},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {token-based algorithm, mutual exclusion, distributed systems, hybrid algorithm, concurrency, message exchange},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001554},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Frieze-Melsted/11,
AUTHOR = {Frieze, Alan and Melsted, P{\'a}ll},
TITLE = {Randomly coloring simple hypergraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {17},
PAGES = {848-853},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, random colorings, markov chain, glauber dynamics},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901100158X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gomez-Gutierrez-Ibeas/11,
AUTHOR = {G{\'o}mez, Domingo and Gutierrez, Jaime and Ibeas, {\'A}lvar},
TITLE = {On the linear complexity of the Naor-Reingold sequence},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {17},
PAGES = {854-856},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, pseudorandom numbers, linear complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001517},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bakhshi-Endrullis-Fokkink-Pang/11,
AUTHOR = {Bakhshi, Rena and Endrullis, J{\"o}rg and Fokkink, Wan and Pang, Jun},
TITLE = {Fast leader election in anonymous rings with bounded expected delay},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {17},
PAGES = {864-870},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed computing, design of algorithms, analysis of algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001682},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gao-Liu/11,
AUTHOR = {Gao, Weifeng and Liu, Sanyang},
TITLE = {Improved artificial bee colony algorithm for global optimization},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {17},
PAGES = {871-882},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {randomized algorithms, artificial bee colony algorithm, initial population, solution search equation, search mechanism},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001670},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cao-Visconti-Zhang/11,
AUTHOR = {Cao, Zhenfu and Visconti, Ivan and Zhang, Zongyang},
TITLE = {On constant-round concurrent non-malleable proof systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {18},
PAGES = {883-890},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, concurrent non-malleability, zero-knowledge proofs, witness-indistinguishable proofs},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001694},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Honma-Abe-Masuyama/11,
AUTHOR = {Honma, Hirotoshi and Abe, Kodai and Masuyama, Shigeru},
TITLE = {Erratum and Addendum to ``A linear time algorithm for finding all hinge vertices of a permutation graph''},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {18},
PAGES = {891-894},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, design of algorithms, permutation graphs, hinge vertices},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011000238},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {Orignally in Inf.~Process.~Lett., Vol. 59, 1996, No. 2, 103-107},
}
@article{Yuval/11,
AUTHOR = {Yuval, Filmus},
TITLE = {Lower bounds for context-free grammars},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {18},
PAGES = {895-898},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, context-free grammars, lower bounds},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001712},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cao-Brglez-Spacapan-Vumar/11,
AUTHOR = {Cao, Xiang-Lan and Brglez, {\v{S}}pela and {\v{S}}pacapan, Simon and Vumar, Elkin},
TITLE = {On edge connectivity of direct products of graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {18},
PAGES = {899-902},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, connectivity, direct product, graph product, separating set},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001724},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Poon-Xu/11,
AUTHOR = {Zhang, Guiqing and Poon, Chung Keung and Xu, Yinfeng},
TITLE = {The ski-rental problem with multiple discount options},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {18},
PAGES = {903-906},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {ski-rental problem, multiple options, on-line algorithms, competitive analysis, lower bound},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001839},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Yuan/11,
AUTHOR = {Li, Wenhua and Yuan, Jinjiang},
TITLE = {Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {18},
PAGES = {907-911},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {online algorithms, scheduling, parallel-batch machines, maximum flow-time, competitive ratio},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001736},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dolev-Dubois-Potop-Butucaru-Tixeuil/11,
AUTHOR = {Dolev, Shlomi and Dubois, Swan and Potop-Butucaru, Maria and Tixeuil, S{\'e}bastien},
TITLE = {Stabilizing data-link over non-FIFO channels with optimal fault-resilience},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {18},
PAGES = {912-920},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {self-stabilization, distributed algorithms, fault-tolerance},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001815},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Arockiaraj-Manuel-Rajasingh-Rajan/11,
AUTHOR = {Arockiaraj, M. and Manuel, Paul and Rajasingh, Indra and Rajan, Bharati},
TITLE = {Wirelength of 1-fault Hamiltonian graphs into wheels and fans},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {18},
PAGES = {921-925},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, embedding, congestion, wirelength, f-fault hamiltonian},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001827},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shi-Niu-Lu/11,
AUTHOR = {Shi, Hai-zhong and Niu, Pan-feng and Lu, Jian-bo},
TITLE = {One conjecture of bubble-sort graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {18},
PAGES = {926-929},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, cayley graph, bubble-sort graph, decomposition of bubble-sort graphs, hamiltonian cycle},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001700},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Becher-Heiber/11,
AUTHOR = {Becher, Ver{\'o}nica and Heiber, Pablo Ariel},
TITLE = {On extending {de Bruijn} sequences},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {18},
PAGES = {930-932},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, graph algorithms, de bruijn sequences, word problems},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001840},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jager-Peczarski/11,
AUTHOR = {J{\"a}ger, Gerold and Peczarski, Marcin},
TITLE = {The number of pessimistic guesses in Generalized Black-peg Mastermind},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {19},
PAGES = {933-940},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, algorithms, mastermind, logic game, computer aided proof},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001803},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Grimson-Heintz-Kuijpers/11,
AUTHOR = {Grimson, Rafael and Heintz, Joos and Kuijpers, Bart},
TITLE = {Efficient evaluation of specific queries in constraint databases},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {19},
PAGES = {941-944},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {constraint databases, query evaluation, computational complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001864},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Palash/11,
AUTHOR = {Palash, Sarkar},
TITLE = {Tweakable enciphering schemes using only the encryption function of a block cipher},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {19},
PAGES = {945-955},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, block cipher, disk encryption, mode of operation, stream cipher, tweakable enciphering scheme},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001852},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yum-Lee/11,
AUTHOR = {Yum, Dae Hyun and Lee, Pil Joong},
TITLE = {On the average cost of order-preserving encryption based on hypergeometric distribution},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {19},
PAGES = {956-959},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, order-preserving encryption, hypergeometric distribution},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001906},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sandeep/11,
AUTHOR = {Sandeep, R.B.},
TITLE = {Perfectly colorable graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {19},
PAGES = {960-961},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, perfect graphs, perfect coloring, perfectly colorable graphs, perfect paw-free graphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001876},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Daniel/11,
AUTHOR = {Daniel, Oron},
TITLE = {Scheduling a batching machine with convex resource consumption functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {19},
PAGES = {962-967},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, batching machine, makespan, total completion time, resource consumption function, workload, ideal schedules},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001918},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Puente-Hermo/11,
AUTHOR = {Puente, V{\'{i}}ctor Lav{\'{i}}n and Hermo, Montserrat},
TITLE = {Negative results on learning multivalued dependencies with queries},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {19},
PAGES = {968-972},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {query learning, databases, propositional formulas, multivalued dependencies},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001992},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ching-Lueh/11,
AUTHOR = {Ching-Lueh, Chang},
TITLE = {Triggering cascades on undirected connected graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {19},
PAGES = {973-978},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fault tolerance, irreversible dynamic monopoly, irreversible conversion set, fault propagation, watts' model, reversible dynamic monopoly, local interaction game, repetitive polling game},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002006},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xu-Men-Li-Li/11,
AUTHOR = {Xu, Zhenpeng and Men, Chaoguang and Li, Weiwei and Li, Xiang},
TITLE = {Checkpoint scheduling model for optimality},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {19},
PAGES = {979-984},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fault tolerance, checkpoint, rollback recovery, checkpoint interval},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002018},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhao-Zheng/11,
AUTHOR = {Zhao, Chunyan and Zheng, Zhiming},
TITLE = {Threshold behaviors of a random constraint satisfaction problem with exact phase transitions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {20},
PAGES = {985-988},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {constraint satisfaction problem, model rb, phase transition, finite-size scaling, threshold behavior, computational complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001980},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Echenim-Peltier/11,
AUTHOR = {Echenim, Mnacho and Peltier, Nicolas},
TITLE = {Modular instantiation schemes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {20},
PAGES = {989-993},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {automatic theorem proving, smt, instantiation-based methods, combination problems},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901100189X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dixit-Ramesh-Dasgupta/11,
AUTHOR = {Dixit, Manoj G. and Ramesh, S. and Dasgupta, Pallab},
TITLE = {Some results on Parametric Temporal Logic},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {20},
PAGES = {994-998},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {specification languages, formal methods, formal languages, temporal logic, parametric specifications, decision procedure},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011001888},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Barnaby/11,
AUTHOR = {Barnaby, Martin},
TITLE = {Low-level dichotomy for quantified constraint satisfaction problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {20},
PAGES = {999-1003},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, quantified constraints, alternating logtime},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901100202X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Liu/11,
AUTHOR = {Zhang, Xia and Liu, Guizhen},
TITLE = {On edge covering colorings of graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {20},
PAGES = {1004-1006},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, edge-coloring, graph, edge covering coloring, edge covering chromatic index},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002067},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Seidl-Reuss/11,
AUTHOR = {Seidl, Helmut and Reu{\ss}, Andreas},
TITLE = {Extending $\mathcal H_1$-clauses with disequalities},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {20},
PAGES = {1007-1013},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal methods, program analysis, horn clauses, term disequalities, h 1 -normalization, finite tree automata},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002031},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wu-Chen-Wang/11,
AUTHOR = {Wu, Chih-Jen and Chen, Yu-Wei and Wang, Yue-Li},
TITLE = {The minimum bandwidth required at each time slot of the fast broadcasting scheme},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {20},
PAGES = {1014-1018},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {performance evaluation, multimedia communication, fast broadcasting scheme, heterogeneous clients, video-on-demand, protocol analysis},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002055},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Wu/11,
AUTHOR = {Wang, Bing and Wu, Jian-Liang},
TITLE = {Total coloring of planar graphs with maximum degree 7},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {20},
PAGES = {1019-1021},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, total coloring, planar graph, cycle},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002043},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Gao-Li/11,
AUTHOR = {Zhang, Kejia and Gao, Hong and Li, Jianzhong},
TITLE = {Finding multiple induced disjoint paths in general graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {20},
PAGES = {1022-1026},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {induced disjoint paths, graph, approximation algorithm},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002080},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Flocchini-Ilcinkas-Pelc-Santoro/11,
AUTHOR = {Flocchini, Paola and Ilcinkas, David and Pelc, Andrzej and Santoro, Nicola},
TITLE = {How many oblivious robots can explore a line},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {20},
PAGES = {1027-1031},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed computing, mobile robots, asynchronous, oblivious, exploration, line},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002109},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bjorklund-Husfeldt-Kaski-Koivisto/11,
AUTHOR = {Bj{\"o}rklund, Andreas and Husfeldt, Thore and Kaski, Petteri and Koivisto, Mikko},
TITLE = {Covering and packing in linear space},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {21-22},
PAGES = {1033-1036},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, chromatic polynomial, zeta transform},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002237},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhou-Xu/11,
AUTHOR = {Zhou, Shuming and Xu, Jun-Ming},
TITLE = {Conditional fault tolerance of arrangement graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {21-22},
PAGES = {1037-1043},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fault tolerance, conditional connectivity, ( n , k ) -arrangement graph},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002092},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chiou-Lee-Yeh/11,
AUTHOR = {Chiou, Che Wun and Lee, Chiou-Yng and Yeh, Yun-Chi},
TITLE = {Multiplexer implementation of low-complexity polynomial basis multiplier in GF$(2^m)$ using all one polynomial},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {21-22},
PAGES = {1044-1047},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {multiplier, cryptography, multiplexer, finite field, polynomial basis},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002250},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tian-Fu-Yuan/11,
AUTHOR = {Tian, Ji and Fu, Ruyan and Yuan, Jinjiang},
TITLE = {An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {21-22},
PAGES = {1048-1053},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, on-line scheduling, parallel-batching, competitive ratio, large delivery time},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002249},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fleischer-Xu/11,
AUTHOR = {Fleischer, Rudolf and Xu, Xiaoming},
TITLE = {Computing minimum diameter color-spanning sets is hard},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {21-22},
PAGES = {1054-1056},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, np hardness, minimum diameter color-spanning disk},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002079},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Raphael/11,
AUTHOR = {Raphael, Yuster},
TITLE = {A shortest cycle for each vertex of a graph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {21-22},
PAGES = {1057-1061},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, girth, shortest path, undirected graph},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002195},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fan-Kierstead-Liu-Molla-Wu-Zhang/11,
AUTHOR = {Fan, Hao and Kierstead, H.A. and Liu, Guizhen and Molla, Theodore and Wu, Jian-Liang and Zhang, Xin},
TITLE = {A note on relaxed equitable coloring of graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {21-22},
PAGES = {1062-1066},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {relaxed coloring, deficit coloring, equitable coloring, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002225},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Lu/11,
AUTHOR = {Wang, Bo-Yi and Lu, Hsueh-I},
TITLE = {Two-dimensional homing sort},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {21-22},
PAGES = {1067-1071},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, combinatorial problems, homing sort, sorting by placement and shift},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002213},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bird/11,
AUTHOR = {Bird, Richard S.},
TITLE = {A simple division-free algorithm for computing determinants},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {21-22},
PAGES = {1072-1074},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, determinants, division-free algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002353},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jens/11,
AUTHOR = {Jens, Vygen},
TITLE = {Faster algorithm for optimum Steiner trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {21-22},
PAGES = {1075-1079},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, design of algorithms, steiner tree problem, dynamic programming, tree composition},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002341},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kazuyuki/11,
AUTHOR = {Kazuyuki, Amano},
TITLE = {Minterm-transitive functions with asymptotically smallest block sensitivity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {23-24},
PAGES = {1081-1084},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, boolean functions, block sensitivity, minterm-transitive functions, tight bounds},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002493},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lai-Li-Li-Liang-Yao/11,
AUTHOR = {Lai, Hong-Jian and Li, Hao and Li, Ping and Liang, Yanting and Yao, Senmei},
TITLE = {Mod $(2p+1)$-orientations in line graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {23-24},
PAGES = {1085-1088},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, nowhere zero flows, mod ( 2 p + 1 ) -orientation, mod ( 2 p + 1 ) -contractible, line graph},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002407},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Michael/11,
AUTHOR = {Michael, Lampis},
TITLE = {A kernel of order $2k-c\log k$ for vertex cover},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {23-24},
PAGES = {1089-1091},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, parameterized complexity, kernelization algorithm, vertex cover},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002389},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yao-Bao-Chen/11,
AUTHOR = {Yao, Erlin and Bao, Yungang and Chen, Mingyu},
TITLE = {What Hill-Marty model learn from and break through Amdahl's law?},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {23-24},
PAGES = {1092-1095},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {parallel processing, multicore, scalability, amdahl's law, hill-marty model},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901100250X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chapuy-Klimann/11,
AUTHOR = {Chapuy, Guillaume and Klimann, Ines},
TITLE = {On the supports of recognizable series over a field and a single letter alphabet},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {23-24},
PAGES = {1096-1098},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, recognizable series, support of series},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002596},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cygan-Pilipczuk-Wojtaszczyk/11,
AUTHOR = {Cygan, Marek and Pilipczuk, Marcin and Wojtaszczyk, Jakub Onufry},
TITLE = {Capacitated domination faster than $O(2^n)$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {23-24},
PAGES = {1099-1103},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, exponential algorithms, dominating set, capacitated domination},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002390},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liang-Shan/11,
AUTHOR = {Liang, Zuosong and Shan, Erfang},
TITLE = {Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {23-24},
PAGES = {1104-1107},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {clique-transversal set, clique-independent set, approximation algorithm, np-complete, cubic graph},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002481},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dobson-Leoni-Nasini/11,
AUTHOR = {Dobson, M.P. and Leoni, V. and Nasini, G.},
TITLE = {The multiple domination and limited packing problems in graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {23-24},
PAGES = {1108-1113},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, computational complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002377},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Malekimajd-Hoseiny-Farahabady-Movaghar-Sarbazi-azad/11,
AUTHOR = {Malekimajd, M. and Hoseiny-Farahabady, M.R. and Movaghar, A. and Sarbazi-azad, H.},
TITLE = {Pancyclicity of OTIS (swapped) networks based on properties of the factor graph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {23-24},
PAGES = {1114-1119},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {parallel processing, otis (swapped) networks, pancyclicity, hamiltonian cycle},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002201},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Maheshwari-Smid-Zeh/11,
AUTHOR = {Maheshwari, Anil and Smid, Michiel and Zeh, Norbert},
TITLE = {Low-interference networks in metric spaces of bounded doubling dimension},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {23-24},
PAGES = {1120-1123},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, wireless networks, interference, metric space, doubling dimension, spanner, minimum spanning tree},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002626},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gu-Lai-Yao/11,
AUTHOR = {Gu, Xiaofeng and Lai, Hong-Jian and Yao, Senmei},
TITLE = {Characterization of minimally $(2,l)$-connected graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {111},
NUMBER = {23-24},
PAGES = {1124-1129},
YEAR = {2011},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, connectivity, minimally k-connected graphs, l-connectivity, ( k , l ) -connected graphs, minimally ( 2 , l ) -connected graphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002614},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}