| Directory > Computers > Algorithms > Publications > Journals Computational Optimization and Applications
(Kluwer) Abstracts and contents from vol.4 (1995). Full text to subscribers.
http://www.kluweronline.com/issn/0926-6003
Reviews Rating: Not yet Rated
Whois Check
Journal of Algorithms Bibliography
A hypertext bibliography containing papers published in the Journal of Algorithms, 1980-1999.
http://liinwww.ira.uka.de/bibliography/Misc/HBP/JALGO.html
Reviews Rating: Not yet Rated
Whois Check
Journal of Graph Algorithms and Applications
An electronic journal available via WWW. All papers freely available in PostScript and PDF.
http://www.cs.brown.edu/publications/jgaa/
Reviews Rating: Not yet Rated
Whois Check
Journal of Complexity
(Elsevier) Mathematical results on complexity as broadly conceived.
http://www.sciencedirect.com/science/journal/0885064X
Reviews Rating: Not yet Rated
Whois Check
Journal of Symbolic Computation
(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.
http://www.elsevier.com/locate/issn/0747-7171
Reviews Rating: Not yet Rated
Whois Check
Journal of Algorithms
(Academic Press) Contents from vol.14 (1993). Full text to subscribers.
http://www.elsevier.com/locate/issn/0196-6774
Reviews Rating: Not yet Rated
Whois Check
Random Structures and Algorithms
Results concerning random graphs, hypergraphs, matroids, trees, mappings, permutations, matrices,
sets and orders, as well as stochastic graph processes and networks are presented with particular
emphasis on the use of probabilistic methods in combinatorics as developed by Paul Erdõs. The
journal focuses on probabilistic algorithms, average case analysis of deterministic algorithms, and
applications of probabilistic methods to cryptography, data structures, searching and sorting. The
journal also devotes space to such areas of probability theory as percolation, random walks and
combinatorial aspects of probability. Table of contents with abstracts on-line starting with
volume 8 (1996), full text available to subscribers.
http://www.interscience.wiley.com/jpages/1042-9832/
Reviews Rating: Not yet Rated
Whois Check
Journal of Discrete Algorithms
Contact information, list of accepted and forthcoming papers.
http://www.dcs.kcl.ac.uk/journals/jda/
Reviews Rating: Not yet Rated
Whois Check
Journal of Complexity
Editor's site. Author and subscriber information.
http://www.ibc-research.org/jofc.html
Reviews Rating: Not yet Rated
Whois Check
Information Processing Letters
The aim of IPL is to allow rapid dissemination of interesting results in the field of information
processing in the form of short, concise papers.
http://www.elsevier.nl/inca/publications/store/5/0/5/6/1/2/
Reviews Rating: Not yet Rated
Whois Check
The Electronic Journal of Combinatorics
A refereed all-electronic journal that welcomes papers in all branches of discrete mathematics.
Full text is available free on-line.
http://www.combinatorics.org/
Reviews Rating: Not yet Rated
Whois Check
Discrete Applied Mathematics
(Elsevier) Combinatorial Algorithms, Optimization and Computer Science.
http://www.elsevier.nl:80/inca/publications/store/5/0/5/6/0/9/
Reviews Rating: Not yet Rated
Whois Check
Computational Complexity
(Birkhauser) Tables of contents from vol.7 (1998) on. Full text to subscribers via LINK.
http://www.birkhauser.ch/journals/3700/3700_tit.htm
Reviews Rating: Not yet Rated
Whois Check
Combinatorics, Probability and Computing
(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.
http://uk.cambridge.org/journals/cpc/
Reviews Rating: Not yet Rated
Whois Check
|
