| 163 links found |
|
|
| pages:
<< prev
|
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
next >>
|
•
Zeus — (Computers/Algorithms)
An algorithm animation system developed at Digital Equipment Corporation's Systems Research Center.
related to Zeus
|
•
(France) INRIA — (Computers/Algorithms)
Rocquencourt, Versailles. Algorithms Project. Interests in design and analysis of algorithms, computer algebra, combinatorial analysis and asymptotics.
related to (France) INRIA
|
•
(Netherlands) Euler Institute for Discrete Mathematics and its Applications (EIDMA) — (Computers/Algorithms)
Discrete Algebra and Geometry, Coding Theory, Information Theory and Cryptology, Combinatorial Optimization and Algorithms, Graph Theory.
related to (Netherlands) Euler Institute for Discrete Mathematics and its Applications (EIDMA)
|
•
(France) LRI - Laboratoire de Recherche en Informatique — (Computers/Algorithms)
CNRS/Université de Paris Sud. Research Topics: Graph Theory and principles of Network Communications, Algorithms and Complexity,Programming, Databases,Proofs and programs, Parallel Architecture, Parallelism, Artificial Intelligence and Inference systems (IASI),Inference and Learning.
related to (France) LRI - Laboratoire de Recherche en Informatique
|
•
(France) LaBRI - Laboratory for Research in Computer Science, — (Computers/Algorithms)
Bordeaux. Researchers at the LaBRI are organized into five research teams: Combinatorics and Algorithmics (Enumerative combinatorics, maps, physics; Random generation and visualization; Graphs and applications; Distributed algorithms); Logic, Formal Languages, and Applications (Graphs and logic; Formal languages; Rewriting, Databases); Modeling, Verifying and Testing Computerized Systems; Parallel and Distributed Computing;Image and Sound (Image analysis; Image synthesis)
related to (France) LaBRI - Laboratory for Research in Computer Science,
|
•
(Austria) Technical University Vienna — (Computers/Algorithms)
Algorithms and Data Structures Group. Research interests: algorithms, data structures and combinatorial optimization, particularly for NP-hard optimization problems.
related to (Austria) Technical University Vienna
|
•
(USA) Caltech — (Computers/Algorithms)
Winfree Lab, DNA and Natural Algorithms Group. Members, research projects.
related to (USA) Caltech
|
•
(Germany) University of Paderborn — (Computers/Algorithms)
Parallel and Distributed Algorithms research group. Research projects and resources.
related to (Germany) University of Paderborn
|
•
(USA) University of Maryland, College Park — (Computers/Algorithms)
Algorithms and Theory Group. Members, research projects.
related to (USA) University of Maryland, College Park
|
•
(USA) Carnegie Mellon University — (Computers/Algorithms)
Algorithms and Computational Complexity group. Members, research projects, courses.
related to (USA) Carnegie Mellon University
|
•
(Australia) Bond University — (Computers/Algorithms)
School of Information Technology, Algorithms Group. The effective application of meta-heuristic search algorithms to intractable problems.
related to (Australia) Bond University
|
•
(USA) Massachusetts Institute of Technology (MIT) — (Computers/Algorithms)
The Algorithms Group, part of the Theory of Computation (TOC) group in the Computer Science and Artificial Intelligence Laboratory (CSAIL). People and research projects.
related to (USA) Massachusetts Institute of Technology (MIT)
|
•
Stack Free Recursion — (Computers/Algorithms)
A paper describing the "Stack Free Recursion" algorithm. C code with C++ comments.
related to Stack Free Recursion
|
•
SODA Bibliography 1990-1998 — (Computers/Algorithms)
Bibliography containing papers published in the proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. [Hypertext version died, only gzip version available.]
related to SODA Bibliography 1990-1998
|
•
The Art of Computer Programming (TAOCP) — (Computers/Algorithms)
By Donald E. Knuth. Bibliographic details of the published volumes (1-3, various editions and translations) and on-line beta versions of parts of volume 4, "Combinatorial Algorithms".
related to The Art of Computer Programming (TAOCP)
|
•
Combinatorics, Probability and Computing — (Computers/Algorithms)
(CUP) Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation. Contact information; full text to subscribers.
related to Combinatorics, Probability and Computing
|
•
Journal of Symbolic Computation — (Computers/Algorithms)
(Academic Press) A forum for research in the algorithmic treatment of all types of symbolic objects. Tables of contents from vol.15 (1993). Full text to subscribers.
related to Journal of Symbolic Computation
|
•
Discrete Applied Mathematics — (Computers/Algorithms)
Aims to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Full text by subscription.
related to Discrete Applied Mathematics
|
•
Fast Median Search — (Computers/Algorithms)
Overview of algorithms to find the median in a list of values; implementations and links are also provided.
related to Fast Median Search
|
•
Ternary Search Trees — (Computers/Algorithms)
Algorithm for search. PDF file and examples in C.
related to Ternary Search Trees
|
pages:
<< prev
|
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
next >>
|
|
|
