Inscriere cercetatori

Asociatia Ad Astra a cercetatorilor romani lanseaza BAZA DE DATE A CERCETATORILOR ROMANI DIN DIASPORA. Scopul acestei baze de date este aceea de a stimula colaborarea dintre cercetatorii romani de peste hotare dar si cu cercetatorii din Romania. Cercetatorii care doresc sa fie nominalizati in aceasta baza de date sunt rugati sa trimita un email la

Advances in the Theory of Computing (AITC’10), special session of SYNASC 2010

Advances in the Theory of Computing” (AITC’2010) is a special session
of SYNASC 2010, the 12th Annual Symposium on Symbolic and Numeric
Algorithms for Scientific Compting.

Conference location: West University of Timisoara, Romania, September
26-29, 2010.

AITC Website:

Program Committee:

Olaf Beyersdorff (Hannover, Germany)
Francine Blanchet-Sadri (Greensboro NC, U.S.A.)
Gabriel Ciobanu (Iasi, Romania)
Jerome Durand-Lose (Orleans, France)
Gabriel Istrate (Timisoara, Romania, co-chair)
Shiva Prasad Kasiviswanathan (Los Alamos NM, U.S.A.)
Miklos Kresz (Szeged, Hungary)
Florin Manea (Magdeburg, Germany, co-chair)
Ion Mandoiu (Storrs CT, U.S.A.)
Daniel Reidenbach (Loughborough, U.K.)
Gheorghe Stefanescu (Bucharest, Romania)

We invite submissions presenting significant advances in the Theory of
Computing in the form of:

+ full-length research papers,
+ informal presentations.

Accepted research papers will be published on electronic media
(distributed during the conference) and in the conference
post-proceedings, published by the IEEE Computer Society Press. (For
previous editions of SYNASC see

All areas of Theoretical Computer Science, broadly construed, are of
interest. In particular a non-exhaustive list of topics includes:

– Data Structures and algorithms
– Combinatorial Optimization
– Formal languages and Combinatorics on Words.
– Graph-theoretic and Combinatorial methods in Computer Science
– Algorithmic paradigms, including distributed, online, approximation,
probabilistic, game-theoretic algorithms.
– Computational Complexity Theory, including structural complexity,
boolean complexity, communication complexity, average-case complexity,
derandomization and property testing.
– Logical approaches to complexity, including finite model theory.
– Algorithmic and computational learning theory.
– Aspects of computability theory, including computability in analysis
and algorithmic information theory.
– Proof complexity.
– Computational social choice and game theory
– New computational paradigms: CNN computing, quantum, holographic and
other non-standard approaches to Computability.
– Randomized methods, random graphs, threshold phenomena and
typical-case complexity.
– Automata theory and other formal models, particularly in relation to
formal verification methods such as model checking and runtime
– Applications of theory, including wireless and sensor networks,
computational biology
and computational economics.
– Experimental algorithmics.

Papers of up to 8 pages (IEEE conference style), must be submitted
electronically through EasyChair. Please select the Advances in the
Theory of Computing track when prompted by the system.

Research papers must contain original results, not concurrently
submitted to other publication venues and not published elsewhere.

Informal presentations can also be submitted (as a one-page pdf
document) to synasc-… Some of the submissions may be
accepted as an informal presentations only.

All authors of accepted papers are expected to present their
contribution(s) at the conference.


July 1st: Paper submission deadline.
August 20: Notification of acceptance
September 08: Deadline for submitting revised versions
September 23-26: Main conference
November 30: Deadline for post-proceedings publication (IEEE DL)