Skip to main content Accessibility help
×
Home
Essentials of Programming in <I>Mathematica</I>®
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 3
  • Export citation
  • Recommend to librarian
  • Buy the print book

Book description

Essentials of Programming in Mathematica® provides an introduction suitable for readers with little or no background in the language as well as for those with some experience using programs such as C, Java, or Perl. The author, an established authority on Mathematica® programming, has written an example-driven text that covers the language from first principles, as well as including material from natural language processing, bioinformatics, graphs and networks, signal analysis, geometry, computer science, and many other applied areas. The book is appropriate for self-study or as a text for a course in programming in computational science. Readers will benefit from the author's tips, which provide insight and suggestions on small and large points. He also provides more than 350 exercises from novice through to advanced level with all of the solutions available online.

Refine List

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Send to Kindle
  • Send to Dropbox
  • Send to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
×

Contents

References
Abbott, Paul. 1998. Finding roots in an interval. The Mathematica Journal, 7(2), 108–112. www.mathematica-journal.com/issue/v7i2/tricks/contents/html/Links/tricks_lnk_5.html.
Aldous, David and James Allen, Fill. 2002. Reversible Markov Chains and Random Walks on Graphs. unfinished monograph, recompiled 2014. www.stat.berkeley.edu/~aldous/RWG/book.pdf (accessed 27 June 2015).
Bailey, David H., Jonathan M., Borwein, Cristian S., Calude, Michael J., Dinneen, Monica, Dumitrescu, and Alex, Yee. 2012. Normality and the digits of p, in Exploratory Experimentation in Mathematics: Selected Works. Perfectly Scientific Press.
Barber, Michael N. and Barry W., Ninham. 1970. Random and Restricted Walks: Theory and Applications. Gordon and Breach.
Bar-Yossef, Ziv and Maxim, Gurevich. 2006. Random sampling from a search engine's index, in Proceedings of the 15th International Conference on World Wide Web,WWW'06. ACM. dx.doi.org/10.1145/1135777.1135833.
Bergerson, HowardW. 1973. Palindromes and Anagrams. Dover.
Bird, Steven, Ewan, Klein, and Edward, Loper. 2009. Natural Language Processing with Python: Analyzing Text with the Natural Language Toolkit. O'Reilly Media.
Blum, Lenore. 2012. Alan Turing and the other theory of computation, in Proceedings of the 17th Annual Conference on Innovation and Technology in Computer Science Education, ITiCSE ’12. ACM. dx.doi.org/10.1145/2325296.2325299.
Bollobás, Béla. 2001. Random Graphs, second edition. Cambridge University Press.
Bolotin, Alexander, Benoit, Quinquis, Alexei, Sorokin, and S. Dusko, Ehrlich. 2005. Clustered regularly interspaced short palindrome repeats (CRISPRs) have spacers of extrachromosomal origin. Microbiology, 151(8), 2551–2561. dx.doi.org/10.1099/mic.0.28048-0.
Borges, Jorge Luis. 2007. The Library of Babel, in Labyrinths: Selected Short Stories & Other Writings. New Directions.
Bourke, Paul. 2001. Julia Set Fractal(2d). www.paulbourke.net/fractals/juliaset.
Bowerman, Bruce L., Richard T., O'Connell, and Anne B., Koehler. 2005. Forecasting, Time Series, and Regression: An Applied Approach, fourth edition. Thomson Brooks/Cole.
Box, George E.P., Gwilym M., Jenkins, and Gregory C., Reinsel. 2008. Time Series Analysis: Forecasting and Control, fourth edition. John Wiley & Sons.
Boyer, Carl B. 1991. A History of Mathematics, second edition. Princeton University Press.
Brent, Richard P. 1980. An improved Monte Carlo factorization algorithm. BIT, 20(2), 176–184. maths-people.anu.edu.au/~brent/pd/rpb051i.pdf.
California Department of Water Resources. Storage in major reservoirs, Data Exchange Center. cdec.water.ca.gov/cgi-progs/reservoirs/STORAGE (accessed 15 Aug 2015).
Callaway, Duncan S., Mark E.J., Newman, Steven H., Strogatz, and Duncan J., Watts. 2000. Network robustness and fragility: percolation on random graphs. Physical Review Letters, 85(25), 5468–5471. arxiv.org/pdf/cond-mat/0007300.pdf.
Car, Talk. 2007. This week's puzzler, June 25. www.cartalk.com/content/puzzlers.
Center for Cancer Systems Biology. Caenorhabditis elegans, Worm interactome database. interactome.dfci.harvard.edu/C_elegans (accessed 24 Mar 2015).
Centre for Applied Linguistics, University of Warwick. Text transcripts and tagged texts, British Academic Spoken English (Base). www2.warwick.ac.uk/fac/soc/al/research/collect/base/lecturetranscripts (accessed 13 June 2014).
Ceruzzi, Paul E. 2012. Computing: A Concise History. MIT Press.
Chatfield, Christopher. 2004. The Analysis of Time Series: An Introduction, sixth edition. Chapman & Hall/CRC Press.
Chomsky, Noam. 2002. Syntactic Structures, second edition. Mouton de Gruyter.
Chung, Fan and Wenbo, Zhao. 2010. PageRank and random walks on graphs, in Fete of Combinatorics and Computer Science: Bolyai Society Mathematical Studies, Volume 20. Springer. dx.doi.org/10.1007/978-3-642-13580-4_3.
Churchhouse, Robert F. 2001. Codes and Ciphers: Julius Caesar, the Enigma, and the Internet. Cambridge University Press.
Cipra, Barry. 2005. Third time proves charm for Prime-Gap Theorem. Science, 308(5726), 1238. dx.doi.org/10.1126/science.308.5726.1238.
Clarkson, Kenneth L. and Peter W., Shor. 1989. Applications of random sampling in computational geometry, ii. Discrete & Computational Geometry, 4(1), 387–421. dx.doi.org/10.1007/BF02187740.
Codling, Edward A., Michael J., Plank, and Simon, Benhamou. 2008. Random walk models in biology. Journal of The Royal Society Interface, 5(25), 813–834. dx.doi.org/10.1098/rsif.2008.0014.
Conway, John H. and Richard K., Guy. 1996. Perfect numbers, in The Book of Numbers. Springer-Verlag.
Cook, Stephen. 2000. The
P versus NP Problem. The Clay Mathematics Institute for Millennium Prize Problems. www.claymath.org/sites/default/files/pvsnp.pdf.
Costa, Luciano da Fontoura and Roberto Marcondes, Cesar. 2001. Shape Analysis and Classi cation: Theory and Practice. CRC Press.
Cover, Thomas M. and Joy A., Thomas. 2006. Elements of Information Theory, second edition. Wiley Interscience.
Crandall, Richard E. 1994. Projects in Scientific Computation. TELOS/Springer-Verlag.
Crandall, Richard E. 1996. Topics in Advanced Scientific Computation. TELOS/Springer-Verlag.
Crandall, Richard E. and Carl, Pomerance. 2005. Prime Numbers: A Computational Perspective, second edition. Springer.
Cristianini, Nello and Matthew W., Hahn. 2007. Introduction to Computational Genomics: A Case Studies Approach. Cambridge University Press.
Datta, Bibhutibhusan and Avadhesh N., Singh. 1938. History of Hindu Mathematics: A Source Book. Asia Publishing House.
Davis, Timothy A. and Yifan, Hu. 2011. The University of Florida sparse matrix collection. ACM Transactions on Mathematical Software, 38(1), 1–25. dx.doi.org/10.1145/2049662.2049663.
Diceware. Time to add a word, The Diceware Security Blog. diceware.blogspot.com (accessed 14 Jul 2015).
Dijkstra, Edsger. 1981. Hamming's exercise in SASL, Report EWD792. www.cs.utexas.edu/users/EWD/ewd07xx/EWD792.PDF.
Downey, Allen B. 2012. Think Python: How to Think Like a Computer Scientist. O'Reilly Media.
Duchamp, Marcel. 1926. Anémic Cinéma. UbuWeb. www.ubu.com/film/duchamp_anemic.html.
Duff, Iain S., Roger G., Grimes, and John G., Lewis. 1989. Sparse matrix test problems. ACM Transactions on Mathematical Software, 15(1), 1–14. dx.doi.org/10.1145/62038.62043.
Edelman, Alan and Gilbert, Strang. 2004. Pascal matrices. American Mathematical Monthly, III(3), 361–385. dx.doi.org/10.2307/4145127.
Encyclopedia of Triangle Centers. Introduction and centers, faculty.evansville.edu/ck6/encyclopedia/ETC.html (accessed 25 Mar 2015).
Enderton, Herbert B. 1972. A Mathematical Introduction to Logic. Academic Press.
Erdos, Paul and Alfred, Rényi. 1959. On random graphs i. Publicationes Mathematicae Debrecen, 6, 290–297. www.renyi.hu/~p_erdos/1959-11.pdf.
Floyd, Robert W. 1962. Algorithm 97: shortest path. Communications of the ACM, 5(6), 345. dx.doi.org/10.1145/367766.368168.
Floyd, Robert W. 1979. The paradigms of programming. Communications of the ACM, 22(8), 455–460. dx.doi.org/10.1145/359138.359140.
Frege, Gottlob. 1879. Begriffsschrift, a formal language, modeled upon that of arithmetic, for pure thought, in From Frege to G del: A Source Book in Mathematical Logic, 1879–1932, ed. Jean van, Heijenoort. Harvard University Press.
Friedl, Jeffrey E.F. 2006. Mastering Regular Expressions, third edition. O'Reilly Media.
Gardner, Martin. 1978. Perfect, amicable, sociable, in Mathematical Magic Show: More Puzzles, Games, Diversions, Illusions and Other Mathematical Sleight-of-Mind from Scienti c American. Random House.
Gardner, Martin. 1992. Fractal Music, Hypercards, and More…Mathematical Recreations from Scientific American Magazine.W.H. Freeman.
Gaylord, Richard J. and Paul R., Wellin. 1995. Computer Simulations with Mathematica: Explorations in Complex Physical and Biological Systems. TELOS/Springer-Verlag.
Gibbs, Adrian J. and George A., Mcintyre. 1970. The Diagram, a method for comparing sequences; its use with amino acid and nucleotide sequences. European Journal of Biochemistry, 16(1), 1–11. dx.doi.org/10.1111/j.1432-1033.1970.tb01046.x.
Goldreich, Oded. 2010. P, NP, and NP-Completeness: The Basics of Computational Complexity. Cambridge University Press.
Golin, Mordecai and Robert, Sedgewick. 1988. Analysis of a simple yet efficient convex hull algorithm, in Proceedings of the Fourth Annual Symposium on Computational Geometry. dx.doi.org/10.1145/73393.73409.
Graham, Paul. 2002. The roots of Lisp. www.paulgraham.com/lisp.html.
Graham, Ronald. 1972. An ef cient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, I(4), 132–133. dx.doi.org/10.1016/0020-0190(72)90045-2.
Graham, Ronald, Donald E., Knuth, and Oren, Patashnik. 1994. Concrete Mathematics: A Foundation for Computer Science, second edition. Addison-Wesley.
Grimmett, Geoffrey. 1999. Percolation, second edition. Springer.
Grünbaum, Branko. 1984. On Venn diagrams and the counting of regions. The College Mathematics Journal, 15(5), 433–435. www.jstor.org/stable/2686559.
Hamming, Richard W. 1950. Error detecting and error correcting codes. The Bell System Technical Journal, 29(2), 147–160. archive.org/details/bstj29-2-147.
Hamming, RichardW. 1989. Digital Filters, third edition. Prentice-Hall.
Har-Peled, Sariel. 2001. A practical approach for computing the diameter of a point set, in Proceedings of the Seventeenth Annual Symposium on Computational Geometry, SCG'01. Association of Computing Machinery. doi.acm.org/10.1145/378583.378662.
Haskell, Wiki. The Fibonacci sequence, The Haskell Programming Language. www.haskell.org/haskellwiki/The_Fibonacci_sequence (accessed 13 Jan 2015).
Hathaway, David H. 2010. The solar cycle. Living Reviews in Solar Physics, 7, dx.doi.org/10.12942/lrsp-2010-1.
Hayes, Allan. 1992. Sums of cubes of digits, driven to abstraction. Mathematica in Education, I(4), 3–11.
Heckbert, Paul S. 1994. Graphics Gems iv. AP Professional.
Herstein, Israel N. and Irving, Kaplansky. 1978. Matters Mathematical, second edition. AMS Chelsea Publishing.
Hill, Ted P. 1998. The first digit phenomenon. American Scientist, 86(4), 358–362. dx.doi.org/10.1511/1998.4.358.
Hoffman, Paul. 1998. The Man Who Loved Only Numbers: The Story of Paul Erdos and the Search for Mathematical Truth. Hyperion.
Honsberger, Ross. 1995. Episodes of Nineteenth and Twentieth Century Euclidean Geometry. The Mathematical Association of America.
International Nucleotide Sequence Database Collaboration. DNA Databank of Japan. www.ddbj.nig.ac.jp/searches (accessed 24 Mar 2015).
Jarvis, Ray A. 1973. On the identification of the convex hull of a finite set of points in the plane. Information Processing Letters, 2(1), 18–21. dx.doi.org/10.1016/0020-0190(73)90020-3.
Joyce, James. 1939. Finnegan's Wake. Viking Penguin.
Jurafsky, Daniel and James H., Martin. 2009. Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition, second edition. Pearson Prentice Hall.
Kernighan, Brian W. and Dennis M., Ritchie. 1988. The C Programming Language, second edition. Prentice Hall.
Kimberling, Clark. 1994. Central points and central lines in the plane of a triangle.Mathematics Magazine, 67(3), 163–187. dx.doi.org/10.2307/2690608.
Kimberling, Clark. 1998. Triangle Centers and Central Triangles, Congressus Numerantium, 129. Utilitas Mathematica Publishing.
Knapp, Rob. 2001. Numerical Mathematica, in 2001 International Mathematica Symposium.
Knuth, Donald E. 1992. Literate Programming. Center for the Study of Language and Information, Lecture Notes, no. 27.
Knuth, Donald E. 1993. The Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press.
Knuth, Donald E. 1997. The Art of Computer Programming, Volume 1: Fundamental Algorithms, third edition. Addison-Wesley.
Knuth, Donald E. 1998. The Art of Computer Programming, Volume 3: Sorting and Searching, second edition. Addison-Wesley.
Knuth, Donald E. 2000. Textbook examples of recursion, in Selected Papers on Analysis of Algorithms. Center for the Study of Language and Information, Lecture Notes, no. 102. arxiv.org/abs/cs/9301113.
Knuth, Donald E. 2003. The early development of programming languages, in Selected Papers on Computer Languages. Center for the Study of Language and Information, Lecture Notes, no. 139.
Knuth, Donald E. 2011. The Art of Computer Programming, Volume 4a: Combinatorial Algorithms, Part 1. Addison- Wesley.
Lagarias, Jeffrey C., Victor S., Miller, and Andrew M., Odlyzko. 1985. Computing p(x): the Meissel– Lehmer method. Mathematics of Computation, 44(170), 537–560. dx.doi.org/10.1090/S0025-5718-1985-0777285-5.
Lagarias, Jeffrey C. and Andrew M., Odlyzko. 1987. Computing p(x): an analytic method. Journal of Algorithms, 8(2), 173–191. dx.doi.org/10.1016/0196-6774(87)90037-X.
Lagarias, Jeffrey C. and K., Soundararajan. 2006. Benford's law for the 3 x + 1 function. Journal of the London Mathematical Society, 74(2), 289–303. dx.doi.org/10.1112/S0024610706023131.
Lagarias, Jeffrey C. 2010. The 3 x + 1 problem and its generalizations, in The Ultimate Challenge: The 3 x + 1 Problem. American Mathematical Society.
LAWLER, EUGENE L., JAN KAREL, LENSTRA, A.H.G. RINNOOY, KAN, and D.B., SHMOYS. 1985. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons.
LESK, ARTHUR M. 2010. Introduction to Protein Science: Architecture, Function, and Genomics, second edition. Oxford University Press.
Lima, Manuel. 2011. Visual Complexity: Mapping Patterns of Information. Princeton Architectural Press.
Lin, Shen. 1965. Computer solutions of the traveling salesman problem. Bell System Technical Journal, 44, 2245–2269. ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=6767727.
Lovász, L. 1993. Random walks on graphs: a survey. Combinatorics, Paul Erdos is Eighty, 2, 1–46. www.cs.elte.hu/~lovasz/erdos.pdf.
MacKay, David J.C. 2003. Information Theory, Inference and Learning Algorithms. Cambridge University Press.
Madachy, Joseph S. 1979. Madachy's Mathematical Recreations. Dover Publications.
Madras, Neal and Gordon, Slade. 2012. The Self-Avoiding Walk. Birkhäuser.
Maeder, Roman E. 1994. Animated algorithms. The Mathematica Journal, 4(4), 37–43. www.mathematicajournal. com/issue/v4i4/columns/maeder.
Maeder, Roman E. 1997. Programming in Mathematica, third edition. Addison-Wesley.
Maeder, Roman E. 2000. Computer Science with Mathematica: Theory and Practice for Science, Mathematics, and Engineering. Cambridge University Press.
Malandain, Grégoire and Jean-Daniel, Boissonnat. 2002. Computing the diameter of a point set, in Discrete Geometry for Computer Imagery. Lecture Notes in Computer Science, Vol. 2301. dx.doi.org/10.1007/3-540-45986-3_18.
Mandelbrot, Benoît. 1982. The Fractal Geometry of Nature. W.H. Freeman.
Mangano, Salvatore. 2010. Mathematica Cookbook. O'Reilly Media.
Manning, Christopher D. and Hinrich, Schütze. 1999. Foundations of Statistical Natural Language Processing. MIT Press.
Manning, Christopher D., Prabhakar, Raghavan, and Hinrich, Schütze. 2008. Introduction to Information Retrieval. Cambridge University Press.
Maor, Eli. 1998. Trigonometric Delights. Princeton University Press.
Marsaglia, George. 1972. Choosing a point from the surface of a sphere. The Annals of Mathematical Statistics, 43(2), 645–646. dx.doi.org/10.1214/aoms/1177692644.
Mathews, Max V., Joan E., Miller, F. Richard, Moore, John R., Pierce, and J.C., Risset. 1969. The Technology of Computer Music. The MIT Press.
McCarthy, John. 1979. History of Lisp. Artificial Intelligence Laboratory, Stanford University. wwwformal. stanford.edu/jmc/history/lisp/lisp.html.
McKay, Brendan D., Frédérique E., Oggier, Gordon F., Royle, N.J.A., Sloane, Ian M., Wanless, and Herbert S., Wilf. 2004. Acyclic digraphs and eigenvalues of (0,1)-matrices. Journal of Integer Sequences, 7(3), arxiv.org/abs/math/0310423.
Meringer, Markus and Eric W., Weisstein. Regular graph. MathWorld. mathworld.wolfram.com/RegularGraph.html.
Mersenne Research, Inc. List of known Mersenne primes, Great Internet Mersenne Prime Search. www.mersenne.org/prime.htm (accessed 24 Mar 2015).
Metropolis, Nicholas. 1987. The beginning of the Monte Carlo method, in Los Alamos Science, 1987 Special Issue dedicated to Stanislaw Ulam. library.lanl.gov/la-pubs/00326866.pdf.
Monnerot-Dumaine, Alexis. 2009. The Fibonacci word fractal. HAL Archives-Ouvertes. hal.archivesouvertes. fr/hal-00367972.
Moore, Cristopher and Mark E.J., Newman. 2000. Exact solution of site and bond percolation on smallworld networks. Physical Review E, 62(5), 7059–7064. dx.doi.org/10.1103/PhysRevE.62.7059.
Nasa. Global temperature, Global Climate Change. climate.nasa.gov/vital-signs/global-temperature (accessed 24 Mar 2015).
National Center for Atmospheric Research. Global temperature data sets: overview & comparison table, The Climate Data Guide. climatedataguide.ucar.edu/collections/overview-comparison-page (accessed 12 Dec 2014).
National Center for Biotechnology Information. Nucleotide Database. www.ncbi.nlm.nih.gov/nuccore (accessed 25 Mar 2015).
National Center for Biotechnology Information. Serotonin, cid=5202, PubChem Compound Database. pubchem.ncbi.nlm.nih.gov/compound/5202 (accessed 25 Mar 2015). National Institute of Genetics. List of species, Genome Composition Database. esper.lab.nig.ac.jp/genome/?page=genome_composition_database_species_list (accessed 25 Mar 2015).
National Institute of Standards and Technology. Lag plot, e-Handbook of Statistical Methods. www.itl.nist.gov/div898/handbook/eda/section3/eda33f.htm (accessed 21 Apr 2015).
National Institute of Standards and Technology. Matrix Market, Sparse Matrix Collection. math.nist.gov/MatrixMarket/index.html (accessed 9 Oct 2014).
Newman, Mark E.J. 2010. Networks: An Introduction. Oxford University Press.
Nigrini, Mark J. 2012. Benford's Law: Applications for Forensic Accounting, Auditing, and Fraud Detection. John Wiley & Sons.
Oak Ridge National Laboratory. NASA GISS surface temperature (GISTEMP) analysis, Carbon Dioxide Information Analysis Center. dx.doi.org/10.3334/CDIAC/cli.001 (accessed 20 Apr 2015).
O'Rourke, Joseph. 1998. Computational Geometry in C, second edition. Cambridge University Press.
PAAR, CHRISTOF and JAN, PELZL. 2010. Understanding Cryptography: A Textbook for Students and Practitioners. Springer.
PEARSON, KARL. 1905. The problem of the random walk. Nature, 72(1865), 294.
PEITGEN, HEINZ-OTTO, HARTMUT, JÜRGENS, and DIETMAR, SAUPE. 2004. Chaos and Fractals: New Frontiers in Science, second edition. Springer-Verlag.
PEMMARAJU, SRIRAM V. and STEVEN S., SKIENA. 2003. Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Cambridge University Press.
PETROVAY, KRISTOF. 2010. Solar cycle prediction. Living Reviews in Solar Physics, 7(6), dx.doi.org/10.12942/lrsp-2010-6.
PLATZMAN, LOREN K. and JOHN J., BARTHOLDI HI. 1989. Spacefilling curves and the planar traveling salesman problem. Journal of the ACM, 36(4), 719-737. dx.doi.org/10.1145/76359.76361.
PORTA, HORACIO, WILLIAM, DAVIS, and JERRY, UHL. 1994. Calculus&Mathematica. Addison-Wesley.
PREPARATA, FRANCO P. and MICHAEL IAN, SHAMOS. 1985. Computational Geometry: An Introduction. Springer- Verlag.
PRESS, WILLIAM H., SAUL A., TEUKOLSKY, WILLIAM T., VETTERLING, and BRIAN P., FLANNERY. 2007. Numerical Recipes: The Art of Scientific Computing, third edition. Cambridge University Press.
PROJECT, EULER. Problem #168: Number rotations, Problems Archives. projecteuler.net/problem=168 (accessed 17 Feb 2015).
PROJECT, GUTENBERG.Portrait of the Artist as a Young Man, www.gutenberg.org/ebooks/4217 (accessed 24 Mar 2015).
RAMIREZ, JOSE L. and GUSTAVO N., RUBIANO. 2014. Properties and generalizations of the Fibonacci word fractal: exploring fractal curves. The Mathematica journal, 16(2), www.mathematica-journal.com/2014/02/.
RAMÍREZ, JOSÉ L., GUSTAVO N., RUBIANO, and RODRIGO DE, CASTRO. 2014. A generalization of the Fibonacci word fractal and the Fibonacci snowflake. arXiv.org. arxiv.org/abs/1212.1368.
RITCHIE, DENNIS M. 1993. The development of the C language, in The Second ACM SIGPLAN Conference on History of Programming Languages, HOPL-II. Association of Computing Machinery. dx.doi.org/10.1145/154766.155580.
DE LAS, RIVAS|JAVIER and CELIA, FONTANILLO. 2010. Protein-protein interactions essentials: key concepts to building and analyzing interactome networks. PLoS Computational Biology, 6(6), dx.doi.org/10.1371/journal.pcbi.1000807.
ROEDERER, JUAN G. 2008. The Physics and Psychophysics of Music: An Introduction, fourth edition. Springer.
ROSENKRANTZ, DANIEL J., RICHARD E., STEARNS, and PHILIP M., LEWIS ii. 1977. An analysis of several heuristics for the traveling salesman problem. SIAM Journal of Computing, 6(3), 563-581. dx.doi.org/10.1137/0206041.
ROYAL OBSERVATORY OF BELGIUM. The international sunspot number, Silso World Data Center. www.sidc.be/silso (accessed 17 Feb 2015).
RUDNICK, JOSEPH and GEORGE, GASPARI. 2004. Elements of the Random Walk: An Introduction for Advanced Students and Researchers. Cambridge University Press.
RUEDY, R., M., SATO, and K., Lo. 2015. NASA GISS surface temperature (GISTEMP) analysis, in Trends: A Compendium of Data on Global Change. Carbon Dioxide Information Analysis Center, Oak Ridge National Laboratory, U.S.Department of Energy. dx.doi.org/10.3334/CDIAC/cli.001.
RUMP, S.M. 1991. A class of arbitrarily ill-conditioned floating-point matrices. SIAM Journal of Matrix Analysis and Applications, 12(4), 645-653. dx.doi.org/10.1137/0612049.
RUSKEY, FRANK and MARK, WESTON. 2005. A survey of Venn diagrams. The Electronic Journal of Combinatorics, DS 5, www.combinatorics.org/files/Surveys/ds5/VennEJC.html.
SCHULZ, JAN. 2008. Introduction to dot plots. Code 10. www.code10.info/index.php?option=com_content&view=article&id=64:inroduction-to-dotplots& catid=52:cat_coding_algorithms_dot-plots&Itemid=76.
SCHWARTZ, RANDAL L., BRIAN D, FOY, and TOM, PHOENIX. 2011. Learning Perl, sixth edition. O'Reilly & Associates.
SEDGEWICK, ROBERT and KEVIN, WAYNE. 2007. Introduction to Programming in Java: An Interdisciplinary Approach. Addison-Wesley.
SEDGEWICK, ROBERT and KEVIN, WAYNE. 2011. Algorithms, fourth edition. Addison-Wesley.
SHAMOS, MICHAEL I. and DAN, HOEY. 1975. Closest-point problems, in 16th Annual Symposium on Foundations of Computer Science. IEEE. dx.doi.org/10.1109/SFCS.1975.8.
SHANKS, DANIEL. 1993. Solved and Unsolved Problems in Number Theory, fourth edition. Chelsea.
SHANNON, CLAUDE E. 1948. A mathematical theory of computation. The Bell System Technical Journal, 27(3,4), 379-423, 623-656. dx.doi.org/10.1002/j.1538-7305.1948.tb01338.x.
SHEPARD, ROGER N. 1962. The analysis of proximities: multidimensional scaling with an unknown distance function, I.Psychometrika, 27(2), 125-140. dx.doi.org/10.1007/BF02289630.
SINKOV, ABRAHAM. 2009. Elementary Cryptanalysis: A Mathematical Approach, second edition. The Mathematical Association of America.
SKIENA, STEVEN S. 2008. The Algorithm Design Manual, second edition. Springer Science+Business Media.
SLOANE, N.J.A. A019518, Smarandache-Wellin numbers. The On-Line Encyclopedia of Integer Sequences. oeis.org/A019518.
STAUFFER, DIETRICH and AMMON, AHARONY. 1994. Introduction to Percolation Theory, second edition. Taylor & Francis.
TAO, TERENCE. 2009. Benford's law, Zipf s law, and the Pareto distribution. terrytao.wordpress.com/2009/07/03/benfords-law-zipfs-law-and-the-pareto-distribution.
TEETOR, PAUL. 2011. R Cookbook. O'Reilly Media.
THOMSON, DIETRICH E. 1982. Making music-fractally. Journal of the Acoustical Society of America, 72(6), 2036. dx.doi.org/10.1121/1.388637.
TROTT, MICHAEL. 2004. The Mathematica Guidebook for Graphics. Springer-Verlag.
TROTT, MICHAEL. 2004. The Mathematica Guidebookfor Programming. Springer-Verlag.
TROTT, MICHAEL. 2006. The Mathematica Guidebookfor Numerics. Springer Science+Business Media.
THE UNICODE CONSORTIUM. Unicode 8.0 Character Code Charts, Unicode Standard. www.unicode.org/charts (accessed 25 Mar 2015).
UNIVERSITY OF CHICAGO PRESS. 2010. The Chicago Manual of Style, sixteenth edition. University of Chicago Press.
Voss, RICHARD F. and JOHN, CLARKE. 1978. 1/fnoise in music: music from 1/f noise. Journal of the Acoustical Society of America, 63(1), 258-263. dx.doi.org/10.1121/1.381721.
WAGON, STAN. 1999. Mathematica in Action, second edition. TELOS/Springer-Verlag.
WALL, LARRY, TOM, CHRISTIANSEN, and JON, ORWANT. 2000. Programming Perl, third edition. O'Reilly Media.
WATTS, DUNCAN J. and STEVEN H., STROGATZ. 1998. Collective dynamics of small-world networks. Nature, 393(6684), 440-442. dx.doi.org/10.1038/30918.
WEISS, GEORGE H. 1983. Random walks and their applications. American Scientist, 71(1), 65-71. www.j stor.org/stable/ 278 51819.
WEISS, GEORGE H. 1994. Aspects and Applications of the Random Walk. North Holland.
WEISSTEIN, ERIC W. Hypocycloid. MathWorld. www.mathworld.wolfram.com/Hypocycloid.html.
WEISSTEIN, ERIC W. Lucky number. MathWorld. mathworld.wolfram.com/LuckyNumber.html.
WEISSTEIN, ERIC W. Sierpinski sieve. MathWorld. mathworld.wolfram.com/SierpinskiSieve.html.
WEISSTEIN, ERIC W. Sphere point picking. MathWorld. www.mathworld.wolfram.com/SpherePointPicking.html.
WELLIN, PAUL. 2013. Programming with Mathematica: An Introduction. Cambridge University Press.
WICKHAM-JONES, TOM. 1994. Computer Graphics with Mathematica. TELOS/Springer-Verlag.
WIER, THOMAS. 2014. Is it easier to make palindromes in some languages than in others? Quora. www.quora.com/Is-it-easier-to-make-palindromes-in-some-languages-than-in-others (accessed 15 June 2015).
WIKIBOOKS. Strings, Python Programming. en.wikibooks.org/wiki/Python_Programming/Strings (accessed 25 Mar 2015).
THE WILCOX SOLAR OBSERVATORY. Complete MF time series, The Mean Magnetic Field of the Sun. wso.stanford.edu/#MeanField (accessed 8 Aug 2015).
ZAKI, MOHAMMED J. and WAGNER MEIRA, JR. 2014. Data Mining and Analysis: Fundamental Concepts and Algorithms. Cambridge University Press.

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Book summary page views

Total views: 0 *
Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed.