@article{Zhao/06a,
AUTHOR = {Zhao, Yunlei},
TITLE = {A note on the Dwork-Naor timed deniable authentication},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {1},
PAGES = {1-7},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {timed deniable authentication, one-timed-valid authentication, non-transitive digital signature, cryptography},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K5JBWD-3/2/c773bc3115a779a7b4e1caac13454587},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Koutis/06,
AUTHOR = {Koutis, Ioannis},
TITLE = {Parameterized complexity and improved inapproximability for computing the largest $j$-simplex in a $V$-polytope},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {1},
PAGES = {8-13},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, computational geometry, inapproximability, parameterized computation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K4WN0G-8/2/1bc26e1bfae701471bd918903e744e37},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Deorowicz/06,
AUTHOR = {Deorowicz, Sebastian},
TITLE = {Speeding up transposition-invariant string matching},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {1},
PAGES = {14-20},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, information retrieval, longest common transposition-invariant subsequence, longest common subsequence, transposition invariance},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K5HWP2-2/2/254613497742d02f4612c03e92994bd2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tonien/06,
AUTHOR = {Tonien, Dongvu},
TITLE = {On a traitor tracing scheme from ACISP 2003},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {1},
PAGES = {21-22},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {traitor tracing, cryptography},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K5ST95-2/2/804e702288ac2120747b934f8bd17794},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Narayanan-Srinathan-Rangan/06,
AUTHOR = {Narayanan, Arvind and Srinathan, K. and Rangan, C. Pandu},
TITLE = {Perfectly reliable message transmission},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {1},
PAGES = {23-28},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fault tolerance, security},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K7NHSC-1/2/b46dfe7d12cd49abf6c7ae14416ce962},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Angel-Bampis-Blin-Gourves/06,
AUTHOR = {Angel, Eric and Bampis, Evripidis and Blin, L{\'e}lia and Gourv{\`e}s, Laurent},
TITLE = {Fair cost-sharing methods for the minimum spanning tree game},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {1},
PAGES = {29-35},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cost sharing, fairness, minimum cost spanning tree game, bird rule, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K66F5X-1/2/76cc85323c16e478a8d50cf5f0d79ead},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Krovetz-Rogaway/06,
AUTHOR = {Krovetz, Ted and Rogaway, Phillip},
TITLE = {Variationally universal hashing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {1},
PAGES = {36-39},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {randomized algorithms, cryptography, hashing, universal hashing},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K5JBWD-2/2/a50dd14953ef7e991e3736644e22392c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wolfovitz/06,
AUTHOR = {Wolfovitz, Guy},
TITLE = {The complexity of depth-3 circuits computing symmetric Boolean functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {2},
PAGES = {41-46},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, theory of computation, depth-3 circuits},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KFV3JK-2/2/4164e21022a8bb8bc819240f4802c37c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Banic-Zerovnik/06,
AUTHOR = {Bani{\v{c}}, Iztok and {\v{Z}}erovnik, Janez},
TITLE = {Fault-diameter of Cartesian graph bundles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {2},
PAGES = {47-51},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fault-tolerance, diameter, cartesian graph product, graph bundle, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K5JBWD-6/2/3a99f8eb5aae59ccbc6b305cd250f6a6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kikuchi-Araki/06,
AUTHOR = {Kikuchi, Yosuke and Araki, Toru},
TITLE = {Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {2},
PAGES = {52-59},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, bubble-sort graph, pancyclicity, edge-pancyclicity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K7NHSC-3/2/44ce43a0620a0a2ed4974e129decefb4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jimenez-Arevalo-Fernandez/06,
AUTHOR = {Jim{\'e}nez, Ernesto and Ar{\'e}valo, Sergio and Fern{\'a}ndez, Antonio},
TITLE = {Implementing unreliable failure detectors with unknown membership},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {2},
PAGES = {60-63},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {failure detectors, crash failures, membership, fault tolerance},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K5JBWD-5/2/6ccbd213a1da116a5e4963d914f59cf4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Damaschke/06a,
AUTHOR = {Damaschke, Peter},
TITLE = {A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {2},
PAGES = {64-68},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {rna structure, pattern matching, dynamic programming, design of algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K5JBWD-4/2/4605e0fc24a1d4504f5f3020e8d8881b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Elbassioni-Lotker-Seidel/06,
AUTHOR = {Elbassioni, Khaled and Lotker, Zvi and Seidel, Raimund},
TITLE = {Upper bound on the number of vertices of polyhedra with 0,1-constraint matrices},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {2},
PAGES = {69-71},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, polyhedron, upper bounds, linear programming},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K7NHSC-2/2/a71e11c5f50dc3c6d524e24a459b9d26},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lange-Somla/06,
AUTHOR = {Lange, Martin and Somla, Rafal},
TITLE = {Propositional dynamic logic of context-free programs and fixpoint logic with chop},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {2},
PAGES = {72-75},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {program specification, formal languages, concurrency},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K9CCT2-1/2/bdf5841cc63f5ae76510529d45dedf40},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ryu-Choi/06,
AUTHOR = {Ryu, Pum-Mo and Choi, Key-Sun},
TITLE = {Determining the specificity of terms using inside-outside information: A necessary condition of term hierarchy mining},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {2},
PAGES = {76-82},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {information retrieval, term specificity, term hierarchy, information theory, inside information, outside information},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KCPVFB-1/2/f1b8969ea4c309ed22605c2bfe99dd31},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Chang-Chen/06,
AUTHOR = {Lin, Jyh-Shyan and Chang, Jen-Chun and Chen, Rong-Jaye},
TITLE = {New simple constructions of distance-increasing mappings from binary vectors to permutations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {2},
PAGES = {83-89},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, distance-preserving mappings, distance-increasing mappings, permutation arrays, hamming distance},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KCPVFB-2/2/e66f607f368d0e0dc06e189ea1a32c0f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fredriksson-Mozgovoy/06,
AUTHOR = {Fredriksson, Kimmo and Mozgovoy, Maxim},
TITLE = {Efficient parameterized string matching},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {3},
PAGES = {91-96},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, parameterized string matching, bit-parallelism, suffix automaton},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KJDX29-2/2/4c07ce1b372804798ce73e47f2fd935f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pinlou-Sopena/06,
AUTHOR = {Pinlou, Alexandre and Sopena, {\'E}ric},
TITLE = {Oriented vertex and arc colorings of outerplanar graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {3},
PAGES = {97-104},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, outerplanar graph, girth, oriented chromatic number, oriented chromatic index},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KJDX29-3/2/e487ccd2eaec014dcdf0723cc39ca1e1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Akutsu/06,
AUTHOR = {Akutsu, Tatsuya},
TITLE = {A relation between edit distance for ordered trees and edit distance for Euler strings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {3},
PAGES = {105-109},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, edit distance, ordered trees, alignment, euler string},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KGG1W6-1/2/7461a75984df3aa44a16912a909fa865},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Liang-Jiang/06,
AUTHOR = {Zhang, Xianchao and Liang, Weifa and Jiang, He},
TITLE = {Flow equivalent trees in undirected node-edge-capacitated planar graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {3},
PAGES = {110-115},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {flow equivalent tree, minimum cut, node-edge-capacitated, planar graphs, graph algorithms, data structures},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KFV3JK-1/2/a7e3d95150b9bb8d469d9b2fc25e1f03},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gronemeier/06,
AUTHOR = {Gronemeier, Andr{\'e}},
TITLE = {A note on the decoding complexity of error-correcting codes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {3},
PAGES = {116-119},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, branching programs, error-correcting codes},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KFV3JK-3/2/24d82334b36552e66f87ccb2a30b448f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mukhopadhyay-Chatterjee-Lafreniere/06,
AUTHOR = {Mukhopadhyay, Asish and Chatterjee, Samidh and Lafreniere, Benjamin},
TITLE = {On the all-farthest-segments problem for a planar set of points},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {3},
PAGES = {120-123},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, computational geometry, analysis of algorithms, design of algorithms, computational complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KJDX29-1/2/c32b8519f67d5c84a43edd4b5f4e9df1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alhazov/06,
AUTHOR = {Alhazov, Artiom},
TITLE = {$P$ systems without multiplicities of symbol-objects},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {3},
PAGES = {124-129},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, theory of computation, distributed computing, parallel processing, membrane systems, turing computability},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KJTNNH-1/2/f424582c2a7f22b3941c552c77264fb7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Baril-Pallo/06,
AUTHOR = {Baril, Jean-Luc and Pallo, Jean-Marcel},
TITLE = {Efficient lower and upper bounds of the diagonal-flip distance between triangulations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {4},
PAGES = {131-136},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {triangulations, diagonal-flip distance, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KJDX29-5/2/bea180e6a3bee96463e078af276ddd34},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Peng-Ting/06,
AUTHOR = {Peng, Z.S. and Ting, H.F.},
TITLE = {An $O(n \log n)$-time algorithm for the maximum constrained agreement subtree problem for binary trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {4},
PAGES = {137-144},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, maximum agreement subtree, phylogenetic analysis},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KJDX29-4/2/4d0b90540a0d44127834bb0c7bf5d36f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Teoh-Jin-Connie-Ngo-Ling/06,
AUTHOR = {Teoh, Andrew and Jin, Beng and Connie, Tee and Ngo, David and Ling, Chek},
TITLE = {Remarks on BioHash and its mathematical foundation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {4},
PAGES = {145-150},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {biohash, cancelable biometrics, random projection, johnson-lindenstrauss lemma, security in digital systems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KGX8CY-1/2/eba78a74412b2136d222e435c9d6b24d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tao/06,
AUTHOR = {Tao, Yunfeng},
TITLE = {Infinity problems and countability problems for $\omega$-automata},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {4},
PAGES = {151-153},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, [omega]-automaton, cardinality, complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KGX8CY-2/2/e387eed723b182df0bd1e057d9b2a153},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Low/06,
AUTHOR = {Low, Chor Ping},
TITLE = {An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {4},
PAGES = {154-161},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {semi-matching, bipartite graphs, load balancing, np-hard, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KH47XC-1/2/3a076989ee0c77f2b1733a1bacfc9703},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cohen-Katzir-Raz/06,
AUTHOR = {Cohen, Reuven and Katzir, Liran and Raz, Danny},
TITLE = {An efficient approximation for the Generalized Assignment Problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {4},
PAGES = {162-166},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {generalized assignment problem, local ratio, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KDBM7F-1/2/eb107a5e5c7a43e3eaba7b9abb0a6f77},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wu-You-Lin/06,
AUTHOR = {Wu, Gang and You, Jia-Huai and Lin, Guohui},
TITLE = {A polynomial time algorithm for the minimum quartet inconsistency problem with $O(n)$ quartet errors},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {4},
PAGES = {167-171},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, phylogeny construction, quartet},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K7NHSC-4/2/8c8713c2fd9ddbe358a58236c823632c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alba-Luque-Araujo/06,
AUTHOR = {Alba, Enrique and Luque, Gabriel and Araujo, Lourdes},
TITLE = {Natural language tagging with genetic algorithms},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {5},
PAGES = {173-182},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {genetic algorithms, chc algorithm, natural language processing, part-of-speech tagging, parallel algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KM46YY-1/2/e3738729c9558ca89fbe0621310431cd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tan/06,
AUTHOR = {Tan, Xuehou},
TITLE = {A 2-approximation algorithm for the Zookeeper's problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {5},
PAGES = {183-187},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, approximation algorithms, zookeeper's problem, unfolding technique},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KF1HVG-1/2/b86385e921a10acc7fa3f963316106e8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Morosan/06,
AUTHOR = {Morosan, Calin D.},
TITLE = {On the number of broadcast schemes in networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {5},
PAGES = {188-193},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {number of broadcast schemes, randomly broadcasting, minimum broadcast time, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KKWVYK-2/2/41f9f6ef02ca7fe64b057472e23e3378},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Qian-Wang/06,
AUTHOR = {Qian, Jianbo and Wang, Cao An},
TITLE = {How much precision is needed to compare two sums of square roots of integers?},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {5},
PAGES = {194-198},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, numerical computations, square root of integer},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KKWVYK-1/2/ea2ba1ca9b0db97c0bab5513bf612f34},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Izumi-Masuzawa/06,
AUTHOR = {Izumi, Taisuke and Masuzawa, Toshimitsu},
TITLE = {A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {5},
PAGES = {199-205},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed computing, fault tolerance, consensus problem, condition-based approach},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KMYG33-2/2/2e5e87f5cc22643b588541fdb2651fcf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Engelfriet-Maneth/06,
AUTHOR = {Engelfriet, Joost and Maneth, Sebastian},
TITLE = {The equivalence problem for deterministic MSO tree transducers is decidable},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {5},
PAGES = {206-212},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, automata theory, equivalence problem, transducer},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KMYG33-1/2/4a6f9b378fe564e11c806dfe12251e90},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shioura-Tokuyama/06,
AUTHOR = {Shioura, Akiyoshi and Tokuyama, Takeshi},
TITLE = {Efficiently pricing European-Asian options --- Ultimate implementation and analysis of the AMO algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {6},
PAGES = {213-219},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, approximation algorithms, european-asian option, option pricing, randomized algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KR3JGT-1/2/7c156649a2b073234799e02d9ac06f92},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Aurenhammer-Drysdale-Krasser/06,
AUTHOR = {Aurenhammer, F. and Drysdale, R.L.S. and Krasser, H.},
TITLE = {Farthest line segment Voronoi diagrams},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {6},
PAGES = {220-225},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, voronoi diagram, farthest line segment, optimal algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KRY3X0-1/2/307f5645df3c2dfa80a86c47b8b10523},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fredriksson-Grabowski/06,
AUTHOR = {Fredriksson, Kimmo and Grabowski, Szymon},
TITLE = {A general compression algorithm that supports fast searching},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {6},
PAGES = {226-232},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, compression, searching in compressed text, q-grams},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KSSWGN-1/2/c5d4276ecb3373a907043d2902b0f0aa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu-Regan/06,
AUTHOR = {Liu, Hong and Regan, Kenneth W.},
TITLE = {Improved construction for universality of determinant and permanent},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {6},
PAGES = {233-237},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, algebraic formula size, determinant, permanent},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KPX904-1/2/bb4402f6f9c8dcc4c568fd8d2688c03f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Efrat-Har-Peled/06,
AUTHOR = {Efrat, Alon and Har-Peled, Sariel},
TITLE = {Guarding galleries and terrains},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {100},
NUMBER = {6},
PAGES = {238-245},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KYXJ0D-1/2/952f1aebd445974193ec972c41a760b9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}