To see the other types of publications on this topic, follow the link: Algorithems.

Books on the topic 'Algorithems'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 books for your research on the topic 'Algorithems.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse books on a wide variety of disciplines and organise your bibliography correctly.

1

Smith, Jeffrey Dean. Design and analysis of algorithms. Boston: PWS-KENT Pub. Co., 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

The advent of the algorithm: The 300 year journey from an idea to the computer. San Diego, Calif: Harcourt, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Berlinski, David. The advent of the algorithm: The idea that rules the world. New York: Harcourt, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Müller-Hannemann, Matthias, and Stefan Schirra. Algorithm engineering: Bridging the gap between algorithm theory and practice. Berlin: Springer, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Baase, Sara. Computer algorithms: Introduction to design and analysis. 2nd ed. Reading, Mass: Addison-Wesley Pub. Co., 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Baase, Sara. Computer algorithms: Introduction to design and analysis. 2nd ed. Reading, Mass: Addison-Wesley Pub. Co., 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

VerfasserIn, Van Gelder Allen, ed. Computer algorithms: Introduction to design and analysis. 3rd ed. Delhi: Pearson Education, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Algorithm engineering for integral and dynamic problems. Amsterdam: Gordon & Breach, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lance, Chambers, ed. The practical handbook of genetic algorithms: Applications. 2nd ed. Boca Raton, Fla: Chapman & Hall/CRC, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

H, Jamieson Leah, Gannon Dennis B. 1947-, and Douglass Robert J, eds. The characteristics of parallel algorithms. Cambridge, Mass: MIT Press, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
11

Feldbauer, Martin. Martin Feldbauer: Allmächtiger Algorithmus = Almighty algorithm. Syke: Syker Vorwerk, 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
12

Chang, Lin, William D. Chey, John Kellow, Jan Tack, and William E. Whitehead, eds. Rome IV Diagnostic Algorithms. Raleigh, NC USA: The Rome Foundation, 2016. http://dx.doi.org/10.24890/algorithms.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

K, Belew Richard, and Booker Lashon B, eds. Proceedings of the Fourth International Conference on Genetic Algorithms, University of California, San Diego, July 13-16, 1991. San Matteo, Calif: Morgan Kaufmann, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
14

Brent, R. P. Algorithms for minimization without derivatives. Mineola, N.Y: Dover Publications, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
15

An introduction to the analysis of algorithms. 2nd ed. New Jersey [u.a.]: World Scientific Publ., 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
16

Dr, Herrera Francisco, and Verdegay José-Luis, eds. Genetic algorithms and soft computing. Heidelberg: Physica-Verlag, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
17

Evripidis, Bampis, Jansen Klaus, and Kenyon Claire, eds. Efficient approximation and online algorithms: Recent progress on classical combinatorical optimization problems and new applications. New York: Springer, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
18

Evripidis, Bampis, Jansen Klaus, and Kenyon Claire, eds. Efficient approximation and online algorithms: Recent progress on classical combinatorical optimization problems and new applications. New York: Springer, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
19

Designing efficient algorithms for parallel computers. Maidenhead: McGraw, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
20

Designing efficient algorithms for parallel computers. New York: McGraw-Hill, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
21

Nine algorithms that changed the future: The ingenious ideas that drive today's computers. Princeton: Princeton University Press, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
22

The design and analysis of efficient learning algorithms. Cambridge, Mass: MIT Press, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
23

K, Agarwal Pankaj, Kavraki Lydia, and Mason Matthew T, eds. Robotics: The algorithmic perspective : the Third Workshop on the Algorithmic Foundations of Robotics. Wellesley, Mass: A K Peters, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
24

-P, Laumond J., and Overmars Mark H. 1958-, eds. Algorithms for robotic motion and manipulation: 1996 Workshop on the Algorithmic Foundations of Robotics. Wellesley, Mass: A K Peters, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
25

Hutchinson, Alan. Algorithmic learning. Oxford: Clarendon Press, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
26

Giuseppe, Persiano, and Solis-Oba Roberto, eds. Approximation and online algorithms: Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004 : revised selected papers. Berlin: Springer, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
27

Workshop, WADS '89 (1989 Ottawa Ont ). Algorithms and data structures: Workshop WADS '89, Ottawa, Canada, August 17-19, 1989 : proceedings. Berlin: Springer-Verlag, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
28

Wilf, Herbert S. Algorithms and complexity. Englewood Cliffs, N.J: Prentice-Hall, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
29

Algorithms and complexity. 2nd ed. Natick, Mass: A.K. Peters, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
30

Alan, Gibbons. Efficient parallel algorithms. Cambridge [England]: Cambridge University Press, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
31

Weimin, Wu, Cardullo Frank M, and Langley Research Center, eds. Motion cueing algorithm development: Initial investigation and redesign of the algorithms. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
32

