[Deadline Extended]

15th Annual Conference on

Theory and Applications of

Models of Computation
Kitakyushu International Conference Center, Kokura Station, Kitakyushu (City), Japan
In Association With: International Society of Management Engineers [ISME], Japan
TAMC 2019 aims at bringing together a wide range of research-
Steering Committee: ers with interests in computational theory and applications. The
M. Agrawal (Indian Institute of Technology, Kanpur, India) main themes of the conference are computability, complexity,
Jin-Yi Cai (University of Wisconsin, USA) algorithms, models of computation and systems theory.
J. Hopcroft (Cornell University, USA) TAMC is happening in Japan after a gap of Eight Years with
A. Li (Beihang University, Beijing, China) special sessions on “Soft Computing and AI models”.
Z. Liu (Institute of Computing Technology, Chinese TAMC 2011 was held in Tokyo, Japan. Typical but not exclu-
Academy of Sciences, China) sive topics of interest include
 algebraic computation  model theory for computing
 algorithmic coding theory [modal and temporal logics,
Programme Committee  algorithmic number theory specification, verification,
Aaron D. Jaggard, U.S. Naval Research Laboratory, USA, synthesis or automated software
 approximation algorithms
Abdulmunem M Artoli, King Saud University, Saudi Arabia, construction, aesthetics, software
 automata theory
Anthony Bonato, Ryerson University, Canada, behavior, transformation of
Antonio Fernández Anta, IMDEA Networks Institute, Spain,  circuit complexity models]
Cristian S. Calude, University of Auckland, New Zealand,  combinatorial algorithms  natural computation
Frank Stephan, National University of Singapore, Singapore,  computability  nature inspired computing
Hans Bodlaender, Utrecht University / Eindhoven University of Technology,  computational biology, and  network algorithms
Netherlands, biological computing
 networks in nature and society
Hiroshi Sakai, Kyushu Institute of Technology, Japan,  computational complexity
 online algorithms
Jan Kratochvil, Charles University, Czech Republic, [including circuits, communication,
derandomization, PCPs,  optimization
Johann A. Makowsky, Technion - Israel Institute of Technology, Israel,  parallel algorithms
Jose Rolim, University of Geneva, Switzerland, proofcomplexity, structural
complexity]  philosophy of computing
Kawano Tomonori, Kitakyushu City University, Japan,
 computational game theory [emerging paradigms, morality,
Kenichi Asami, Kyushu Institute of Technology, Japan, intentionality]
Klaus Ambos-Spies, University of Heidelberg, Germany,  computational logic
 computational geometry  privacy and security
Klaus Meer, Brandenburg University of Technology (BTU) Cottbus –
 continuous and real computation  property testing
Senftenberg, Germany,
 cryptography  proof complexity
Maya Dimitrova, Institute of Robotics, Bulgarian Academy of Sciences,
Bulgaria  data structures  process models
Naijun Zhan, Institute of Software Chinese Academy of Sciences, China, [for software construction,
 design and analysis of algorithms
validating software
Pan Peng, University of Sheffield, United Kingdom,  distrbuted algorithms underconstruction, supply - chain]
Pandu Rangan Chandrasekaran, Indian Institute of Technology, Madras,  domain models
India  quantum computing
[Assets, Price of Abstraction,
Philippe Moser, National University of Ireland, Ireland,  randomness, pseudo-randomness
frameworks]
Pushkar S. Joglekar, Vishwakarma Institute of Technology, India,  randomized algorithms
 fixed parameter tractability
Roman Kuznets, TU Wien, Austria,  space - time tradeoffs
 geometric algorithms
Shyamasundar R.K, Indian Institute of Technology Bombay, India,  streaming algorithms
 graph algorithms
Steffen Lempp, University of Wisconsin, Madison, USA  systems theory
 information and communication
Toshihide Yoshimura, Kitakyushu City University, Japan, [Concurrent, Timed, Hybrid and
complexity
Thomas Zeugmann, Hokkaido University, Japan, Secure systems]
 learning theory
 VLSI Models of Computation
Valentina Emilia Balas, Aurel Vlaicu University of Arad, Romania,
Venkat Chakravarthy, IBM, India,  memory hierarchy tradeoffs [Models for Hardware - Software
Toshihiro Fujito, Toyohashi University of Technology, Japan, Co-design]
Wu Guohua, Nanyang Technological University, Singapore,
Yaroslav D. Sergeyev, Università della Calabria, Italy, Important Dates
Yoshiyuki Matsumoto, Shimonoseki City University, Japan,
Yoshiyuki Yabuuchi, Shimonoseki City University, Japan,
Submission Deadline: 5 December 2018, 11:59pm EST.
Finance Committee: Notification of Acceptance: 31 December 2018
Chair: Yoshiyuki Matsumoto,Shimonoseki City University,Japan Final Camera Ready Version Due: 21 January 2019

Papers submitted will be reviewed and evaluated based on originality, technical quality and relevance to the conference.
Paper submission at: https://easychair.org/conferences/?conf=tamc2019
Paper Format for Springer LNCS: https://www.springer.com/de/it-informatik/lncs/conference-proceedings-guidelines
In Association with Proceedings published by Professor Junzo Watada Professor T V Gopal
Professor Emeritus CEG Campus,
Waseda University, Japan Anna University, Chennai, India
Chair, Programme Committee Co-Chair, Programme Committee
Department of Computer Science and Engineering
IPS Graduate School, Waseda University,
College of Engineering, Anna University
2-7 Hibikino, Wakamatsu. Chennai - 600 025, INDIA
Kitakyushu 808-0135 JAPAN Ph : (Off) 22351723 Extn. 3340
Mobile: +81-90-3464-4929 Mobile: +91 9840121302
E-Mail : tamc@wcicme.sakura.ne.jp E-Mail : gopal@annauniv.edu;
For Registration and Other details Please Visit : https://drive.google.com/open?id=1tYAEUR1pRw9PBLcvVnm7bRgZ0hk1G5EV gopal.tadepalli@gmail.com