The.Algorithm.Design.Manual.Springer-Verlag.1998

References
BS81
BS86
BS93
BS96
BS97
BT92
Buc94
BW91
J. Bentley and M. Shamos. Divide-and-conquer in higher-dimensional space. In Proc. Eighth ACM
Symp. Theory of Computing, pages 220-230, 1976.
I. Barrodale and G. F. Stuart. A Fortran program for solving . ACM Trans. Math. Softw.,
7(3):391-397, September 1981.
G. Berry and R. Sethi. From regular expressions to deterministic automata. Theoretical Computer
Science, 48:117-126, 1986.
E. Biham and A. Shamir. Differential Cryptanalysis of the Data Encryption Standard. Springer-
Verlag, Berlin, 1993.
E. Bach and J. Shallit. Algorithmic Number Theory: Efficient Algorithms, volume 1. MIT Press,
Cambridge MA, 1996.
R. Bradley and S. Skiena. Fabricating arrays of strings. In Proc. First Int. Conf. Computational
Molecular Biology (RECOMB '97), pages 57-66, 1997.
J. Buchanan and P. Turner. Numerical methods and analysis. McGraw-Hill, New York, 1992.
A. G. Buckley. A Fortran 90 code for unconstrained nonlinear minimization. ACM Trans. Math.
Softw., 20(3):354-372, September 1994.
G. Brightwell and P. Winkler. Counting linear extensions is #P-complete. In Proc. 23rd ACM
Symp. Theory Computing (STOC), pages 175-181, 1991.
BYGNR94
R. Bar-Yehuda, D. Geiger, J. Naor, and R. Roth. Approximation algorithms for the vertex
feedback set problem with applications to constraint satisfaction and Bayesian inference. In Proc.
Fifth ACM-SIAM Symp. Discrete Algorithms, pages 344-354, 1994.
Can87
J. Canny. The complexity of robot motion planning. MIT Press, Cambridge MA, 1987.
file:///E|/BOOK/BOOK5/NODE232.HTM (8 of 50) [19/1/2003 1:28:01]