Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Theory of Computing Systems - incl. option to publish open access (Editorial Board)

Theory of Computing Systems

Theory of Computing Systems

Editor-in-Chief: Alan L. Selman

ISSN: 1432-4350 (print version)
ISSN: 1433-0490 (electronic version)

Journal no. 224

$99.00 Personal Rate e-only for the Americas
Get Subscription

Online subscription, valid from January through December of current calendar year

Immediate access to this year's issues via SpringerLink

2 Volume(-s) with 8 issue(-s) per annual subscription

Automatic annual renewal

More information: >> FAQs // >> Policy

Editor in Chief

Alan L. Selman
(computational complexity)
Department of Computer Science and Engineering
University at Buffalo
The State University of New York
338 Davis Hall
Buffalo, NY 14260, USA
selman@buffalo.edu


Editorial Board

Nancy M. Amato
(computational biology; computational geometry; computational science;
distributed data structures; parallel algorithms; robotics)
Department of Computer Science and Engineering
Texas A&M University
TAMU 3112
College Station, TX 77843-3112, USA
amato@tamu.edu

Benny Applebaum
(cryptography; computational complexity)
School of Electrical Engineering
Tel-Aviv University
Ramat-Aviv
Tel-Aviv 69978, Israel
bennyap@eng.tau.ac.il

Harry M. Buhrman
(computational complexity; quantum computing; distributed computing; Kolmogorov complexity)
Centrum voor Wiskunde en
Informatica
Kruislaan 413
1098 SJ Amsterdam
The Netherlands
buhrman@cwi.nl

Volker Diekert
(theory of concurrent systems; automata and formal languages; algebraic methods)
Formale Methoden der Informatik
University of Stuttgart
Universitätstrasse 38
D-70569 Stuttgart, Germany
volker.diekert@informatik.uni-stuttgart.de

Rod Downey
(parameterized and structural complexity; exact algorithms; algorithmic information theory; effective mathematics)
School of Mathematics, Statistics, and Operations Research
Victoria University
PO Box 600
Wellington, New Zealand
rod.downey@vuw.ac.nz

Guy Even
(graph algorithms; approximation algorithms)
School of Electrical Engineering
Tel-Aviv University
Ramat-Aviv
Tel-Aviv 69978, Israel
guy@eng.tau.ac.il

Pierre Fraigniaud
(theory of communication networks; routing, broadcasting, searching; mobile computing; network models)
Institut de Recherche en Informatique Fondamentale (IRIF)
Université Paris Diderot - Paris 7
Case 7014
75205 Paris Cedex 13 France
pierre.fraigniaud@irif.fr

Anna C. Gilbert
(randomized algorithms, especially streaming and sublinear algorithms; theory of communication networks; data compression algorithms)
Department of Mathematics
The University of Michigan
2074 East Hall
530 Church St.
Ann Arbor, MI 48109-1043
annacg@umich.edu

Seth Gilbert
(distributed algorithms, parallel algorithms, fault-tolerance, robustness)
Office COM2-323
13 Computing Drive
School of Computing
National University of Singapore (NUS)
Singapore 117417
seth.gilbert@comp.nus.edu.sg

Sheila A. Greibach
(automata and formal languages; machine-based complexity theory)
Department of Computer Science
UCLA
Los Angeles, CA 90024, USA
greibach@cs.ucla.edu

Roberto Grossi
(combinatorial pattern matching; dynamic data structures; external memory algorithms; string algorithms; text indexing)
Dipartimento di Informatica
Università di Pisa
Largo B. Pontecoro 3
56127 Pisa, Italy
grossi@di.unipi.it

Phokion G. Kolaitis
(logic in computer science; computational complexity; database theory)
Computer Science Department
University of California
Santa Cruz, CA 95064, USA
kolaitis@cse.ucsc.edu

Fabrizio Luccio
(models of computation; algorithms and data structures; computational molecular biology)
Dipartimento Informatica
Università di Pisa
Largo B. Pontecorvo 3
56127 Pisa, Italy
luccio@di.unipi.it

Bernard Mans
(distributed algorithms; data structures; applied graph theory)
Department of Computing
Division of ICS
Macquarie University
Sydney, NSW 2109,
Australia
bmans@ics.mq.edu.au

Elvira Mayordomo
(Algorithmic information theory, Computational complexity, Kolmogorov complexity)
Departamento de Informatica e Ingenieria de Sistemas
Universidad de Zaragoza
Maria de Luna 1
50018 Zaragoza, Spain
elvira@unizar.es

Ernst W. Mayr
(Algorithms and data structures, Analysis of algorithms, Computational complexity, Effective mathematics, Graph algorithms, Theoretical aspects of parallel algorithms and architectures of networks)
Department of Informatics
Technical University of Munich
Boltzmannstraße 3
85748 Garching
Germany
mayr@in.tum.de

