Books on the topic '080201 Analysis of Algorithms and Complexity'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 books for your research on the topic '080201 Analysis of Algorithms and Complexity.'
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.
Goodwin, Roger. Algorithm complexity: Analysis and theory. 2nd ed. Norfolk, VA (P.O. Box 8235, Norfolk 23503-0235): Old Dominion Press, 1991.
Find full text1939-, Steiglitz Kenneth, ed. Combinatorial optimization: Algorithms and complexity. Mineola, N.Y: Dover Publications, 1998.
Find full textAlgorithms: Their complexity and efficiency. 2nd ed. Chichester: Wiley, 1987.
Find full textBorodin, Allan. Online computation and competitive analysis. Cambridge, [Eng.]: Cambridge University Press, 1998.
Find full textAlexander, Ostermann, ed. Analysis for computer scientists: Foundations, methods, and algorithms. London: Springer-Verlag, 2011.
Find full textKuhn, Peter. Algorithms, Complexity Analysis and VLSI Architectures for MPEG-4 Motion Estimation. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4757-4474-3.
Full textDieter, Kratsch, and SpringerLink (Online service), eds. Exact Exponential Algorithms. Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2010.
Find full textCastura, Jeff. Performance analysis and optimization of reduced complexity low density parity check decoding algorithms. Ottawa: National Library of Canada, 2000.
Find full textWassenhove, Luk N. van. Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. Fontainebleau: INSEAD, 1991.
Find full textÇela, Eranda. The Quadratic Assignment Problem: Theory and Algorithms. Boston, MA: Springer US, 1998.
Find full textGiancarlo, Bongiovanni, Gambosi G. 1955-, and Petreschi Rossella 1950-, eds. Algorithms and complexity: 4th Italian conference, CIAC 2000, Rome, Italy, March 2000 : proceedings. Berlin: Springer, 2000.
Find full textTempo, Roberto. Randomized Algorithms for Analysis and Control of Uncertain Systems: With Applications. 2nd ed. London: Springer London, 2013.
Find full textLawler, Eugene L. Combinatorial optimization: Networks and matroids. Mineola, N.Y: Dover Publications, 2001.
Find full textEven, Guy. Design and Analysis of Algorithms: First Mediterranean Conference on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3-5, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.
Find full text1957-, Gutin Gregory, ed. Digraphs: Theory, algorithms, and applications. 2nd ed. London: Springer, 2009.
Find full text1957-, Gutin Gregory, ed. Digraphs: Theory, algorithms, and applications. London: Springer, 2001.
Find full textWang, Tse-kʻo. Algebraic systems of equations and computational complexity theory. Beijing: Science Press, 1994.
Find full textSpirakis, Paul G. Algorithms and Complexity: 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.
Find full textBar-Noy, Amotz. Algorithms for Sensor Systems: 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2012, Ljubljana, Slovenia, September 13-14, 2012. Revised Selected Papers. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.
Find full textChang, Hyeong Soo. Simulation-Based Algorithms for Markov Decision Processes. 2nd ed. London: Springer London, 2013.
Find full textIliopoulos, Costas S. Combinatorial Algorithms: 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011.
Find full textIbaraki, Toshihide. Algorithms and computation: 14th international symposium ; proceedings. Berlin: Springer, 2003.
Find full textBonifaci, Vincenzo. Experimental Algorithms: 12th International Symposium, SEA 2013, Rome, Italy, June 5-7, 2013. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.
Find full textGhosh, Subir Kumar. WALCOM: Algorithms and Computation: 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.
Find full textGiuseppe, Persiano, and SpringerLink (Online service), eds. Approximation and Online Algorithms: 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.
Find full textPaolo, Ferragina, and SpringerLink (Online service), eds. Algorithms – ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.
Find full textMyasnikov, Alexei G. Non-commutative cryptography and complexity of group-theoretic problems. Providence, R.I: American Mathematical Society, 2011.
Find full textDanny, Krizanc, Luccio Flaminia, and SpringerLink (Online service), eds. Fun with Algorithms: 6th International Conference, FUN 2012, Venice, Italy, June 4-6, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.
Find full textDavid, Hutchison. Computing and Combinatorics: 15th Annual International Conference, COCOON 2009 Niagara Falls, NY, USA, July 13-15, 2009 Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009.
Find full textservice), SpringerLink (Online, ed. Experimental Algorithms: 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.
Find full textShukla, K. K. Efficient Algorithms for Discrete Wavelet Transform: With Applications to Denoising and Fuzzy Inference Systems. London: Springer London, 2013.
Find full textErlebach, Thomas. Approximation and Online Algorithms: 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.
Find full textDavid, Hutchison. Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009.
Find full textPetteri, Kaski, and SpringerLink (Online service), eds. Algorithm Theory – SWAT 2012: 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.
Find full textPapadimitriou, Christos H., and Kenneth Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Dover Publications, Incorporated, 2013.
Find full textPapadimitriou, Christos H., and Kenneth Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Dover Publications, Incorporated, 2013.
Find full textRobert, Yves, Anne Benoit, and édéric Vivien. Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis. Taylor & Francis Group, 2013.
Find full textRobert, Yves, Anne Benoit, and édéric Vivien. Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis. Taylor & Francis Group, 2013.
Find full textRobert, Yves, Anne Benoit, and édéric Vivien. Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis. Taylor & Francis Group, 2013.
Find full textRobert, Yves, Anne Benoit, and édéric Vivien. Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis. Taylor & Francis Group, 2013.
Find full textRobert, Yves, Anne Benoit, and édéric Vivien. Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis. Taylor & Francis Group, 2013.
Find full textDingzhu, Du, and Pardalos P. M. 1954-, eds. Network optimization problems: Algorithms, applications, and complexity. Singapore: World Scientific, 1993.
Find full textBlanton, Marina, and Mikhail J. Atallah. Algorithm Design and Analysis Techniques and Applications. Chapman & Hall/CRC, 2009.
Find full textOnline Computation and Competitive Analysis. Cambridge University Press, 2005.
Find full textA Guide To Algorithm Design Paradigms Methods And Complexity Analysis. CRC Press, 2013.
Find full textAlgorithms, Complexity Analysis and VLSI Architectures for MPEG-4 Motion Estimation. Springer, 1999.
Find full textKuhn, Peter. Algorithms, complexity analysis and VLSI architectures for MPEG-4 motion estimation. 1999.
Find full textKratsch, Dieter, and Fedor V. Fomin. Exact Exponential Algorithms. Springer, 2010.
Find full textKratsch, Dieter, and Fedor V. Fomin. Exact Exponential Algorithms. Springer Berlin / Heidelberg, 2012.
Find full textDu, Ding-Zhu. Network Optimization Problems: Algorithms, Applications and Complexity (Series on Applied Mathematics, Vol 2). World Scientific Pub Co Inc, 1993.
Find full text