@article{Mayordomo/02,
AUTHOR = {Mayordomo, Elvira},
TITLE = {A Kolmogorov complexity characterization of constructive Hausdorff dimension},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {1},
PAGES = {1-3},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Ayala-Rincon-Fonseca-Poubel-Siqueira/02,
AUTHOR = {Ayala-Rinc{\'{o}}n, Mauricio and Fonseca, Alexsandro F. da and Poubel, Hayd{\'{e}}e Werneck and Siqueira, Jos{\'{e}}},
TITLE = {A framework to visualize equivalences between computational models of regular languages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {1},
PAGES = {5-16},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kanda-Sugihara/02,
AUTHOR = {Kanda, Takeshi and Sugihara, Kokichi},
TITLE = {Comparison of various trees for nearest-point search with/without the Voronoi diagram},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {1},
PAGES = {17-22},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bansal-Vishal-Gupta/02,
AUTHOR = {Bansal, S.S. and Vishal, B. and Gupta, P.},
TITLE = {Near optmal Cholesky factorization on orthogonal multiprocessors},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {1},
PAGES = {23-30},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Gu-Hu-Zhang/02,
AUTHOR = {Gu, Jun and Hu, Xiao-Dong and Zhang, Mu-Hong},
TITLE = {Algorithms for multicast connection under multi-path routing model},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {1},
PAGES = {31-39},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Greenberg-Guan/02,
AUTHOR = {Greenberg, Ronald I. and Guan, Lee},
TITLE = {On the area of hypercube layouts},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {1},
PAGES = {41-46},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kim-Anderson/02,
AUTHOR = {Kim, Yong-Jik and Anderson, James H.},
TITLE = {A space- and time-efficient local-spin spin lock},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {1},
PAGES = {47-55},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Honkala/02a,
AUTHOR = {Honkala, Juha},
TITLE = {The equality problem for Parikh simple algebraic power series},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {2},
PAGES = {57-60},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Karagiorgos-Missirlis/02,
AUTHOR = {Karagiorgos, Gregory and Missirlis, Nikolaos M.},
TITLE = {Accelerated diffusion algorithms for dynamic load balancing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {2},
PAGES = {61-67},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Jacobsen-Larsen-Nielsen/02,
AUTHOR = {Jacobsen, Lars and Larsen, Kim S. and Nielsen, Morten N.},
TITLE = {On the existence and construction of non-extreme $(a, b)$-trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {2},
PAGES = {69-73},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bouyer/02,
AUTHOR = {Bouyer, Patricia},
TITLE = {A logical characterization of data languages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {2},
PAGES = {75-85},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Chuang-Hsu-Chang/02,
AUTHOR = {Chuang, Yen-Chu and Hsu, Lih-Hsing and Chang, Chung-Haw},
TITLE = {Optimal 1-edge fault-tolerant designs for ladders},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {2},
PAGES = {87-92},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Srinivasan-Baruah/02,
AUTHOR = {Srinivasan, Anand and Baruah, Sanjoy},
TITLE = {Deadline-based scheduling of periodic task systems on multiprocessors},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {2},
PAGES = {93-98},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Wan-Chen-Xu/02,
AUTHOR = {Wan, Yingyu and Chen, Guoliang and Xu, Yinlong},
TITLE = {A note on the minimum label spanning tree},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {2},
PAGES = {99-101},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lin-Xue/02,
AUTHOR = {Lin, Guohui and Xue, Guoliang},
TITLE = {On the terminal Steiner tree problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {2},
PAGES = {103-107},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kwon/02a,
AUTHOR = {Kwon, Oh-Heum},
TITLE = {Scheduling time-constrained multicast messages in circuit-switched tree networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {2},
PAGES = {109-116},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Biham/02,
AUTHOR = {Biham, Eli},
TITLE = {How to decrypt or even substitute DES-encrypted messages in $2^{28}$ steps},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {3},
PAGES = {117-124},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Cho-Kim-Cha-Bae/02,
AUTHOR = {Cho, Seung Mo and Kim, Hyung Ho and Cha, Sung Deok and Bae, Doo Hwan},
TITLE = {A semantics of sequence diagrams},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {3},
PAGES = {125-130},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Fertin-Godard-Raspaud/02,
AUTHOR = {Fertin, Guillaume and Godard, Emmanuel and Raspaud, Andr{\'{e}}},
TITLE = {Minimum feedback vertex set and acyclic coloring},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {3},
PAGES = {131-139},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Chen-Zhang/02,
AUTHOR = {Chen, Zhi-Zhong and Zhang, Shiquing},
TITLE = {Tight upper bound on the number of edges in bipartite $K_{3,3}$-free or $K_5$-free graph with an application},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {3},
PAGES = {141-145},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kleine_Buning-Zhao/02,
AUTHOR = {Kleine B{\"u}ning, Hans and Zhao, Xishun},
TITLE = {Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {3},
PAGES = {147-151},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Regev/02a,
AUTHOR = {Regev, Oded},
TITLE = {Priority algorithms for makespan minimization in the subset model},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {3},
PAGES = {153-157},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Baldoni-Melideo/02,
AUTHOR = {Baldoni, Roberto and Melideo, Giovanna},
TITLE = {On the minimal information to encode timestamps in distributed computations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {3},
PAGES = {159-166},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Nakano/02a,
AUTHOR = {Nakano, Shin-ichi},
TITLE = {Efficient generation of plane trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {3},
PAGES = {167-172},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Caprara-Rizzi/02,
AUTHOR = {Caprara, Alberto and Rizzi, Romeo},
TITLE = {Packing triangles in bounded degree graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {4},
PAGES = {175-180},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Neumann-Szepietowski-Walukiewicz/02,
AUTHOR = {Neumann, Jakub and Szepietowski, Andrzej and Walukiewicz, Igor},
TITLE = {Complexity of weak acceptance conditions in tree automata},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {4},
PAGES = {181-187},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Makino-Takabatake-Fujishige/02,
AUTHOR = {Makino, Kazuhisa and Takabatake, Takashi and Fujishige, Satoru},
TITLE = {A simple matching algorithm for regular bipartite graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {4},
PAGES = {189-193},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Tsai-Lin-Hsu/02,
AUTHOR = {Tsai, Yin-Te and Lin, Yaw-Ling and Hsu, F.R.},
TITLE = {The on-line first-fit algorithm for radio frequency assignment problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {4},
PAGES = {195-199},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Arya/02,
AUTHOR = {Arya, Sunil},
TITLE = {Binary space partitions for axis-parallel line segments: Size-height tradeoffs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {4},
PAGES = {201-206},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Ohlebusch/02,
AUTHOR = {Ohlebusch, Enno},
TITLE = {Hierarchical termination revisited},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {4},
PAGES = {207-214},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Khuller-Zhu/02,
AUTHOR = {Khuller, Samir and Zhu, An},
TITLE = {The general Steiner tree-star problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {4},
PAGES = {215-220},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Sung-Kim-Park-Chang-Shin/02,
AUTHOR = {Sung, Minyoung and Kim, Soyoung and Park, Sangsoo and Chang, Naehyuck and Shin, Heonshik},
TITLE = {Comparative performance evaluation of Java Threads for embedded applications: Linux Thread vs. Green Thread},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {4},
PAGES = {221-225},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Verma/02,
AUTHOR = {Verma, Rakesh},
TITLE = {Algorithms and reductions for rewriting problems --- II},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {4},
PAGES = {227-233},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Pretzel/02a,
AUTHOR = {Pretzel, Oliver},
TITLE = {Characterization of simple edge-firing games},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {5},
PAGES = {235-236},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Rosen/02,
AUTHOR = {Ros{\'{e}}n, Adi},
TITLE = {A note on models for non-probabilistic analysis of packet switching networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {5},
PAGES = {237-240},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Costantini-DAntona-Provetti/02,
AUTHOR = {Costantini, Stefania and D'Antona, Ottavio and Provetti, Alessandro},
TITLE = {On the equivalence and range of applicability of graph-based representations of logic programs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {5},
PAGES = {241-249},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Brandstadt-Mahfud/02,
AUTHOR = {Brandst{\"a}dt, Andreas and Mahfud, Suhail},
TITLE = {Maximum weight stable set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {5},
PAGES = {251-259},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Fujita/02a,
AUTHOR = {Fujita, Ken-etsu},
TITLE = {An interpretation of $\lambda\mu$-calculus},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {5},
PAGES = {261-264},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Ngo-Du-Graham/02,
AUTHOR = {Ngo, Hung Quang and Du, Ding-Zhu and Graham, Ronald L.},
TITLE = {New bounds on hypercube coloring problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {5},
PAGES = {265-269},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bartal-Chrobak-Noga-Raghavan/02,
AUTHOR = {Bartal, Yair and Chrobak, Marek and Noga, John and Raghavan, Prabhakar},
TITLE = {More on random walks, electrical networks, and the harmonic $k$-server algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {5},
PAGES = {271-276},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Cho-Hsu/02,
AUTHOR = {Cho, Hsun-Jung and Hsu, Li-Yen},
TITLE = {Ring embedding in faulty honeycomb rectangular torus},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {5},
PAGES = {277-284},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Fomin-Kratsch-Novelli/02,
AUTHOR = {Fomin, Fedor V. and Kratsch, Dieter and Novelli, Jean-Christophe},
TITLE = {Approximating minimum cocolorings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {5},
PAGES = {285-290},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kirsten/02a,
AUTHOR = {Kirsten, Daniel},
TITLE = {The finite power problem revisited},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {6},
PAGES = {291-294},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Jana-Naidu-Kumar-Arora-Sinha/02,
AUTHOR = {Jana, Prasanta K. and Naidu, B. Damodara and Kumar, Shailendra and Arora, Monish and Sinha, Bhabani P.},
TITLE = {Parallel prefix computation on extended multi-mesh network},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {6},
PAGES = {295-303},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Maggiolo-Schettini-Tini/02,
AUTHOR = {Maggiolo-Schettini, Andrea and Tini, Simone},
TITLE = {On disjunction of literals in triggers of statecharts transitions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {6},
PAGES = {305-310},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Diller/02,
AUTHOR = {Diller, Antoni},
TITLE = {Efficient multi-variate abstraction using an array representation for combinators},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {6},
PAGES = {311-317},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Blundo-Cimato-Masucci/02,
AUTHOR = {Blundo, Carlo and Cimato, Stelvio and Masucci, Barbara},
TITLE = {A note on optimal metering schemes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {6},
PAGES = {319-326},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Rastsvetaev-Beklemishev/02,
AUTHOR = {Rastsvetaev, A.L. and Beklemishev, L.D.},
TITLE = {On the query complexity of finding a local maximum point},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {6},
PAGES = {327-332},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Cleary/02,
AUTHOR = {Cleary, Sean},
TITLE = {Rstricted rotation distance between binary trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {6},
PAGES = {333-338},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Domaratzki-Pighizzini-Shallit/02,
AUTHOR = {Domaratzki, Michael and Pighizzini, Giovanni and Shallit, Jeffrey},
TITLE = {Simulating finite automata with context-free grammars},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {84},
NUMBER = {6},
PAGES = {339-344},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}