Frank Neven
(database theory; logic in computer science; automata)
Departement WNI
Universiteit Hasselt Agoralaan
B-3590 Diepenbeek, Belgium
frank.neven@uhasselt.be

Mitsunori Ogihara
(computational complexity theory; data mining; molecular computation)
Department of Computer Science
University of Miami
P.O. Box 248154
Coral Gables, FL 33124-4245 USA
ogihara@cs.miami.edu

Giuseppe Persiano
(foundations of cryptography; algorithmic game theory;  approximation algorithms)
Dipartimento di Informatica ed Applicazioni "Renato M. Capocelli"
Università di Salerno
via Ponte Don Melillo, 2
84084 Fisciano (SA) , Italy
giuper@dia.unisa.it

Rajmohan Rajaraman
(Parallel and distributed computing; approximation algorithms; algorithmic game theory; networks)
College of Computer and Information Science
Northeastern University
202 WVH
Boston, MA 02115, USA
rraj@ccs.neu.edu

Arnold L. Rosenberg
(theoretical aspects of parallel algorithms and architectures and of networks; applied graph theory)
Department of Computer Science
Box 34610
University of Massachusetts
Amherst, MA 01003-4610, USA
rsnbrg@cs.umass.edu

Ronitt Rubinfeld
(property testing; program checking; randomized algorithms; computational learning theory)
MIT Computer Science and
Artificial Intelligence Laboratory
32 Vasser Street
Cambridge, MA 02139, USA
ronitt@theory.lcs.mit.edu

Atri Rudra
(theory of error-correcting codes; sublinear algorithms; database algorithms, communication complexity)
338 Davis Hall
University at Buffalo
Buffalo, NY, 14260, USA
atri@buffalo.edu

Saket Saurabh
(parameterized complexity, graph algorithms, graph theory, exact algorithms)
Institute of Mathematical Sciences
CIT Campus
Taramani, Chennai, 600 113 India
saket@imsc.res.in 

Uwe Schöning
(complexity and computability theory; algorithmic information theory and randomness; logic in computer science)
Abteilung für Theoretische Informatik
Universität Ulm
Oberer Eselsberg
D-89069 Ulm, Germany
uwe.schoening@uni-ulm.de

Paul Spirakis
(analysis of algorithms; approximate algorithms for hard problems; communication networks; parallel computing; mobile computing)
Computer Science Department
Ashton Str. Ashton Building, office 320 
L69 3BX, Liverpool UK 
p.spirakis@liverpool.ac.uk

Paul Vitanyi
(Kolmogorov complexity; distributed algorithms; machine learning; physics and computation)
Centrum voor Wiskunde en Informatica
Kruislaan 413
1098 SJ Amsterdam, The Netherlands
paulv@cwi.nl

Osamu Watanabe
(computational complexity; computational and algorithmic learning theory)
Department of Mathematical
and Computing Sciences
Tokyo Institute of Technology
Meguro-ku, Ookayama, Tokyo 152
Japan
watanabe@is.titech.ac.jp

Read this Journal on Springerlink

