Algorithmic pointers and diversions

• Computing research: interview with Tony Hoare (cf Grand Challenges and paper in Computer J).
• Robert Zakon's timeline of the development of the Internet.
• BT's technology timeline till 2030 and beyond (version 2002).
• Foresight on information society technology.
• Information Society Technologies: ISTAG, Future and Emerging Technologies
• Documentary: A story About the semantic web (BBC, 2010).

• Algolib: The Algorithms Project's Library (INRIA).
• Algorithmic Solutions Software GmbH.
• Digital Library of Mathematical Functions (NIST).
• Function calculator (Xiao Gang)
• ILOG Optimization Suite, Jgraph (for Swing), ScientificPython.
• Information Technology Laboratory (NIST).
• Integrator (Wolfram).
• Optimization tools (MathTools).
• Decision Tree for Optimization Software .
• Linear programming, nonlinear programming.
• COmputational INfrastructure for Operations Research (COIN-OR).
• NEOS - Software for optimization problems.
• Optimization research and software (OREAS).
• Machine learning algorithms for data mining tasks (WeKa).
• PARI/GP - computer algebra system, Maxima- symbolic computation .
• ScienceOps (Computational science solutions)
• The Stony Brook Algorithm Repository.
• webMathematica Calculators (Efunda).
• Technical Computing Tools (MathTools).

• Dictionary of algorithms and datastructures (Black).
• Analysis of algorithms homepage (Flajolet and Prodinger).
• Algorithm design manual (Skiena).
• Compendium of NP-optimization problems (Creszenzi and Kann).
• Compendium of parameterized complexity problems (Cesati, 2004),
  Compendium of parameterized complexity problems (Cesati, 2006, pdf).
• Functions (Wolfram).
• Geometric algorithms `in action', the geometry junkyard (Epstein).
• Linear programming (Ferguson).
• P-versus-NP among the millennium prize problems.
• The complexity zoo (Aaronson)
• Theoretical computer science cheat sheet (Seiden).
• Glossary of terms in combinatorics (West).

• MathWorld (Weisstein).
• Art Gallery Theorems and Algorithms (O'Rourke).
• Combinatorics (after De Bruyn, by Hung and Kloks).
• Complexity and Approximation: Combinatorial Optimization Problems etc (Ausiello et al).
• Computational Complexity: a Modern Approach (Arora, draft).
• Generatingfunctionology (Wilf), see also A=B (Petkovsek, Wilf, Zeilberger).
• Graph theory (Diestel, 3rd edition, also here).
• Introduction to Combinatorial Geometry (Matousek.ps).
• Introduction to convexity (Dahl).
• Introduction to convexity, polyhedral theory, and combinatorial optimization (Dahl).
• Knapsack problems (Martello and Toth).
• Lecture notes on approximation algorithms - Vol I (Motwani)
• Lecture Notes in Computational Complexity (Trevisan, pdf).
• Lectures in Computational Complexity (Cai, pdf).
• Parametrized algorithmics: A graph-theoretic approch (Fernau, pdf).
• Probabilistic checking of proofs and hardness of approximation problems (Arora).
• Reversible Markov Chains and Random Walks on Graphs (Aldous and Fill).
• Stanford encyclopedia of philosophy.
• Statistics: Methods and Applications.
• Virtual Laboratories in Probability and Statistics (also here).

• Pattern matching pointers (Lonardi).
• Data compression algorithms (Nelson).
• Graph coloring page (Culberson).
• Graph classes
• Combinatorial games (Epstein).
• Machine learning resources (OFAI) (see also Aha's pages).
• Computational learning theory resources.
• Cryptography and security (Rivest).
• Cryptology pointers e.g. elliptic curve cryptography (Lipmaa).
• Econometrics, Mathematics, Macroeconomics, Microeconomics, Software Tutorials (Lecture Notes online)
• Operations Research and Management Sciences Resource Collection (INFORMS).
• Sports scheduling (Knust)
• Complexity results for scheduling problems (Brucker, Knust)
• Wireless ad-hoc networks bibliography (Miller, see also here)).
• Wireless sensor networks (Zhou).
• Complex adaptive systems and agent-based computational economics (Tesfatsion).
• Numbers, constants and computation (Gourdon and Sebah).
• Digital library of mathematical functions (NIST).

• Great Algorithms (Karp).
• Introduction to graphs and algorithms (Emden-Weinert et al).
• Course on structural graph theory (Thomas).
• Course on algorithms (Tarjan).
• Course on advanced algorithms (Hastad).
• Course on combinatorial algorithms (Erickson).
• Course on advanced algorithms (Williamson).
• Course on advanced complexity theory (Sudan).
• Course on computational complexity (Arora). See also here (Trevisan).
• Intensive introduction to computational complexity theory (O'Donnell).
• Course on approximation algorithms (Thakur, incl. pointers).
• Course on randomized algorithms (Karger).
• Course on randomness and computation (Sinclair).
• Course on Randomisierter Algorithmen (Hofmeister).
• Course on Markov Chain Monte Carlo Methods (Vigoda).
• Algorithmic introduction to coding theory (Sudan).
• Course on pseudorandomness (Zuckerman). See also here (Vadhan).
• Course on information retrieval and web mining (Raghavan, Schuetze)
• Course on algorithmic game theory (Tardos), Algorithmic Game Theory and Applications (Etessami).
• Game theory and mechanism design (Harrenstein), CS, Game theory, and Economics (Nissan).
• Course on algorithms for selfish agents.
• Wireless networking (Wan).
• Distributed Algorithms for Mobile Wireless Ad Hoc Networks (Lynch).
• Course on algorithms in molecular biology (Ruzzo/Tompa/Karp).
• Course on algorithms in the real world (Blelloch).
• Introduction to linear programming (Goemans).
• OR notes (Beasley).
• Economics and computation (also here, Feigenbaum).
• Course on quantum computation (Preskill).
• Course on algebra and computation (Sudan).
• Course on history of mathematics (Grant, pdf).
• Collection of lecture notes and surveys (Fomin).

• Reducibility among combinatorial problems (Karp, 1972).
• Solving traveling salesman problems.
• Quadratic four-coloring algorithm (Robertson, Sanders, Seymour, Thomas).
• Map labeling (Wolff).
• Positioning algorithms for ad-hoc networks
• Visualizing internet topology.
  
  
• Interactive mathematics miscellany and puzzles (Bogomolny).
• Math pages.
• Primality testing in polynomial time (Agrawal, Kayal, Saxena, 2002, News FAQ).
• The prime pages (Caldwell).
• Wiskundemeisjes (NL).
  
  
• Useful theory pages (SigACT).
• Graph theory resources (Sanders).
• TCS virtual address book (SigACT).
• Graph Theorists' Home Page Guide (Zuther).
• MacTutor History of Mathematics archive.
• International World-Wide Web conference committee.
  
  
• Challenges for theoretical computer science (Johnson).
• The top ten algorithms of the 20th century (also here).
• Top 25 innovations: Internet ranks No 1
• Websites that changed the world: list (Guardian 2006).
  
  
• Bioinformatics - Elements of an emerging discipline (Pedersen, also here).

Last Changed: December 2008