Vor Ort
Merkzettel Warenkorb
Produktbild: Theory and Applications of Models of Computation
Band 14637

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

Aus der Reihe Lecture Notes in Computer Science

214,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

04.05.2024

Herausgeber

Xujin Chen + weitere

Verlag

Springer Singapore

Seitenzahl

368

Maße (L/B/H)

23,5/15,5/2,1 cm

Auflage

1. Auflage

Sprache

Englisch

ISBN

978-981-9723-39-3

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

04.05.2024

Herausgeber

Verlag

Springer Singapore

Seitenzahl

368

Maße (L/B/H)

23,5/15,5/2,1 cm

Auflage

1. Auflage

Sprache

Englisch

ISBN

978-981-9723-39-3

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Theory and Applications of Models of Computation

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