default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18th TAMC 2024: Hong Kong, China
- Xujin Chen
, Bo Li:
Theory and Applications of Models of Computation - 18th Annual Conference, TAMC 2024, Hong Kong, China, May 13-15, 2024, Proceedings. Lecture Notes in Computer Science 14637, Springer 2024, ISBN 978-981-97-2339-3 - Nikolay Bazhenov, Manat Mustafa:
On Learning Families of Ideals in Lattices and Boolean Algebras. 1-13 - Tomoyuki Yamakami:
Unambiguous and Co-nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters. 14-25 - Shin-Ichi Nakano:
A Gray Code of Ordered Trees. 26-37 - Jiazhu Fang, Qizhi Fang, Wenjing Liu, Qingqin Nong:
Mechanism Design with Predictions for Facility Location Games with Candidate Locations. 38-49 - Jingyang Zhao, Mingyu Xiao:
An Improved Approximation Algorithm for Metric Triangle Packing. 50-62 - Xuehou Tan:
An Optimal and Practical Algorithm for the Planar 2-Center Problem. 63-74 - Zeyu Ren, Yan Liu:
Endogenous Threshold Selection with Two-Interval Restricted Tests. 75-85 - Yuxi Liu, Mingyu Xiao:
An Improved Kernel and Parameterized Algorithm for Almost Induced Matching. 86-98 - Sunny Atalig, Marek Chrobak:
A Tight Threshold Bound for Search Trees with 2-Way Comparisons. 99-110 - Mike Cruchten:
Kleene Theorems for Lasso Languages and ømega-Languages. 111-123 - Ivan Bliznets, Markus Hecher:
Tight Double Exponential Lower Bounds. 124-136 - Pierre Fraigniaud, Hovhannes A. Harutyunyan:
Source-Oblivious Broadcast. 137-148 - Debajyoti Mondal, Md. Saidur Rahman:
On the 3-Tree Core of Plane Graphs. 149-160 - Wenxuan Tao, Gang Chen:
A Coq-Based Infrastructure for Quantum Programming, Verification and Simulation. 161-172 - Gaojie Chi, Longkun Guo:
A Local Search Algorithm for Radius-Constrained k-Median. 173-184 - Jayalal Sarma, Kei Uchizawa:
Energy and Output Patterns in Boolean Circuits. 185-196 - Chenchen Wu, Rolf H. Möhring, Yishui Wang, Dachuan Xu, Dongmei Zhang:
Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques. 197-208 - Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos:
On the Power of Counting the Total Number of Computation Paths of NPTMs. 209-220 - Simon Schierreich, José Gaspar Smutný:
The Parameterized Complexity of Maximum Betweenness Centrality. 221-233 - Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi:
Offensive Alliances in Signed Graphs. 234-246 - Simone Faro, Arianna Pavone, Caterina Viola:
Quantum Path Parallelism: A Circuit-Based Approach to Text Searching. 247-259 - Frank Kammer, Andrej Sajenko:
Space-Efficient Graph Kernelizations. 260-271 - Robert D. Barish, Tetsuo Shibuya:
Counting on Rainbow k-Connections. 272-283 - Zhongzheng Tang, Yaxuan Li, Zhuo Diao:
Some Combinatorial Algorithms on the Edge Cover Number of k-Regular Connected Hypergraphs. 284-295 - Kamil Khadiev, Maxim Yagafarov:
Time Efficient Implementation for Online K-Server Problem on Trees. 296-308 - Ting Liang, Qilong Feng, Xiaoliang Wu, Jinhui Xu, Jianxin Wang:
Improved Approximation Algorithm for the Distributed Lower-Bounded k-Center Problem. 309-319 - Takahiro Suzuki, Kei Kimura, Akira Suzuki, Yuma Tamura, Xiao Zhou:
Parameterized Complexity of Weighted Target Set Selection. 320-331 - Zining Qin, Hau Chan, Chenhao Wang, Ying Zhang:
Mechanism Design for Building Optimal Bridges Between Regions. 332-343 - Yuchao Ma, Weian Li, Wanzhi Zhang, Yahui Lei, Zhicheng Zhang, Qi Qi, Qiang Liu, Xingxing Wang:
Joint Bidding in Ad Auctions. 344-354 - C. S. Bhargav, Prateek Dwivedi, Nitin Saxena:
Lower Bounds for the Sum of Small-Size Algebraic Branching Programs. 355-366
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-12 01:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
