The.Algorithm.Design.Manual.Springer-Verlag.1998
Share Embed Flag
Download ePaper

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

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

omarfabiano
18.04.2013 Views

References Journal, 36:1389-1401, 1957. Prü18 H. Prüfer. Neuer beweis eines satzes über permutationen. Arch. Math. Phys., 27:742-744, 1918. PS82 PS85 C. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1982. F. Preparata and M. Shamos. Computational Geometry. Springer-Verlag, New York, 1985. PSW92 T. Pavlides, J. Swartz, and Y. Wang. Information encoding with two-dimensional bar-codes. IEEE Computer, 25:18-28, 1992. Pug90 PW83 W. Pugh. Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM, 33:668-676, 1990. S. Pizer and V. Wallace. To compute numerically: concepts and strategies. Little, Brown, Boston, 1983. Rab80 M. Rabin. Probabilistic algorithm for testing primality. J. Number Theory, 12:128-138, 1980. Rab95 F. M. Rabinowitz. A stochastic algorithm for global optimization with constraints. ACM Trans. Math. Softw., 21(2):194-213, June 1995. Raw92 G. Rawlins. Compared to What? Computer Science Press, New York, 1992. RC55 Rand-Corporation. A million random digits with 100,000 normal deviates. The Free Press, Glencoe, IL, 1955. RDC93 E. Reingold, N. Dershowitz, and S. Clamen. Calendrical calculations II: Three historical calendars. Software - Practice and Experience, 22:383-404, 1993. file:///E|/BOOK/BOOK5/NODE232.HTM (39 of 50) [19/1/2003 1:28:02]

References Rei72 Rei91 Rei94 E. Reingold. On the optimality of some set algorithms. J. ACM, 19:649-659, 1972. G. Reinelt. TSPLIB - a traveling salesman problem library. ORSA J. Computing, 3:376-384, 1991. G. Reinelt. The traveling salesman problem: Computational solutions for TSP applications. In Lecture Notes in Computer Science 840, pages 172-186. Springer-Verlag, Berlin, 1994. Ren84 R. J. Renka. Triangulation and interpolation at arbitrarily distributed points in the plane. ACM Trans. Math. Softw., 10(4):440-442, December 1984. RHS89 A. Robison, B. Hafner, and S. Skiena. Eight pieces cannot cover a chessboard. Computer Journal, 32:567-570, 1989. Riv77 Riv92 R. Rivest. On the worst-case behavior of string-searching algorithms. SIAM J. Computing, 6:669- 674, 1977. R. Rivest. The MD5 message digest algorithm. RFC 1321, 1992. RND77 E. Reingold, J. Nievergelt, and N. Deo. Combinatorial algorithms: theory and practice. Prentice- Hall, Englewood Cliffs NJ, 1977. RS96 H. Rau and S. Skiena. Dialing for documents: an experiment in information theory. Journal of Visual Languages and Computing, pages 79-95, 1996. RSA78 R. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21:120-126, 1978. RSL77 D. Rosenkrantz, R. Stearns, and P. M. Lewis. An analysis of several heuristics for the traveling salesman problem. SIAM J. Computing, 6:563-581, 1977. RSST96 file:///E|/BOOK/BOOK5/NODE232.HTM (40 of 50) [19/1/2003 1:28:02]

References<br />

Rei72<br />

Rei91<br />

Rei94<br />

E. Reingold. On the optimality of some set algorithms. J. ACM, 19:649-659, 1972.<br />

G. Reinelt. TSPLIB - a traveling salesman problem library. ORSA J. Computing, 3:376-384, 1991.<br />

G. Reinelt. <strong>The</strong> traveling salesman problem: Computational solutions for TSP applications. In<br />

Lecture Notes in Computer Science 840, pages 172-186. <strong>Springer</strong>-Verlag, Berlin, 1994.<br />

Ren84<br />

R. J. Renka. Triangulation and interpolation at arbitrarily distributed points in the plane. ACM<br />

Trans. Math. Softw., 10(4):440-442, December 1984.<br />

RHS89<br />

A. Robison, B. Hafner, and S. Skiena. Eight pieces cannot cover a chessboard. Computer Journal,<br />

32:567-570, 1989.<br />

Riv77<br />

Riv92<br />

R. Rivest. On the worst-case behavior of string-searching algorithms. SIAM J. Computing, 6:669-<br />

674, 1977.<br />

R. Rivest. <strong>The</strong> MD5 message digest algorithm. RFC 1321, 1992.<br />

RND77<br />

E. Reingold, J. Nievergelt, and N. Deo. Combinatorial algorithms: theory and practice. Prentice-<br />

Hall, Englewood Cliffs NJ, 1977.<br />

RS96<br />

H. Rau and S. Skiena. Dialing for documents: an experiment in information theory. Journal of<br />

Visual Languages and Computing, pages 79-95, 1996.<br />

RSA78<br />

R. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key<br />

cryptosystems. Communications of the ACM, 21:120-126, 1978.<br />

RSL77<br />

D. Rosenkrantz, R. Stearns, and P. M. Lewis. An analysis of several heuristics for the traveling<br />

salesman problem. SIAM J. Computing, 6:563-581, 1977.<br />

RSST96<br />

file:///E|/BOOK/BOOK5/NODE232.HTM (40 of 50) [19/1/2003 1:28:02]

logo

products

Resources

Company

Terms of service
Privacy policy
Cookie policy
Cookie settings
Imprint
Change language
Made with love in Switzerland
© 2024 Yumpu.com all rights reserved

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!