04697nam a22005655i 4500 978-981-97-2340-9 DE-He213 20251030112028.0 cr nn 008mamaa 240503s2024 si | s |||| 0|eng d 9789819723409 978-981-97-2340-9 10.1007/978-981-97-2340-9 doi QA76.9.A43 UMB bicssc COM051300 bisacsh UMB thema Theory and Applications of Models of Computation [electronic resource] : 18th Annual Conference, TAMC 2024, Hong Kong, China, May 13–15, 2024, Proceedings / edited by Xujin Chen, Bo Li. 1st ed. 2024. Singapore : Springer Nature Singapore : Imprint: Springer, 2024. XIII, 368 p. 67 illus., 34 illus. in color. online resource. text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Lecture Notes in Computer Science, 1611-3349 ; 14637 -- 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. 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. . Algorithms. 58677 Computer science Mathematics. 64041 Discrete mathematics. Computer science. 58552 Algorithms. 58677 Discrete Mathematics in Computer Science. Theory of Computation. 67552 Chen, Xujin. editor. (orcid)0000-0001-7844-5411 https://orcid.org/0000-0001-7844-5411 edt http://id.loc.gov/vocabulary/relators/edt 76395 Li, Bo. editor. edt http://id.loc.gov/vocabulary/relators/edt 76396 SpringerLink (Online service) Springer Nature eBook Printed edition: 9789819723393 Printed edition: 9789819723416 Lecture Notes in Computer Science, 1611-3349 ; 14637 https://doi.org/10.1007/978-981-97-2340-9 ZDB-2-SCS ZDB-2-SXCS ZDB-2-LNC 59652 59652