From mboxrd@z Thu Jan  1 00:00:00 1970
Return-Path: <pmt6sbc@maths.leeds.ac.uk>
X-Original-To: caml-list@sympa.inria.fr
Delivered-To: caml-list@sympa.inria.fr
Received: from mail4-relais-sop.national.inria.fr (mail4-relais-sop.national.inria.fr [192.134.164.105])
	by sympa.inria.fr (Postfix) with ESMTPS id 180697F1C3
	for <caml-list@sympa.inria.fr>; Tue, 27 Nov 2012 00:25:02 +0100 (CET)
Received-SPF: None (mail4-smtp-sop.national.inria.fr: no sender
  authenticity information available from domain of
  pmt6sbc@maths.leeds.ac.uk) identity=pra;
  client-ip=129.11.36.1;
  receiver=mail4-smtp-sop.national.inria.fr;
  envelope-from="pmt6sbc@maths.leeds.ac.uk";
  x-sender="pmt6sbc@maths.leeds.ac.uk";
  x-conformance=sidf_compatible
Received-SPF: None (mail4-smtp-sop.national.inria.fr: no sender
  authenticity information available from domain of
  pmt6sbc@maths.leeds.ac.uk) identity=mailfrom;
  client-ip=129.11.36.1;
  receiver=mail4-smtp-sop.national.inria.fr;
  envelope-from="pmt6sbc@maths.leeds.ac.uk";
  x-sender="pmt6sbc@maths.leeds.ac.uk";
  x-conformance=sidf_compatible
Received-SPF: None (mail4-smtp-sop.national.inria.fr: no sender
  authenticity information available from domain of
  postmaster@amsta.leeds.ac.uk) identity=helo;
  client-ip=129.11.36.1;
  receiver=mail4-smtp-sop.national.inria.fr;
  envelope-from="pmt6sbc@maths.leeds.ac.uk";
  x-sender="postmaster@amsta.leeds.ac.uk";
  x-conformance=sidf_compatible
X-IronPort-Anti-Spam-Filtered: true
X-IronPort-Anti-Spam-Result: AlUCAAL5s1CBCyQBe2dsb2JhbABErgqSGiQBARYmBSKCICJLBYlqDJ8smDuJCI1RS4JcA5YBizeHbw0
X-IronPort-AV: E=Sophos;i="4.83,323,1352070000"; 
   d="scan'208";a="163894758"
Received: from amsta.leeds.ac.uk ([129.11.36.1])
  by mail4-smtp-sop.national.inria.fr with ESMTP; 27 Nov 2012 00:25:01 +0100
Received: from maths.leeds.ac.uk (localhost [127.0.0.1])
	by amsta.leeds.ac.uk (8.14.1/8.14.1) with ESMTP id qAQNOwVI008338
	for <caml-list@inria.fr>; Mon, 26 Nov 2012 23:25:01 GMT
Received: (from pmt6sbc@localhost)
	by maths.leeds.ac.uk (8.14.1/8.13.4/Submit) id qAQNO4ax006789
	for caml-list@inria.fr; Mon, 26 Nov 2012 23:24:04 GMT
Date: Mon, 26 Nov 2012 23:24:04 GMT
From: S B Cooper <pmt6sbc@maths.leeds.ac.uk>
Message-Id: <201211262324.qAQNO4ax006789@maths.leeds.ac.uk>
To: caml-list@inria.fr
X-Validation-by: pmt6sbc@mac.com
Subject: [Caml-list] 10th Annual Conference on Theory and Applications of
 Models of Computation (TAMC13)

                FIRST CALL FOR PAPERS: TAMC 2013
    The 10th annual conference on Theory and Applications of
                     Models of Computation

          University of Hong Kong, Pokfulam, Hong Kong

Important Dates
Submission deadline : 11:59 pm EST January 11, 2013
Notification of authors : late February or early March, 2013
Final versions deadline : to be announced soon

The TAMC proceedings will be published in the Lecture Notes in
Computer Science Series by Springer (http://www.springer.com/lncs).
Authors of accepted papers are expected to present their work
at the conference.

Post Conference Publications
Special issues of the journals Theoretical Computer Science and
Mathematical Structures in Computer Science devoted to a
selected set of accepted papers of the conference are planned.

Aims and Scope

TAMC aims at bringing together a wide range of researchers with
interests in computational theory and applications. The main themes of
the conference are computability, complexity, and algorithms. Typical
      but not exclusive topics of interest include:

* algebraic computation
* algorithmic coding theory
* algorithmic number theory
* approximation algorithms
* automata theory
* circuit complexity
* computability
* computational biology, and biological computing
* computational complexity
* computational game theory
* computational logic
* computational geometry
* continuous and real computation
* cryptography
* data structures
* design and analysis of algorithms
* distributed algorithms
* fixed parameter tractability
* graph algorithms
* information and communication complexity
* learning theory
* natural computation
* network algorithms, networks in nature and society
* online algorithms
* optimization
* parallel algorithms
* privacy and security
* property testing
* proof complexity
* quantum computing
* randomness, pseudo-randomness
* randomized algorithms
* streaming algorithms

      http://www.cs.hku.hk/tamc2013/call.htm