Skip to main content
SpringerLink
Log in

Theory and Applications of Models of Computation

18th Annual Conference, TAMC 2024, Hong Kong, China, May 13–15, 2024, Proceedings

  • Conference proceedings
  • © 2024

Overview

Editors:
  1. Xujin Chen

    1. Chinese Academy of Sciences, Beijing, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Bo Li

    1. The Hong Kong Polytechnic University, Hong Kong, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 14637)

Included in the following conference series:

Conference proceedings info: TAMC 2024.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 219.99
Price excludes VAT (USA)
This title has not yet been released. You may pre-order it now and we will ship your order when it is published on 20 May 2024.
  • Compact, lightweight edition
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This book constitutes the proceedings of the 18th Annual Conference on Theory and Applications of Models of Computation, TAMC 2024, which was held in Hong Kong, China, during May 13–15, 2024. 

The 30 full papers presented in this book were carefully reviewed and selected from 69 submissions. The main themes of the selected papers are computability, complexity, algorithms, information theory, as well as their integration with machine learning theory and the foundations of artificial intelligence.

 

Keywords

Table of contents (30 papers)

  1. Front Matter

    Pages i-xiii
    Download chapter PDF

  2. On Learning Families of Ideals in Lattices and Boolean Algebras

    • Nikolay Bazhenov, Manat Mustafa
    Pages 1-13

  3. Unambiguous and Co-nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters

    • Tomoyuki Yamakami
    Pages 14-25

  4. A Gray Code of Ordered Trees

    • Shin-ichi Nakano
    Pages 26-37

  5. Mechanism Design with Predictions for Facility Location Games with Candidate Locations

    • Jiazhu Fang, Qizhi Fang, Wenjing Liu, Qingqin Nong
    Pages 38-49

  6. An Improved Approximation Algorithm for Metric Triangle Packing

    • Jingyang Zhao, Mingyu Xiao
    Pages 50-62

  7. An Optimal and Practical Algorithm for the Planar 2-Center Problem

    • Xuehou Tan
    Pages 63-74

  8. Endogenous Threshold Selection with Two-Interval Restricted Tests

    • Zeyu Ren, Yan Liu
    Pages 75-85

  9. An Improved Kernel and Parameterized Algorithm for Almost Induced Matching

    • Yuxi Liu, Mingyu Xiao
    Pages 86-98

  10. A Tight Threshold Bound for Search Trees with 2-Way Comparisons

    • Sunny Atalig, Marek Chrobak
    Pages 99-110

  11. Kleene Theorems for Lasso Languages and \(\omega \)-Languages

    • Mike Cruchten
    Pages 111-123

  12. Tight Double Exponential Lower Bounds

    • Ivan Bliznets, Markus Hecher
    Pages 124-136

  13. Source-Oblivious Broadcast

    • Pierre Fraigniaud, Hovhannes A. Harutyunyan
    Pages 137-148

  14. On the 3-Tree Core of Plane Graphs

    • Debajyoti Mondal, Md. Saidur Rahman
    Pages 149-160

  15. A Coq-Based Infrastructure for Quantum Programming, Verification and Simulation

    • Wenxuan Tao, Gang Chen
    Pages 161-172

  16. A Local Search Algorithm for Radius-Constrained k-Median

    • Gaojie Chi, Longkun Guo
    Pages 173-184

  17. Energy and Output Patterns in Boolean Circuits

    • Jayalal Sarma, Kei Uchizawa
    Pages 185-196

  18. Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques

    • Chenchen Wu, Rolf H. Möhring, Yishui Wang, Dachuan Xu, Dongmei Zhang
    Pages 197-208

  19. On the Power of Counting the Total Number of Computation Paths of NPTMs

    • Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos
    Pages 209-220

  20. The Parameterized Complexity of Maximum Betweenness Centrality

    • Šimon Schierreich, José Gaspar Smutný
    Pages 221-233
Back to top

Other volumes

  1. Theory and Applications of Models of Computation

Editors and Affiliations

  • Chinese Academy of Sciences, Beijing, China

    Xujin Chen

  • The Hong Kong Polytechnic University, Hong Kong, China

    Bo Li

Bibliographic Information

  • Book Title: Theory and Applications of Models of Computation

  • Book Subtitle: 18th Annual Conference, TAMC 2024, Hong Kong, China, May 13–15, 2024, Proceedings

  • Editors: Xujin Chen, Bo Li

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/978-981-97-2340-9

  • Publisher: Springer Singapore

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024

  • Softcover ISBN: 978-981-97-2339-3Published: 04 May 2024

  • eBook ISBN: 978-981-97-2340-9Published: 02 May 2024

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XIII, 368

  • Number of Illustrations: 33 b/w illustrations, 34 illustrations in colour

  • Topics: Algorithms, Discrete Mathematics in Computer Science, Theory of Computation

Publish with us

Policies and ethics

Back to top

Search

Navigation