default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 50 matches
- 2017
- Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta:
Mediated Population Protocols: Leader Election and Applications. TAMC 2017: 172-186 - 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. TAMC 2017: 59-70 - Shareef Ahmed, Md. Saidur Rahman:
Multi-interval Pairwise Compatibility Graphs - (Extended Abstract). TAMC 2017: 71-84 - Nikolay Bazhenov:
A Note on Effective Categoricity for Linear Orderings. TAMC 2017: 85-96 - Tristan Braquelaire, Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru:
On the Shortest Common Superstring of NGS Reads. TAMC 2017: 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. TAMC 2017: 112-128 - Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas. TAMC 2017: 362-372 - Diptarka Chakraborty, Satyadev Nandakumar, Himanshu Shukla:
On Resource-Bounded Versions of the van Lambalgen Theorem. TAMC 2017: 129-143 - Vincent Chau, Minming Li, Kai Wang:
Scheduling Fully Parallel Jobs with Integer Parallel Units. TAMC 2017: 144-157 - Xujin Chen, Xiaodong Hu, Changjun Wang, Ying Zhang:
Continuous Firefighting on Infinite Square Grids. TAMC 2017: 158-171 - Adrian-Horia Dediu, Joana M. Matos, Carlos Martín-Vide:
Natural Language Processing, Moving from Rules to Data. TAMC 2017: 24-38 - Ning Ding, Yanli Ren, Dawu Gu:
Learning AC0 Under k-Dependent Distributions. TAMC 2017: 187-200 - Henning Fernau, Lakshmanan Kuppusamy:
Parikh Images of Matrix Ins-Del Systems. TAMC 2017: 201-215 - Guillaume Fertin, Julien Fradin, Géraldine Jean:
Algorithmic Aspects of the Maximum Colorful Arborescence Problem. TAMC 2017: 216-230 - Olivier Finkel:
Incompleteness Theorems, Large Cardinals, and Automata over Finite Words. TAMC 2017: 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. TAMC 2017: 247-259 - Emanuele Frittaion, Silvia Steila, Keita Yokoyama:
The Strength of the SCT Criterion. TAMC 2017: 260-273 - Roland Glück:
Covering Polygons with Rectangles. TAMC 2017: 274-288 - Jie Han:
The Complexity of Perfect Packings in Dense Graphs. TAMC 2017: 289-303 - Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono:
On the Maximum Weight Minimal Separator. TAMC 2017: 304-318 - Yuguo He:
Pebble Games over Ordered Structural Abstractions. TAMC 2017: 319-332 - Mamadou Moustapha Kanté, Takeaki Uno:
Counting Minimal Dominating Sets. TAMC 2017: 333-347 - Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen:
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. TAMC 2017: 348-361 - Sang-Ki Ko, Igor Potapov:
Vector Ambiguity and Freeness Problems in SL (2, ℤ). TAMC 2017: 373-388 - Marta Kwiatkowska:
Cognitive Reasoning and Trust in Human-Robot Interactions. TAMC 2017: 3-11 - Minming Li, Frances F. Yao, Hao Yuan:
An O(n2) Algorithm for Computing Optimal Continuous Voltage Schedules. TAMC 2017: 389-400 - Andrzej Lingas:
Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution. TAMC 2017: 401-411 - Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model. TAMC 2017: 412-424 - Neil Lutz, Donald M. Stull:
Bounding the Dimension of Points on a Line. TAMC 2017: 425-439 - Maria Emilia Maietti:
On Choice Rules in Dependent Type Theory. TAMC 2017: 12-23
skipping 20 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-20 12:45 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint