CINXE.COM

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"><html lang="en"> <head> <title>Deakin University / All Locations</title> <base target="_self"/> <link rel="stylesheet" type="text/css" href="/scripts/ProStyles.css" /> <link rel="stylesheet" type="text/css" href="/screens/styles.css" /> <link rel="shortcut icon" type="ximage/icon" href="/screens/favicon.ico" /> <script type="text/javascript" src="/scripts/common.js"></script> <script type="text/javascript" src="/scripts/webbridge.js"></script> <script type="text/javascript" src="/scripts/elcontent.js"></script> <meta http-equiv="X-UA-Compatible" content="IE=8;FF=3;OtherUA=4"><script type="text/javascript" src="/screens/iiilangswitch.js"></script><link rel="stylesheet" type="text/css" href="/screens/styles_print.css" media="print"><script type="text/javascript" src="/screens/bibdisplay.js"></script> </head> <body bgcolor="#FFFFFF" >     <script> window.dataLayer = window.dataLayer || []; window.dataLayer.push({ 'cmsType' : 'WebPAC-PRO' }); </script> <script>(function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start': new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0], j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src= '//www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f); })(window,document,'script','dataLayer','GTM-N3CB');</script>  <script language="JavaScript" type="text/javascript">  </script> <script language="JavaScript1.1" type="text/javascript">  </script> <script type="text/javascript" src="/screens/js/gbsclasses.js"></script> <script type="text/javascript" src="/screens/js/gbsclasses.js"></script>  <noscript><div id="div-javascript">This page contains enriched content visible when JavaScript is enabled.</div></noscript> <div id="deakinwrapper">      <div id="header-new">   <iframe src="https://www.deakin.edu.au/library/media/static/deakin-header3" width="100%" height="115" scrolling="no" frameborder="0" style="margin: 0; vertical-align:bottom;" aria-label="Deakin header" title="Deakin header"></iframe> </div> <div class="pageContentColumn"> <div class="topLinks"> <ul id="topLinksList"> <li><a href="/patroninfo" title="Login to My Account" class="top-myaccount"><span class="buttonText">My Account</span></a></li> <li><a href="https://www.deakin.edu.au/library" title="Library home page" class="top-libhome"><span class="buttonText">Library Home</span></a></li> </ul> </div> <a name="content"></a>  <script type="text/JavaScript">  </script> <div id="TimeoutPopup" tabindex="0" class="modal" onkeypress="refreshSession(event)"> <div class="modal-content"> Your session will expire automatically in <span id=TimeoutSeconds>0</span> seconds.<br> <br> <button id="CancelTimeout" onclick="refreshSession()">Continue session</button> <button id="DoTimeout" onclick="endSession()">End session now</button></div> </div> <noscript> <meta http-equiv="Refresh" content="18000;URL=/" /> </noscript> <div align="center" class="navigationRow"> <a href="/search~S1?/dAlgorithms/dalgorithms/1,-1,0,B/limit:relimit"><span class="button buttonNav">Limit/Sort Search</span></a> <a href="/search~S1/X?Algorithms&SORT=D&searchscope=1"><span class="button buttonNav">Search as Words</span></a> </div>  <table width="100%" cellpadding="0" cellspacing="0" border="0" class="browseScreen">  <div align="center"> <tr align="center" valign="middle"> <td valign="middle" colspan="2"> <div class="browseSearchtool"><form target="_self" action="/search~S1/" method='get'> <label for="searchtype" style="display:none;">Search Type1</label><select name="searchtype" id="searchtype"> <option value="X"> Keyword</option> <option value="t"> Title</option> <option value="a"> Author (Last name first)</option> <option value="d" selected="selected"> Subject</option> <option value="i"> ISBN/ISSN</option> <option value="c"> Call Number</option> <option value="f"> Unit Code</option> <option value="m"> Libraries Australia No.</option> <option value="l"> Library of Congress No.</option> </select>   <label for="searcharg" style="display:none;">Search</label><input type="text" name="searcharg" id="searcharg" size="30" onchange='return searchtoolSubmitAction()'maxlength="75" value="Algorithms" />   <label for="searchscope" style="display:none;">Search Scope</label><select name="searchscope" id="searchscope"> <option value="1" selected="selected"> Entire Collection</option> <option value="11"> Print Books</option> <option value="9"> E-books</option> <option value="12"> All books</option> <option value="10"> E-journals</option> <option value="6"> All journals</option> <option value="13"> Databases</option> <option value="3"> All e-resources</option> <option value="2"> Streaming Video</option> <option value="14"> DVDs</option> <option value="5"> Curriculum Resources</option> <option value="4"> Deakin Theses</option> <option value="8"> Special Collections</option> <option value="7"> GIFT City</option> <option value="15"> Melbourne Burwood</option> <option value="16"> Warrnambool</option> <option value="17"> Geelong Waterfront</option> <option value="18"> Geelong Waurn Ponds</option> </select>   <input type="hidden" name="SORT" value="D" /><input type="hidden" name="extended" value="0" /> <input type="submit" name="SUBMIT" value="Search" onclick='return searchtoolSubmitAction();' /> <div> <input type="checkbox" name="availlim" value="1" /> <span class="availLimMessage">Limit search to available items</span><br/> </div> <div> <input type="hidden" name="searchlimits" value="" /> <input type="hidden" name="searchorigarg" value="dAlgorithms" /> </div> </form> <div></div></div> </td> </tr> </div>  <tr class="msg"><td align="center" colspan="4">Nearby Subjects are:</td></tr>  <tr class="browsePager"><td align="center" class="browsePager" colspan="4">  Result Page   <a href="/search~S1?/dAlgorithms/dalgorithms/-53,-1,0,B/browse">Prev</a> <a href="/search~S1?/dAlgorithms/dalgorithms/47,-1,0,B/browse">Next</a>  </td> </tr>   <tr><td> <table width="100%" cellpadding="50" cellspacing="0" border="0" class="browseList"> <tr align="CENTER" valign="MIDDLE"> <td colspan="4" class="browseSaveJump" width="100%"> <form method="POST" action="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/browse" name="export_form" id="export_form" > <input type="hidden" name="jumpref" value="dalgorithms"> <input type="hidden" id="save_func" name="save_func" value=""/> <a href="#" onclick="process_save(0);" style="text-decoration:none"> <span class="button"><img src="/screens/ico_bag_add.gif" alt=""><span class="buttonText">Add Marked to Bag</span></span></a> <span name='save_page_btn1' id='save_page_btn1' style='visibility: visible' ><a href="#" onclick="process_save(1);" style="text-decoration:none"> <span class="button"><img src="/screens/ico_bag_add.gif" alt=""><span class="buttonText">Add All On Page</span></span></a> </span> <span name='mylist_btn1' id='mylist_btn1' style='visibility: visible' ><a href="#" onclick="save_to_mylist();"> <span class="button"><img src="/screens/ico_list_add.gif" alt=""><span class="buttonText">Add Marked to My Lists</span></span></a> </span> </td></tr> </td> </tr> <tr class="browseHeader"> <td align="center" valign="bottom" class="browseHeaderMark"> Mark </td> <td class="browseHeaderData">   </td> <td align="left" valign="bottom" class="browseHeaderYear"> Year </td> <td align="center" valign="bottom" class="browseHeaderEntries"> Entries </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithmische geometrie|16"> </td> <td class="browseEntryData"> <a name='anchor_-3'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithmische+geometrie&1%2C16%2C">Algorithmische Geometrie</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 16 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithmische lerntheorie|4"> </td> <td class="browseEntryData"> <a name='anchor_-2'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithmische+lerntheorie&1%2C4%2C">Algorithmische Lerntheorie</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 4 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithmische programmierung|1"> </td> <td class="browseEntryData"> <a name='anchor_-1'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithmische+programmierung&1%2C1%2C">Algorithmische Programmierung</a> : Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2009 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithmische zahlentheorie|1"> </td> <td class="browseEntryData"> <a name='anchor_0'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithmische+zahlentheorie&1%2C1%2C">Algorithmische Zahlentheorie</a> : Algorithmic number theory : second internati[o]nal symposium, ANTS-II, Talence, France, May 18-23, 1996 : proceedings / Henri Cohen (ed.)  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 1996 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td> </td> <td class="browseEntryData"> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/aexact&FF=dalgorithms&1%2C16" > Algorithms </a> -- <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/aexact&FF=dalgorithms&1%2C16" >16 Related Subjects</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 16 </td> </tr> <tr class="yourEntryWouldBeHere"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms|1507"> </td> <td class="yourEntryWouldBeHereData"> <a name='anchor_2'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithms&1%2C1507%2C"><strong> Algorithms.</strong></a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 1507 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms analysis|2"> </td> <td class="browseEntryData"> <a name='anchor_3'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithms+analysis&1%2C2%2C">Algorithms -- Analysis.</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 2 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms analysis congresses|1"> </td> <td class="browseEntryData"> <a name='anchor_4'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+analysis+congresses&1%2C1%2C">Algorithms -- Analysis -- Congresses.</a> : Applied algebra, algebraic algorithms, and error-correcting codes : 8th International Conference, AAECC-8 Tokyo, Japan, August 20-24, 1990 : proceedings / S. Sakata (ed.)  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 1991 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms and data structures|799"> </td> <td class="browseEntryData"> <a name='anchor_5'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithms+and+data+structures&1%2C799%2C">Algorithms & data structures.</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 799 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms case studies|1"> </td> <td class="browseEntryData"> <a name='anchor_6'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+case+studies&1%2C1%2C">Algorithms -- Case studies</a> : The constitution of algorithms : ground-truthing, programming, formulating / Florian Jaton ; foreword by Geoffrey C. Bowker  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2020 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms complexity number theory computational number theory|1"> </td> <td class="browseEntryData"> <a name='anchor_7'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+complexity+number+theory+computational+number+theory&1%2C1%2C">Algorithms; complexity Number theory Computational number theory</a> : Women in Numbers 2 : research directions in number theory : BIRS Workshop, WIN2 - Women in Numbers 2, November 6-11, 2011, Banff International Research Station, Banff, Alberta, Canada / Chantal David, Matilde Lal铆n, Michelle Manes, editors  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2013 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms computer programs|2"> </td> <td class="browseEntryData"> <a name='anchor_8'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithms+computer+programs&1%2C2%2C">Algorithms -- Computer programs.</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 2 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms computer science algorithms|1"> </td> <td class="browseEntryData"> <a name='anchor_9'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+computer+science+algorithms&1%2C1%2C">Algorithms Computer science Algorithms</a> : Computational algebraic and analytic geometry : AMS special sessions on computational algebraic and analytic geometry for low-dimensional varieties, January 8, 2007, New Orleans, LA, January 6, 2009, Washington, DC, [and] January 6, 2011, New Orleans, LA / Mika Sepp盲l盲, Emil Volcheck, editors  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2012 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms computer science approximation algorithms|1"> </td> <td class="browseEntryData"> <a name='anchor_10'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+computer+science+approximation+algorithms&1%2C1%2C">Algorithms Computer science Approximation algorithms</a> : Recent advances in scientific computing and applications : eighth International Conference on Scientific Computing and Applications, April 1-4, 2012, University of Nevada, Las Vegas, Nevada / Jichun Li, Hongtao Yang, Eric Machorro, editors  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2013 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms computer science nonnumerical algorithms|1"> </td> <td class="browseEntryData"> <a name='anchor_11'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+computer+science+nonnumerical+algorithms&1%2C1%2C">Algorithms Computer science Nonnumerical algorithms</a> : Graph partitioning and graph clustering : 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA / David A. Bader, Henning Meyerhenke, Peter Sanders, Dorothea Wagner, editors  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2013 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms computer science parallel algorithms|1"> </td> <td class="browseEntryData"> <a name='anchor_12'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+computer+science+parallel+algorithms&1%2C1%2C">Algorithms Computer science Parallel algorithms</a> : Graph partitioning and graph clustering : 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA / David A. Bader, Henning Meyerhenke, Peter Sanders, Dorothea Wagner, editors  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2013 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms computers programming|699"> </td> <td class="browseEntryData"> <a name='anchor_13'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithms+computers+programming&1%2C699%2C">Algorithms Computers Programming</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 699 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms congres|1"> </td> <td class="browseEntryData"> <a name='anchor_14'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+congres&1%2C1%2C">Algorithms -- Congr猫s.</a> : Applied algebra, algebraic algorithms, and error-correcting codes : 10th international symposium, AAECC-10, San Juan de Puerto Rico, Puerto Rico, May 10-14, 1993 : proceedings / G茅rard Cohen, Teo Mora, Oscar Moreno (eds.)  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 1993 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms congresses|157"> </td> <td class="browseEntryData"> <a name='anchor_15'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithms+congresses&1%2C157%2C">Algorithms -- Congresses</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 157 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms data processing|9"> </td> <td class="browseEntryData"> <a name='anchor_16'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithms+data+processing&1%2C9%2C">Algorithms -- Data processing.</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 9 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms data processing congresses|1"> </td> <td class="browseEntryData"> <a name='anchor_17'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+data+processing+congresses&1%2C1%2C">Algorithms -- Data processing -- Congresses.</a> : Applied algebra, algorithmics and error-correcting codes : 2nd International Conference, AAECC-2, Toulouse, France, October 1-5, 1984 : proceedings / edited by Alain Poli  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 1986 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms design|4"> </td> <td class="browseEntryData"> <a name='anchor_18'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithms+design&1%2C4%2C">Algorithms -- Design.</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 4 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms encyclopedias|3"> </td> <td class="browseEntryData"> <a name='anchor_19'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithms+encyclopedias&1%2C3%2C">Algorithms -- Encyclopedias</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 3 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms fiction|1"> </td> <td class="browseEntryData"> <a name='anchor_20'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+fiction&1%2C1%2C">Algorithms -- Fiction</a> : The CS detective : an algorithmic tale of crime, conspiracy, and computation / Jeremy Kubica  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2016 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms for numerical algorithms see 65 xx for combinat computer science for papers involving machine computations a|1"> </td> <td class="browseEntryData"> <a name='anchor_21'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+for+numerical+algorithms+see+++++++65+xx+for+combinat+computer+science+for+papers+involving+machine+computations+a&1%2C1%2C">Algorithms {For numerical algorithms, see 65-XX; for combinat Computer science {For papers involving machine computations and programs in a specific mathematical area, see Section</a> : The bounded and precise word problems for presentations of groups / S.V. Ivanov  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2020 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms handbooks manuals etc|3"> </td> <td class="browseEntryData"> <a name='anchor_22'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithms+handbooks+manuals+etc&1%2C3%2C">Algorithms -- Handbooks, manuals, etc</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 3 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms history|8"> </td> <td class="browseEntryData"> <a name='anchor_23'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithms+history&1%2C8%2C">Algorithms -- History</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 8 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms juvenile fiction|1"> </td> <td class="browseEntryData"> <a name='anchor_24'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+juvenile+fiction&1%2C1%2C">Algorithms -- Juvenile fiction</a> : The CS detective : an algorithmic tale of crime, conspiracy, and computation / Jeremy Kubica  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2016 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td class="browseEntryMark"> </td> <td class="browseEntryData">  <h2 class="briefcitTitle"><em>Algorithms, Kohonen</em> -- See <a href="/search~S1/d?Self-organizing+maps&search_code=a">Self-organizing maps </a></strong></h2><span class="authPublicNote"><br /></span> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms mathematical models|1"> </td> <td class="browseEntryData"> <a name='anchor_26'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+mathematical+models&1%2C1%2C">Algorithms -- Mathematical models.</a> : Catalyst Bytes : The Secret To Making Better Decisions - Algorithms  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2018 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms moral and ethical aspects|2"> </td> <td class="browseEntryData"> <a name='anchor_27'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithms+moral+and+ethical+aspects&1%2C2%2C">Algorithms -- Moral and ethical aspects</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 2 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms of ai|1"> </td> <td class="browseEntryData"> <a name='anchor_28'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+of+ai&1%2C1%2C">algorithms of AI.</a> : Artificial Intelligence : With an Introduction to Machine Learning, Second Edition  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2018 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms periodicals|8"> </td> <td class="browseEntryData"> <a name='anchor_29'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithms+periodicals&1%2C8%2C">Algorithms -- Periodicals</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 8 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms political aspects|4"> </td> <td class="browseEntryData"> <a name='anchor_30'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithms+political+aspects&1%2C4%2C">Algorithms -- Political aspects</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 4 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms popular works|1"> </td> <td class="browseEntryData"> <a name='anchor_31'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+popular+works&1%2C1%2C">Algorithms -- Popular works</a> : Algorithms / Panos Louridas  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2023 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms problems exercises etc|6"> </td> <td class="browseEntryData"> <a name='anchor_32'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithms+problems+exercises+etc&1%2C6%2C">Algorithms -- Problems, exercises, etc</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 6 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms psychological aspects|1"> </td> <td class="browseEntryData"> <a name='anchor_33'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+psychological+aspects&1%2C1%2C">Algorithms -- Psychological aspects</a> : Live coding : a user's manual / Alan F. Blackwell, Emma Cocker, Geoff Cox, Alex McLean, and Thor Magnusson  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2022 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms research|1"> </td> <td class="browseEntryData"> <a name='anchor_34'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+research&1%2C1%2C">Algorithms -- Research.</a> : Catalyst: Kaggle/Carbon Nano/Fur Seals/Richard Costin Profile/Hot Or Cold  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2011 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms social aspects|20"> </td> <td class="browseEntryData"> <a name='anchor_35'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithms+social+aspects&1%2C20%2C">Algorithms -- Social aspects</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 20 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms social aspects congresses|1"> </td> <td class="browseEntryData"> <a name='anchor_36'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+social+aspects+congresses&1%2C1%2C">Algorithms -- Social aspects -- Congresses</a> : Algorithmuskulturen : 脺ber die rechnerische Konstruktion der Wirklichkeit / Robert Seyfert, Jonathan Roberge (Hg.)  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2017 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms social aspects costa rica|1"> </td> <td class="browseEntryData"> <a name='anchor_37'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+social+aspects+costa+rica&1%2C1%2C">Algorithms -- Social aspects -- Costa Rica</a> : Living with algorithms : agency and user culture in Costa Rica / Ignacio Siles  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2023 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms sociological aspects|1"> </td> <td class="browseEntryData"> <a name='anchor_38'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+sociological+aspects&1%2C1%2C">Algorithms -- Sociological aspects</a> : The everyday life of an algorithm / Daniel Neyland  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2019 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms study and teaching|3"> </td> <td class="browseEntryData"> <a name='anchor_39'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithms+study+and+teaching&1%2C3%2C">Algorithms -- Study and teaching</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 3 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms study and teaching higher|1"> </td> <td class="browseEntryData"> <a name='anchor_40'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithms+study+and+teaching+higher&1%2C1%2C">Algorithms -- Study and teaching (Higher)</a> : Algorithms and applications for academic search, recommendation and quantitative association rule mining / Emmanouil Amolochitis  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2018 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithms textbooks|7"> </td> <td class="browseEntryData"> <a name='anchor_41'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithms+textbooks&1%2C7%2C">Algorithms -- Textbooks</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 7 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithmus|66"> </td> <td class="browseEntryData"> <a name='anchor_42'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgorithmus&1%2C66%2C">Algorithmus</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 66 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgorithmus xml|1"> </td> <td class="browseEntryData"> <a name='anchor_43'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgorithmus+xml&1%2C1%2C">Algorithmus XML</a> : Foundations of XML processing : the tree-automata approach / Haruo Hosoya  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2011 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgoritmen|84"> </td> <td class="browseEntryData"> <a name='anchor_44'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/exact&FF=dalgoritmen&1%2C84%2C">Algoritmen.</a> </td> <td class="browseEntryYear"> </td> <td align="right" class="browseEntryEntries"> 84 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgoritmer|1"> </td> <td class="browseEntryData"> <a name='anchor_45'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgoritmer&1%2C1%2C">Algoritmer.</a> : Optimization algorithms on matrix manifolds / P.-A. Absil, R. Mahony, R. Sepulchre  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 2008 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr class="browseEntry"> <td style="text-align:center" rowspan="1" class="browseEntryMark"> <input type="checkbox" name="savegroup" value="dalgoritmer kongresser|1"> </td> <td class="browseEntryData"> <a name='anchor_46'></a> <a href="/search~S1?/dAlgorithms/dalgorithms/-3%2C-1%2C0%2CB/frameset&FF=dalgoritmer+kongresser&1%2C1%2C">Algoritmer -- Kongresser.</a> : Logic of programs : workshop, ETH Z眉rich, May-July 1979 / edited by Erwin Engeler  </td> <td align="left" valign="top" rowspan="1" class="browseEntryYear"> 1981 </td> <td align="right" class="browseEntryEntries"> 1 </td> </tr> <tr align="CENTER" valign="MIDDLE"> <td colspan="4" class="browseSaveJump" width="100%"> <a href="#" onclick="process_save(0);" style="text-decoration:none"> <span class="button"><img src="/screens/ico_bag_add.gif" alt=""><span class="buttonText">Add Marked to Bag</span></span></a> <span name='save_page_btn2' id='save_page_btn2' style='visibility: visible' ><a href="#" onclick="process_save(1);" style="text-decoration:none"> <span class="button"><img src="/screens/ico_bag_add.gif" alt=""><span class="buttonText">Add All On Page</span></span></a> </span> <span name='mylist_btn2' id='mylist_btn2' style='visibility: visible' ><a href="#" onclick="save_to_mylist();"> <span class="button"><img src="/screens/ico_list_add.gif" alt=""><span class="buttonText">Add Marked to My Lists</span></span></a> </span> </form> </td></tr> </td> </tr> </table>  </td>  </tr>  <tr class="browsePager"><td align="center" class="browsePager" colspan="4">  Result Page   <a href="/search~S1?/dAlgorithms/dalgorithms/-53,-1,0,B/browse">Prev</a> <a href="/search~S1?/dAlgorithms/dalgorithms/47,-1,0,B/browse">Next</a>  </td> </tr>  </table>  <div align="center" class="navigationRow"> <a href="/search~S1?/dAlgorithms/dalgorithms/1,-1,0,B/limit:relimit"><span class="button buttonNav">Limit/Sort Search</span></a> <a href="/search~S1/X?Algorithms&SORT=D&searchscope=1"><span class="button buttonNav">Search as Words</span></a> </div>    </div> <div style="clear:both"></div> </div> <iframe src="https://www.deakin.edu.au/library/media/static/deakin-footer2" target="_top" style="width:100%;height: 648px;border: none;overflow: hidden;margin: 0;" scrolling="no" aria-label="Deakin footer" title="Deakin footer"></iframe>   </body> </html>