000 04652nam a22005655i 4500
001 978-981-97-2340-9
003 DE-He213
005 20240730172041.0
007 cr nn 008mamaa
008 240503s2024 si | s |||| 0|eng d
020 _a9789819723409
_9978-981-97-2340-9
024 7 _a10.1007/978-981-97-2340-9
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aTheory and Applications of Models of Computation
_h[electronic resource] :
_b18th Annual Conference, TAMC 2024, Hong Kong, China, May 13-15, 2024, Proceedings /
_cedited by Xujin Chen, Bo Li.
250 _a1st ed. 2024.
264 1 _aSingapore :
_bSpringer Nature Singapore :
_bImprint: Springer,
_c2024.
300 _aXIII, 368 p. 67 illus., 34 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14637
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 _aThis 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. .
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aComputer science.
_99832
650 1 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aTheory of Computation.
_9101536
700 1 _aChen, Xujin.
_eeditor.
_0(orcid)
_10000-0001-7844-5411
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9101538
700 1 _aLi, Bo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9101540
710 2 _aSpringerLink (Online service)
_9101542
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9789819723393
776 0 8 _iPrinted edition:
_z9789819723416
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14637
_923263
856 4 0 _uhttps://doi.org/10.1007/978-981-97-2340-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cEBK
999 _c87977
_d87977