FCS'06 - The 2006 International Conference on Foundations of Computer Science
Last modified
2007-12-02 09:38
Monte Carlo Resort, Las Vegas, Nevada, USA
(June 26-29, 2006)
FCS'06 is an international conference held simultaneously
(ie, same location and dates) with a number of other
joint conferences as part of WORLDCOMP'06 (The 2006 World
Congress in Computer Science, Computer Engineering, and
Applied Computing). WORLDCOMP'06 is the largest annual
gathering of researchers in computer science, computer
engineering and applied computing. Many of the joint conferences in WORLDCOMP are the premier
conferences for presentation of advances in their respective
fields (for the complete list of joint conferences Click Here).
The motivation is to assemble a spectrum of affiliated
research conferences into a coordinated research meeting
held in a common place at a common time. The main goal
is to provide a forum for exchange of ideas in a number
of research areas that interact. The model used to form
these annual conferences facilitates communication among
researchers in different fields of computer science,
computer engineering and applied computing. Both inward
research (core areas of computer science and engineering)
and outward research (multi-disciplinary, Inter-disciplinary,
and applications) will be covered during the conferences.
The last set of conferences (FCS'05 and affiliated events) had
research contributions from 76 countries and had attracted over 1,500 participants. It is anticipated to have over 2,000 participants for
the 2006 event.
You are invited to submit a draft paper of about 5-8 pages and/or a proposal to
organize a Technical Session/workshop (see the Submission information).
All accepted papers will be published in the respective
conference proceedings. The names of technical session/workshop
organizers/chairs will appear on the cover of the
proceedings/books as Associate Editors.
Topics of interest include, but are not limited to,
the following:
- Automata and formal languages
- Languages and complexity
- Deduction
- Combinatorics
- Graph theory and algorithms
- Algorithms
- Algebraic theory of computing and formal systems
- Games theory and methods
- Geometry
- Probabilistic and randomized methodologies
- Approximation methods
- Complexity theory (including circuit complexity)
- Parametrized complexity (including Kolmogorov, ...)
- Computational biology and bioinformatics
- Cryptography
- Database theory
- Data structures
- Foundations of computer security
- Logic in computer science
- Model checking and computer-aided verification
- Models of computation
- Quantum Computing
- Semantics, concurrency and type theory
- Scheduling methods
- Models of internet computing
- Theory of parallel and distributed computing
|
|
