Submission Topics
Submissions in all areas of theoretical computer science are invited. Areas include (but are not limited to): algorithms (approximation, online, randomized, algorithmic game theory, etc.), automata theory and formal languages, coding theory and data compression, combinatorics and graph theory, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, databases and information retrieval, data structures, Internet and the web, logic in computer science, machine learning, mathematical programming, parallel and distributed computing, pattern matching, quantum computing, random structures, scientific computing.
Submission FormatAuthors are invited to submit an extended abstract in English no longer than 12 pages (including the bibliography) on letter-size paper in Springer LNCS format. Submissions should begin with a succinct statement of the problems considered, the main results, an explanation of their significance, and a comparison to past research, all of which should be accessible to non-specialists. More technical developments follow as appropriate. Additional necessary details must be included in a clearly marked appendix that will be read at the discretion of the program committee. The proceedings will be published in the Lecture Notes in Computer Science Series by Springer-Verlag. It is strongly recommended that submissions adhere to the specified format and length. No prior publication or simultaneous submission to other publication outlets (either a conference or a journal) is allowed. Download the lncs class file for LaTeX-2e from Springer.
Submission serverSubmissions should be contributed using the EasyChair system (http://www.easychair.org/conferences/?conf=latin2012). Submissions are due on September 30, 2011, 23:59 HST (GMT/UTC - 10h).
|
