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

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

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Chen, Xujin (Editor), Li, Bo (Editor)
Format: Electronic eBook
Language:English
Published: Singapore : Springer Nature Singapore : Imprint: Springer, 2024.
Edition:1st ed. 2024.
Series:Lecture Notes in Computer Science, 14637
Subjects:
Online Access:https://doi.org/10.1007/978-981-97-2340-9
Tags: Add Tag
No Tags, Be the first to tag this record!

MARC

LEADER 00000nam a22000005i 4500
001 978-981-97-2340-9
003 DE-He213
005 20260810171106.0
007 cr nn 008mamaa
008 240503s2024 si | o |||| 0|eng d
020 |a 9789819723409  |9 978-981-97-2340-9 
024 7 |a 10.1007/978-981-97-2340-9  |2 doi 
050 4 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
072 7 |a UMB  |2 thema 
082 0 4 |a 518.1  |2 23 
245 1 0 |a Theory and Applications of Models of Computation  |h [electronic resource] :  |b 18th Annual Conference, TAMC 2024, Hong Kong, China, May 13–15, 2024, Proceedings /  |c edited by Xujin Chen, Bo Li. 
250 |a 1st ed. 2024. 
264 1 |a Singapore :  |b Springer Nature Singapore :  |b Imprint: Springer,  |c 2024. 
300 |a 1 online resource (XIII, 368 p. 67 illus.).  |b 34 illus. in color. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 1611-3349 ;  |v 14637 
505 0 |a  -- 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. 
520 |a 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. . 
588 |a Print version record. 
650 0 |a Algorithms. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Discrete mathematics. 
650 0 |a Computer science. 
650 1 4 |a Algorithms. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Theory of Computation. 
700 1 |a Chen, Xujin.  |e editor.  |0 (orcid)0000-0001-7844-5411  |1 https://orcid.org/0000-0001-7844-5411  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Li, Bo.  |e editor.  |0 (orcid)0000-0001-7500-8355  |1 https://orcid.org/0000-0001-7500-8355  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9789819723393 
776 0 8 |i Printed edition:  |z 9789819723416 
830 0 |a Lecture Notes in Computer Science,  |x 1611-3349 ;  |v 14637 
856 4 0 |u https://doi.org/10.1007/978-981-97-2340-9 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-SXPS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710) 
950 |a Springer Nature Proceedings Computer Science (SpringerNature-85344)