posted by user: agniss || 14504 views || tracked by 58 users: [display]

ICALP 2013 : 40th International Colloquium on Automata, Languages and Programming


Conference Series : International Colloquium on Automata, Languages and Programming
 
Link: http://icalp2013.lu.lv
 
When Jul 8, 2013 - Jul 12, 2013
Where Riga, Latvia
Submission Deadline Feb 15, 2013
Notification Due Apr 12, 2013
Final Version Due Apr 28, 2013
Categories    computer science   automata theory   algorithms   logic
 

Call For Papers

The 40th International Colloquium on Automata, Languages and Programming (ICALP), the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS), will take place from the 8th to the 12th of July 2013 in Riga, Latvia.

The main conference will be preceded by a series of workshops, taking place on Sunday, July 7th, 2013 (i.e., one day before ICALP).

Topics

Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are:

Track A: Algorithms, Complexity and Games

· Algorithmic Game Theory

· Approximation Algorithms

· Combinatorial Optimization

· Combinatorics in Computer Science

· Computational Biology

· Computational Complexity

· Computational Geometry

· Cryptography

· Data Structures

· Design and Analysis of Algorithms

· Machine Learning

· Parallel, Distributed and External Memory Computing

· Parameterized Algorithms and Complexity

· Randomness in Computation

· Quantum Computing


Track B: Logic, Semantics, Automata  and Theory of Programming

· Algebraic and Categorical Models

· Automata Theory, Formal Languages

· Emerging and Non-standard Models of Computation

· Databases, Semi-Structured Data and Finite Model Theory

· Principles of Programming Languages

· Logics, Formal Methods and Model Checking

· Models of Concurrent, Distributed, and Mobile Systems

· Models of Reactive, Hybrid and Stochastic Systems

· Program Analysis and Transformation

· Specification, Refinement and Verification

· Type Systems and Theory, Typed Calculi



Track C: Foundations of Networked  Computation: Models, Algorithms and Information Management

· Cloud Computing, Overlay Networks, P2P Systems

· Cryptography, Privacy, Security, Spam

· Distributed and Parallel Computing

· E-commerce, Auctions, Trust and Reputation

· Game Theory, Incentives, Selfishness

· Internet Algorithms

· Mobile and Complex Networks

· Natural and Physical Algorithms

· Network Information Management

· Sensor, Mesh, and Ad Hoc Networks

· Social Networks, Viral Marketing

· Specification, Semantics, Synchronization

· Web Mining, Searching, Ranking and Analysis

· Wireless and Optical Communication

Paper Submissions

Authors are invited to submit an extended abstract of no more than 12 pages in LNCS style presenting original research on the theory of Computer Science. Submissions should indicate to which track (A, B, or C) the paper is submitted. No prior publication or simultaneous submission to other publication outlets (either a conference or a journal) is allowed. 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. Submissions that are clearly too long may be rejected immediately. Material other than the abstract, references and the first 12 pages may be considered as supplementary and will be read at the committee's discretion.

Best Paper Awards

As in previous editions of ICALP, there will be best paper and best student paper awards for each track of the conference. In order to be eligible for a best student paper award, a paper should be authored only by students and should be marked as such upon submission.

Submission server

Submissions should be contributed using the EasyChair system

(http://www.easychair.org/conferences/?conf=icalp13)

Submissions are due on February 15, 2013, 23:59 CET.

Related Resources

COMIT 2020   4th International Conference on Computer Science and Information Technology
ICALP 2020   47th International Colloquium on Automata, Languages and Programming
ASPLOS 2021   Architectural Support for Programming Languages and Operating Systems
IoTE 2020   International Conference on Internet of Things & Embedded Systems
NLAI 2020   International Conference on NLP & Artificial Intelligence Techniques
AIKE 2020   IEEE Artificial Intelligence & Knowledge Engineering 2020
LCPC 2020   Languages and Compilers for Parallel Computing
ACM--NLPIR--Ei Compendex and Scopus 2020   ACM--2020 4th International Conference on Natural Language Processing and Information Retrieval (NLPIR 2020)--Scopus, Ei Compendex
LATA 2020 & 2021   14th International Conference on Language and Automata Theory and Applications
ACM--ESSE--Ei Compendex, Scopus 2020   ACM--2020 European Symposium on Software Engineerings (ESSE 2020)--Ei Compendex, Scopus
{"cc_re__cc_re__cc_by_sa_3_0": ["il.com\">Contact Us</a> |\n<a href=\"/cfp/data.jsp\">Data</a> |\n<a href=\"/cfp/privacy.jsp\">Privacy Policy</a> |\n<a href=\"/cfp/terms.jsp\">Terms and Conditions</a>\n</td></tr>\n<tr><td align=\"left\">\nPartners:\n<a href=\"https://www.semanticscholar.org/?utm_source=WikiCFP&utm_medium=Display&utm_term=home&utm_content=semantic-scholar-rail-try-it&utm_campaign=WikiCFP%20Test\">AI2's Semantic Scholar</a> |\n<a href=\"http://weizhilink.com\">Weizhi</a>\n</td></tr>\n<tr><td align=\"left\">\nThis wiki is licensed under a\n<a rel=\"license\" href=\"http://creativecommons.org/licenses/by-sa/3.0/\">Creative Commons Attribution-Share Alike 3.0 License</a>.\n</td></tr></table>\n</td>\n\n<td align=\"right\" style=\"width:1%\">\n\n<!--\n<a href=\"http://www3.clustrmaps.com/counter/maps.php?url=http://www.wikicfp.com\" target=\"_blank\" id=\"clustrMapsLink\"><img src=\"http://www3.clustrmaps.com/counter/index2.php?url=http://www.wikicfp.com\" style=\"border:0px;\" width=\"160\" height=\"90\" alt=\"Locations of visitors to WikiCFP\" title=\"Locations of visitors to WikiCFP\" id=\"clustrMapsImg\">\n</a>\n-->\n\n<!--\n<script type=\""]}