@article{Lanotte-Maggiolo-Schettini-Tini/04,
AUTHOR = {Lanotte, Ruggero and Maggiolo-Schettini, Andrea and Tini, Simone},
TITLE = {$\varepsilon$-transitions in concurrent timed auatomata},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {1},
PAGES = {1-7},
YEAR = {2004},
KEYWORDS = {real-time systems, $\epsilon$-transitions, concurrent timed automata, polynomial closure},
URL = {DOI:10.1016/j.ipl.2003.09.018},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Honkala-Laihonen/04,
AUTHOR = {Honkala, Iiro and Laihonen, Tero},
TITLE = {On identifying codes in the hexagonal mesh},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {1},
PAGES = {9-14},
YEAR = {2004},
KEYWORDS = {fault tolerance, identification, optimal code, combinatorial problems},
URL = {DOI:10.1016/j.ipl.2003.09.009},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Drake-Hougardy/04,
AUTHOR = {Drake, Doratha E. and Hougardy, Stefan},
TITLE = {On approximation algorithms for the terminal Steiner tree problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {1},
PAGES = {15-18},
YEAR = {2004},
KEYWORDS = {approximation algorithms, Steiner tree},
URL = {DOI:10.1016/j.ipl.2003.09.014},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Chan/04,
AUTHOR = {Chan, Timothy M.},
TITLE = {A note on maximum independent sets in rectangle intersection graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {1},
PAGES = {19-23},
YEAR = {2004},
KEYWORDS = {approximation algorithms, computational geometry, dynamic programming},
URL = {DOI:10.1016/j.ipl.2003.09.019},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Vincent-Liu/04,
AUTHOR = {Vincent, Millist W. and Liu, Jixue},
TITLE = {Irrelevant updates and self-maintainability in transitive closure database views},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {1},
PAGES = {25-29},
YEAR = {2004},
KEYWORDS = {databases, irrelevant updates, self-maintainability, view maintenance, graphs, transitive closure},
URL = {DOI:10.1016/j.ipl.2003.09.008},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Geerts-Kuijpers/04,
AUTHOR = {Geerts, Floris and Kuijpers, Bart},
TITLE = {Topological formulation of termination properties of iterates of functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {1},
PAGES = {31-35},
YEAR = {2004},
KEYWORDS = {decision problems, iterates of functions, dynamical systems, fixed points, transitive closure, topology, databases},
URL = {DOI:10.1016/j.ipl.2003.09.012},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Grieser-Lange/04,
AUTHOR = {Grieser, Gunter and Lange, Steffen},
TITLE = {Incremental learning of approximations from positive data},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {1},
PAGES = {37-42},
YEAR = {2004},
KEYWORDS = {inductive inference, incremental learning, formal languages, theory of computation, on-line algorithms},
URL = {DOI:10.1016/j.ipl.2003.09.010},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Vinodchandran/04,
AUTHOR = {Vinodchandran, N.V.},
TITLE = {$AM_{exp}\not\subseteq(NP\cup coNP)/poly$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {1},
PAGES = {43-47},
YEAR = {2004},
KEYWORDS = {computational complexity, nonuniform computation, lower bound, relativization},
URL = {DOI:10.1016/j.ipl.2003.09.011},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Durgan/04,
AUTHOR = {Durgan, Bruce K.},
TITLE = {Compact searchable static binary trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {1},
PAGES = {49-52},
YEAR = {2004},
KEYWORDS = {compact binary tree, databases, data structures},
URL = {DOI:10.1016/j.ipl.2003.09.013},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Seager/04,
AUTHOR = {Seager, Suzanne M.},
TITLE = {The greedy algorithm for domination in graphs of maximum degree 3},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {2},
PAGES = {53-56},
YEAR = {2004},
KEYWORDS = {algorithms, dominating set, maximum size},
URL = {DOI:10.1016/j.ipl.2003.10.007},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Fleischer-Golin-Lea-Wong/04,
AUTHOR = {Fleischer, Rudolf and Golin, Mordecai and Lea, Chin-Tau and Wong, Steven},
TITLE = {Finding optimal paths in MREP routing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {2},
PAGES = {57-63},
YEAR = {2004},
KEYWORDS = {approximation algorithms, graph algorithms, computational complexity},
URL = {DOI:10.1016/j.ipl.2003.10.005},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Fraczak-Podolak/04,
AUTHOR = {Fraczak, Wojciech and Podolak, Anna},
TITLE = {A characterization of s-languages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {2},
PAGES = {65-70},
YEAR = {2004},
KEYWORDS = {formal languages, minimal deterministic automaton, prefix code, $s$-language},
URL = {DOI:10.1016/j.ipl.2003.10.006},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Jukna/04,
AUTHOR = {Jukna, Stasys},
TITLE = {On the minimum number of negations leading to super-polynomial savings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {2},
PAGES = {71-74},
YEAR = {2004},
KEYWORDS = {computational complexity, negation-limited circuits},
URL = {DOI:10.1016/j.ipl.2003.10.003},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Klasing-Laforest/04,
AUTHOR = {Klasing, Ralf and Laforest, Christian},
TITLE = {Hardness results and approximation algorithms of $k$-tuple domination in graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {2},
PAGES = {75-83},
YEAR = {2004},
KEYWORDS = {approximation algorithms, combinatorial problems, domination problems},
URL = {DOI:10.1016/j.ipl.2003.10.004},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Marx/04,
AUTHOR = {Marx, D{\'a}niel},
TITLE = {List edge multicoloring in graphs with few cycles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {2},
PAGES = {85-90},
YEAR = {2004},
KEYWORDS = {graph algorithms, list coloring, edge coloring, multicoloring},
URL = {DOI:10.1016/j.ipl.2003.09.016},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Roy-Goswami-Das-Nandy/04,
AUTHOR = {Roy, Sasanka and Goswami, Partha P. and Das, Sandip and Nandy, Subhas C.},
TITLE = {Optimal algorithm for a special point-labeling problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {2},
PAGES = {91-98},
YEAR = {2004},
KEYWORDS = {map labeling, chordal graphs, algorithms, complexity, analysis of algorithms},
URL = {DOI:10.1016/j.ipl.2003.10.002},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Valiant/04,
AUTHOR = {Valiant, Paul},
TITLE = {The log-rank conjecture and low degree polynomials},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {2},
PAGES = {99-103},
YEAR = {2004},
KEYWORDS = {log-rank conjecture, communication complexity, boolean polynomials, computational complexity},
URL = {DOI:10.1016/j.ipl.2003.09.020},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Chandran/04,
AUTHOR = {Chandran, L. Sunil},
TITLE = {Minimum cuts, girth and a spectral threshold},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {3},
PAGES = {105-110},
YEAR = {2004},
KEYWORDS = {laplacian spectrum, minimum cuts, girth, graph algorithms},
URL = {DOI:10.1016/j.ipl.2003.10.009},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Hess/04,
AUTHOR = {Hess, F.},
TITLE = {On the security of the verifiably-encrypted signature scheme of Boneh, Gentry, Lynn and Shacham},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {3},
PAGES = {111-114},
YEAR = {2004},
KEYWORDS = {safety/security in digital systems, signature schemes},
URL = {DOI:10.1016/j.ipl.2003.10.008},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Jung-Chwa/04,
AUTHOR = {Jung, Joo-Won and Chwa, Kyung-Yong},
TITLE = {Labeling points with given rectangles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {3},
PAGES = {115-121},
YEAR = {2004},
KEYWORDS = {approximation algorithms, computational geometry, map labeling},
URL = {DOI:10.1016/j.ipl.2003.09.017},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Baier-Hermanns-Katoen/04,
AUTHOR = {Baier, Christel and Hermanns, Holger and Katoen, Joost-Pieter},
TITLE = {Probabilistic weak simulation is decidable in polynomial time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {3},
PAGES = {123-130},
YEAR = {2004},
KEYWORDS = {algorithms, computational complexity, Markov chains, performance evaluation, simulation preorder},
URL = {DOI:10.1016/j.ipl.2003.10.001},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Kerenidis-Nayak/04,
AUTHOR = {Kerenidis, I. and Nayak, A.},
TITLE = {Weak coin flipping with small bias},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {3},
PAGES = {131-135},
YEAR = {2004},
KEYWORDS = {quantum computation, coin flipping, cryptography, algorithms, quantum communication},
URL = {DOI:10.1016/j.ipl.2003.07.007},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Ben-Moshe-Carmi-Katz/04,
AUTHOR = {Ben-Moshe, Boaz and Carmi, Paz and Katz, Matthew J.},
TITLE = {Computing all large sums-of-pairs in $R^n$ and the discrete planar two-watchtower problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {3},
PAGES = {137-139},
YEAR = {2004},
KEYWORDS = {algorithms, computational geometry, facility location},
URL = {DOI:10.1016/j.ipl.2003.07.008},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Perst-Seidl/04,
AUTHOR = {Perst, Thomas and Seidl, Helmut},
TITLE = {Macro forest transducers},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {3},
PAGES = {141-149},
YEAR = {2004},
KEYWORDS = {xml, macro tree transducers, inverse type inference, formal languages},
URL = {DOI:10.1016/j.ipl.2003.05.001},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{da_Fonseca-de_Figueiredo-Carvalho/04,
AUTHOR = {da Fonseca, Guilherme D. and de Figueiredo, Celina M.H. and Carvalho, Paulo C.P.},
TITLE = {Kinetic hanger},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {3},
PAGES = {151-157},
YEAR = {2004},
KEYWORDS = {data structures, kinetic priority queue, kinetic hanger},
URL = {DOI:10.1016/j.ipl.2003.10.010},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Campelo-Correa-Frota/04,
AUTHOR = {Camp{\^e}lo, Manoel and Corr{\^e}a, Ricardo and Frota, Yuri},
TITLE = {Cliques, holes and the vertex coloring polytope},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {4},
PAGES = {159-164},
YEAR = {2004},
KEYWORDS = {combinatorial problems, facets of polyhedra, graph coloring, integer programming},
URL = {DOI:10.1016/j.ipl.2003.11.005},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Brandstadt-Le-de_Ridder/04,
AUTHOR = {Brandst{\"a}dt, Andreas and Le, Van Bang and de Ridder, H.N.},
TITLE = {Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {4},
PAGES = {165-173},
YEAR = {2004},
KEYWORDS = {efficient graph algorithms, robust graph algorithms, modular decomposition, maximum weight stable set problem on graphs, graph algorithms},
URL = {DOI:10.1016/j.ipl.2003.11.002},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Crescenzi-Greco/04,
AUTHOR = {Crescenzi, Pilu and Greco, Federico},
TITLE = {The minimum likely column cover problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {4},
PAGES = {175-179},
YEAR = {2004},
KEYWORDS = {approximation algorithms, combinatorial problems, computational complexity, covering design, lottery schema},
URL = {DOI:10.1016/j.ipl.2003.11.003},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Kovacs-Kis/04,
AUTHOR = {Kov{\'a}cs, Andr{\'a}s and Kis, Tam{\'a}s},
TITLE = {Partitioning of trees for minimizing height and cardinality},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {4},
PAGES = {181-185},
YEAR = {2004},
KEYWORDS = {partitioning of trees, graph algorithms, analysis of algorithms, computational complexity},
URL = {DOI:10.1016/j.ipl.2003.11.004},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Johnson/04,
AUTHOR = {Johnson, L.F.},
TITLE = {Tumble, a fast simple iteration algorithm for Fibonacci},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {4},
PAGES = {187-189},
YEAR = {2004},
KEYWORDS = {algorithms, Fibonacci, Lucas numbers, recurrence relations},
URL = {DOI:10.1016/j.ipl.2003.10.012},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Lucas/04,
AUTHOR = {Lucas, Salvador},
TITLE = {Strong and $NV$-sequentiality of constructor systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {4},
PAGES = {191-201},
YEAR = {2004},
KEYWORDS = {programming languages, sequentiality, strategies, term rewriting},
URL = {DOI:10.1016/j.ipl.2003.11.006},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Wang-Wang-Chang/04,
AUTHOR = {Wang, Fu-Hsing and Wang, Yue-Li and Chang, Jou-Ming},
TITLE = {Feedback vertex sets in star graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {4},
PAGES = {203-208},
YEAR = {2004},
KEYWORDS = {feedback vertex sets, interconnection networks, star graphs, algorithms, analysis of algorithms},
URL = {DOI:10.1016/j.ipl.2003.11.001},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Giurcaneanu/04,
AUTHOR = {Giurc{\u{a}}neanu, Ciprian Doru},
TITLE = {On some properties of the NML estimator for Bernoulli strings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {4},
PAGES = {209-213},
YEAR = {2004},
KEYWORDS = {algorithms, combinatorial problems, monotonicity, bounds, non-asymptotic estimation},
URL = {DOI:10.1016/j.ipl.2003.10.011},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Codenotti-De_Marco-Leoncini-Montangero-Santini/04,
AUTHOR = {Codenotti, Bruno and De Marco, Gianluca and Leoncini, Mauro and Montangero, Manuela and Santini, Massimo},
TITLE = {Approximation algorithms for a hierarchically structured bin packing problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {5},
PAGES = {215-221},
YEAR = {2004},
KEYWORDS = {algorithms, approximation algorithms, bin packing, $np$-hardness},
URL = {DOI:10.1016/j.ipl.2003.12.001},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Nagamochi-Suzuki-Ishii/04,
AUTHOR = {Nagamochi, Hiroshi and Suzuki, Takahisa and Ishii, Toshimasa},
TITLE = {A simple recognition of maximal planar graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {5},
PAGES = {223-226},
YEAR = {2004},
KEYWORDS = {linear time algorithm, maximal planar graph, triangulated plane graph, planarity test, graph algorithms},
URL = {DOI:10.1016/j.ipl.2003.11.011},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Wang/04,
AUTHOR = {Wang, Guilin},
TITLE = {Universal forgery on a group signature scheme using self-certified public keys},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {5},
PAGES = {227-231},
YEAR = {2004},
KEYWORDS = {cryptography, digital signature, group signature, forgery},
URL = {DOI:10.1016/j.ipl.2003.11.014},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Koltun/04,
AUTHOR = {Koltun, Vladlen},
TITLE = {Ready, Set, Go! The Voronoi diagram of moving points that start from a line},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {5},
PAGES = {233-235},
YEAR = {2004},
KEYWORDS = {computational geometry, voronoi diagram, near-quadratic upper bound},
URL = {DOI:10.1016/j.ipl.2003.11.012},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Durand-Lose/04,
AUTHOR = {Durand-Lose, J{\'e}r{\^o}me},
TITLE = {A Kleene theorem for splitable signals},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {5},
PAGES = {237-245},
YEAR = {2004},
KEYWORDS = {timed automata, piecewise constant signal, signal regular expression, formal languages},
URL = {DOI:10.1016/j.ipl.2003.11.010},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Dinur-Safra/04,
AUTHOR = {Dinur, Irit and Safra, Shmuel},
TITLE = {On the hardness of approximating label-cover},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {5},
PAGES = {247-254},
YEAR = {2004},
KEYWORDS = {computational complexity, hardness of approximation, PCP, label-cover},
URL = {DOI:10.1016/j.ipl.2003.11.007},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Dahlhaus-Dankelmann-Ravi/04,
AUTHOR = {Dahlhaus, Elias and Dankelmann, Peter and Ravi, R.},
TITLE = {A linear-time algorithm to compute a MAD tree of an interval graph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {5},
PAGES = {255-259},
YEAR = {2004},
KEYWORDS = {graph algorithms, interval graphs, spanning tree},
URL = {DOI:10.1016/j.ipl.2003.11.009},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Fecher/04,
AUTHOR = {Fecher, Harald},
TITLE = {A completed hierarchy of true concurrent equivalences},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {5},
PAGES = {261-265},
YEAR = {2004},
KEYWORDS = {concurrency, semantic equivalences, hierarchy, configuration structures, bisimulation},
URL = {DOI:10.1016/j.ipl.2003.11.008},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Hoogeboom-Kosters/04,
AUTHOR = {Hoogeboom, Hendrik Jan and Kosters, Walter A.},
TITLE = {Tetris and decidability},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {6},
PAGES = {267-272},
YEAR = {2004},
KEYWORDS = {tetris, decidability, theory of computation},
URL = {DOI:10.1016/j.ipl.2003.12.006},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Laoutaris-Zissimopoulos-Stavrakakis/04,
AUTHOR = {Laoutaris, Nikolaos and Zissimopoulos, Vassilios and Stavrakakis, Ioannis},
TITLE = {Joint object placement and node dimensioning for Internet content distribution},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {6},
PAGES = {273-279},
YEAR = {2004},
KEYWORDS = {combinatorial problems, content distribution, multi-commodity $k$-median, packing},
URL = {DOI:10.1016/j.ipl.2003.12.002},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Goldberg/04,
AUTHOR = {Goldberg, Mayer},
TITLE = {A construction of one-point bases in extended lambda calculi},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {6},
PAGES = {281-286},
YEAR = {2004},
KEYWORDS = {programming calculi, programming languages, functional programming, lambda calculi, bases, constants},
URL = {DOI:10.1016/j.ipl.2003.12.005},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Lai-Chang/04,
AUTHOR = {Lai, Yung-Ling and Chang, Gerard J.},
TITLE = {On the profile of the corona of two graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {6},
PAGES = {287-292},
YEAR = {2004},
KEYWORDS = {profile, corona, numbering, interval graph, caterpillar, complete graph, cycle},
URL = {DOI:10.1016/j.ipl.2003.12.004},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Kapoor-Josephs/04,
AUTHOR = {Kapoor, Hemangee K. and Josephs, Mark B.},
TITLE = {Modelling and verification of delay-insensitive circuits using CCS and the Concurrency Workbench},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {6},
PAGES = {293-296},
YEAR = {2004},
KEYWORDS = {formal methods, specification languages, formal verification, asynchronous logic},
URL = {DOI:10.1016/j.ipl.2003.12.007},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Liskiewicz-Manthey/04,
AUTHOR = {Li{\'s}kiewicz, Maciej and Manthey, Bodo},
TITLE = {New lower and upper bounds for the competitive ratio of transmission protocols},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {6},
PAGES = {297-301},
YEAR = {2004},
KEYWORDS = {on-line algorithms, interconnection networks, transmission protocols},
URL = {DOI:10.1016/j.ipl.2003.12.003},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Alonso-Chassaing-Reingold-Schott/04,
AUTHOR = {Alonso, Laurent and Chassaing, Philippe and Reingold, Edward M. and Schott, Ren{\'e}},
TITLE = {The worst-case chip problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {6},
PAGES = {303-308},
YEAR = {2004},
KEYWORDS = {fault diagnosis, analysis of algorithms, chip problem, majority problem},
URL = {DOI:10.1016/j.ipl.2003.11.013},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}
@article{Yokoyama-Hu-Takeichi/04,
AUTHOR = {Yokoyama, Tetsuo and Hu, Zhenjiang and Takeichi, Masato},
TITLE = {Deterministic second-order patterns},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {89},
NUMBER = {6},
PAGES = {309-314},
YEAR = {2004},
KEYWORDS = {second-order pattern matching, functional programming, program derivation, program transformation, fusion transformation},
URL = {DOI:10.1016/j.ipl.2003.12.008},
PUBLISHER = {Elsevier Science B.V. (North-Holland)},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-Shannon-St. Louis-Tokyo},
}