@article{Focardi-Luccio-Peleg/00,
AUTHOR = {Focardi, Riccardo and Luccio, Flaminia L. and Peleg, David},
TITLE = {Feedback vertex set in hypercubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {1-2},
PAGES = {1-5},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bespamyatnikh-Segal/00a,
AUTHOR = {Bespamyatnikh, Sergei and Segal, Michael},
TITLE = {Enumerating longest increasing subsequences and patience sorting},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {1-2},
PAGES = {7-11},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Uehara-Chen/00,
AUTHOR = {Uehara, Ryuhei and Chen, Zhi-Zhong},
TITLE = {Parallel approximation algorithms for maximum weighted matching in general graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {1-2},
PAGES = {13-17},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Borzyszkowski/00,
AUTHOR = {Borzyszkowski, Tomasz},
TITLE = {Generalized interpolation in Casl},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {1-2},
PAGES = {19-24},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lopriore/00,
AUTHOR = {Lopriore, Lanfranco},
TITLE = {Protection in a single-address-space environment},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {1-2},
PAGES = {25-32},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Schonlau-Theus/00,
AUTHOR = {Schonlau, Matthias and Theus, Martin},
TITLE = {Detecting masquerades in intrusion detection based on unpopular commands},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {1-2},
PAGES = {33-38},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Serra-Sagrista/00,
AUTHOR = {Serra-Sagrist{\`{a}}, Joan},
TITLE = {Enumeration of lattice points in $l_1$ norm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {1-2},
PAGES = {39-44},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Xue-Liu/00,
AUTHOR = {Xue, Jue and Liu, Ju},
TITLE = {A network-flow-based lower bound for the minimum weighted integer coloring problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {1-2},
PAGES = {45-50},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Aerts-Korst-Egner/00,
AUTHOR = {Aerts, Joep and Korst, Jan and Egner, Sebastian},
TITLE = {Random dublicate storage strategies for load balancing in multimedia servers},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {1-2},
PAGES = {51-59},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Cai-Nerurkar/00,
AUTHOR = {Cai, Jin-Yi and Nerurkar, Ajay},
TITLE = {A note on the non-$NP$-hardness of approximate lattice problems under general Cook reductions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {1-2},
PAGES = {61-66},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Garcia-Villalba-Fuster-Sabater/00,
AUTHOR = {Garc{\'{i}}a-Villalba, L.J. and F{\'{u}}ster-Sabater, A.},
TITLE = {On the linear complexity of the sequences generated by nonlinear filterings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {1-2},
PAGES = {67-73},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Li/00b,
AUTHOR = {Li, Chu Min},
TITLE = {Equivalency reasoning to solve a class of hard SAT problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {1-2},
PAGES = {75-81},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Comellas-Ozon-Peters/00,
AUTHOR = {Comellas, Francesc and Oz{\'{o}}n, Javier and Peters, Joseph G.},
TITLE = {Deterministic small-world communication networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {1-2},
PAGES = {83-90},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Dobrev-Schroder-Sykora-Vrto/00,
AUTHOR = {Dobrev, Stefan and Schr{\"o}der, Heiko and S{\'y}kora, Ondrej and Vrt'o, Imrich},
TITLE = {Evolutionary graph colouring},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {1-2},
PAGES = {91-94},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Shparlinski/00,
AUTHOR = {Shparlinski, Igor E.},
TITLE = {Linear complexity of the Naor-Reingold pseudo-random function},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {3},
PAGES = {95-99},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Higuchi-Takagi/00,
AUTHOR = {Higuchi, Akira and Takagi, Naofumi},
TITLE = {A fast addition algorithm for elliptic curve arithmetic in $GF(2^n)$ using projective coordinates},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {3},
PAGES = {101-103},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lee-Yoo/00,
AUTHOR = {Lee, Keon-Jik and Yoo, Kee-Young},
TITLE = {Linear systolic multiplier/squarer for fast exponentiation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {3},
PAGES = {105-111},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Chung-Yan/00,
AUTHOR = {Chung, Kuo-Liang and Yan, Wen-Ming},
TITLE = {On the number of spanning trees of a multi-complete/star related graph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {3},
PAGES = {113-119},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Park-Chung/00,
AUTHOR = {Park, Ho-Hyun and Chung, Chin-Wan},
TITLE = {Complexity of estimating multi-way join result sizes for area skewed spatial data},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {3},
PAGES = {121-129},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lamport-Perl-Weihl/00,
AUTHOR = {Lamport, Leslie and Perl, Sharon and Weihl, William},
TITLE = {When does a correct mutual exclusion algorithm guarantee mutual exclusion?},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {3},
PAGES = {131-134},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kim-Lee-Yoo/00,
AUTHOR = {Kim, Hyun-Sung and Lee, Sung-Woo and Yoo, Kee-Young},
TITLE = {Partitioned systolic architecture for modular multiplication in $GF(2^m)$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {3},
PAGES = {135-139},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Roussel-Rusu/00,
AUTHOR = {Roussel, F. and Rusu, I.},
TITLE = {Recognizing $i$-triangulated graphs in $O(mn)$ time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {3},
PAGES = {141-147},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Epstein/00,
AUTHOR = {Epstein, Leah},
TITLE = {A note on on-line scheduling with precedence constraints on identical machines},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {4-6},
PAGES = {149-153},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bein-Fleischer-Larmore/00,
AUTHOR = {Bein, Wolfgang W. and Fleischer, Rudolf and Larmore, Lawrence L.},
TITLE = {Limited bookmark randomized online algorithms for the paging problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {4-6},
PAGES = {155-162},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Tan/00,
AUTHOR = {Tan, Xuehou},
TITLE = {On optimal bridges between two convex regions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {4-6},
PAGES = {163-168},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Xiang-Ushijima-Tang/00,
AUTHOR = {Xiang, Limin and Ushijima, Kazuo and Tang, Changjie},
TITLE = {Efficient loopless generation of Gray codes for $k$-ary trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {4-6},
PAGES = {169-174},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Hartuv-Shamir/00,
AUTHOR = {Hartuv, Erez and Shamir, Ron},
TITLE = {A clustering algorithm based on graphh connectivity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {76},
NUMBER = {4-6},
PAGES = {175-181},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}