Del 14637 - Lecture Notes in Computer Science

Theory and Applications of Models of Computation

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

Häftad, Engelska, 2024

2 999 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2024-05-04
Mått155 x 235 x 21 mm
Vikt581 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor368
FörlagSpringer Verlag, Singapore
ISBN9789819723393

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT
Diskret matematik inom Naturvetenskap och teknik

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