[Agda] TAMC 2013 in Hong Kong: Second Call for Papers

[S B Cooper]

===========================================================================
SECOND CALL FOR PAPERS:

                              TAMC 2013

        The 10th Annual Conference on Theory and Applications of
                        Models of Computation

                  Hong Kong, China, 20-22 May 2013

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

===========================================================================

The 10th Annual Conference on Theory and Application of Models of
Computation (TAMC 2013 http://www.cs.hku.hk/tamc2013/) will be held in
Hong Kong, China, from May 20 to May 22, 2013. TAMC aims at bringing
together a wide range of researchers with interests in computational
theory and applications.

Hong Kong is situated on China's south coast and is famous for its
skyline. Hong Kong was a colony of the British Empire until 1997 when it
was returned to China. It now thrives under the principle of "one country,
two systems", enjoying a high degree of authority and independent
judiciary. Hong Kong is often described as "East meets West" and is one of
the world's leading international financial centers.

Come and visit Asia's vibrant world city
(www.discoverhongkong.com/eng/index.jsp) and join the conference at the
University of Hong Kong (according to 2012 QS World University Rankings
HKU ranked 23rd in the world and 1st in Asia).

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 theory
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

IMPORTANT DATES -
Submission deadline	:	11:59 pm EST January 11, 2013
Notification of authors	:	February 22, 2013
Final versions deadline	:	March 8, 2013

Submission page:
 https://www.easychair.org/conferences/?conf=tamc2013.

Conference Chair:
Francis Chin (The University of Hong Kong)

Program Chair:
Lap Chi Lau (The Chinese University of Hong Kong)
Luca Trevisan (Stanford University)

Program Committee:
Andrej Bogdanov (The Chinese University of Hong Kong)
Hubert Chan (University of Hong Kong)
Ho-Lin Chen (National Taiwan University)
Jianer Chen (Texas A&M University)
Ning Chen (Nanyang Technological University)
Wei Chen (Microsoft Research Asia)
Xi Chen (Columbia University)
Francis Chin (The University of Hong Kong, Chair)
Marek Chrobak (UC Riverside)
Nicola Galesi (Universita di Roma La Sapienza)
Naveen Garg (IIT Dehli)
Navin Goyal (Microsoft Research India)
Nick Harvey (University of British Columbia)
Rahul Jain (National University of Singapore)
David Jao (University of Waterloo)
Ken-ichi Kawarabayashi (National Institute of Informatics, Japan)
Jochen Konemann (University of Waterloo)
Amit Kumar (IIT Delhi)
Lap Chi Lau (The Chinese University of Hong Kong, Co-chair)
Jian Li (Tsinghua University)
Rachel Lin (MIT and The Chinese University of Hong Kong)
Pinyan Lu (Microsoft Research Asia)
Mohammad Mahdian (Google Research)
Seffi Naor (Technion University)
Krzysztof Onak (IBM Research)
Periklis Papakonstantinou (Tsinghua University)
Seth Pettie (University of Michigan)
Atri Rudra (University at Buffalo, The State University of New York)
Alexander Russell (University of Connecticut)
Piotr Sankowski (University of Warsaw)
Rahul Santhanam (University of Edinburgh)
Anastasios Sidiropoulos (UIUC)
Mohit Singh (Microsoft Research Redmond)
Man Cho Anthony So (The Chinese University of Hong Kong)
John Steinberger (Tsinghua University)
Luca Trevisan (Stanford University, Co-chair)
Laszlo Vegh (London School of Economics)
David Woodruff (IBM Research)
Ke Yi (Hong Kong University of Science and Technology)
Qin Zhang (IBM Research and Indiana University)

Submission instructions:
* Authors should submit an extended abstract (not a full paper), online
at:  https://www.easychair.org/conferences/?conf=tamc2013

* The submission should contain a scholarly exposition of ideas,
techniques, and results, including motivation and a clear comparison with
related work.

* The length of the extended abstract should not exceed ten (10)
letter-sized pages (not including bibliography and appendices.)

* Submitted papers must describe work not previously published. They must
not be submitted simultaneously to another conference with refereed
proceedings.

* Research that is already submitted to a journal may be submitted to
TAMC13, provided that (a) the PC chair is notified in advance that this is
the case, and (b) it is not scheduled for journal publication before the
conference.

Proceedings:
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.

Special issues of the leading journals 'Theoretical Computer Science' and
'Mathematical Structures in Computer Science', devoted to a selected set
of accepted papers of the conference, are planned.

Steering Committee:
Manindra Agrawal (Indian Institute of Technology, Kanpur, India)
Jin-Yi Cai (University of Wisconsin - Madison, USA)
S. Barry Cooper (University of Leeds, Leeds, UK)
John Hopcroft (Cornell University)
Angsheng Li (Chinese Academy of Sciences)

Local Organising Committee:
Hubert Chan, H.F. Ting, Zhang Yong

===========================================================================
Contact: tamc at cs.hku.hk
===========================================================================