Call for Papers
Original papers are solicited for the conference. A full paper (up to 15 pages) should be submitted by January 30, 2011.
An extended abstract (5-7 pages) can be submitted by February 15, 2011.
Please, bear in mind, that it is more difficult for the Program Committee to decide about your work having just an abstract in hand.
All contributions will be internationally reviewed.
Authors will be notified of acceptance by March 30, 2011. We will require camera-ready full papers by May 20, 2011.
In order to submit a paper or just indicate your interest in the PaCT-2011,
please register at the site of the conference and follow the instructions which you will find there.
If you face any difficulties using this site, please contact the Secretary (pact2011@ssd.sscc.ru). Only electronic submission of manuscripts is accepted.
The first page should include (but not be limited to) the following information: a title, authors' full names, affiliation, addresses, telephone and fax numbers, e-mail addresses.
To gain the better understanding of your abstract, we also request that it includes the following information: short review of related papers, formulation of the problem, objectives, description of results, main ideas, and list of references.
The organizers expect that the authors of selected papers will present their work at the Conference.
Technical details
The manuscripts should be prepared in the style of Springer Verlag LNCS series (Microsoft Word, LaTex or PostScript). Please visit this page for help.
Proceedings
The Conference Proceedings is planned to be published at the volume of the Springer Verlag LNCS (Lecture Notes in Computer Science) series and distributed at the Conference.
We also plan to publish selected papers in a special issue of one of international journals.
Language
The official language of the Conference is English.
Important dates
Submission of the full paper | January 30, 2011 |
Deadline for extended abstracts | February 15, 2011 |
Notification of acceptance | March 30, 2011 |
Camera-ready version of the accepted paper | May 20, 2011 |