Our Sponsors
ICALP 2010 - 37th International Colloquium on Automata, Languages and Programming ICALP 2010
Website icalp10.inria.fr |
Edit Freely
Category ICALP 2010
Deadline: February 10, 2010 | Date: July 05, 2010
Venue/Country: Bordeaux, France
Updated: 2010-06-04 19:32:22 (GMT+9)
Call For Papers - CFP
The 37th International Colloquium on Automata, Languages and Programming, the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS), will take place from the 5th to the 12th of July 2010 in Bordeaux, France. The main conference will be preceded and followed by a series of Workshops.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
Combinatorics in Computer Science
Computational Biology
Computational Complexity
Computational Geometry
Cryptography
Data Structures
Design and Analysis of Algorithms
Internet Algorithmics
Machine Learning
Parallel, Distributed and External Memory Computing
Randomness in Computation
Quantum Computing
Track B : Logic, Semantics, Automata and Theory of Programming
Algebraic and Categorical Models
Automata Theory, Formal Languages
Non-standard Approaches to Computability
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
Algorithmic Aspects of Networks
Auctions
Computing with Incentives
E-commerce, Privacy, Spam
Formal Methods for Network Information Management
Foundations of Trust and Reputation in Networks
Internet Algorithmics
Mobile and Wireless Networks
Models of Complex Networks
Models and Algorithms for Global Computing
Models of Mobile Computation
Networks Economics
Networks of Low Capability Devices
Overlay Networks and P2P Systems
Social Networks
Specification, Semantics, Synchronization of Networked Systems
Theory of Security in Networks and Distributed Computing
Web Searching, Ranking
Web Mining and Analysis
Important Dates
Submission Deadline: Feb 10, 2010
Author Notification: Apr 6, 2010
Final Manuscript Due: Apr 27, 2010
Submission Guildelines
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 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 recommended that submissions adhere to the specified format and length. Submissions that are clearly too long may be rejected immediately. Additional material intended for the referee but not for publication in the final version - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit.
Program Committee
Invited Speakers
Workshops
Organization
ICALP 2010 is organised by the INRIA Bordeaux - Sud-Ouest research center in collaboration with the LaBRI, computer science laboratory of CNRS and the University of Bordeaux.
Keywords: Accepted papers list. Acceptance Rate. EI Compendex. Engineering Index. ISTP index. ISI index. Impact Factor.
Disclaimer: ourGlocal is an open academical resource system, which anyone can edit or update. Usually, journal information updated by us, journal managers or others. So the information is old or wrong now. Specially, impact factor is changing every year. Even it was correct when updated, it may have been changed now. So please go to Thomson Reuters to confirm latest value about Journal impact factor.