For authors and editors


  • Journal Citation Reports®
    2016 Impact Factor
  • 0.645
  • Aims and Scope

    Aims and Scope

    Close

    Statement of Scope

    TOCS is devoted to publishing original research from all areas of theoretical computer science, ranging from foundational areas such as computational complexity, to fundamental areas such as algorithms and data structures, to focused areas such as parallel and distributed algorithms and architectures. Topics include theoretical aspects of the following items:

     

    ·         Algebraic methods

    ·         Algorithmic game theory

    ·         Algorithmic information theory

    ·         Algorithms and data structures

    ·         Analysis of algorithms

    ·         Applied graph theory

    ·         Approximate algorithms for hard problems

    ·         Approximation algorithms

    ·         Automata

    ·         Formal languages

    ·         Combinatorial pattern matching

    ·         Communication networks

    ·         Complexity and computability theory

    ·         Computational and algorithmic learning theory

    ·         Computational biology

    ·         Computational complexity

    ·         Computational geometry

    ·         Computational molecular biology

    ·         Computational science 

    ·         Cryptography and security

    ·         Data compression algorithms

    ·         Data mining

    ·         Data structures

    ·         Database theory

    ·         Distributed algorithms

    ·         Distributed computing

    ·         Dynamic data structures

    ·         Effective mathematics

    ·         Exact algorithms

    ·         External memory algorithms

    ·         Graph algorithms

    ·         Kolmogorov complexity

    ·         Logic in computer science

    ·         Machine learning

    ·         Machine-based complexity theory

    ·         Mobile computing

    ·         Models of computation

    ·         Molecular computation

    ·         Networks

    ·         Parallel and distributed computing

    ·         Parameterized and structural chemistry

    ·         Physics and computation

    ·         Program checking

    ·         Property testing

    ·         Quantum computing

    ·         Randomized algorithms

    ·         Routing, broadcasting, searching

    ·         String algorithms

    ·         Text indexing

    ·         Theoretical aspects of parallel algorithms and architectures of networks

    ·         Theory of communication networks

    ·         Theory of concurrent systems

  • Submit Online
  • Open Choice - Your Way to Open Access
  • Instructions for Authors

    Instructions for Authors

    Close

  • Resources for Journal Authors
  • Author Academy: Training for Authors
  • Copyright Information

    Copyright Information

    Close

    Copyright Information

    For Authors

    Submission of a manuscript implies: that the work described has not been published before (except in form of an abstract or as part of a published lecture, review or thesis); that it is not under consideration for publication elsewhere; that its publication has been approved by all co-authors, if any, as well as – tacitly or explicitly – by the responsible authorities at the institution where the work was carried out.

    Author warrants (i) that he/she is the sole owner or has been authorized by any additional copyright owner to assign the right, (ii) that the article does not infringe any third party rights and no license from or payments to a third party is required to publish the article and (iii) that the article has not been previously published or licensed. The author signs for and accepts responsibility for releasing this material on behalf of any and all co-authors. Transfer of copyright to Springer (respective to owner if other than Springer) becomes effective if and when a Copyright Transfer Statement is signed or transferred electronically by the corresponding author. After submission of the Copyright Transfer Statement signed by the corresponding author, changes of authorship or in the order of the authors listed will not be accepted by Springer.

    The copyright to this article, including any graphic elements therein (e.g. illustrations, charts, moving images), is assigned for good and valuable consideration to Springer effective if and when the article is accepted for publication and to the extent assignable if assignability is restricted for by applicable law or regulations (e.g. for U.S. government or crown employees).

    The copyright assignment includes without limitation the exclusive, assignable and sublicensable right, unlimited in time and territory, to reproduce, publish, distribute, transmit, make available and store the article, including abstracts thereof, in all forms of media of expression now known or developed in the future, including pre- and reprints, translations, photographic reproductions and microform. Springer may use the article in whole or in part in electronic form, such as use in databases or data networks for display, print or download to stationary or portable devices. This includes interactive and multimedia use and the right to alter the article to the extent necessary for such use.

    Authors may self-archive the Author's accepted manuscript of their articles on their own websites. Authors may also deposit this version of the article in any repository, provided it is only made publicly available 12 months after official publication or later. He/she may not use the publisher's version (the final article), which is posted on SpringerLink and other Springer websites, for the purpose of self-archiving or deposit. Furthermore, the Author may only post his/her version provided acknowledgement is given to the original source of publication and a link is inserted to the published article on Springer's website. The link must be accompanied by the following text: "The final publication is available at link.springer.com".

    Prior versions of the article published on non-commercial pre-print servers like arXiv.org can remain on these servers and/or can be updated with Author's accepted version. The final published version (in pdf or html/xml format) cannot be used for this purpose. Acknowledgement needs to be given to the final publication and a link must be inserted to the published article on Springer's website, accompanied by the text "The final publication is available at link.springer.com". Author retains the right to use his/her article for his/her further scientific career by including the final published journal article in other publications such as dissertations and postdoctoral qualifications provided acknowledgement is given to the original source of publication.

    Author is requested to use the appropriate DOI for the article. Articles disseminated via link.springer.com are indexed, abstracted and referenced by many abstracting and information services, bibliographic networks, subscription agencies, library networks, and consortia.

    For Readers

    While the advice and information in this journal is believed to be true and accurate at the date of its publication, neither the authors, the editors, nor the publisher can accept any legal responsibility for any errors or omissions that may have been made. The publisher makes no warranty, express or implied, with respect to the material contained herein.

    All articles published in this journal are protected by copyright, which covers the exclusive rights to reproduce and distribute the article (e.g., as offprints), as well as all translation rights. No material published in this journal may be reproduced photographically or stored on microfilm, in electronic data bases, video disks, etc., without first obtaining written permission from the publisher (respective the copyright owner if other than Springer). The use of general descriptive names, trade names, trademarks, etc., in this publication, even if not specifically identified, does not imply that these names are not protected by the relevant laws and regulations.

    Springer has partnered with Copyright Clearance Center's RightsLink service to offer a variety of options for reusing Springer content. For permission to reuse our content please locate the material that you wish to use on link.springer.com or on springerimages.com and click on the permissions link or go to copyright.com, then enter the title of the publication that you wish to use. For assistance in placing a permission request, Copyright Clearance Center can be connected directly via phone: +1-855-239-3415, fax: +1-978-646-8600, or e-mail: info@copyright.com.


    © Springer Science+Business Media New York

Alerts for this journal

 

Get the table of contents of every new issue published in Theory of Computing Systems.