Theory and Applications of Models of Computation : 18th Annual Conference, TAMC 2024, Hong Kong, China, May 13–15, 2024, Proceedings / / edited by Xujin Chen, Bo Li |
Edizione | [1st ed. 2024.] |
Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2024 |
Descrizione fisica | 1 online resource (380 pages) |
Disciplina | 511.3 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Algorithms
Computer science - Mathematics Discrete mathematics Computer science Discrete Mathematics in Computer Science Theory of Computation |
ISBN | 981-9723-40-X |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | -- 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. |
Record Nr. | UNINA-9910855372303321 |
Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2024 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Web and internet economics : 16th international conference, WINE 2020, Beijing, China, December 7-11, 2020 : proceedings / / Xujin Chen [and three others], (Eds.) |
Edizione | [1st ed. 2020.] |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2020] |
Descrizione fisica | 1 online resource (XIV, 476 p. 39 illus., 16 illus. in color.) |
Disciplina | 511.8 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Algorithms
Electronic commerce |
ISBN | 3-030-64946-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Matching -- Markets -- Mechanism Design and Pricing -- Routing, Scheduling, Load Balancing -- Fairness -- Learning. |
Record Nr. | UNINA-9910447250803321 |
Cham, Switzerland : , : Springer, , [2020] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Web and internet economics : 16th international conference, WINE 2020, Beijing, China, December 7-11, 2020 : proceedings / / Xujin Chen [and three others], (Eds.) |
Edizione | [1st ed. 2020.] |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2020] |
Descrizione fisica | 1 online resource (XIV, 476 p. 39 illus., 16 illus. in color.) |
Disciplina | 511.8 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Algorithms
Electronic commerce |
ISBN | 3-030-64946-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Matching -- Markets -- Mechanism Design and Pricing -- Routing, Scheduling, Load Balancing -- Fairness -- Learning. |
Record Nr. | UNISA-996418212503316 |
Cham, Switzerland : , : Springer, , [2020] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|