Analysis Of Algorithms

Title:	Analysis Of Algorithms
URL:	http://pauillac.inria.fr/algo/AofA/
Cat:	Computers/Algorithms/
Text:	analysis algorithms analysis algorithms pages maintained , rocquencourt, , johannesburg nalysis algorithms aofa field computer science goal understanding complexity algorithms. extremely large amount research devoted worst case evaluations, focus pages methods average case probabilistic analysis. properties random strings, permutations, trees, graphs essential ingredients analysis algorithms. subject founded coined term analysis algorithms mid sixties illustrated monumental series, field entertains close ties number areas discrete mathematics, combinatorial analysis, probability theory, analytic number theory, asymptotic analysis, complexity theory, statistical physics. hese pages initiative bunch people gathered meeting specifically devoted aofa, , germany, july . open objective pages forum research interests average case probabilistic analysis algorithms. images icons clickable. research papers, announcements technical reports, preprints, results relative analysis algorithms available web. list moderated micha hofri. list open problems comments solutions. hesitate contribute... starting column problems presented dagstuhl gang july . relative quickselect, adaptive searching, quicksort, etc. place freely express yourself. messages simply archived automatically mailbox encumbered. here, mail addresses founders friends analysis algorithms pages. join. shy enjoy enjoy, finding newly discovered sequence , , , , , , , , , etc, truly original constant . expressible terms classical quantities compute directly billionth bit pi also, books journals relevant. email links , links pages, please algo.inria.fr aofa index.html selected member britannica internet guide. illustrations. khwarizmi server monkey saddle appears analysis connectivity random graphs source picture courtesy
Source:	<HTML> <BODY BACKGROUND="Pix/noten1.gif"> <HEAD> <TITLE>ANALYSIS of ALGORITHMS HOME PAGE</TITLE> <META name="description" content="Home page of Analysis of Algorithms, with links to research in analysis of algorithms, people, events, references, etc."> <META name="keywords" content="algorithms, data structures, analysis of algorithms, analytic combinatorics, combinatorial analysis, asymptotics, asymptotic methods, probabilistic methods, Dagstuhl, random structures, limit distributions, random trees, random strings, pattern matching, random permutation, sorting and searching, probabilistic algorithms, computer algebra"> </HEAD> <body> <center> <IMG SRC="Pix/ALGO2-small.jpg"> </center> <center><H1>ANALYSIS of ALGORITHMS HOME PAGE</H1> </center> <center> <H4>Pages maintained by<br> <A HREF="http://www-rocq.inria.fr/algo/flajolet/index.html">Philippe Flajolet</A>, Rocquencourt, <br>and<br> <A HREF="http://www.wits.ac.za/helmut/index.htm"> Helmut Prodinger</A>, Johannesburg </H4> </center> <P> <center> [ <a href="Research/index.html">Research</a> \| <a href="Problems/index.html">Problems</a> \| <a href="http://semillon.wpi.edu/~aofa/mailing_list/">Bulletin board</a> \| <a href="http://www.wits.ac.za/helmut/AofA/People/index.html">People</a> \| <a href="http://www.wits.ac.za/helmut/AofA/Resources/index.html">Resources</a> ] </center> </font> <p> <p> <center> [<strong><em> <A HREF="http://www-rocq.inria.fr/algo/AofA/index.html"> European Base </A> \| <A HREF="http://www.cecm.sfu.ca/mirror/INRIA/algo/AofA/index.html"> North American Mirror</A></strong></em> ] </center> <hr> <TABLE><TBODY><TR><TD> <A HREF="http://www-groups.dcs.st-andrews.ac.uk/~history/Mathematicians/Al'Khwarizmi.html"> <IMG SRC="Pix/Al_Khwarizmi-small.jpg" valign="middle" halign="left"></A> </TD><TD> </P> <b><font size=7>A</font>nalysis of Algorithms (AofA)</b> is a field in computer science whose overall goal is an understanding of the complexity of algorithms. While an extremely large amount of research is devoted to worst-case evaluations, the focus in these pages is methods for average-case and probabilistic analysis. Properties of random strings, permutations, trees, and graphs are thus essential ingredients in the analysis of algorithms. </P> </TD></TR></TBODY></TABLE> <TABLE><TBODY><TR><TD> <P> <font size=7>T</font>he subject was founded by <A HREF="http://www-cs-staff.stanford.edu/~knuth"/<b>Knuth</b></A> (who coined the term <cite>"analysis of algorithms"</cite> in the mid-sixties) and is well illustrated by his monumental series, <A HREF="http://www-cs-staff.stanford.edu/~knuth/taocp.html"> <cite>The Art of Computer Programming</cite></A> The field entertains close ties with a number of areas like discrete mathematics, combinatorial analysis, probability theory, analytic number theory, asymptotic analysis, complexity theory, and sometimes statistical physics. </P> </TD> <TD> <A HREF="ALGO2.html"> <IMG align="bottom" SRC="Pix/ALGO2.jpg"></A> </TD> </TR></TBODY></TABLE> l <TABLE><TBODY><TR><TD> <A HREF="dagbars.html"><IMG align="bottom" SRC="Pix/dagbars-small.jpg"> </TD><TD> <P> </A><font size=7>T</font>hese pages are the initiative of a bunch of people who gathered at a meeting specifically devoted to AofA, in <A HREF="http://www.dag.uni-sb.de/ENG/">Dagstuhl</A>, Germany, in July 1997. <b> This site is open to all!</b> It is our objective that the pages become a forum for everyone with research interests in average-case and probabilistic analysis of algorithms. </P> </TD></TR></TBODY></TABLE> <hr> <center><font size=2>Images and icons on this page are clickable. </font></center> <hr> <P> <A HREF="Research/index.html"> <H3><IMG SRC="Pix/library2.gif"> Research</H3> </A> This is for research papers, announcements of technical reports, preprints, and new results relative to Analysis of Algorithms that are available on the web. The list is now moderated by Micha Hofri. <hr> <P> <A HREF="Problems/index.html"> <H3><IMG SRC="Pix/activite.gif"> Problems</H3> </A> A list of open (?) problems with comments and perhaps solutions. Don't hesitate to contribute... We're starting this column with problems presented by the Dagstuhl gang in July 1997. They are relative to Quickselect, adaptive searching, Quicksort, etc. <hr> <P> <A HREF="mailing_list/index.html"> <H3><IMG SRC="Pix/b_hot.gif">Bulletin board</H3> </A> A place where you can freely express yourself. Messages are simply archived here automatically and nobody's mailbox is encumbered. <hr> <P> <A HREF="http://www.wits.ac.za/helmut/AofA/People/index.html"> <H3><IMG SRC="Pix/shakespe.gif"> People</H3> </A> Here, you'll find mail and home page addresses of the founders and friends of the Analysis of Algorithms pages. Also how to join. (Don't be shy!) <hr> <P> <A HREF="http://www.wits.ac.za/helmut/AofA/Resources/index.html"> <H3><IMG SRC="Pix/graduate.gif"> Resources</H3> </A> Some <A HREF="http://www.wits.ac.za/helmut/AofA/Resources/index.html">pages</A> that we enjoy and that you might well enjoy, too! What about finding whether your newly discovered sequence 0,1,1,2,3,5,8,13,21, etc, is truly original? Is the constant 1.20205690315959428 expressible in terms of classical quantities? How do I compute directly the billionth bit of pi? Also, books and journals that are relevant. <hr> <h3><IMG SRC="Pix/mailbox.gif"align="bottom" >Email and Links</h3> <A HREF="mailto:Philippe.Flajolet@inria.fr"> Philippe.Flajolet@inria.fr</A>, <A HREF="mailto:helmut@gauss.cam.wits.ac.za"> helmut@gauss.cam.wits.ac.za</A></TT> <p> For <strong>links</strong> to these pages, please use <strong><em><tt> http://algo.inria.fr/AofA/index.html </tt></em></strong> <p> <!--********* BEGIN BANNER IMAGE *****--> <a href="http://www.britannica.com/" target="Britannica.com"><img src="http://www.britannica.com/awards/120x60award.gif" width="120" height="60" border="0"></a> <!--******* ENDBANNER IMAGE *******--> <font size=2><em>Selected as member of the Britannica Internet Guide. </em></font> <p> <hr> <font size=2> <b>Illustrations.</b> Al Khwarizmi (from the <A HREf="http://www-groups.dcs.st-andrews.ac.uk/~history/index.html"> History of Mathematics </A>server); the monkey saddle that appears in the analysis of connectivity in random graphs (source: <A HREF="http://www-rocq.inria.fr/algo">Algorithms Project</A>); a picture of <A HREF="http://wwwdb.informatik.uni-rostock.de/dagstuhl_9610/dagstuhl_pics.html">Schloss Dagstuhl</A> (courtesy of <A HREF="http://www.cs.utwente.nl/~keulen"> Maurice van Keulen</A>) </font> <body>

By wesece.com