Books on the topic 'Functional algorithms'

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

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 'Functional algorithms.'

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

Stone, John David. Algorithms for Functional Programming. Berlin, Heidelberg: Springer Berlin Heidelberg, 2018. http://dx.doi.org/10.1007/978-3-662-57970-1.

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

Rabhi, Fethi. Algorithms: A functional approach. 2nd ed. Harlow, England: Addison-Wesley, 1999.

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

Guy, Lapalme, ed. Algorithms: A functional programming approach. 2nd ed. Harlow, England: Addison-Wesley, 1999.

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

Pearls of functional algorithm design. New York: Cambridge University Press, 2010.

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

Curien, Pierre-Louis. Categorical Combinators, Sequential Algorithms, and Functional Programming. Boston, MA: Birkhäuser Boston, 1993. http://dx.doi.org/10.1007/978-1-4612-0317-9.

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

Curien, P. L. Categorical combinators, sequential algorithms, and functional programming. 2nd ed. Boston: Birkhäuser, 1993.

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

Categorical combinators, sequential algorithms, and functional programming. London: Pitman, 1986.

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

Goedecker, S. Low complexity algorithms for density functional electronic structure calculations. Ithaca, N.Y: Cornell Theory Center, Cornell University, 1993.

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

Crosbie, Caroline. A Functional Writing Package and Middle School Special Education Students’ Math Algorithms. [New York, N.Y.?]: [publisher not identified], 2018.

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

Neittaanmäki, P. Optimal control of nonlinear parabolic systems: Theory, algorithms, and applications. New York: M. Dekker, 1994.

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

I, Agoshkov V., and Shuti͡a︡ev V. P, eds. Sopri͡a︡zhennye uravnenii͡a︡ i algoritmy vozmushcheniĭ. Moskva: Akademii͡a︡ nauk SSSR, Otdel vychislitelʹnoĭ matematiki, 1986.

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

Bi, Guoan. Transforms and fast algorithms for signal analysis and representations. Boston, MA: Birkhauser, 2003.

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

Timochouk, Leonid A. Constructive algebraic methods for some problems in non-linear analysis: Doctor thesis. [York?]: L.A. Timochouk, 1997.

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

L, Combettes Patrick, and SpringerLink (Online service), eds. Convex Analysis and Monotone Operator Theory in Hilbert Spaces. New York, NY: Springer Science+Business Media, LLC, 2011.

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

Recursive algorithms. Norwood, N.J: Ablex Pub. Corp., 1994.

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

Bird, Richard. Pearls of Functional Algorithm Design. Leiden: Cambridge University Press, 2010.

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

Muller, J. M. Elementary functions: Algorithms and implementation. Boston: Birkhäuser, 1997.

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

Dieter, Kratsch, and SpringerLink (Online service), eds. Exact Exponential Algorithms. Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2010.

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

Robot dynamics algorithms. Boston: Kluwer Academic Publishers, 1987.

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

Featherstone, Roy. Robot dynamics algorithms. Boston: Kluwer, 1987.

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

Crama, Yves. Boolean functions: Theory, algorithms, and applications. Cambridge: Cambridge University Press, 2011.

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

Hiriart-Urruty, Jean-Baptiste. Convex analysis and minimization algorithms. Berlin: Springer-Verlag, 1993.

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

Hiriart-Urruty, Jean-Baptiste. Convex analysis and minimization algorithms. Berlin: Springer-Verlag, 1993.

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

Two dimensional spline interpolation algorithms. Wellesley, Mass: A.K. Peters, 1995.

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

SAPV, Tharrmashastha, Debajyoti Bera, Arpita Maitra, and Subhamoy Maitra. Quantum Algorithms for Cryptographically Significant Boolean Functions. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-3061-3.

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

Sokolov, Artem, and Oleg Zhdanov. Cryptographic constructions on the basis of functions of multivalued logic. ru: INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/1045434.

Full text
Abstract:
Symmetric encryption algorithms have been successfully used to protect information during transmission on an open channel. The classical approach to the synthesis of modern cryptographic algorithms and cryptographic primitives on which they are based, is the use of mathematical apparatus of Boolean functions. The authors demonstrate that the use to solve this problem of functions of multivalued logic (FML) allows to largely improve the durability of the cryptographic algorithms and to extend the used algebraic structures. On the other hand, the study of functions of multivalued logic in cryptography leads to a better understanding of the principles of cryptographic primitives and the emergence of new methods of describing cryptographic constructions. In the monograph the results of theoretical and experimental studies of the properties of the FML, the presented algorithms for generating high-quality S-blocks for the symmetric encryption algorithms, as well as full-working samples of the cryptographic algorithms ready for practical implementation. For students and teachers and all those interested in issues of information security.
APA, Harvard, Vancouver, ISO, and other styles
27

Roy, Richard. Real-time flutter identification. [Washington, D.C.]: National Aeronautics and Space Administration, Scientific and Technical Information Branch, 1985.

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

I, Malʹt͡sev A. Algoritmy i rekursivnye funkt͡sii. 2nd ed. Moskva: "Nauka," Glav. red. fiziko-matematicheskoĭ lit-ry, 1986.

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

McCormick, S. Thomas. Easy with difficulty objective functions for Max cut. Bangalore: Indian Institute of Management, 2002.

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

Muthukrishnan, S. Data Streams: Algorithms and Applications. Hanover: Now Publishers, 2005.

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

Unobstructed shortest paths in polyhedral environments. Berlin: Springer-Verlag, 1987.

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

Roman, Hirschfeldt Denis, ed. Algorithmic randomness and complexity. New York: Springer, 2010.

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

Stone, John David. Algorithms for Functional Programming. Springer, 2019.

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

Stone, John David. Algorithms for Functional Programming. Springer, 2018.

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

Learning Functional Data Structures and Algorithms. Packt Publishing - ebooks Account, 2017.

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

Curien, P. L. Categorical Combinators, Sequential Algorithms, and Functional Programming. Birkhauser Verlag, 2012.

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

Curien, P. L. Categorical Combinators, Sequential Algorithms, and Functional Programming. Birkhäuser, 2012.

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

Masood, Adnan. Learning F# Functional Data Structures and Algorithms. Packt Publishing, Limited, 2015.

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

Stone, John D. Algorithms for Functional Programming (Texts in Computer Science). Springer, 2020.

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

Masood, Adnan. Learning F# Functional Data Structures and Algorithms: Get Started with F# and Explore Functional Programming Paradigm with Data Structures and Algorithms. Packt Publishing, Limited, 2015.

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

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
42

Almudevar, Anthony Louis. Approximate Iterative Algorithms. Taylor & Francis Group, 2014.

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

Approximate Iterative Algorithms. CRC Press, 2014.

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

Almudevar, Anthony Louis. Approximate Iterative Algorithms. Taylor & Francis Group, 2014.

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

Almudevar, Anthony Louis. Approximate Iterative Algorithms. Taylor & Francis Group, 2014.

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

Almudevar, Anthony Louis. Approximate Iterative Algorithms. Taylor & Francis Group, 2014.

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

Almudevar, Anthony Louis. Approximate Iterative Algorithms. Taylor & Francis Group, 2014.

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

Almudevar, Anthony Louis. Approximate Iterative Algorithms. Taylor & Francis Group, 2014.

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

Currien, P. L. Categorical Combinators, Sequential Algorithms and Functional Programming (Research notes in theoretical computer science). Financial Times Prentice Hall, 1986.

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

Upadhyaya, Bhim P. Data Structures and Algorithms with Scala: A Practitioner's Approach with Emphasis on Functional Programming. Springer, 2019.

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