期刊名称：THEORY OF COMPUTING SYSTEMS
 期刊简介(About the journal)
投稿须知(Instructions to Authors)
编辑部信息(Editorial Board)
About the journal
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. A more detailed enumeration of relevant topics is available from the specialties listed by the Editorial Board
Instructions to Authors
Submission of Manuscript
The manuscript should be a LaTeX document. This can be submitted directly to the Editor-in-Chief or to any member of the Editorial Board. Authors have two options for submission. The preferred option is to submit the manuscript as a PDF file or a postscript file that contains all embedded fonts. The other option is to mail the manuscript in triplicate. The document should be prepared in 12-point font size.
Color can be published in the electronic edition of the journal, at no charge to the author, if appropriate electronic files are provided. Color will only be included in the print edition when the author covers the additional expense of color printing. For an exact quote on color printing charges please contact the Production Editor.
Authors must send final versions of accepted TOCS papers to the Editor-in-Chief using one of the following options:
(1) The preferred option is to send all relevant files as e-mail attachments (not as plain text)
(2) The authors may submit their final version on a Zip disk. This disk should contain all relevant files, as described below.
(3) The authors may send two copies of the paper copy, with all mathematical formulae presented clearly, as the only form of submission.
Under either of the electronic options, the "relevant files" comprise:
(a) all LaTeX source files necessary for generating the final postscript version of their paper;
(b) postscript files of all figures;
(c) a plain-text README file (if necessary) enumerating all transmitted files and explaining any required special processing;
(d) a copy of the final paper in PDF format.
The LaTeX source files will be relayed to the publisher's TOCS ftp site for production; the PDF file will be sent to the copy editor.
Under any of the options, the author(s) will receive a final typeset version of their paper for proofreading. The benefit of the electronic option is speed in the proofreading and typesetting phase of the final processing of papers.
The first page should contain the title, the name(s) and affiliation(s) of author(s), email addresses, and the full mailing address of the author to whom communications are to be sent. The manuscript must contain a short abstract.
References to the literature should be prepared in standard LaTeX/BibTeX format.
Guidelines for Electronically Produced Illustrations for Print
General
Send illustrations separately from the text (i.e. files should not be integrated with the text files). Always send printouts of all illustrations.
Vector (line) Graphics
Vector graphics exported from a drawing program should be stored in EPS format.
Suitable drawing program: Adobe Illustrator. For simple line art the following drawing programs are also acceptable: Corel Draw, Freehand, Canvas.
No rules narrower than .25 pt.
No gray screens paler than 15% or darker than 60%.
Screens meant to be differentiated from one another must differ by at least 15%.
Spreadsheet/Presentation Graphics
Most presentation programs (Excel, PowerPoint, Freelance) produce data that cannot be stored in an EPS format. Therefore graphics produced by these programs cannot be used for print.
Halftone Illustrations
Black & white and color illustrations should be saved in TIFF format.
Illustrations should be created using Adobe Photoshop whenever possible.
Scans*
Scanned reproductions of black and white photographs should be provided as 300 ppi TIFF files.
Scanned color illustrations should be provided as TIFF files scanned at a minimum of 300 ppi with a 24-bit color depth.
Line art should be provided as TIFF files at 600 ppi.
* We do prefer having the original art as our printers have drum scanners which allow for better reproduction of critical medical halftones.
Graphics from Videos
Separate files should be prepared for frames from a video that are to be printed in the journal. When preparing these files you should follow the same rules as listed under Halftone Illustrations.
Guidelines for Electronically Produced Illustrations for ONLINE
Video
Quicktime (.mov) is the preferred format, but .rm, .avi, .mpg, etc. are acceptable.
No video file should be larger than 2MB. To decrease the size of your file, consider changing one or more of the following variables: frame speed, number of colors/greys, viewing size (in pixels), or compression. Video is subject to Editorial review and approval.
Editorial Board
Editor in Chief
Alan L. Selman
(complexity theory)
Department of Computer Science and Engineering
University at Buffalo
The State University of New York
201 Bell Hall
Buffalo, NY 14260, USA
selman@cse.buffalo.edu
Editorial Board
Tetsuo Asano
(computational geometry; geometric aspects of computer vision)
School of Information Science
Japan Advanced Institute of
Science and Technology
(JAIST)
Asahidai, Tatsunokuchi
Ishikawa, 932-12 Japan
t-asano@jaist.ac.jp
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
Anne E. Condon
(complexity theory; randomized computation; automata theory; biomolecular computation)
Department of Computer Science
2366 Main Mall
University of British Columbia
Vancouver, B.C. Canada V6T 1Z4
condon@cs.ubc.ca
Joost Engelfriet
(formal language theory; tree language theory; graph grammars; automata-theoretic complexity; attribute grammars; petri nets)
Department of Mathematics
and Computer Science
University of Leiden
P.O. Box 9512
2300 RA Leiden, The Netherlands
engelfri@wi.leidenuniv.nl
Shimon Even
(algorithms; interconnection networks; cryptography)
Computer Science Department
Technion, Israel Institute
of Technology
Haifa 32000, Israel
even@cs.technion.ac.il
Pierre Fraigniaud
(theory of communication networks; routing, broadcasting, searching; mobile computing; network models)
CNRS-LRI
Universit?Paris-Sud
91405 Orsay cedex
France
pierre@lri.fr
Harold N. Gabow
(data structures; graph algorithms; graph theory; combinatorial optimization)
Department of Computer Science
University of Colorado
Boulder, CO 80309, USA
hal@cs.colorado.edu
Harald Ganzinger
(automated theorem proving; term rewriting; constraint solving; tree automata; logic programming)
Max-Planck-Institut für Informatik
Im Stadtwald
D-66123 Saarbrücken, Germany
hg@mpi-sb.mpg.de
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
via Buonarroti 2,
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
S. Rao Kosaraju
(pattern matching; data structures; parallel algorithms; computational geometry)
Department of Computer Science
Johns Hopkins University
Baltimore, MD 21218, USA
kosaraju@cs.jhu.edu
Dexter Kozen
(algorithms and complexity, especially complexity of decision problems in logic and algebra; logics and semantics of programming languages; computer security)
Computer Science Department
Upson Hall
Cornell University
Ithaca, NY 14853-7501, USA
kozen@cs.cornell.edu
Fabrizio Luccio
(models of computation; algorithms and data structures; computational molecular biology)
Dipartimento di Informatica
University of Pisa
Corso Italia 40
56100 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
Mitsunori Ogihara
(computational complexity theory; data mining; molecular computation)
Department of Computer Science
University of Rochester
Rochester, NY 14627-0226,
USA
ogihara@cs.rochester.edu
Azaria Paz
(automata and probabilistic automata; finite markov chains; integer algorithms; Bayes nets; theory of graphoids)
School of Computer Science
and Mathematics
The Academic College
of Netanya
and
Computer Science Department
Technion, Israel Institute
of Technology
Haifa 32000, Israel
paz@cs.technion.ac.il
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)
NEC Research Institute, Inc.
4 Independence Way
Princeton, NJ 08540, USA
ronitt@research.nj.nec.com
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
schoenin@informatik.uni-ulm.de
Paul Spirakis
(analysis of algorithms; approximate algorithms for hard problems; communication networks; parallel computing; mobile computing)
Computer Technology Institute
P.O. Box 1122
26110 Patras, Greece
spirakis@cti.gr
Martin J. Strauss
(randomized algorithms, especially for data streams and sketches; cryptography and security; complexity theory)
AT&T Shannon Laboratory
180 Park Avenue
P.O. Box 971
Florham Park, NJ 07932-0971, USA
mstrauss@research.att.com
H. Raymond Strong
(fault tolerant distributed algorithms and architectures; clock synchronization; algorithms for maintaining availability and balancing loads)
K53/802
IBM Almaden Research Center
650 Harry Road
San Jose, CA 95120-6099, USA
strong@almaden.ibm.com
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
Jeffrey S. Vitter
(mathematical analysis of algorithms; external memory algorithms and I/O performance; data compression; data mining and prediction)
School of Science
Purdue University
Mathematical Sciences Building
150 North University Street
West Lafayette, IN 47907-2067,
USA
jsv@purdue.edu
http://www.science.purdue.edu/jsv/
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
|
