| NAME | How to submit | Topic |
| ACM Transactions on Computation Theory (ToCT) | Submit | ACM Transactions on Computation Theory will cover theoretical computer science complementing the scope of the ACM Transactions on Algorithms and the ACM Transactions on Computational Logic including, but not limited to, computational complexity, foundations of cryptography, randomness in computing, coding theory, models of computation including parallel, distributed and quantum and other emerging models, computational learning theory, theoretical computer science aspects of areas such as databases, information retrieval, economic models and networks. |
| THEORETICAL COMPUTER SCIENCE Special Issue on Graph Searching | mail Dimitrios M. Thilikos (sedthilk@math.uoa.gr) with copies to Fedor Fomin (fomin@ii.uib.no) and Pierre Fraigniaud (pierre@lri.fr). before March 31, 2007 | Graph Searching ( (...) Applications of Graph Searching in Computer Science ) |
| Journal of Experimental Algorithmics | JEA ACM Central (*) | Devoted to the study of discrete algorithms and data structures through a combination of experimentation and classical analysis and design techniques. |
| Journal of the ACM | ACM Central | Most significant work going on in computer science, broadly construed |
| ACM Computing Surveys from ACM | Submissions | surveys, tutorials, and special reports on all areas of computing research. |
| Transactions on Algorithms from ACM | Submissions (*) | Algorithms that are inherently discrete and finite, and having mathematical content in a natural way, either in the objective or in the analysis |
| Theory of Computing | A free journal with serious referring. | |
| Algorithmica from SPRINGERLINK | Submissions | Algorithms that are either (i) theoretical papers addressing problems arising in practical areas or (ii) experimental papers that have general appeal because of their practical importance or techniques. Papers are expected to make significant contributions, judged in terms of theoretical analysis, simulations, or algorithm behavior on data from applications. |
| Algorithmica OVERVIEW PAPERS from SPRINGERLINK | Informatica initiates a new paper format. It is our intention to include in each issue an overview paper. Our assumption is that in the highly fragmented world of computer science it is very often the case that professionals lose track of what is currently going on in the other areas. The intention of our initiative is to remedy this situation. | |
| Acta Informatica from SPRINGERLINK | Instructions For Authors | The journal provides international dissemination of contributions on the art, discipline and science of informatics. Its scope covers design, description, presentation and analysis of programs, information structures, computing systems and interaction between components thereof. |
| Journal of Discrete Algorithms (JDA) from ELSEVIER | Instructions for Authors | 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 anlyses 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. |
| Information Processing Letters IPL from ELSEVIER | 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. To this end, submissions should not exceed the equivalent of nine A4 or 81/2?by?11 double?spaced typed pages. The scope of the journal is indicated by the list of keywords found below. This list is periodically updated by inserting items most frequently proposed by the contributors and removing the least popular entries, under the advisement of the Board of Editors. Submissions are encouraged both on theoretical work and on experimental work. The scope of IPL is suggested by the following alphabetical list of keywords: Algorithms - analysis of algorithms- approximation algorithms - computational complexity - - databases - data structures - design of algorithms - graph algorithms - information retrieval - on-line algorithms - randomized algorithms - theory of computation | |
| Theoretical Computer Science (TCS) from ELSEVIER | Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing. Papers published in Theoretical Computer Science are grouped in three sections according to their nature. The first section `Algorithms, automata, complexity and games' is devoted to the study of algorithms and their complexity using analytical, combinatorial or probabilistic methods. It includes the whole field of abstract complexity (i.e. all the results about the hierarchies that can be defined using Turing machines), the whole field of automata and language theory (including automata on infinite words and infinitary languages), the whole field of geometrical (graphic) applications and the whole field of measurement of system performance using statistical methods. |
See also these addresses for some journals:
Anyway, you should consider submit your paper to arXiv to make it available to more people in less time.
| http://www.cs.uwaterloo.ca/~jbarbay | 07.03.2008 (08:51) |