H, Cormen Thomas, and Cormen Thomas H, eds. Introduction to algorithms. 2nd ed. Cambridge, Mass: MIT Press, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
33

Information-theoretic incompleteness. Singapore: World Scientific, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
34

Lance, Chambers, ed. Practical handbook of genetic algorithms. Boca Raton: CRC Press, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
35

Griffiths, P. 1947 Oct. 29- and Hill I. D. 1926-, eds. Applied statistics algorithms. Chichester: Published by E. Horwood for the Royal Statistical Society, London, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
36

(Editor), Lawrence D. Davis, Kenneth De Jong (Editor), Michael D. Vose (Editor), and L. Darrell Whitley (Editor), eds. Evolutionary Algorithms (The IMA Volumes in Mathematics and its Applications). Springer, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
37

Berlinski, David. The Advent of the Algorithm: The 300-Year Journey from an Idea to the Computer. Harvest Books, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
38

James, Evans. Optimization Algorithms for Networks and Graphs. Taylor & Francis Group, 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
39

James, Evans. Optimization Algorithms for Networks and Graphs. Taylor & Francis Group, 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
40

Müller-Hannemann, Matthias, and Stefan Schirra. Algorithm Engineering: Bridging the Gap Between Algorithm Theory and Practice. Springer London, Limited, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
41

Baase, Sara. Computer Algorithms: An Introduction to Design & Analysis. Addison-Wesley, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
42

Chambers, Lance. Practical Handbook of Genetic Algorithms: Applications. Taylor & Francis Group, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
43

Chambers, Lance. Practical Handbook of Genetic Algorithms. Taylor & Francis Group, 2020.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
44

Bleakley, Chris. Poems That Solve Puzzles. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198853732.001.0001.

Full text
Abstract:
Algorithms are the hidden methods that computers apply to process information and make decisions. The book tells the story of algorithms from their ancient origins to the present day and beyond. The book introduces readers to the inventors and events behind the genesis of the world’s most important algorithms. Along the way, it explains, with the aid of examples and illustrations, how the most influential algorithms work. The first algorithms were invented in Mesopotamia 4,000 years ago. The ancient Greeks refined the concept, creating algorithms for finding prime numbers and enumerating Pi. Al-Khawrzmi’s 9th century books on algorithms ultimately became their conduit to the West. The invention of the electronic computer during World War II transformed the importance of the algorithm. The first computer algorithms were for military applications. In peacetime, researchers turned to grander challenges - forecasting the weather, route navigation, choosing marriage partners, and creating artificial intelligences. The success of the Internet in the 70s depended on algorithms for transporting data and correcting errors. A clever algorithm for ranking websites was the spark that ignited Google. Recommender algorithms boosted sales at Amazon and Netflix, while the EdgeRank algorithm drove Facebook’s NewsFeed. In the 21st century, an algorithm that mimics the operation of the human brain was revisited with the latest computer technology. Suddenly, algorithms attained human-level accuracy in object and speech recognition. An algloirthm defeated the world champion at Go - the most complex of board games. Today, algorithms for cryptocurrencies and quantum computing look set to change the world.
APA, Harvard, Vancouver, ISO, and other styles
45

(Editor), Alberto Apostolico, Maxime Crochemore (Editor), Zvi Galil (Editor), and Udi Manber (Editor), eds. Combinatorial Pattern Matching: 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993. Proceedings (Lecture Notes in Computer Science). Springer, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
46

Sedgewick, Robert. Algorithms (Addison-Wesley series in computer science). Addison Wesley Longman Publishing Co, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
47

Design Analysis and Algorithms: Analysis of algorithm, Advanced Data Structure, Algorithm Analysis. New Delhi, India: University Science Press, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
48

Bucher, Taina. The Multiplicity of Algorithms. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190493028.003.0002.

Full text
Abstract:
Algorithms exist and operate on multiple levels. They are technical as much as they are social, cultural as much as they are functional. The chapter examines the multiplicity of algorithms, arguing for an expanded view on algorithms that takes it variable ontology into account. Providing the conceptual groundwork by merging perspectives from computer science, social sciences, and the humanities, the chapter explains the different meanings of algorithms as technical entities, and phenomena of social concern, respectively. Algorithms do not merely have power and politics; they are fundamentally productive of new ways of ordering the world as part of a much wider network of relations and practices. Offering a rich overview of critical algorithms studies, the author suggests that the multiplicity of algorithms is not about providing different perspectives on one static object called an algorithm but about realizing how the algorithm is already many things at once.
APA, Harvard, Vancouver, ISO, and other styles
49

Cormen, Thomas H., Clifford Stein, and Ronald L. Rivest. Introduction to Algorithms, Fourth Edition. MIT Press, 2022.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
50

Algorithms and Subjectivity. Taylor & Francis Group, 2021.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography