 |
|
| JOURNAL OF DISCRETE ALGORITHMS
| |
| | |
|
|
Editors-in-Chief:
D.M. Gabbay, C.S. Iliopoulos, G.F. Italiano, M. Smid, E. Upfal, D. Wagner
See editorial board for all editors information
Description
The Journal of Discrete Algorithms (JDA) aims to facilitate communication between researchers in theoretical
computer science who are concerned with the design and analysis of discrete algorithms. The Journal of Discrete Algorithms
welcomes original papers in all areas of finite and discrete algorithm design and analysis.
The purpose of this journal is to feature
new algorithms and data structures, new analyses or comparisons of known algorithms, complexity studies and well-focussed review articles
of currently-active subject areas. Articles in other areas of theoretical computer science will also be considered when there is a clear
connection to computational issues.
The Journal of Discrete Algorithms is pledged to maintain high quality standards, an
openess to all approaches to the subject, a transparent reviewing policy, and a minimal delay between submissioned publication.
| Bibliographic details |
ISSN: 1570-8667
Imprint: ELSEVIER
Published by Elsevier since 2003
Subscriptions for the year 2009,
Volume 7,
4 issues
NEW!! Elsevier's Theoretical Computer Science Student Collection
This journal is included in a bundle of 12 premier Theoretical
Computer Science journals at a discounted student rate:
Click here for more information on eligibility AND/OR to get your online personal
student collection today!
|
For an overview of recently-dispatched issues, see the Journal issue
dispatch dates
600/144
Last update: 7 Oct 2008
|
|
| |
| | |
|
|
| |
