@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{Zhang/10a,
AUTHOR = {Zhang, Haihui},
TITLE = {On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {24},
PAGES = {A1-A1},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51NFYBF-2/2/7cf5a7f4e6623a783224a738aaf06645},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Martin-Larrea/10,
AUTHOR = {Mart{\'{i}}n, Cristian and Larrea, Mikel},
TITLE = {A simple and communication-efficient Omega algorithm in the crash-recovery model},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {3},
PAGES = {83-87},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed computing, fault tolerance, consensus, omega failure detector, leader election, crash-recovery, communication-efficient algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XHVH5J-1/2/509329e8ab260d3a04156ee8155eca57},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bailey-Loekito/10,
AUTHOR = {Bailey, James and Loekito, Elsa},
TITLE = {Efficient incremental mining of contrast patterns in changing data},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {3},
PAGES = {88-92},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data mining, contrast patterns, databases},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XHCJ33-3/2/eb5ee409f804c1390f6081c540585a40},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Asahiro-Miyano-Miyazaki-Yoshimuta/10,
AUTHOR = {Asahiro, Yuichi and Miyano, Eiji and Miyazaki, Shuichi and Yoshimuta, Takuro},
TITLE = {Weighted nearest neighbor algorithms for the graph exploration problem on cycles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {3},
PAGES = {93-98},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {on-line algorithms, graph exploration problem, weighted nearest neighbor, competitive ratio},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XJP41M-1/2/8285ef7f4bb0616d99f55fac9d3625a3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{De_Francesco-Lettieri-Martini-Vaglini/10,
AUTHOR = {De Francesco, N. and Lettieri, G. and Martini, L. and Vaglini, G.},
TITLE = {Partial model checking via abstract interpretation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {3},
PAGES = {99-103},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {compositional verification, temporal logic, concurrency},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XJWD6M-1/2/757fe911e3f77366eec3a9cdf3c7fcbd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Anand-Chandramouli/10,
AUTHOR = {Anand, S. and Chandramouli, R.},
TITLE = {A network flow based approach for network selection in dynamic spectrum access networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {3},
PAGES = {104-107},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {dynamic spectrum access, network selection, graph algorithms, network flow},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XNN5KV-1/2/9830feb9734c08eb9ac08dfea42eca6d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rampersad-Shallit/10,
AUTHOR = {Rampersad, Narad and Shallit, Jeffrey},
TITLE = {Detecting patterns in finite regular and context-free languages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {3},
PAGES = {108-112},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, pattern matching, finite automaton, regular language, context-free language},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XNW48T-2/2/df725d58d046c11a0ce1c72e1e1abeab},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brass-Na/10,
AUTHOR = {Brass, Peter and Na, Hyeon-Suk},
TITLE = {Finding the maximum bounded intersection of $k$ out of $n$ halfplanes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {3},
PAGES = {113-115},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, algorithms, maximum intersection},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XNW48T-4/2/f3d3ddd94de8a7dd3d5941c9268f2952},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chevalier-Rusinowitch/10,
AUTHOR = {Chevalier, Yannick and Rusinowitch, Micha{\"e}l},
TITLE = {Compiling and securing cryptographic protocols},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {3},
PAGES = {116-122},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal methods, cryptographic protocols, safety/security in digital systems, protocol compiling, roles, dolev yao model},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XNW48T-1/2/f518583070f7c8387072a03ab624b3c1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ohlebusch-Gog/10,
AUTHOR = {Ohlebusch, Enno and Gog, Simon},
TITLE = {Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {3},
PAGES = {123-128},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, suffix array, suffix-prefix matching},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XNW48T-3/2/423cac993bd76502764a99f6c70bc91b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Keller-Miller/10,
AUTHOR = {Keller, Nathan and Miller, Stephen D.},
TITLE = {Distinguishing attacks on stream ciphers based on arrays of pseudo-random words},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {4},
PAGES = {129-132},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, stream ciphers, distinguishing attacks, mv3, sn3},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XP3802-1/2/8176daa12eec31c55da9dd193a4920c4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bezem-Nieuwenhuis-Rodriguez-Carbonell/10,
AUTHOR = {Bezem, Marc and Nieuwenhuis, Robert and Rodr{\'{i}}guez-Carbonell, Enric},
TITLE = {Hard problems in max-algebra, control theory, hypergraphs and other areas},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {4},
PAGES = {133-138},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, computational complexity, (hyper)graphs, constraint solving},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XRJX9N-1/2/a842ed16c32da6883ee32c62e2302bd8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Baer/10,
AUTHOR = {Baer, Michael B.},
TITLE = {Alphabetic coding with exponential costs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {4},
PAGES = {139-142},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, dynamic programming, information retrieval, r{\'o}nyi entropy, tree searching},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XSJVST-2/2/303b99630a022bbea66d05dc57fe8314},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Libkin-Sirangelo/10,
AUTHOR = {Libkin, Leonid and Sirangelo, Cristina},
TITLE = {Disjoint pattern matching and implication in strings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {4},
PAGES = {143-147},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {theory of computation, strings, patterns, implication, xml},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XVK42H-1/2/6aab2632a2f3d6a3a947433ec41424fb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Durian-Holub-Peltola-Tarhio/10,
AUTHOR = {{\v{D}}urian, Branislav and Holub, Jan and Peltola, Hannu and Tarhio, Jorma},
TITLE = {Improving practical exact string matching},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {4},
PAGES = {148-152},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, string matching, bit-parallelism, experimental comparison},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XSVRFX-1/2/320223a0ef1b211ee954747f83eda905},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bonnet-Raynal/10,
AUTHOR = {Bonnet, Fran{\c{c}}ois and Raynal, Michel},
TITLE = {A simple proof of the necessity of the failure detector $\Sigma$ to implement an atomic register in asynchronous message-passing systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {4},
PAGES = {153-157},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {concurrency, distributed algorithms, fault-tolerance, theoty of computation, asynchronous message-passing system, atomic register, weakest failure detector},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XSVRFX-2/2/ee15f5b7cece6cabe3c6c6485d37be60},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Cui/10,
AUTHOR = {Zhang, Guo-Qiang and Cui, Licong},
TITLE = {A set coverage problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {4},
PAGES = {158-159},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, boolean rank, bipartite covering, sperner's theorem},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XT3HSD-1/2/818c1a6ac18b218b614f0f830141cad9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Wu-Sun/10,
AUTHOR = {Li, Hui and Wu, Chuan-Kun and Sun, Jun},
TITLE = {A general compiler for password-authenticated group key exchange protocol},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {4},
PAGES = {160-167},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, password, group key exchange, random-oracle model, ideal-cipher model},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XV44Y8-1/2/fe61c914d2eb779b3ca73a21a3b80ad2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Saxena/10,
AUTHOR = {Saxena, Sanjeev},
TITLE = {On finding fundamental cut sets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {4},
PAGES = {168-170},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, fundamental cut sets, algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XT3HSD-2/2/c737245aca518cfcaee4db79b164cc40},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu-Zhang-Chen-Meng/10,
AUTHOR = {Liu, Juan and Zhang, Xindong and Chen, Xing and Meng, Jixiang},
TITLE = {On domination number of Cartesian product of directed cycles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {5},
PAGES = {171-173},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cartesian product, domination number, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XSJVST-1/2/f2ffee486b462cc7ec3b9fdaa6b18205},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mubayi-Turan/10,
AUTHOR = {Mubayi, Dhruv and Tur{\'a}n, Gy{\"o}rgy},
TITLE = {Finding bipartite subgraphs efficiently},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {5},
PAGES = {174-177},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, graph algorithm, bipartite graph, extremal graph theory},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XVC4TD-1/2/3cad789d1f480e2333d5c49423d8cda0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sarkar-Maitra/10,
AUTHOR = {Sarkar, Santanu and Maitra, Subhamoy},
TITLE = {Cryptanalysis of RSA with two decryption exponents},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {5},
PAGES = {178-181},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, rsa, cryptanalysis, factorization, lattice, lll algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XVB6YF-1/2/9b5dfce646fde8eb4e15db018bd638a8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ci-Zhang-Zuo-Wu-Yang/10,
AUTHOR = {Ci, Yi-Wei and Zhang, Zhan and Zuo, De-Cheng and Wu, Zhi-Bo and Yang, Xiao-Zong},
TITLE = {Dependency mining-based causal message logging},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {5},
PAGES = {182-187},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fault-tolerance, causal message logging, dependency mining},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XVRYSC-1/2/3bdf09dbb8425859386a347d33dc4bb7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Ning-Feng-Chen/10,
AUTHOR = {Wang, Jianxin and Ning, Dan and Feng, Qilong and Chen, Jianer},
TITLE = {An improved kernelization for $P_2$-packing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {5},
PAGES = {188-192},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, p2-packing, kernelization, crown decomposition},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XWMNG8-1/2/3e36a2dd4b43701a283f0e2bf34caf95},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cohen-Golumbic-Lipshteyn-Stern/10,
AUTHOR = {Cohen, Elad and Golumbic, Martin Charles and Lipshteyn, Marina and Stern, Michal},
TITLE = {On the bi-enhancement of chordal-bipartite probe graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {5},
PAGES = {193-197},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, chordal bipartite graphs, probe graphs},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XX15WW-1/2/4ecff4803f0eb00e6f51e2485b816826},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sorenson/10,
AUTHOR = {Sorenson, Jonathan P.},
TITLE = {A randomized sublinear time parallel GCD algorithm for the EREW PRAM},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {5},
PAGES = {198-201},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {parallel algorithms, randomized algorithms, algorithm analysis, greatest common divisor, number theoretic algorithms, smooth numbers},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4Y1NV77-1/2/f78753e767c42e8d66e1028afaec6233},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen/10a,
AUTHOR = {Chen, Xie-Bin},
TITLE = {Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {6},
PAGES = {203-205},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {hypercube, vertex-disjoint paths, hamiltonian path, matching, folded hypercube, interconnection network},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XY4GPM-1/2/5234732dfd0ef5cf7ff4c3eea3b61182},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Miao-Lin/10,
AUTHOR = {Miao, Huifang and Lin, Guoping},
TITLE = {Strong orientations of complete $k$-partite graphs achieving the strong diameter},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {6},
PAGES = {206-210},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {automatic theorem proving, complete k-partite graph, strong distance, strong diameter, lower and upper orientable strong diameter},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4XY4N3M-1/2/5a4d7a5d4bc630061c6d8b4b5aa75a26},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xiao-Parhami-Chen-He-Wei/10,
AUTHOR = {Xiao, Wenjun and Parhami, Behrooz and Chen, Weidong and He, Mingxin and Wei, Wenhong},
TITLE = {Fully symmetric swapped networks based on bipartite cluster connectivity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {6},
PAGES = {211-215},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {bipartite graph, hierarchical network, interconnection network, otis network, routing algorithm, swapped network, topological parameters},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4Y051GR-2/2/435492ac7c9b564808673b414de0e8bb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Zhang-Hu/10,
AUTHOR = {Zhang, Meng and Zhang, Yi and Hu, Liang},
TITLE = {A faster algorithm for matching a set of patterns with variable length don't cares},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {6},
PAGES = {216-220},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, string matching, variable length don't cares},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4Y051GR-1/2/53fbca5cdcb85d227b3787b5a454a962},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alon-Feldman-Procaccia-Tennenholtz/10,
AUTHOR = {Alon, Noga and Feldman, Michal and Procaccia, Ariel D. and Tennenholtz, Moshe},
TITLE = {A note on competitive diffusion through social networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {6},
PAGES = {221-225},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, algorithmic game theory, social networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4Y34WFK-1/2/a27a96290d6b57fbb552c6bcddbc47c7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xu-Zhan/10,
AUTHOR = {Xu, Qiwen and Zhan, Naijun},
TITLE = {Rate monotonic scheduling re-analysed},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {6},
PAGES = {226-231},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {real time systems, scheduling, schedulability conditions},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4Y34SV4-1/2/3e5d777b817b3fa0a99e836dc04b2d85},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Schmidt-Schauss-Sabel/10,
AUTHOR = {Schmidt-Schau{\ss}, Manfred and Sabel, David},
TITLE = {Closures of may-, should- and must-convergences for contextual equivalence},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {6},
PAGES = {232-235},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal semantics, programming calculi, program correctness},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4Y6454V-1/2/abae05ede08b8c3af7003b711f073f07},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zivkovic-Goljat-Hericko/10,
AUTHOR = {{\v{Z}}ivkovi{\v{c}}, Ale{\v{s}} and Goljat, Uro{\v{s}} and Heri{\v{c}}ko, Marjan},
TITLE = {Improving the usability of the source code quality index with interchangeable metrics sets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {6},
PAGES = {236-240},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {quality index, object-oriented metrics, code quality, design metrics, software metrics, software design and implementation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4Y5GY23-1/2/92f53e323fe6d125033090eed97e9fa1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu-Wu-Lin/10,
AUTHOR = {Liu, Feng and Wu, ChuanKun and Lin, XiJun},
TITLE = {A new definition of the contrast of visual cryptography scheme},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {7},
PAGES = {241-246},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, visual cryptography, secret sharing, contrast},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4Y70C9N-1/2/0168074fdc96e323621aee124a9dece8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Szalachowski-Ksiezopolski-Kotulski/10,
AUTHOR = {Szalachowski, P. and Ksiezopolski, B. and Kotulski, Z.},
TITLE = {CMAC, CCM and GCM/GMAC: Advanced modes of operation of symmetric block ciphers in wireless sensor networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {7},
PAGES = {247-251},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {wireless sensor network, cryptographic protocols, block cipher modes, sensor's security, utilization efficiency},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4Y70C9N-3/2/6ddd7ce363aa5d6926b364eae9589a71},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kolpakov-Kucherov-Ochem/10,
AUTHOR = {Kolpakov, Roman and Kucherov, Gregory and Ochem, Pascal},
TITLE = {On maximal repetitions of arbitrary exponent},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {7},
PAGES = {252-256},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {theory of computation, combinatorial problems, repetitions, periodicities},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4Y70C9N-2/2/937ccc826376559452c3c5c3da2a5d9e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hung-Lee-Ting/10,
AUTHOR = {Hung, Regant Y.S. and Lee, Lap-Kei and Ting, H.F.},
TITLE = {Finding frequent items over sliding windows with constant update time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {7},
PAGES = {257-260},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, on-line algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4Y8G5Y5-1/2/72816ca8b85b8021e298c8574a1f1ed3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Barrus/10,
AUTHOR = {Barrus, Michael D.},
TITLE = {Antimagic labeling and canonical decomposition of graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {7},
PAGES = {261-263},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {antimagic labeling, split graph, canonical decomposition, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4Y95RRJ-1/2/861644e072c32012703a8a8608cf632a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Demenkov-Kojevnikov-Kulikov-Yaroslavtsev/10,
AUTHOR = {Demenkov, E. and Kojevnikov, A. and Kulikov, A. and Yaroslavtsev, G.},
TITLE = {New upper bounds on the Boolean circuit complexity of symmetric functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {7},
PAGES = {264-267},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, boolean circuit complexity, upper bounds, symmetric functions, modular functions},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4Y9CFDB-1/2/2769f48c474acdbb7152b267848eeb88},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yu-Bailey-Montefusco-Zhang-Zhong/10,
AUTHOR = {Yu, Cui and Bailey, James and Montefusco, Julian and Zhang, Rui and Zhong, Jiling},
TITLE = {Enhancing the B$^+$-tree by dynamic node popularity caching},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {7},
PAGES = {268-273},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {databases, data structures},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YC1K7R-1/2/50256b203e4c7a4000207e108c395e49},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Abbasi-Healy-Rextin/10,
AUTHOR = {Abbasi, Sarmad and Healy, Patrick and Rextin, Aimal},
TITLE = {Improving the running time of embedded upward planarity testing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {7},
PAGES = {274-278},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, graph drawing, upward planarity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YC2XK1-1/2/9ca782c5d96550b8db42bc6005f74a93},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hougardy/10,
AUTHOR = {Hougardy, Stefan},
TITLE = {The Floyd-Warshall algorithm on graphs with negative cycles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {8-9},
PAGES = {279-281},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {floyd-warshall algorithm, design of algorithms, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YC1K7R-2/2/cdd1de289451741ee8b7a67aaa25b2d3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kenkre-Vishwanathan/10,
AUTHOR = {Kenkre, Sreyash and Vishwanathan, Sundar},
TITLE = {Approximation algorithms for the Bipartite Multicut problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {8-9},
PAGES = {282-287},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, bipartite multicut},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YC1K7R-3/2/127a85c191d3322d5217bbe73a336ea8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yu-She-Gong-Yu/10,
AUTHOR = {Yu, Lingfei and She, Kun and Gong, Haigang and Yu, Changyuan},
TITLE = {Price of anarchy in parallel processing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {8-9},
PAGES = {288-293},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, job scheduling game, coordination mechanism, price of anarchy, nash equilibrium},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YC2XK1-2/2/223da2801901f66fb7b4ecd19e466e5b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lee-Lim-Kim/10,
AUTHOR = {Lee, Byoung-Hoon and Lim, Sung-Hwa and Kim, Jai-Hoon},
TITLE = {Scalable real-time monitoring system for ubiquitous smart space},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {8-9},
PAGES = {294-299},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed systems, real-time systems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YG1M25-1/2/395462a5b91c61cc21bf6773bf873b30},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Chen-Chen-Li/10,
AUTHOR = {Li, Yin and Chen, Gong-liang and Chen, Yi-yang and Li, Jian-hua},
TITLE = {An extension of TYT inversion algorithm in polynomial basis},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {8-9},
PAGES = {300-303},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, multiplicative inverse, tyt, polynomial basis},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YDT425-1/2/adb4f8e8f316077eb2cf8725d47e562f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dunkelman-Keller/10,
AUTHOR = {Dunkelman, Orr and Keller, Nathan},
TITLE = {The effects of the omission of last round's MixColumns on AES},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {8-9},
PAGES = {304-308},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, aes, mixcolumns, impossible differential cryptanalysis},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YG7K02-1/2/000f29aecf7c814f63e06dbf66c50f6d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fakcharoenphol-Kijsirikul/10,
AUTHOR = {Fakcharoenphol, Jittat and Kijsirikul, Boonserm},
TITLE = {Short proofs for online multiclass prediction on graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {8-9},
PAGES = {309-311},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, on-line algorithms, on-line learning, prediction on graphs},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YDT425-2/2/ec2d5b5a8bfc2593849e0f712eb71318},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Heggernes-Meister/10,
AUTHOR = {Heggernes, Pinar and Meister, Daniel},
TITLE = {Hardness and approximation of minimum distortion embeddings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {8-9},
PAGES = {312-316},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distortion, computational complexity, approximation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YDYSM8-1/2/55f8033f120039cab92cae23c1487794},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fischer/10,
AUTHOR = {Fischer, Johannes},
TITLE = {Wee LCP},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {8-9},
PAGES = {317-320},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data sructures, text indexing, compressed data structures, suffix arrays, longest common prefixes},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YF5R9D-1/2/5ca4a564e80b635446b4cdf501ccb709},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Roussel-Zhu/10,
AUTHOR = {Roussel, Nicolas and Zhu, Xuding},
TITLE = {Total coloring of planar graphs of maximum degree eight},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {8-9},
PAGES = {321-324},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, total coloring, planar graphs},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YG7K02-2/2/384bb330a4c82d0067d78cc856097827},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tao-Chao-Xi-Tao/10,
AUTHOR = {Tao, Jiping and Chao, Zhijun and Xi, Yugeng and Tao, Ye},
TITLE = {An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {8-9},
PAGES = {325-330},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, semi-online algorithms, single machine scheduling, total weighted completion time, competitive ratio},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YGHGW9-1/2/67d10558f86773af3aa57d9b7c0f3a45},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fischer-Huson/10,
AUTHOR = {Fischer, Johannes and Huson, Daniel H.},
TITLE = {New common ancestor problems in trees and directed acyclic graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {8-9},
PAGES = {331-335},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, data structures, computational biology},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YGHGW9-2/2/562a6621776a7e42137670ff66da8c06},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sarkar-Maitra/10a,
AUTHOR = {Sarkar, Santanu and Maitra, Subhamoy},
TITLE = {Cryptanalysis of RSA with more than one decryption exponent},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {8-9},
PAGES = {336-340},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptanalysis, cryptography, factorization, lattice, lll algorithm, rsa},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YH4R4M-1/2/8e9514f95a1a20b525f866014584bb8e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Simon-Szorenyi/10,
AUTHOR = {Simon, Hans Ulrich and Sz{\"o}r{\'e}nyi, Bal{\'a}zs},
TITLE = {One-inclusion hypergraph density revisited},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {8-9},
PAGES = {341-344},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, one-inclusion hypergraph, pseudo-dimension, graph-dimension, mistake bound},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YHT80J-2/2/e90571f13b312464f3711306af83888d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Huang-Huang-Tang-Lu/10,
AUTHOR = {Huang, Yen-Lin and Huang, Cheng-Chen and Tang, Chuan Yi and Lu, Chin Lung},
TITLE = {An improved algorithm for sorting by block-interchanges based on permutation groups},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {8-9},
PAGES = {345-350},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithm, data structure, genome rearrangement, permutation group, block-interchange, generalized transposition, permutation tree},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YHT80J-3/2/1c949da3247b9db7767f3c578388d70a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jonsson-Thapper/10,
AUTHOR = {Jonsson, Peter and Thapper, Johan},
TITLE = {Approximating integer programs with positive right-hand sides},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {10},
PAGES = {351-355},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, integer programming},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YF5R9D-2/2/923f9cfecef8e5f87e561e5910c06411},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kozma-Lotker-Stupp/10,
AUTHOR = {Kozma, Gady and Lotker, Zvi and Stupp, Gideon},
TITLE = {On the connectivity threshold for general uniform metric spaces},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {10},
PAGES = {356-359},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {random networks, sensor networks, connectivity threshold, fractal},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YGHGW9-3/2/6e1b28cc18e9913a484a2b1d17b7772d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Afrati-Damigos-Gergatsoulis/10,
AUTHOR = {Afrati, Foto N. and Damigos, Matthew and Gergatsoulis, Manolis},
TITLE = {Query containment under bag and bag-set semantics},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {10},
PAGES = {360-369},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {databases, query containment, conjunctive queries, bag semantics, bag-set semantics},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YHP04F-1/2/0e632b20055529a25532349a6af87497},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Halldorsson/10,
AUTHOR = {Halld{\'o}rsson, Magn{\'u}s M.},
TITLE = {Online coloring of hypergraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {10},
PAGES = {370-372},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {online algorithms, hypergraphs, graph coloring},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YHT80J-1/2/20475725e645e4d78c8d29226fae17c9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kundi-Aziz-Ikram/10,
AUTHOR = {Kundi, Dur-e-Shahwar and Aziz, Arshad and Ikram, Nasar},
TITLE = {Resource efficient implementation of T-Boxes in AES on Virtex-5 FPGA},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {10},
PAGES = {373-377},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, aes, fpga, t-box, virtex-5},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YK2F70-1/2/8a9729bc23a8c6aa1b49f1b93bd49cad},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu/10a,
AUTHOR = {Liu, Shuli},
TITLE = {On toughness and fractional $(g,f,n)$-critical graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {10},
PAGES = {378-382},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, graph, toughness, fractional (g,f)-factor, fractional (g,f,n)-critical graph},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YK2F70-2/2/f9281a68aef55dc974f548928baa69d6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu-Zhu/10,
AUTHOR = {Liu, Hong and Zhu, Daming},
TITLE = {Parameterized complexity of control problems in Maximin election},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {10},
PAGES = {383-388},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, maximin election, control, fixed parameter tractability, w[1]-hard, w[2]-hard},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YMY74B-1/2/d1bfb3e0216c486adb05b905b0c74267},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pelc/10,
AUTHOR = {Pelc, Andrzej},
TITLE = {Fault-tolerant strategies in the Iterated Prisoner's Dilemma},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {10},
PAGES = {389-395},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {prisoner's dilemma, robust strategy, algorithms, fault-tolerance, bounded memory},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YK2F70-4/2/f071a0b72739934fe5d69782c51cc918},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Balcerzak-Niwinski/10,
AUTHOR = {Balcerzak, Marcin and Niwi{\'n}ski, Damian},
TITLE = {Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {10},
PAGES = {396-398},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, regular languages, two-way finite automata, bounded number of reversals},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YK2F70-3/2/c8888d0331fcee7a6b476d0a0f4b82a4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cucu-Grosjean-Goossens/10,
AUTHOR = {Cucu-Grosjean, Liliana and Goossens, Jo{\"e}l},
TITLE = {Predictability of Fixed-Job Priority schedulers on heterogeneous multiprocessor real-time systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {10},
PAGES = {399-402},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {real-time systems, multiprocessors, global scheduling},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YK7J6F-1/2/d95c0144cbb84d25fcc24d19156f432b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhou-Xiao/10,
AUTHOR = {Zhou, Shuming and Xiao, Wenjun},
TITLE = {Conditional diagnosability of alternating group networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {10},
PAGES = {403-409},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {comparison diagnosis, conditional diagnosability, alternating group network},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YK7J6F-2/2/1d5f0522d0c076cc919dbda25d162bb0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Freivalds-Yakarylmaz-Say/10,
AUTHOR = {Freivalds, R{\=u}si{\c{n}}{\v{s}} and Yakary{\i}lmaz, Abuzer and Say, A.C. Cem},
TITLE = {A new family of nonstochastic languages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {10},
PAGES = {410-413},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {theory of computation, nonstochastic languages},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YMB68H-1/2/084fcc9df0ace06cf832d04c3340b1c7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Yang-Hsu-Chang/10,
AUTHOR = {Lin, Jia-Cian and Yang, Jinn-Shyong and Hsu, Chiun-Chieh and Chang, Jou-Ming},
TITLE = {Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {10},
PAGES = {414-419},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {independent spanning trees, edge-disjoint spanning trees, locally twisted cubes, interconnection networks, fault-tolerant broadcasting},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YMK1PT-1/2/b4e51d71c0e7a69da2d7ae46a5020c8d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kolbe-Zhu-Pramanik/10,
AUTHOR = {Kolbe, Dashiell and Zhu, Qiang and Pramanik, Sakti},
TITLE = {Reducing non-determinism of $k$-NN searching in non-ordered discrete data spaces},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {10},
PAGES = {420-423},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, databases, information retrieval, non-ordered discrete data space, k-nearest neighbor search},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YNC1T3-1/2/693e789c141ffd34e2b06ce0d9e47d0f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dvorak-Woltran/10,
AUTHOR = {Dvo{\v{r}}{\'a}k, Wolfgang and Woltran, Stefan},
TITLE = {Complexity of semi-stable and stage semantics in argumentation frameworks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {11},
PAGES = {425-430},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, abstract argumentation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YTFBTG-1/2/ebaf7f3f691a8bc47970198651ae6c1e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Clement-Defago-Potop-Butucaru-Izumi-Messika/10,
AUTHOR = {Clement, Julien and D{\'e}fago, Xavier and Potop-Butucaru, Maria Gradinariu and Izumi, Taisuke and Messika, Stephane},
TITLE = {The cost of probabilistic agreement in oblivious robot networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {11},
PAGES = {431-438},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed systems, analysis of algorithms, randomized algorithms, distributed computing, design of algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YV82RJ-1/2/fa16f4946f8eb2a7f9aa228686621f4b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fu/10,
AUTHOR = {Fu, Jung-Sheng},
TITLE = {Edge-fault-tolerant vertex-pancyclicity of augmented cubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {11},
PAGES = {439-443},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {hypercubes, augmented hypercubes, fault-tolerant, pancyclic, vertex-pancyclic, interconnection network},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YWXSK6-1/2/5c22ba324194ea73a3f41c769b8b5b12},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fu-Cheng-Ng-Yuan/10,
AUTHOR = {Fu, Ruyan and Cheng, T.C.E. and Ng, C.T. and Yuan, Jinjiang},
TITLE = {Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {11},
PAGES = {444-450},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {online scheduling, parallel-batching machines, limited restart, competitive ratio, analysis of algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YXK0H3-1/2/838c79193a20780c516af561c6f51f08},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Crowston-Gutin-Jones/10,
AUTHOR = {Crowston, Robert and Gutin, Gregory and Jones, Mark},
TITLE = {Note on Max Lin-2 above Average},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {11},
PAGES = {451-454},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, fixed-parameter tractability, max lin, max sat},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YX7KKD-1/2/776af445517e1d46baa0a1a2d78bf2ed},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lai-Lee/10,
AUTHOR = {Lai, Peng-Jen and Lee, Wen-Chiung},
TITLE = {Single-machine scheduling with a nonlinear deterioration function},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {11},
PAGES = {455-459},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, deteriorating jobs, single-machine},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YX000G-2/2/e9e0551af0dbe564edffcd034ce3b292},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ji-Cheng/10,
AUTHOR = {Ji, Min and Cheng, T.C.E.},
TITLE = {Scheduling with job-dependent learning effects and multiple rate-modifying activities},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {11},
PAGES = {460-463},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, learning effect, rate-modifying activity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YX7KKD-4/2/81295cf57d5be6e52f31bcc2d3527f0c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dong-Yang/10,
AUTHOR = {Dong, Qiang and Yang, Xiaofan},
TITLE = {Embedding a long fault-free cycle in a crossed cube with more faulty nodes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {11},
PAGES = {464-468},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, crossed cube, cycle embedding, fault tolerance, parallel computing},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YX7KKD-3/2/6820d11ec1d38c8ae68b94be251033f3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Lin/10,
AUTHOR = {Lin, Lan and Lin, Yixun},
TITLE = {Two models of two-dimensional bandwidth problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {11},
PAGES = {469-473},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, two-dimensional bandwidth, lower bound, upper bound, optimal embedding},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YX7KKD-2/2/3e7fbb639a0a2fe83714fcfba0db88a2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Baril-Vernay/10,
AUTHOR = {Baril, Jean-Luc and Vernay, R{\'e}mi},
TITLE = {Whole mirror duplication-random loss model and pattern avoiding permutations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {11},
PAGES = {474-480},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, combinatorial problems, pattern avoiding permutation, whole duplication-random loss model, genome, generating algorithm, binary reflected gray code},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YX000G-3/2/1e00ddaaacddfeffaebfe800cdb66839},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lucas/10,
AUTHOR = {Lucas, Joan M.},
TITLE = {An improved kernel size for rotation distance in binary trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {12-13},
PAGES = {481-484},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, fixed-parameter tractability, rotation distance},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YYRMVR-2/2/e3bf540a1caf60e629f75b6ecae5d6f2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Li/10,
AUTHOR = {Chen, Liqun and Li, Jiangtao},
TITLE = {A note on the Chen-Morrissey-Smart DAA scheme},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {12-13},
PAGES = {485-488},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, trusted computing, user privacy, direct anonymous attestation, user-controlled linkability},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YYGH4S-1/2/4cab0f7eeab4963910fdf743e1ccabff},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Park-Choi-Kim/10,
AUTHOR = {Park, Jonghun and Choi, Byung-Cheon and Kim, Kwanho},
TITLE = {A vector space approach to tag cloud similarity ranking},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {12-13},
PAGES = {489-496},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {information retrieval, similarity measure, tag cloud, vector space model, ranking},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YNT4BR-1/2/4e516ad758cdf09a06c2d329577eadfd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Crespelle-Gambette/10,
AUTHOR = {Crespelle, Christophe and Gambette, Philippe},
TITLE = {Unrestricted and complete Breadth-First Search of trapezoid graphs in $O(n)$ time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {12-13},
PAGES = {497-502},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {breadth-first search, trapezoid graphs, permutation graphs, interval graphs, shortest paths, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YRHCXT-1/2/bdb305335c48793a7a0fe6def4cabb9a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Epstein-Levin/10,
AUTHOR = {Epstein, Leah and Levin, Asaf},
TITLE = {Randomized algorithms for online bounded bidding},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {12-13},
PAGES = {503-506},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {on-line algorithms, online bidding, competitive analysis},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YRPDX7-1/2/7606ae3e5d2284b6bf09455d05c37324},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Frati/10,
AUTHOR = {Frati, Fabrizio},
TITLE = {A note on isosceles planar graph drawing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {12-13},
PAGES = {507-509},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, computational geometry, graph drawing, isosceles triangles, triangulation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YT6D9K-1/2/ddeb14f94ac78628d37dd4532e739c05},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-van_de_Velde/10,
AUTHOR = {Zhang, Xiandong and van de Velde, Steef},
TITLE = {On-line two-machine job shop scheduling with time lags},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {12-13},
PAGES = {510-513},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, job shop, time lags, greedy algorithm, competitive analysis},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YT6D9K-2/2/fca40d0f488de2c60690cc176773aacf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ichimura-Shigeno/10,
AUTHOR = {Ichimura, Akira and Shigeno, Maiko},
TITLE = {A new parameter for a broadcast algorithm with locally bounded Byzantine faults},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {12-13},
PAGES = {514-517},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithm, fault tolerance, broadcasting, byzantine faults, ma ordering},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YT6D9K-3/2/941f4a511826a31070aad5093142ee4a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Radonjic-Vujicic/10,
AUTHOR = {Radonjic, Aleksandar and Vujicic, Vladimir},
TITLE = {Integer SEC-DED codes for low power communications},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {12-13},
PAGES = {518-520},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {integer sec-ded codes, safety/security in digital systems, computational complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YT6D9K-4/2/e7bc85ba7849c4d78fe74dcddd155067},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {see Comments in Inf.~Process.~Lett., Vol. 111, 2011, No. 9, 414-415},
}
@article{Bagheri-Razzazi/10,
AUTHOR = {Bagheri, Alireza and Razzazi, Mohammadreza},
TITLE = {Planar straight-line point-set embedding of trees with partial embeddings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {12-13},
PAGES = {521-523},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, computational complexity, geometric embedding, point-set embedding, constrained graph drawing, partial drawing},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YYRMVR-1/2/9b4a0a3e79d4cfaa0f98a28b168811d2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Andrade-Maciel-Nogueira-Araujo-Callou/10,
AUTHOR = {Andrade, Ermeson and Maciel, Paulo and Nogueira, Bruno and Ara{\'u}jo, Carlos and Callou, Gustavo},
TITLE = {A COTS-based approach for estimating performance and energy consumption of embedded real-time systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {14-15},
PAGES = {525-534},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {software engineering, performance evaluation, formal methods, time petri net, sysml, embedded real-time systems, component},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YYXJTM-2/2/c4c4dbe5c38a7b480fb173deed6c5b96},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Iwasaki-Kaneko/10,
AUTHOR = {Iwasaki, Tatsuya and Kaneko, Keiichi},
TITLE = {Fault-tolerant routing in burnt pancake graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {14-15},
PAGES = {535-538},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, fault tolerance, interconnection networks, parallel processing},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YYRMVR-3/2/ee966bad141d50f6466c7748cc90efbb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gruner-Steyn/10,
AUTHOR = {Gruner, S. and Steyn, T.J.},
TITLE = {Deadlock-freeness of hexagonal systolic arrays},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {14-15},
PAGES = {539-543},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {parallel processing, parallelism, systolic array, deadlock, roscoe-dathi method},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YYXJTM-1/2/05982d29c6f4343e4bfa577daa1665da},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fu-Li-Matsuura-Qu/10,
AUTHOR = {Fu, Shaojing and Li, Chao and Matsuura, Kanta and Qu, Longjiang},
TITLE = {Enumeration of balanced symmetric functions over $GF(p)$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {14-15},
PAGES = {544-548},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, symmetric function, balanced function, permutation, equivalence class},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YYGH4S-2/2/0ed8835bdb7228e0b450fdbd13aecf9f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gueron-Kounavis/10,
AUTHOR = {Gueron, Shay and Kounavis, Michael},
TITLE = {Efficient implementation of the Galois Counter Mode using a carry-less multiplier and a fast reduction algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {14-15},
PAGES = {549-553},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, galois fields, message authentication, authenticated encryption, aes-gcm},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YX000G-1/2/db35ab1658e6ee16dc4f9d890757f409},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xiao/10,
AUTHOR = {Xiao, Mingyu},
TITLE = {Finding minimum 3-way cuts in hypergraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {14-15},
PAGES = {554-558},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, k-way cut, hypergraph},
URL = {http://www.sciencedirect.com/science/article/B6V0F-501FPPK-2/2/76a648ae07aad095ff7a4f07ac58a01b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yang-Dong-Tang/10,
AUTHOR = {Yang, Xiaofan and Dong, Qiang and Tang, Yuan Yan},
TITLE = {Embedding meshes/tori in faulty crossed cubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {14-15},
PAGES = {559-564},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, crossed cube, graph embedding, mesh, torus, fault-tolerance},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4YXP1FR-1/2/2df8cea9429359d1c75ab54f97710f51},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Melkman-Tamura-Akutsu/10,
AUTHOR = {Melkman, Avraham A. and Tamura, Takeyuki and Akutsu, Tatsuya},
TITLE = {Determining a singleton attractor of an AND/OR Boolean network in $O(1.587^n)$ time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {14-15},
PAGES = {565-569},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, sat, boolean network, singleton attractor},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5023KPJ-2/2/9a042bf8504607e1791157f8ca953cb9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Guttmann-Beck-Hassin/10,
AUTHOR = {Guttmann-Beck, Nili and Hassin, Refael},
TITLE = {On two restricted ancestors tree problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {14-15},
PAGES = {570-575},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {directed minimum spanning tree, matroid, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-501FPPK-1/2/989e83ea81e58ead23a3f9b2cc58119d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lee/10,
AUTHOR = {Lee, Jae Moon},
TITLE = {An efficient algorithm to find $k$-nearest neighbors in flocking behavior},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {14-15},
PAGES = {576-579},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, flocking behavior, spatial subdivision, k-nearest neighbors, agent},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5004R3F-1/2/57eb7914acd77ca5aa0dc4b97f165697},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu-Li/10,
AUTHOR = {Liu, Di and Li, Jing},
TITLE = {Many-to-many $n$-disjoint path covers in $n$-dimensional hypercubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {14-15},
PAGES = {580-584},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, hypercubes, disjoint paths, parallel computing},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5023KPJ-3/2/944f3ec4a0a98c02a6267d95d53e05ca},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vidali-Nose-Pasalic/10,
AUTHOR = {Vidali, Jano{\v{s}} and Nose, Peter and Pa{\v{s}}ali{\'c}, Enes},
TITLE = {Collisions for variants of the BLAKE hash function},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {14-15},
PAGES = {585-590},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {blake, bloke, brake, collision, cryptography, fixed point, hash functions},
URL = {http://www.sciencedirect.com/science/article/B6V0F-502GHDD-1/2/fdd5d0c61416cd428fa1790402860bf4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Harju-Nowotka/10,
AUTHOR = {Harju, Tero and Nowotka, Dirk},
TITLE = {Cyclically repetition-free words on small alphabets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {14-15},
PAGES = {591-595},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, combinatorics on words, repetitions, conjugates, square-free words},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50297KK-1/2/fa3e9f57ab2596b56605f69ba0d9f6c4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wu-Jiang-Su/10,
AUTHOR = {Wu, Zong-Da and Jiang, Tao and Su, Wu-Jie},
TITLE = {Efficient computation of shortest absent words in a genomic sequence},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {14-15},
PAGES = {596-601},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {sequence analysis, absent words, shortest absent words, algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-502V70J-1/2/3df0f0399df4631484d0b23b7a39247e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lee-Park/10,
AUTHOR = {Lee, Jooyoung and Park, Je Hong},
TITLE = {Preimage resistance of LP$mkr$ with $r=m-1$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {14-15},
PAGES = {602-608},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5046MD6-1/2/282b739ec8500e4c00e4fe91ef14b2ef},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Freschi-Bogliolo/10,
AUTHOR = {Freschi, Valerio and Bogliolo, Alessandro},
TITLE = {A faster algorithm for the computation of string convolutions using LZ78 parsing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {14-15},
PAGES = {609-613},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {string convolution, lempel-ziv parsing, pattern matching, algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5046MD6-2/2/c6aeb21baa4bac7c1b1cca851d999dc2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Roh-Jeon-Seo-Kim-Lee/10,
AUTHOR = {Roh, Hyun-Gul and Jeon, Myeongjae and Seo, Euiseong and Kim, Jinsoo and Lee, Joonwon},
TITLE = {Log'version vector: Logging version vectors concisely in dynamic replication},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {14-15},
PAGES = {614-620},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed computing, distributed systems, version vector, version vector, replication system},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5017HRK-1/2/8f0d84fb6a578b78d12fa00435c2e9ac},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Abu-Khzam/10,
AUTHOR = {Abu-Khzam, Faisal N.},
TITLE = {An improved kernelization algorithm for $r$-set Packing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {621-624},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fixed-parameter algorithms, kernelization, crown decomposition, set packing, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5023KPJ-1/2/7f3c9d2f438455d25f2d2f290e0a1afe},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen/10b,
AUTHOR = {Chen, Xie-Bin},
TITLE = {Cycles passing through a prescribed path in a hypercube with faulty edges},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {625-629},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {hypercube, cycle embedding, path bipancyclicity, edge-fault-tolerance, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-505XPH1-1/2/017e8acb81482c9d3d32be9b4f15d493},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nash-Gregg/10,
AUTHOR = {Nash, Nicholas and Gregg, David},
TITLE = {An output sensitive algorithm for computing a maximum independent set of a circle graph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {630-634},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, graph algorithms, circle graph, maximum independent set, maximum stable set},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5051PP3-2/2/4231cd9aab06ca11b475772fc3fa2884},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Backer-Keil/10,
AUTHOR = {Backer, Jonathan and Keil, J. Mark},
TITLE = {Constant factor approximation algorithms for the densest $k$-subgraph problem on proper interval graphs and bipartite permutation graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {635-638},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {densest subgraph, proper interval graph, bipartite permutation graph, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5046MD6-3/2/5c10f991f079caf4f2aa45abb6ef5aeb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gelade-Neven/10,
AUTHOR = {Gelade, Wouter and Neven, Frank},
TITLE = {Optimizing the Region Algebra is PSPACE-complete},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {639-643},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, region algebra, databases},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50297KK-2/2/325fae98693e0fd346dfba18c0615ab3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Colantonio-Di_Pietro/10,
AUTHOR = {Colantonio, Alessandro and Di Pietro, Roberto},
TITLE = {{\sc Concise}: Compressed ``n'' Composable Integer Set},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {644-650},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {bitmap compression, data structures, performance},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5057KX5-1/2/b003ebba0e5d89da03a8b940c1aaddcd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li/10,
AUTHOR = {Li, Ruijuan},
TITLE = {A fan-type result on $k$-ordered graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {651-654},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {k-ordered graphs, k-linked, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5051PP3-3/2/8f78bb451aa883678e994f48b697c0cc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Elmasry/10,
AUTHOR = {Elmasry, Amr},
TITLE = {The longest almost-increasing subsequence},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {655-658},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, algorithm design and analysis, data structures},
URL = {http://www.sciencedirect.com/science/article/B6V0F-506R72G-1/2/3eac9db3593668b0ab2be3568ee82ec8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Guo-Qin-Guo/10,
AUTHOR = {Guo, Litao and Qin, Chengfu and Guo, Xiaofeng},
TITLE = {Super connectivity of Kronecker products of graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {659-661},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fault tolerance, kronecker product, super connectivity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-505NS7Y-1/2/cf24ad5c1d6ce1b03a8e8389cdfc48f2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Delic-Wang/10,
AUTHOR = {Deli{\'c}, Dejan and Wang, Changping},
TITLE = {Upper signed $k$-domination in a general graph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {662-665},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, signed k-dominating function, minimal signed k-dominating function, upper signed k-domination number},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5057KX5-2/2/ffca83de4de6916913952c7452f7caa4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gulavani-Chakraborty-Nori-Rajamani/10,
AUTHOR = {Gulavani, Bhargav S. and Chakraborty, Supratik and Nori, Aditya V. and Rajamani, Sriram K.},
TITLE = {Refining abstract interpretations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {666-671},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {program correctness, abstract interpretation, interpolation, cegar},
URL = {http://www.sciencedirect.com/science/article/B6V0F-505NS7Y-2/2/b289ef107979dc63e1cd3e3e38c42033},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bae-Lee-Choi/10,
AUTHOR = {Bae, Sang Won and Lee, Chunseok and Choi, Sunghee},
TITLE = {On exact solutions to the Euclidean bottleneck Steiner tree problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {672-678},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, bottleneck steiner tree, exact algorithm, farthest-color voronoi diagram},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5051PP3-1/2/7f7dd7696995ddbcfe3c939183615d49},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Di_Lena-Margara/10,
AUTHOR = {Di Lena, Pietro and Margara, Luciano},
TITLE = {Optimal global alignment of signals by maximization of Pearson correlation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {679-686},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, signal similarity detection, pearson correlation, needleman-wunsch algorithm, optimal global alignment},
URL = {http://www.sciencedirect.com/science/article/B6V0F-505NS7Y-3/2/521dd53c97c1e957c843805a0a21736e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Didimo-Eades-Liotta/10,
AUTHOR = {Didimo, Walter and Eades, Peter and Liotta, Giuseppe},
TITLE = {A characterization of complete bipartite RAC graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {687-691},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, combinatorial problems, graph algorithms, theory of computation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-506RN4M-2/2/265be815448d7681f8cf68a2c9906fcb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ding-Wang-Qin/10,
AUTHOR = {Ding, Guiguang and Wang, Jianmin and Qin, Kai},
TITLE = {A visual word weighting scheme based on emerging itemsets for video annotation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {692-696},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {information retrieval, video annotation, emerging itemsets, bow},
URL = {http://www.sciencedirect.com/science/article/B6V0F-506RCVY-1/2/c64b2d11be4883229b7dce22363e60d9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vallee/10,
AUTHOR = {Vall{\'e}e, Thierry},
TITLE = {Normal Eulerian clique-covering and hamiltonicity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {697-701},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, graph theory, hamiltonian problem},
URL = {http://www.sciencedirect.com/science/article/B6V0F-506RCVY-2/2/634f78e313701e36d3271be94f40954c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fomin-Gaspers-Golovach-Kratsch-Saurabh/10,
AUTHOR = {Fomin, Fedor V. and Gaspers, Serge and Golovach, Petr A. and Kratsch, Dieter and Saurabh, Saket},
TITLE = {Parameterized algorithm for eternal vertex cover},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {702-706},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, parameterized complexity, fixed parameter tractability, vertex cover, eternal vertex cover},
URL = {http://www.sciencedirect.com/science/article/B6V0F-506W6TN-1/2/7bb2563c82fb208007fcdf09c5bce7ce},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kulik-Shachnai/10,
AUTHOR = {Kulik, Ariel and Shachnai, Hadas},
TITLE = {There is no EPTAS for two-dimensional knapsack},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {707-710},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {two-dimensional knapsack, efficient polynomial-time approximation schemes, parameterized complexity, theory of computation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-507CRXM-2/2/ba11b90d7b017d7511ce87ee710944a8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chang-Kuo-Lin/10,
AUTHOR = {Chang, Chan-Wei and Kuo, David and Lin, Hsing-Ching},
TITLE = {Ranking numbers of graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {711-716},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, vertex ranking, ranking number, minimal cut set, independent set, power, cartesian product, path, cycle, caterpillar, composition},
URL = {http://www.sciencedirect.com/science/article/B6V0F-506RN4M-3/2/912a290b58ecd5837d69dd66518faa47},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Koehler-Link/10,
AUTHOR = {Koehler, Henning and Link, Sebastian},
TITLE = {Armstrong axioms and Boyce-Codd-Heath Normal Form under bag semantics},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {717-724},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {database, multiset, key, functional dependency, armstrong axioms, normal form},
URL = {http://www.sciencedirect.com/science/article/B6V0F-508K852-2/2/01c68d6ebc3532a0d53fa8135df87f48},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Libura/10,
AUTHOR = {Libura, Marek},
TITLE = {A note on robustness tolerances for combinatorial optimization problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {725-729},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, robust solutions, robustness tolerances},
URL = {http://www.sciencedirect.com/science/article/B6V0F-508K852-3/2/f52a5a9b14664cf83673f7bc3f7a25b3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Peng-Yang-Huang-Ann/10,
AUTHOR = {Peng, Yung-Hsing and Yang, Chang-Biau and Huang, Kuo-Si and Ann, Hsing-Yen},
TITLE = {Efficient indexing algorithms for one-dimensional discretely-scaled strings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {16},
PAGES = {730-734},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithm, string matching, discrete scale},
URL = {http://www.sciencedirect.com/science/article/B6V0F-507CRXM-1/2/aae00806cdf984f31e4637e344cd7041},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rackham/10,
AUTHOR = {Rackham, Tom},
TITLE = {The complexity of changing colourings with bounded maximum degree},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {17},
PAGES = {735-739},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, computational complexity, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50860HJ-1/2/5da4ad8deb057f13f823778c47631a55},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lazic/10,
AUTHOR = {Lazi{\'c}, Ranko},
TITLE = {The reachability problem for branching vector addition systems requires doubly-exponential space},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {17},
PAGES = {740-745},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {program correctness, theory of computation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50BJNSW-1/2/61bfc17969782c506ba803c497c92175},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nandy-Mukhopadhyaya-Bhattacharya/10,
AUTHOR = {Nandy, Subhas C. and Mukhopadhyaya, Krishnendu and Bhattacharya, Bhargab B.},
TITLE = {Recognition of largest empty orthoconvex polygon in a point set},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {17},
PAGES = {746-752},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithm, complexity, computational geometry, orthoconvex polygon},
URL = {http://www.sciencedirect.com/science/article/B6V0F-508K852-1/2/74341b7fcd10948f386d2b1444aaa95a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Amano/10,
AUTHOR = {Amano, Shun'ichi},
TITLE = {On the co$NP$ hardness of computing certain answers over locally specified incomplete DOM-trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {17},
PAGES = {753-756},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {databases, incomplete information, certain answers},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50B5PSB-1/2/556b6c6f86a1a5136b4450e5c07b4069},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Junosza-Szaniawski-Rozej/10,
AUTHOR = {Junosza-Szaniawski, Konstanty and Ro{\.z}ej, {\L}ukasz},
TITLE = {Game chromatic number of graphs with locally bounded number of cycles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {17},
PAGES = {757-760},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, competitive algorithms, game coloring number, game chromatic number},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50B5PSB-2/2/ef8c33d474b42e2e1819e126e22bd702},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Eftekhari-Forouzanfar-Moghaddam-Alirezaie/10,
AUTHOR = {Eftekhari, Armin and Forouzanfar, Mohamad and Moghaddam, Hamid Abrishami and Alirezaie, Javad},
TITLE = {Block-wise 2D kernel PCA/LDA for face recognition},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {17},
PAGES = {761-766},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, computational complexity, principal component analysis (pca), linear discriminant analysis (lda), kernel machines, face recognition},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50BB5HY-1/2/69cf63c6996e2eef03a2607c8277d53e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bertini-Leite-Mosse/10,
AUTHOR = {Bertini, Luciano and Leite, Julius C.B. and Moss{\'e}, Daniel},
TITLE = {Power and performance control of soft real-time web server clusters},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {17},
PAGES = {767-773},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {real-time systems, server clusters, energy economy, quality of service, power-aware computing},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50F8C0S-3/2/8bd2f2cea51dd86c60b4c4349a608c56},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cipriano-Gonzalez/10,
AUTHOR = {Cipriano, Christopher C. and Gonzalez, Teofilo F.},
TITLE = {Multicasting in the hypercube, chord and binomial graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {17},
PAGES = {774-777},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, np-complete, n-cube, binomial graphs, chord, multicasting, steiner trees},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50F8C0S-1/2/302c752b5826b0b9efd4149a01dc0642},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Wang-Wang/10,
AUTHOR = {Chen, Ing-Ray and Wang, Yating and Wang, Ding-Chau},
TITLE = {Reliability of wireless sensors with code attestation for intrusion detection},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {17},
PAGES = {778-786},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fault tolerance, wireless sensor networks, intrusion detection, code attestation, performance evaluation, reliability},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50BB5HY-2/2/a085613c98f5342b183c0c13307def43},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gluck/10,
AUTHOR = {Gl{\"u}ck, Robert},
TITLE = {Self-generating program specializers},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {17},
PAGES = {787-793},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {partial evaluation, programming languages, program generation, self-reproduction, metacomputation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-506RN4M-1/2/7dad16a7946a95200b39dea9af4310f3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Moosa-Rahman/10,
AUTHOR = {Moosa, Tanaeem M. and Rahman, M. Sohel},
TITLE = {Indexing permutations for binary strings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {18-19},
PAGES = {795-798},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, combinatorial problems, pattern matching},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50F8C0S-2/2/72dc2e77799136779d90a17c99e9f45a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Roh-Hahn/10,
AUTHOR = {Roh, Dongyoung and Hahn, Sang Geun},
TITLE = {On the bit security of the weak Diffie-Hellman problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {18-19},
PAGES = {799-802},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, hidden number problem, weak diffie-hellman problem},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50G06BS-2/2/08e738e2e368b8852c7643144e453db1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yamanaka-Nakano/10,
AUTHOR = {Yamanaka, Katsuhisa and Nakano, Shin-ichi},
TITLE = {A compact encoding of plane triangulations with efficient query supports},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {18-19},
PAGES = {803-809},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithm, graph, plane triangulation, encoding, query support},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50G06BS-1/2/585d44b0fdde3d422721db66e1643fbd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sakai-Ogawa/10,
AUTHOR = {Sakai, Masahiko and Ogawa, Mizuhito},
TITLE = {Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {18-19},
PAGES = {810-814},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {term rewriting systems, confluence, formal languages},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50FGYBK-2/2/84a44fc9ad46183457825c386085899d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Akutsu/10,
AUTHOR = {Akutsu, Tatsuya},
TITLE = {A bisection algorithm for grammar-based compression of ordered trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {18-19},
PAGES = {815-820},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, graph algorithms, tree grammars, data compression},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50H1WT1-3/2/f3d6d1658eca7c0b69ec7de8c537c11a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Guo-Chen-He-Jin-Chen-Chen-Shu-Huang/10,
AUTHOR = {Guo, Deke and Chen, Hanhua and He, Yuan and Jin, Hai and Chen, Chao and Chen, Honghui and Shu, Zhen and Huang, Guangqi},
TITLE = {KCube: A novel architecture for interconnection networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {18-19},
PAGES = {821-825},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, compound graph, kautz digraph, hypercube graph, hierarchical networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50GWNBS-1/2/c270c4c050b890be80592da838810743},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gamzu-Segev/10,
AUTHOR = {Gamzu, Iftah and Segev, Danny},
TITLE = {A polylogarithmic approximation for computing non-metric terminal Steiner trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {18-19},
PAGES = {826-829},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, terminal steiner tree, group steiner tree},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50H7D84-2/2/e8e2e0be1f4ce6216109718f77b44a0e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Wang/10,
AUTHOR = {Zhang, Jingwen and Wang, Yingqian},
TITLE = {$(\Delta+1)$-total-colorability of plane graphs with maximum degree $\Delta$ at least 6 and without adjacent short cycles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {18-19},
PAGES = {830-834},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, plane graph, total coloring, maximum degree},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50H1WT1-2/2/c5e00973ae5dd9a39b44ab135e126c7b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ezra/10,
AUTHOR = {Ezra, Esther},
TITLE = {A note about weak $\epsilon$-nets for axis-parallel boxes in $d$-space},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {18-19},
PAGES = {835-840},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, geometric range spaces, [epsilon]-nets, d-layer range-trees},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50H1WT1-1/2/c9c11eea983ee5a18de66837ef494655},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jordan/10,
AUTHOR = {Jord{\'a}n, Tibor},
TITLE = {Generically globally rigid zeolites in the plane},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {18-19},
PAGES = {841-844},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, globally rigid graph, rigidity matroid, zeolite},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50FGYBK-1/2/753f0913c0c7b87de6071bf3ee33b608},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chang-Chung-Lin/10,
AUTHOR = {Chang, Maw-Shang and Chung, Hsiao-Han and Lin, Chuang-Chieh},
TITLE = {An improved algorithm for the red-blue hitting set problem with the consecutive ones property},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {20},
PAGES = {845-848},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, covering problem, hitting set, consecutive ones property, shortest path},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50J4MJP-3/2/50abb1b664f49676067421c481fcb12b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chang-Hou-Roussel/10,
AUTHOR = {Chang, Gerard Jennhwa and Hou, Jianfeng and Roussel, Nicolas},
TITLE = {On the total choosability of planar graphs and of sparse graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {20},
PAGES = {849-853},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, total coloring, total choosability, planar graphs, cycle-free, maximum average degree},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50HP2YG-1/2/0d73722d983ea00f1197117459e5ba93},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yonta-Tchuente-Ndoundam/10,
AUTHOR = {Yonta, Paulin Melatagia and Tchuente, Maurice and Ndoundam, Ren{\'e}},
TITLE = {Routing automorphisms of the hypercube},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {20},
PAGES = {854-860},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, hypercube, queueless mimd, bpc permutation, arbitrarily routable},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50H7D84-1/2/657ebefdd5facd434cdfe0062fcb5d21},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bogdanov/10,
AUTHOR = {Bogdanov, Andrey},
TITLE = {On the differential and linear efficiency of balanced Feistel networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {20},
PAGES = {861-866},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {block ciphers, feistel networks, substitution-diffusion networks, linear diffusion, differential cryptanalysis, linear cryptanalysis, efficiency, cryptography},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50JHC0G-3/2/dc3c54b3deb029684623bbe64fbf63b0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bjorklund-Husfeldt-Kaski-Koivisto/10,
AUTHOR = {Bj{\"o}rklund, Andreas and Husfeldt, Thore and Kaski, Petteri and Koivisto, Mikko},
TITLE = {Evaluation of permanents in rings and semirings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {20},
PAGES = {867-870},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, parameterized computation, permanent},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50J4MJP-1/2/ec88eb6e5b7387ae08449014fedaef0c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Ma-Liu-Niu/10,
AUTHOR = {Wang, Shuaiqiang and Ma, Jun and Liu, Jiming and Niu, Xiaofei},
TITLE = {Evolving choice structures for genetic programming},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {20},
PAGES = {871-876},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {program derivation, evolutionary computation, genetic programming, choice structure},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50K5T29-1/2/9ef3031afe03a6d15f2f0a468fca26ec},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bonizzoni-Vedova-Dondi-Pirola/10,
AUTHOR = {Bonizzoni, Paola and Vedova, Gianluca Della and Dondi, Riccardo and Pirola, Yuri},
TITLE = {Variants of constrained longest common subsequence},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {20},
PAGES = {877-881},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, longest common subsequence, constrained longest common subsequence, fixed-parameter tractability},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50JHC0G-2/2/dfa0735d7aacff7d598bde2c315db8b7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kim/10,
AUTHOR = {Kim, Chong Hee},
TITLE = {New fault attacks using Jacobi symbol and application to regular right-to-left algorithms},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {20},
PAGES = {882-886},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {exponentiation, physical attacks, fault attacks, cryptography},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50J9H59-2/2/2299e1d8f50d25dbaa620352feb375dd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dong-Xu/10,
AUTHOR = {Dong, Wei and Xu, Baogang},
TITLE = {Some results on acyclic edge coloring of plane graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {20},
PAGES = {887-892},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {coloring, acyclic chromatic index, plane graphs, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50KC6VH-2/2/0123bbb8204ff39b4dd0856ef258e411},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jain-Klauck-Santha/10,
AUTHOR = {Jain, Rahul and Klauck, Hartmut and Santha, Miklos},
TITLE = {Optimal direct sum results for deterministic and randomized decision tree complexity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {20},
PAGES = {893-897},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, direct sum, decision tree complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50KWG24-1/2/9aba3f80ef61e6d2a0c835b43ac558c5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Grigorescu-Jung-Rubinfeld/10,
AUTHOR = {Grigorescu, Elena and Jung, Kyomin and Rubinfeld, Ronitt},
TITLE = {A local decision test for sparse polynomials},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {20},
PAGES = {898-901},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {randomized algorithms, sparsity tests, multivariate polynomials},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50J9H59-1/2/5b96cdb8109b5735c47c1ea6eff1bd4f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Csuhaj-Varju-Vaszil/10,
AUTHOR = {Csuhaj-Varj{\'u}, Erzs{\'e}bet and Vaszil, Gy{\"o}rgy},
TITLE = {Scattered context grammars generate any recursively enumerable language with two nonterminals},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {20},
PAGES = {902-907},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, regulated rewriting, scattered context grammars, nonterminal complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50J4MJP-2/2/8b644997f43e09161965b0410c0bbb06},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Groult-Prieur-Richomme/10,
AUTHOR = {Groult, Richard and Prieur, {\'E}lise and Richomme, Gw{\'e}na{\"e}l},
TITLE = {Counting distinct palindromes in a word in linear time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {20},
PAGES = {908-912},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {palindrome, palindromic richness, palindromic fullness, algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50KC6VH-1/2/bed41c9d902a2435cbc41abc4abbe9e4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Montassier-Raspaud-Zhu/10,
AUTHOR = {Montassier, Mickael and Raspaud, Andr{\'e} and Zhu, Xuding},
TITLE = {Decomposition of sparse graphs into two forests, one having bounded maximum degree},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {20},
PAGES = {913-916},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, decomposition, forest with bounded degree, discharging procedure, global rules},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50JHC0G-1/2/0fe4fc42d95f63d894ad3aa47810bc15},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Service/10,
AUTHOR = {Service, Travis C.},
TITLE = {A No Free Lunch theorem for multi-objective optimization},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {21},
PAGES = {917-923},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, combinatorial optimization, no free lunch, multi-objective optimization},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50P4N7S-4/2/79fe00459236003ee3eb97b944eb5019},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bollig/10,
AUTHOR = {Bollig, Beate},
TITLE = {Exponential space complexity for OBDD-based reachability analysis},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {21},
PAGES = {924-927},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, lower bounds, ordered binary decision diagrams, reachability analysis, transitive closure},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50M1RY8-1/2/99c15159d0976fb5b88ac9045f3449c1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Charron-Bost-Hutle-Widder/10,
AUTHOR = {Charron-Bost, Bernadette and Hutle, Martin and Widder, Josef},
TITLE = {In search of lost time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {21},
PAGES = {928-933},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed computing, failure detectors, asynchronous system, consensus},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50P4N7S-1/2/ff4a189fcf8c37d066cf6981f1dc3f9c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Luccio-Enriquez-Pagli/10,
AUTHOR = {Luccio, Fabrizio and Enriquez, Antonio Mesa and Pagli, Linda},
TITLE = {Lower bounds on the rotation distance of binary trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {21},
PAGES = {934-938},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {rotation distance, lower bound, binary tree, design of algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50P4N7S-3/2/36b5f7ec8216bfec39675244ad61786c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Amtoft-Androutsopoulos-Clark-Harman-Li/10,
AUTHOR = {Amtoft, Torben and Androutsopoulos, Kelly and Clark, David and Harman, Mark and Li, Zheng},
TITLE = {An alternative characterization of weak order dependence},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {21},
PAGES = {939-943},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {control dependence, programming languages},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50MN7NX-1/2/04133a601071ea9f1864599e08768c51},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Christensen-Roginsky-Jimeno/10,
AUTHOR = {Christensen, Ken and Roginsky, Allen and Jimeno, Miguel},
TITLE = {A new analysis of the false positive rate of a Bloom filter},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {21},
PAGES = {944-949},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data structures, analysis of algorithms, bloom filters},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50P4N7S-2/2/3bb062eb37c5557a79a633a9d1af9a90},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wijsen/10,
AUTHOR = {Wijsen, Jef},
TITLE = {A remark on the complexity of consistent conjunctive query answering under primary key violations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {21},
PAGES = {950-955},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {databases, consistent query answering, database repairing},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50P9H32-1/2/2f06abf4466ce4d7959b8c63c796774a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Walczak/10,
AUTHOR = {Walczak, Bartosz},
TITLE = {A simple representation of subwords of the Fibonacci word},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {21},
PAGES = {956-960},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fibonacci word, algorithms, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50PJWYN-3/2/8857509d82942e99afaa46357c4ac211},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mannaa/10,
AUTHOR = {Mannaa, Bassel},
TITLE = {Cluster editing problem for points on the real line: A polynomial time algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {21},
PAGES = {961-965},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, graph algorithms, clustering, dynamic programming},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50PJWYN-1/2/a86375241c5f84389ad90ee2f041a48a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gutin-Yeo/10,
AUTHOR = {Gutin, Gregory and Yeo, Anders},
TITLE = {Note on maximal bisection above tight lower bound},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {21},
PAGES = {966-969},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, fixed-parameter tractability, kernels},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50P9H32-2/2/4b670f0f94872c1d3d5a55d0659185f1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu-Lu/10,
AUTHOR = {Liu, Tsung-Hao and Lu, Hsueh-I},
TITLE = {Minimum cycle bases of weighted outerplanar graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {21},
PAGES = {970-974},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, minimum cycle basis, outerplanar graph},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50PVG4N-1/2/cef71c116a19f4ef99e2b40b228d7932},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dorn-Thierauf/10,
AUTHOR = {D{\"o}rn, Sebastian and Thierauf, Thomas},
TITLE = {A note on the search for $k$ elements via quantum walk},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {22},
PAGES = {975-978},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {quantum query complexity, quantum walk, randomized algorithms, analysis of algorithms, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50PJWYN-2/2/8c99d096b589cc16b5865d562d9d6fd6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zemke-James-Narayan/10,
AUTHOR = {Zemke, Andrew and James, Sandra and Narayan, Darren A.},
TITLE = {Greedy algorithms for generalized $k$-rankings of paths},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {22},
PAGES = {979-985},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {rank number, ordered coloring, minimal ranking, vertex coloring, greedy algorithm, graph algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50RP23J-1/2/545c522d913a89379b3104ab96e731f2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Zhang/10,
AUTHOR = {Li, Xiuying and Zhang, Zhao},
TITLE = {Two algorithms for minimum 2-connected $r$-hop dominating set},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {22},
PAGES = {986-991},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, wireless sensor network, r-hop dominating set, fault-tolerant, unit disk graph},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50T9X1D-1/2/8a16d3f3333d42761423b626dc42f449},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Shi/10,
AUTHOR = {Wang, Xiaorong and Shi, Hongbo},
TITLE = {A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {22},
PAGES = {992-997},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {reed-solomon codes, list decoding algorithm, design of algorithms, computational complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50THXHP-1/2/09504fa49f1fec101c85bbcde34831e7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Xiong-Yang/10,
AUTHOR = {Zhang, Zhao and Xiong, Wei and Yang, Weihua},
TITLE = {A kind of conditional fault tolerance of alternating group graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {22},
PAGES = {998-1002},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {alternating group graph, restricted connectivity, fault tolerance},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50THXHP-2/2/c02a9aa0d7796ac42d76237a2667f024},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhou-Hu-Xu-Song/10,
AUTHOR = {Zhou, Zhenghua and Hu, Zhi and Xu, Maozhi and Song, Wangan},
TITLE = {Efficient 3-dimensional GLV method for faster point multiplication on some GLS elliptic curves},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {22},
PAGES = {1003-1006},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, elliptic curve, point multiplication algorithm, glv method, lattice basis},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50X2NKN-1/2/e9d218b488a378a06e58b971b8d9cac3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yang-Li-Guo/10,
AUTHOR = {Yang, Weihua and Li, Hengzhe and Guo, Xiaofeng},
TITLE = {A kind of conditional fault tolerance of $(n,k)$-star graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {22},
PAGES = {1007-1011},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {generalized star graph, restricted connectivity, fault tolerance},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50X3TYF-1/2/9f03f4b591c55b681486cf4089565fe3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Clifford-Sach/10,
AUTHOR = {Clifford, Rapha{\"e}l and Sach, Benjamin},
TITLE = {Permuted function matching},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {22},
PAGES = {1012-1015},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximate pattern matching, multiple knapsack problems, approximation algorithms, theory of computation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50YF6M5-1/2/adb5eba4460e710dd9341ba8a4096ffd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Iwama-Zhang/10,
AUTHOR = {Iwama, Kazuo and Zhang, Guochuan},
TITLE = {Online knapsack with resource augmentation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {22},
PAGES = {1016-1020},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {online algorithms, knapsack, resource augmentation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50W80Y6-2/2/5cd0bc31634d259b84ecefedbb8cf8b8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Clifford-Porat/10,
AUTHOR = {Clifford, Rapha{\"e}l and Porat, Ely},
TITLE = {A filtering algorithm for $k$-mismatch with don't cares},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {22},
PAGES = {1021-1025},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, design of algorithms, combinatorial problems, string algorithms, don't cares, pattern matching, filtering, fast fourier transforms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50W80Y6-1/2/2ef98e87c57a0c5e027f2bf16d7e3b2a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yang-Li-Meng/10,
AUTHOR = {Yang, Weihua and Li, Hengzhe and Meng, Jixiang},
TITLE = {Conditional connectivity of Cayley graphs generated by transposition trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {23},
PAGES = {1027-1030},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, cayley graphs, conditional connectivity, transposition tree},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50XS6KB-1/2/13ede0f4b2c0cad95b52b37e1de11559},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gnecco-Sanguineti/10,
AUTHOR = {Gnecco, Giorgio and Sanguineti, Marcello},
TITLE = {On spectral windows in supervised learning from data},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {23},
PAGES = {1031-1036},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, learning from data, regularization, suboptimal solutions, empirical error functionals, probabilistic estimates},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50XCY5G-1/2/31ca1efeea6eaa7026e35b625764ca38},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{van_Iersel-Semple-Steel/10,
AUTHOR = {van Iersel, Leo and Semple, Charles and Steel, Mike},
TITLE = {Locating a tree in a phylogenetic network},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {23},
PAGES = {1037-1043},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, computational complexity, phylogenetic trees, phylogenetic networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-511G1WB-1/2/b73e5a515381b6221f0bb54ef3edfcd5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Das-Francis-Mathew-Sadagopan/10,
AUTHOR = {Das, Anita and Francis, Mathew C. and Mathew, Rogers and Sadagopan, N.},
TITLE = {Non-contractible non-edges in 2-connected graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {23},
PAGES = {1044-1048},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, contraction, contractible edges/non-edges, connectivity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-511C03K-1/2/05ad8cdbc6a5dcc18af3ebef01a1e45b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Han-Peng-Ye-Zhang-Lan/10,
AUTHOR = {Han, Xin and Peng, Chao and Ye, Deshi and Zhang, Dahai and Lan, Yan},
TITLE = {Dynamic bin packing with unit fraction items revisited},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {23},
PAGES = {1049-1054},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, competitive ratio, bin packing problem},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50XV9F8-1/2/2659d5369169697dc4835baec3ed9b8b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Aravind/10,
AUTHOR = {Aravind, Alex A.},
TITLE = {Highly-fair bakery algorithm using symmetric tokens},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {23},
PAGES = {1055-1060},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {concurrency, distributed algorithm, mutual exclusion, bakery algorithm, fairness, bounded timestamps},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5120K6R-1/2/8b1e875a99f6c4197100e85eeae3d784},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Katajainen-Rao/10,
AUTHOR = {Katajainen, Jyrki and Rao, S. Srinivasa},
TITLE = {A compact data structure for representing a dynamic multiset},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {23},
PAGES = {1061-1066},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data structures, space efficiency, memory management, dictionaries, balanced search trees},
URL = {http://www.sciencedirect.com/science/article/B6V0F-50S8PRR-1/2/5730fd8532fb3399c888bec1c862f841},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Panda-Pradhan/10,
AUTHOR = {Panda, B.S. and Pradhan, D.},
TITLE = {Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {23},
PAGES = {1067-1073},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, graph algorithms, locally connected spanning tree, np-complete},
URL = {http://www.sciencedirect.com/science/article/B6V0F-512VTMX-1/2/2072568612e2b0839419728e1c8dcc30},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Beyersdorff-Galesi-Lauria/10,
AUTHOR = {Beyersdorff, Olaf and Galesi, Nicola and Lauria, Massimo},
TITLE = {A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {23},
PAGES = {1074-1077},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, proof complexity, prover-delayer games, resolution},
URL = {http://www.sciencedirect.com/science/article/B6V0F-512K1V7-3/2/475449e47edfef4e46143747bb97f820},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bartoschek-Held-Massberg-Rautenbach-Vygen/10,
AUTHOR = {Bartoschek, C. and Held, S. and Ma{\ss}berg, J. and Rautenbach, D. and Vygen, J.},
TITLE = {The repeater tree construction problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {24},
PAGES = {1079-1083},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, interconnection networks, vlsi design, repeater tree, steiner tree, minimum spanning tree},
URL = {http://www.sciencedirect.com/science/article/B6V0F-512K1V7-1/2/06de8b380c77d5c62fc41bd346c29bd5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang/10b,
AUTHOR = {Zhang, Haihui},
TITLE = {Retracted article: On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {24},
PAGES = {1084-1087},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
URL = {http://www.sciencedirect.com/science/article/B6V0F-512K1V7-2/2/ec9d48f3d57ff695fab8307ed8f3c33c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {see Corrigendum in Inf.~Process.~Lett., Vol. 113, 2013, No. 9, 354-356},
}
@article{Chen/10c,
AUTHOR = {Chen, Xie-Bin},
TITLE = {Edge-fault-tolerant diameter and bipanconnectivity of hypercubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {24},
PAGES = {1088-1092},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {hypercube, path embedding, bipanconnectivity, fault tolerance, fault-tolerant diameter, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51491NF-1/2/c50a46408e2970963b897d39ea43db43},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fredriksson/10,
AUTHOR = {Fredriksson, Kimmo},
TITLE = {On building minimal automaton for subset matching queries},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {24},
PAGES = {1093-1098},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, approximate string matching, subset matching, finite-state automaton minimization},
URL = {http://www.sciencedirect.com/science/article/B6V0F-514R6CJ-1/2/71fc3a202be95b845508df554f9b164c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Zhang-Hu/10a,
AUTHOR = {Zhang, Meng and Zhang, Yi and Hu, Liang},
TITLE = {Pattern matching with wildcards using words of shorter length},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {24},
PAGES = {1099-1102},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, pattern matching, wildcards},
URL = {http://www.sciencedirect.com/science/article/B6V0F-513F908-1/2/5e40244b3705286705f6363398950c34},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Ke-Xu-Yi/10,
AUTHOR = {Zhang, Yunong and Ke, Zhende and Xu, Peng and Yi, Chenfu},
TITLE = {Time-varying square roots finding via Zhang dynamics versus gradient dynamics and the former's link and new explanation to Newton-Raphson iteration},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {24},
PAGES = {1103-1109},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {parallel algorithms, real-time systems, zhang dynamics, gradient dynamics, indefinite error-function, square roots finding, newton-raphson iteration},
URL = {http://www.sciencedirect.com/science/article/B6V0F-514Y2F3-1/2/9618864ce4a8341ff91ae920d794c7aa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Montanaro/10,
AUTHOR = {Montanaro, Ashley},
TITLE = {Nonadaptive quantum query complexity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {24},
PAGES = {1110-1113},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {quantum computing, quantum query complexity, decision tree complexity, theory of computation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-512K1V7-4/2/aebe88199cb59b8ceede2fdc96af7f0f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jain-Ong-Stephan/10,
AUTHOR = {Jain, Sanjay and Ong, Yuh Shin and Stephan, Frank},
TITLE = {Regular patterns, regular languages and context-free languages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {24},
PAGES = {1114-1119},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {theory of computation, pattern languages, regular languages, context free languages},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51336C4-1/2/f59b969ab96391b87f2c78364836c0b0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Emek-Fraigniaud-Korman-Rosen/10,
AUTHOR = {Emek, Yuval and Fraigniaud, Pierre and Korman, Amos and Ros{\'e}n, Adi},
TITLE = {On the additive constant of the $k$-server Work Function Algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {24},
PAGES = {1120-1123},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {on-line algorithms, k-server problem},
URL = {http://www.sciencedirect.com/science/article/B6V0F-5100HS3-1/2/46ffa16b9955ff2b93ef82f149f18584},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shen-Ma-Liu-Bao-Chen/10,
AUTHOR = {Shen, Yang and Ma, LiZhuang and Liu, Hai and Bao, Yanxia and Chen, Zhihua},
TITLE = {Detecting and extracting natural snow from videos},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {110},
NUMBER = {24},
PAGES = {1124-1130},
YEAR = {2010},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithm, alpha matting, snow, video},
URL = {http://www.sciencedirect.com/science/article/B6V0F-51696YH-1/2/4f28984101b151fec0cb750b702d989b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}