default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14. TAMC 2017: Bern, Switzerland
- T. V. Gopal, Gerhard Jäger, Silvia Steila:
Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings. Lecture Notes in Computer Science 10185, 2017, ISBN 978-3-319-55910-0
Invited Papers
- Marta Kwiatkowska
:
Cognitive Reasoning and Trust in Human-Robot Interactions. 3-11 - Maria Emilia Maietti:
On Choice Rules in Dependent Type Theory. 12-23 - Adrian-Horia Dediu, Joana M. Matos, Carlos Martín-Vide:
Natural Language Processing, Moving from Rules to Data. 24-38 - Stefan Wolf:
An All-or-Nothing Flavor to the Church-Turing Hypothesis. 39-56
Contributed Papers
- Faisal N. Abu-Khzam, Shaowei Cai, Judith Egan, Peter Shaw, Kai Wang:
Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis. 59-70 - Shareef Ahmed, Md. Saidur Rahman:
Multi-interval Pairwise Compatibility Graphs - (Extended Abstract). 71-84 - Nikolay Bazhenov:
A Note on Effective Categoricity for Linear Orderings. 85-96 - Tristan Braquelaire, Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru:
On the Shortest Common Superstring of NGS Reads. 97-111 - Florian Bridoux, Pierre Guillon, Kévin Perrot, Sylvain Sené, Guillaume Theyssier:
On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One. 112-128 - Diptarka Chakraborty, Satyadev Nandakumar, Himanshu Shukla:
On Resource-Bounded Versions of the van Lambalgen Theorem. 129-143 - Vincent Chau, Minming Li, Kai Wang:
Scheduling Fully Parallel Jobs with Integer Parallel Units. 144-157 - Xujin Chen, Xiaodong Hu, Changjun Wang, Ying Zhang:
Continuous Firefighting on Infinite Square Grids. 158-171 - Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta:
Mediated Population Protocols: Leader Election and Applications. 172-186 - Ning Ding, Yanli Ren, Dawu Gu:
Learning AC0 Under k-Dependent Distributions. 187-200 - Henning Fernau, Lakshmanan Kuppusamy:
Parikh Images of Matrix Ins-Del Systems. 201-215 - Guillaume Fertin, Julien Fradin, Géraldine Jean:
Algorithmic Aspects of the Maximum Colorful Arborescence Problem. 216-230 - Olivier Finkel:
Incompleteness Theorems, Large Cardinals, and Automata over Finite Words. 231-246 - Ken C. K. Fong, Minming Li, Yungao Li, Sheung-Hung Poon, Weiwei Wu, Yingchao Zhao:
Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity. 247-259 - Emanuele Frittaion, Silvia Steila, Keita Yokoyama:
The Strength of the SCT Criterion. 260-273 - Roland Glück:
Covering Polygons with Rectangles. 274-288 - Jie Han:
The Complexity of Perfect Packings in Dense Graphs. 289-303 - Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono:
On the Maximum Weight Minimal Separator. 304-318 - Yuguo He:
Pebble Games over Ordered Structural Abstractions. 319-332 - Mamadou Moustapha Kanté, Takeaki Uno:
Counting Minimal Dominating Sets. 333-347 - Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen:
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. 348-361 - Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas. 362-372 - Sang-Ki Ko, Igor Potapov:
Vector Ambiguity and Freeness Problems in SL (2, ℤ). 373-388 - Minming Li, Frances F. Yao, Hao Yuan:
An O(n2) Algorithm for Computing Optimal Continuous Voltage Schedules. 389-400 - Andrzej Lingas:
Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution. 401-411 - Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model. 412-424 - Neil Lutz, Donald M. Stull:
Bounding the Dimension of Points on a Line. 425-439 - Arthur Milchior:
Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order. 440-454 - Luca Paolini, Margherita Zorzi:
qPCF: A Language for Quantum Circuit Computations. 455-469 - Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions. 470-483 - Iosif Petrakis:
A Density Theorem for Hierarchies of Limit Spaces over Separable Metric Spaces. 484-498 - Photchchara Pisantechakool, Xuehou Tan:
On the Conjecture of the Smallest 3-Cop-Win Planar Graph. 499-514 - Sheung-Hung Poon, Wei-Lin Wang:
On Complexity of Total Vertex Cover on Subcubic Graphs. 515-528 - Mozhgan Pourmoradnasseri, Dirk Oliver Theis:
Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract). 529-542 - Heiko Röglin, Clemens Rösner:
The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization. 543-555 - Sam Sanders:
From Nonstandard Analysis to Various Flavours of Computability Theory. 556-570 - Yangguang Shi, Fa Zhang, Zhiyong Liu:
Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs. 571-585 - Maciej Skórski:
A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds. 586-599 - Maciej Skórski:
On the Complexity of Breaking Pseudoentropy. 600-613 - Xuehou Tan, Bo Jiang:
Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems. 614-627 - Tomás Masarík, Tomás Toufar:
Parameterized Complexity of Fair Deletion Problems. 628-642 - Guohua Wu, Huishan Wu:
Degrees of Word Problem for Algebras Without Finitely Presented Expansions. 643-653 - Mingyu Xiao, Shaowei Kou:
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover. 654-668 - Yuan Xue, Boting Yang:
Fast Searching on Cartesian Products of Graphs. 669-683 - Anand Yeolekar, Kumar Madhukar, Dipali Bhutada, R. Venkatesh:
Sequentialization Using Timestamps. 684-696
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 2026-03-10 22:30 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:
