@article{Hanus-Lucas-Middeldorp/98,
AUTHOR = {Hanus, Michael and Lucas, Salvador and Middeldorp, Aart},
TITLE = {Strongly sequential and inductively sequential term rewriting systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {1},
PAGES = {1-8},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Liberatore/98,
AUTHOR = {Liberatore, Vincenzo},
TITLE = {Uniform multipaging reduces to paging},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {1},
PAGES = {9-12},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Bottoni-Levialdi-Paun/98,
AUTHOR = {Bottoni, Paolo and Levialdi, Stefano and P{\u{a}}un, Gheorghe},
TITLE = {Successful visual human-computer interaction is undecidable},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {1},
PAGES = {13-19},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Yang/98,
AUTHOR = {Yang, Wuu},
TITLE = {A data-parallel algorithm for minimum-width tree layout},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {1},
PAGES = {21-28},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Blass-Gurevich-Kreinovich-Longpre/98,
AUTHOR = {Blass, Andreas and Gurevich, Yuri and Kreinovich, Vladik and Longpr{\'{e}}, Luc},
TITLE = {A variation on the zero-one law},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {1},
PAGES = {29-30},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Cerioli-Everett-Figueiredo-Klein/98,
AUTHOR = {Cerioli, M{\'{a}}rcia R. and Everett, Hazel and Figueiredo, Celina M.H. de and Klein, Sulamita},
TITLE = {The homogeneous set sandwich problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {1},
PAGES = {31-35},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Johannsen/98,
AUTHOR = {Johannsen, Jan},
TITLE = {Lower bounds for monotone real circuit depth and formula size and tree-like cutting planes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {1},
PAGES = {37-41},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Waldmann/98,
AUTHOR = {Waldmann, Uwe},
TITLE = {Extending reduction orderings to ACU-compatible reduction orderings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {1},
PAGES = {43-49},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Nardelli-Proietti-Widmayer/98,
AUTHOR = {Nardelli, Enrico and Proietti, Guido and Widmayer, Peter},
TITLE = {Finding the detour-critical edge of a shortest path between two nodes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {1},
PAGES = {51-54},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{de_Bonis-Vaccaro/98,
AUTHOR = {de Bonis, Annalisa and Vaccaro, Ugo},
TITLE = {Improved algorithms for group testing with inhibitors},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {2},
PAGES = {57-64},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Audsley-Burns/98,
AUTHOR = {Audsley, N.C. and Burns, A.},
TITLE = {On fixed priority scheduling, offsets and co-prime task periods},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {2},
PAGES = {65-69},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Krivelevich-Sudakov/98,
AUTHOR = {Krivelevich, Michael and Sudakov, Benny},
TITLE = {Coloring random graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {2},
PAGES = {71-74},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Castro-Guijarro-Lavin/98,
AUTHOR = {Castro, Jorge and Guijarro, David and Lav{\'{i}}n, V{\'{i}}ctor},
TITLE = {Learning nearly monotone $k$-term DNF},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {2},
PAGES = {75-79},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Montana-Pardo/98,
AUTHOR = {Monta{\~{n}}a, J.L. and Pardo, Luis M.},
TITLE = {On Kolmogorov complexity in the real Turing machine setting},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {2},
PAGES = {81-86},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Grolmusz/98,
AUTHOR = {Grolmusz, Vince},
TITLE = {A lower bound for depth-3 circuits with MOD $m$-gates},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {2},
PAGES = {87-90},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Rosenberg/98,
AUTHOR = {Rosenberg, Burton},
TITLE = {Fast nondeterministic recognition of context-free languages using two queues},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {2},
PAGES = {91-93},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Bergstra-Ponse/98,
AUTHOR = {Bergstra, Jan A. and Ponse, Alban},
TITLE = {Kleene's three-valued logic and process algebra},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {2},
PAGES = {95-103},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Phillips-Punnen-Kabadi/98,
AUTHOR = {Phillips, Jeffrey Mark and Punnen, Abraham P. and Kabadi, S.N.},
TITLE = {A linear time algorithm for the bottleneck Traveling Salesman problem on a Halin graph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {2},
PAGES = {105-110},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Crochmore-Mignosi-Restivo/98,
AUTHOR = {Crochmore, M. and Mignosi, F. and Restivo, A.},
TITLE = {Automata and forbidden words},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {3},
PAGES = {111-117},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Majster-Cederbaum-Roggenbach/98,
AUTHOR = {Majster-Cederbaum, Mila and Roggenbach, Markus},
TITLE = {Transition systems from event structures revisited},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {3},
PAGES = {119-124},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Hassin-Rubinstein/98,
AUTHOR = {Hassin, Refael and Rubinstein, Shlomi},
TITLE = {An approximation algorithm for the maximum Traveling Salesman problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {3},
PAGES = {125-130},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Damaschke/98,
AUTHOR = {Damaschke, Peter},
TITLE = {Randomized group testing for mutually obscuring defectives},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {3},
PAGES = {131-135},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Hu-Tucker/98,
AUTHOR = {Hu, T.C. and Tucker, P.A.},
TITLE = {Optimal alphabetic trees for binary search},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {3},
PAGES = {137-140},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Rajasekaran/98,
AUTHOR = {Rajasekaran, Sanguthevar},
TITLE = {An optimal parallel algorithm for sorting multisets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {3},
PAGES = {141-143},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Pedreschi-Ruggieri/98,
AUTHOR = {Pedreschi, Dino and Ruggieri, Salvatore},
TITLE = {Weakest preconditions for pure Prolog programs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {3},
PAGES = {145-150},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Chen-Wu/98,
AUTHOR = {Chen, Loon-Been and Wu, I-Chen},
TITLE = {On the time complexity of minimum and maximum global snapshot problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {3},
PAGES = {151-156},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Chalamaiah-Ramamurthy/98,
AUTHOR = {Chalamaiah, Nimmagadda and Ramamurthy, Badrinath},
TITLE = {Finding shortest paths in distributed loop networkds},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {3},
PAGES = {157-161},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Lobbing-Sieling-Wegener/98,
AUTHOR = {L{\"o}bbing, Martin and Sieling, Detlef and Wegener, Ingo},
TITLE = {Parity OBDDs cannot be handled efficiently enough},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {4},
PAGES = {163-168},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Backhouse/98,
AUTHOR = {Backhouse, Roland},
TITLE = {Pair algebras and Galois connections},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {4},
PAGES = {169-175},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Bonabeau-Henaux/98,
AUTHOR = {Bonabeau, Eric and H{\'{e}}naux, Florian},
TITLE = {Self-organizing maps for drawing large graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {4},
PAGES = {177-184},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Martinelli/98,
AUTHOR = {Martinelli, Fabio},
TITLE = {An improvement of algorithms for solving interface equations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {4},
PAGES = {185-190},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Fujita/98,
AUTHOR = {Fujita, Satoshi},
TITLE = {A quorum based $k$-mutual exclusion by weighted $k$-quorum systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {4},
PAGES = {191-197},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Greco/98,
AUTHOR = {Greco, G.},
TITLE = {Embeddings and the trace of finite sets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {4},
PAGES = {199-203},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Goldreich-Hastad/98,
AUTHOR = {Goldreich, Oded and H{\aa}stad, Johan},
TITLE = {On the complexity of interactive proofs with bounded communication},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {4},
PAGES = {205-214},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Baader/98,
AUTHOR = {Baader, Franz},
TITLE = {On the complexity of Boolean unification},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {4},
PAGES = {215-220},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Wang/98a,
AUTHOR = {Wang, Huaxiong},
TITLE = {On syntactic nuclei of rational languages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {5},
PAGES = {221-226},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Harary-Ranjan/98,
AUTHOR = {Harary, Frank and Ranjan, Desh},
TITLE = {Breaking symmetry in complete graphs by orienting edges: Asymptotic bounds},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {5},
PAGES = {227-230},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Burkard-Deneko/98,
AUTHOR = {Burkard, Rainer E. and De{\u{\i}}neko, Vladimir G.},
TITLE = {On the Traveling Salesman problem with a relaxed Monge matrix},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {5},
PAGES = {231-237},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Nagamochi-Ibaraki/98,
AUTHOR = {Nagamochi, Hiroshi and Ibaraki, Toshihide},
TITLE = {A note on minimizing submodular functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {5},
PAGES = {239-244},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Lucas/98,
AUTHOR = {Lucas, Salvador},
TITLE = {Root-neededness and approximations of neededness},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {5},
PAGES = {245-254},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Sterbini-Raschle/98,
AUTHOR = {Sterbini, Andrea and Raschle, Thomas},
TITLE = {An $O(n^3)$ time algorithm for recognizing threshold dimension 2 graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {5},
PAGES = {255-259},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Gens-Levner/98,
AUTHOR = {Gens, George and Levner, Eugene},
TITLE = {An approximate binary search algorithm for the multiple-choice knapsack problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {5},
PAGES = {261-265},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Gonzalez/98,
AUTHOR = {Gonzalez, Teofilo F.},
TITLE = {Improved approximation algorithms for embedding hyperedges in a cycle},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {5},
PAGES = {267-271},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Ramirez_Alfonsin/98,
AUTHOR = {Ram{\'{i}}rez Alfons{\'{i}}n, J.L.},
TITLE = {A special arrangement with minimal number of triangles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {6},
PAGES = {273-276},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Guaiana-Meyer-Petit-Weil/98,
AUTHOR = {Guaiana, G. and Meyer, R. and Petit, A. and Weil, P.},
TITLE = {An extension of the wreath product principle for finite Mazurkiewicz traces},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {6},
PAGES = {277-282},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Gu-Peng/98a,
AUTHOR = {Gu, Qian-Ping and Peng, Shietung},
TITLE = {An efficient algorithm for $k$-pairwise disjoint paths in star graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {6},
PAGES = {283-287},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Chu/98,
AUTHOR = {Chu, Francis},
TITLE = {Reducing $\Omega$ to $\diamond W$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {6},
PAGES = {289-293},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Feder-Shende/98,
AUTHOR = {Feder, Tom{\'{a}}s and Shende, Sunil M.},
TITLE = {Online channel allocation in FDMA networks with reuse constraints},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {6},
PAGES = {295-302},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Chan/98a,
AUTHOR = {Chan, Timothy M.},
TITLE = {Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {6},
PAGES = {303-304},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Sanders/98a,
AUTHOR = {Sanders, P.},
TITLE = {Random permutations on distributed, external and hierarchical memory},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {6},
PAGES = {305-309},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Choi-Jung-Kim-Jung/98,
AUTHOR = {Choi, Kyunghee and Jung, Gihyun and Kim, Taegeun and Jung, Seunhun},
TITLE = {Real-time scheduling algorithm for minimizing maximum weighted error with $O(N\log N+cN)$ complexity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {6},
PAGES = {311-315},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Baroujerdi-Uhlmann/98,
AUTHOR = {Baroujerdi, Ali and Uhlmann, Jeffrey},
TITLE = {An efficient algorithm for computing least cost paths with turn constraints},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {67},
NUMBER = {6},
PAGES = {317-321},
YEAR = {1998},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}