期刊名称：INFORMATION PROCESSING LETTERS
 期刊简介(About the journal)
投稿须知(Instructions to Authors)
编辑部信息(Editorial Board)
About the journal
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 - automatic theorem proving - combinatorial problems - compilers - computational complexity - computational geometry - concurrency - cryptography - databases - data structures - design of algorithms - distributed computing - distributed systems - fault tolerance - formal languages - formal methods - formal semantics - functional programming - graph algorithms - information retrieval - interconnection networks - on-line algorithms - operating systems - parallel algorithms - parallel processing - performance evaluation - program correctness - program derivation - programming calculi - programming languages - program specification - randomized algorithms - real-time systems - safety/security in digital systems - scheduling - software design and implementation - software engineering - specification languages - theory of computation
Instructions to Authors
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 - automatic theorem proving - combinatorial problems - compilers - computational complexity - computational geometry - concurrency - cryptography - databases - data structures - design of algorithms - distributed computing - distributed systems - fault tolerance - formal languages - formal methods - formal semantics - functional programming - graph algorithms - information retrieval - interconnection networks - on-line algorithms - operating systems - parallel algorithms - parallel processing - performance evaluation - program correctness - program derivation - programming calculi - programming languages - program specification - randomized algorithms - real-time systems - safety/security in digital systems - scheduling - software design and implementation - software engineering - specification languages - theory of computation
×÷ÕßÐëÖª£º
Contributions should be sent in quadruplicate to a member of the Board of Editors (NOT one of the Managing Editors) selected for reasons of geographic or subject-area proximity. Potential authors are advised not to submit the same or similar papers to two or more Editors. Multiple submissions will be unconditionally rejected. Before submitting your contributions you may wish to consult the IPL Editors' Domains of Competency below. Contributions must be in English or American. Please contact a Managing Editor if you have questions or problems concerning submission, processing, or publication of a paper. Submit a paper ONLY to an Editor (based on geographic or subject-area proximity) who is on the Board of Editors. The Managing Editors are not responsible for directing submissions to appropriate Editors.
Since no linguistic assistance in the form of copy editing is provided by IPL, poorly written papers will not be considered.
The length of a contribution (including all figures, references etc.) should not exceed the equivalent of nine A4 or 8 1/2-by-11 pages, typed with wide margins and double line-spacing, i.e., approximately a 20K character file or 3,000 words. An Editor's decision to reject a contribution because of its length is final.
An abstract is not required, but appropriate keywords must be supplied; these should include at least one keyword drawn from the following list of keywords: algorithms - analysis of algorithms - approximation algorithms - automatic theorem proving - combinatorial problems - compilers - computational complexity - computational geometry - concurrency - cryptography - databases - data structures - design of algorithms - distributed computing - distributed systems - fault tolerance - formal languages - formal methods - formal semantics - functional programming - graph algorithms - information retrieval - interconnection networks - on-line algorithms - operating systems - parallel algorithms - parallel processing - performance evaluation - program correctness - program derivation - programming calculi - programming languages - program specification - randomized algorithms - real-time systems - safety/security in digital systems - scheduling - software design and implementation - software engineering - specification languages - theory of computation.
References should be numbered and put in alphabetical order at the end of the paper. References should contain the names and initials of all authors, title of the article, name of the journal, volume number, year of publication (or title of volume, name of editor(s), name of publishers), and page numbers. See papers in existing issues of IPL for the preferred style. Since IPL is not published from camera-ready copies, there is no need to supply fancy print-outs. If computer-assisted printing is used, care must be taken that the print is legible and properly paginated and that the paper satisfies the length constraint stated earlier. Figures should be sharp glossy prints of about manuscript size or, preferably, original drawings or computer output.
Once a submission has been accepted for publication, all further correspondence should be sent directly to the Publishers (Elsevier Science B.V., P.O. Box 2759, 1000 CT Amsterdam, The Netherlands - refer to IPL on the envelope).
Upon acceptance of an article, author(s) are asked to transfer copyright of the article to the Publisher. This transfer of copyright will ensure the widest possible dissemination of information. There are no page charges. Fifty free offprints are supplied for each article published. Further offprints can be ordered from the Publisher. (Both an Offprint Order Form and a Copyright Transfer).
Notice will be sent by the Publisher upon receipt of the paper.
IPL Editors' Domains of Competency For each IPL keyword, the table below lists Editors who prefer handling submissions classified by that keyword. Choosing an Editor indicated in the table may lead to a shorter processing time for your submission. Within each group, the Editors are listed alphabetically --no order of preference is implied.
algorithms: Albers, Bertossi, Chin, Dehne, Eiben, Hambrusch, Hemaspaandra, Hsu, Iwama, Vitanyi, Yamashita
analysis of algorithms: Albers, Dehne, Eiben, Hambrusch, Hemaspaandra, Hsu, Iwama, Yamashita
approximation algorithms: Albers, Chin, Eiben, Iwama
automatic theorem proving: Basin, Chomicki, Tarlecki
combinatorial problem: Albers, Boasson, Eiben Hambrusch, Hemaspaandra, Hsu, Iwama, Yamashita
compilers: Backhouse,
computational complexity: Bertossi, Hemaspaandra, Iwama, Vitanyi
computational geometry: Albers, Boasson, Chin, Dehne, Hambrusch, Yamashita
concurrency: Fiadeiro, Schneider
cryptography: Desmedt, Yamashita
databases: Chomicki, Hambrusch
data structures: Albers, Bertossi, Dehne, Hambrusch, Hemaspaandra, Hsu, Moffat, Yamashita
design of algorithms: Albers, Dehne, Eiben, Hambrusch, Hemaspaandra, Hsu, Iwama, Moffat, Yamashita
distributed computing: Chin, Iwama, Schneider, Vitanyi, Yamashita
distributed systems: Schneider, Vitanyi
fault tolerance: Bertossi, Schneider
formal languages: Boasson, Iwama, Yamashita
formal methods: Backhouse, Basin, Fiadeiro
formal semantics: Boasson, Fiadeiro, Tarlecki, Yamashita
functional programming: Boasson, Tarlecki
graph algorithms: Albers, Chin, Iwama, Yamashita
information retrieval: Hambrusch, Hsu, Moffat
interconnection networks: Bertossi, Dehne, Hambrusch, Yamashita
on-line algorithms: Albers, Iwama
operating systems: Schneider
parallel algorithms: Albers, Bertossi, Dehne, Eiben, Hambrusch,Iwama, Yamashita
parallel processing: Dehne, Hambrusch
performance evaluation:
program correctness: Basin, Fiadeiro, Tarlecki
program derivation: Basin, Tarlecki
program specification: Basin, Chomicki, Fiadeiro, Tarlecki
programming calculi: Tarlecki
programming languages: Chomicki, Tarlecki
randomized algorithms: Albers, Eiben, Iwama
real-time systems: Bertossi
safety/security in digital systems: Basin, Chomicki, Desmedt, Schneider, Yamashita
scheduling: Albers, Bertossi, Yamashita
software design and implementation: Fiadeiro, Tarlecki
software engineering: Fiadeiro, Tarlecki
specification languages: Basin, Chomicki, Fiadeiro, Tarlecki
theory of computation: Albers, Hambrusch, Hemaspaandra, Iwama, Tarlecki, Yamashita
Electronic Submissions: LaTeX documents
The Latex source for an accepted paper (only) may be submitted along with the final printed version; this can speed up processing time and reduce errors.
If the file is suitable, proofs will be produced without rekeying the text. The article should be encoded in ESP-LaTeX, standard LaTeX, or AMS-LaTeX (in document style "article"). The Elsevier-LaTex package, together with instructions on how to prepare a file, is available from the Publisher. This package can also be obtained from our server, or using anonymous FTP from the Comprehensive TeX Archive Network (CTAN) at sites in the USA, United Kingdom and in Germany.
No changes from the accepted version are permissible, without the explicit approval by the Editors. The Publisher reserves the right to decide whether to use the author's file or not.
Electronic submission:Non-LaTeX documents
Only the final accepted manuscript can be submitted on disk, along with a paper-printed version which is identical to the file. Please label the disk with your name, and mention which word processor you have used. The word-processed text should be in single column format. Keep the layout of the text as simple as possible; in particular, do not use the word-processor's options to justify the text or to hyphenate words. The electronic text should be prepared in a way very similar to that of conventional manuscripts (see also Guide for Authors). The list of references, tables and figure legends should be compiled separately from the main text. Do not reserve space for the figures and tables in the text; instead, indicate their approximate locations, either directly in the electronic text or on the manuscript. The final text should be submitted both in manuscript form and on diskette. Use standard 3.5" diskettes for this purpose. Both double density (DD) and high density (HD) diskettes are acceptable. It is recommended to store the main text, list of references, tables and figure legends in separate text files with clearly identifiable file names (for example, with extensions .TXT, .REF, .TBL,.FIG). The format of the files depends on the word-processor used. Texts made with DEC WPS PLUS, DisplayWrite, First Choice, IBM Writing Assistant, MicrosoftWord, Multimate, PFS: Write, Professional Writer, Samma Word, Sprint, TotalWord, Volkswriter, Wang PC, WordMARC, WordPerfect, Wordstar, or files supplied in DCA.RFT format can be readily processed. In all other cases the preferred text format is ASCII. Essential is that name and version of the word-processing program and the type of computer on which the text was prepared is clearly indicated on the diskette label or the accompanying checklist. The manuscript may contain parts (e.g. formulas or complex tables) or last-minute corrections which are not included in the text on diskette; however, if this is the case then the differences with the diskette version should be clearly marked on the manuscript.
Illustrative material (original figures or high-quality glossy prints, or photographs showing a sharp contrast) should be included separately.
Keyword Instructions
Important Notice: please add one to five keywords to your article
Keywords are essential for the accessibility and retrievability of your article. Keywords assigned to articles will be assembled in a keyword index which will be printed in the last issue of each volume, and in cumulative indexes. In addition, it is planned to make keywords available on Internet.
To maximize the consistency with which such keywords are assigned by different authors, the following guidelines have been drawn up.
- Each keyword (which can be a phrase of more than one word) should describe one single concept. Often words like "and" or "of" should be avoided. At least one keyword should be drawn from the list of keywords given above.
- Avoid very general keywords which become meaningless once in a keyword list. Examples to avoid are "action", "computer", "mathematics". Check whether thekeywords as a whole describe the outlines of the article.
- Use natural language: for instance "automatic error recovery" rather than "error recovery, automatic".
- Try to use nouns and adjectives as much as possible (i.e. use "automatic error recovery" rather than "recovering errors automatically"). Do not use nouns in the plural form.
- Use English rather than American spelling (regardless of the spelling used for the article itself).
Avoid the use of abbreviations as much as possible, unless an abbreviation is so well-established that the full term is rarely used (e.g. use "laser" instead of "Light Amplification by Stimulated Emission of Radiation", but use "computer aided design" instead of "CAD").
Editorial Board
Editorial Board
Managing Editor
A. Tarlecki
Inst. of Informatics, University of Warsaw, ul. Banacha Stefana 2, 02-097 Warszawa, Poland, Email: tarlecki@mimuw.edu.pl
Board of Editors
A.A. Bertossi
Dept. of Computer Science, Università di Bologna, Mura Anteo Zamboni 7, I-40127 Bologna, Italy, Email: bertossi@cs.unibo.it
F.Y.L. Chin
Dept. of Computer Science and Information Systems, University of Hong Kong, Chow Yei Ching Building, Pokfulam Road, Pokfulam, Hong Kong, Hong Kong, Email: ipl@cs.hku.hk
G. Chockler
IBM Research Haifa Laboratory, 31905 Haifa, Israel, Email: chockler@il.ibm.com
J. Chomicki
Dept. of Computer Science and Engineering, State University of New York (SUNY) at Buffalo, 201 Bell Hall, Buffalo, NY 14260-2000, USA, Email: chomicki@cse.buffalo.edu
Y. Desmedt
Dept. of Computer Science, University College London (UCL), Gower Street, London, WC1E 6BT, UK, Email: y.desmedt@cs.ucl.ac.uk
B. Doerr
Im Stadtwald - Gebäude 46.1, Max Planck Institut (MPI) für Informatik, D-66123 Saarbrücken, Germany, Email: doerr@mpi-inf.mpg.de
J.L. Fiadeiro
Dept. of Computer Science, University of Leicester, University Road, Leicester, LE1 7RH, UK, Email: jose@fiadeiro.org
S. Hambrusch
Dept. of Computer Science, Purdue University, 305 N. University Street, West Lafayette, IN 47907, USA, Email: seh@cs.purdue.edu
W.-L. Hsu
Inst. of Information Science 20, Academia Sinica Taipei, Academia Road Section 2 128 Sec. 2 Academia Rd., 115-29 Taipei City, Taiwan, ROC, Email: hsu@iis.sinica.edu.tw
L. Kowalik
Inst. of Informatics, University of Warsaw, ul. Banacha Stefana 2, 02-097 Warszawa, Poland, Email: kowalik@mimuw.edu.pl
G. Morrisett
Harvard School of Engineering and Applied Sciences, Harvard University, Oxford St., Cambridge, MA 02138, USA, Email: greg@eecs.harvard.edu
A. Muscholl
Lab. Bordelais de Recherche en Informatique, Institut Universitaire de Technologie, 351 Cours de la Liberation, 34405 Talence, France, Email: anca@labri.fr
D. Pointcheval
Dept. d'Informatique, École Normale Supérieure de Lyon, 45 rue D Ulm, 75230 Paris, France, Email: David.Pointcheval@ens.fr
J. Torán
Institut für Theoretische Informatik, Universität Ulm, D-89069 Ulm, Germany, Email: jacobo.toran@uni-ulm.de
L. Viganò
Facoltà di Scienze Matematiche, Fisiche e Naturali, Università degli Studi di Verona, Strada le Grazie 15, I-37134 Verona, Italy, Email: luca.vigano@univr.it
M. Yamashita
Dept. of Computer Science, & Communication Engineering, Kyushu University, Hakozaki, 812-8581 Fukuoka, Japan, Email: mak@csce.kyushu-u.ac.jp
Advisory Editors
D. Gries
Dept. of Computer Science, Cornell University, Upson Hall, Ithaca, NY 14853-3801, USA, Email: gries@cs.cornell.edu
W.M. Turski
Inst. of Informatics, University of Warsaw, ul. Banacha Stefana 2, 02-097 Warszawa, Poland, Email: wmt@mimuw.edu.pl
|
