Kovalyov, Mikhail Y.; Pattloch, Marcus; Schmidt, Günter A polynomial algorithm for lot-size scheduling of two type tasks. (English) Zbl 1051.68142 Inf. Process. Lett. 83, No. 4, 229-235 (2002). MSC: 68W05 68M20 90B35 PDFBibTeX XMLCite \textit{M. Y. Kovalyov} et al., Inf. Process. Lett. 83, No. 4, 229--235 (2002; Zbl 1051.68142) Full Text: DOI
Attie, Paul Wait-free Byzantine consensus. (English) Zbl 1044.68512 Inf. Process. Lett. 83, No. 4, 221-227 (2002). MSC: 68M14 PDFBibTeX XMLCite \textit{P. Attie}, Inf. Process. Lett. 83, No. 4, 221--227 (2002; Zbl 1044.68512) Full Text: DOI
Holt, John D.; Chung, Soon M. Mining association rules using inverted hashing and pruning. (English) Zbl 1051.68053 Inf. Process. Lett. 83, No. 4, 211-220 (2002). MSC: 68P15 PDFBibTeX XMLCite \textit{J. D. Holt} and \textit{S. M. Chung}, Inf. Process. Lett. 83, No. 4, 211--220 (2002; Zbl 1051.68053) Full Text: DOI
Laber, Eduardo Sany; Holanda, Leonardo Gomes Improved bounds for asymmetric communication protocols. (English) Zbl 1043.68015 Inf. Process. Lett. 83, No. 4, 205-209 (2002). MSC: 68M12 94A05 94A24 PDFBibTeX XMLCite \textit{E. S. Laber} and \textit{L. G. Holanda}, Inf. Process. Lett. 83, No. 4, 205--209 (2002; Zbl 1043.68015) Full Text: DOI
Fouquet, Jean-Luc No odd pairs in minimal imperfect NP\({}_{5}\) graphs. (English) Zbl 1043.05055 Inf. Process. Lett. 83, No. 4, 201-204 (2002). MSC: 05C17 68R10 68W05 PDFBibTeX XMLCite \textit{J.-L. Fouquet}, Inf. Process. Lett. 83, No. 4, 201--204 (2002; Zbl 1043.05055) Full Text: DOI
Gröpl, Clemens; Hougardy, Stefan; Nierhoff, Till; Prömel, Hans Jürgen Steiner trees in uniformly quasi-bipartite graphs. (English) Zbl 1043.68063 Inf. Process. Lett. 83, No. 4, 195-200 (2002). MSC: 68Q25 68R10 68W40 05C05 PDFBibTeX XMLCite \textit{C. Gröpl} et al., Inf. Process. Lett. 83, No. 4, 195--200 (2002; Zbl 1043.68063) Full Text: DOI
Schwarzer, Fabian; Schweikard, Achim On the complexity of one-shot translational separability. (English) Zbl 1043.68065 Inf. Process. Lett. 83, No. 4, 187-194 (2002). MSC: 68Q25 68U05 PDFBibTeX XMLCite \textit{F. Schwarzer} and \textit{A. Schweikard}, Inf. Process. Lett. 83, No. 4, 187--194 (2002; Zbl 1043.68065) Full Text: DOI
Aronov, Boris A lower bound on Voronoi diagram complexity. (English) Zbl 1044.68855 Inf. Process. Lett. 83, No. 4, 183-185 (2002). MSC: 68U05 PDFBibTeX XMLCite \textit{B. Aronov}, Inf. Process. Lett. 83, No. 4, 183--185 (2002; Zbl 1044.68855) Full Text: DOI