Theory and Applications of Models of Computation: 18th Annual Conference, TAMC 2024, Hong Kong, China, May 13-15, 2024, Proceedings

by Xujin Chen (Editor), Bo Li (Editor)

Overview

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.

Product Details

ISBN-13:	9789819723393
Publisher:	Springer Nature Singapore
Publication date:	05/20/2024
Series:	Lecture Notes in Computer Science , #14637
Edition description:	2024
Pages:	368
Product dimensions:	6.10(w) x 9.25(h) x (d)

Table of Contents

.- On Learning Families of Ideals in Lattices and Boolean Algebras.
.- Unambiguous and Co-Nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters
.- A Gray Code of Ordered Trees
.- Mechanism Design with Predictions for Facility Location Games with Candidate Locations
.- An Improved Approximation Algorithm for Metric Triangle Packing
.- An Optimal and Practical Algorithm for the Planar 2-Center Problem
.- Endogenous Threshold Selection with Two-Interval Restricted Tests
.- An Improved Kernel and Parameterized Algorithm for Almost Induced Matching
.- A Tight Threshold Bound for Search Trees with 2-Way Comparisons
.- Kleene Theorems for Lasso and ω-Languages
.- Tight Double Exponential Lower Bounds
.- Source-Oblivious Broadcast
.- On the 3-Tree Core of Plane Graphs
.- A Coq-Based Infrastructure for Quantum Programming, Verification and Simulation
.- A Local Search Algorithm for Radius-Constrained $k$-Median
.- Energy and Output Patterns in Boolean Circuits
.- Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques
.- On the Power of Counting the Total Number of Computation Paths of NPTMs
.- The Parameterized Complexity of Maximum Betweenness Centrality
.- Offensive Alliances in Signed Graphs
.- Quantum Path Parallelism: A Circuit-Based Approach to Text Searching
.- Space-Efficient Graph Kernelizations
.- Counting on Rainbow $k$-Connections
.- Some Combinatorial Algorithms on the Edge Cover Number of $k$-Regular Connected Hypergraphs
.- Time Efficient Implementation for Online $k$-Server Problem on Trees
.- Improved Approximation Algorithm for the Distributed Lower-Bounded k-Center Problem
.- Parameterized Complexity of Weighted Target Set Selection
.- Mechanism Design for Building Optimal Bridges between Regions
.- Joint Bidding in Ad Auctions
.- Lower Bounds for the Sum of Small-Size Algebraic Branching Programs.