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 29 matches
- 2014
- David Auger, Pierre Coucheney, Yann Strozecki:
Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games. TAMC 2014: 67-85 - Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon:
A Tight Lower Bound Instance for k-means++ in Constant Dimension. TAMC 2014: 7-22 - Cristian S. Calude, Ludwig Staiger, Frank Stephan:
Finite State Incompressible Infinite Sequences. TAMC 2014: 50-66 - David Cattanéo, Simon Perdrix:
The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes. TAMC 2014: 86-103 - Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara:
Intersection Dimension of Bipartite Graphs. TAMC 2014: 323-340 - Jingchao Chen:
A Bit-Encoding Phase Selection Strategy for Satisfiability Solvers. TAMC 2014: 158-167 - Shibsankar Das, Kalpesh Kapoor:
Fine-Tuning Decomposition Theorem for Maximum Weight Bipartite Matching. TAMC 2014: 312-322 - Samir Datta, Raghav Kulkarni:
Space Complexity of Optimization Problems in Planar Graphs. TAMC 2014: 300-311 - Yihua Ding, James Z. Wang, Pradip K. Srimani:
Self-stabilizing Minimal Global Offensive Alliance Algorithm with Safe Convergence in an Arbitrary Graph. TAMC 2014: 366-377 - Michael François, David Defour, Pascal Berthomé:
A Pseudo-Random Bit Generator Based on Three Chaotic Logistic Maps and IEEE 754-2008 Floating-Point Arithmetic. TAMC 2014: 229-247 - Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen:
Approximation Algorithms for the Weight-Reducible Knapsack Problem. TAMC 2014: 203-215 - T. V. Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper:
A Roadmap for TAMC. TAMC 2014: 1-6 - Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka:
On the Parameterized Complexity for Token Jumping on Graphs. TAMC 2014: 341-351 - Ievgen Ivanov:
On Representations of Abstract Systems with Partial Inputs and Outputs. TAMC 2014: 104-123 - Jia Jiao, Peng Liu, Xianxian Li:
A Personalized Privacy Preserving Method for Publishing Social Network Data. TAMC 2014: 141-157 - Matsuo Konagaya, Yota Otachi, Ryuhei Uehara:
Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs. TAMC 2014: 216-228 - Min Lu, Tian Liu, Weitian Tong, Guohui Lin, Ke Xu:
Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems. TAMC 2014: 248-258 - Jean-Yves Marion, Romain Péchoux:
Complexity Information Flow in a Multi-threaded Imperative Language. TAMC 2014: 124-140 - Klaus Meer, Ameen Naif:
Generalized Finite Automata over Real and Complex Numbers. TAMC 2014: 168-187 - Venkata Padmavati Metta, Alica Kelemenová:
Universality of Spiking Neural P Systems with Anti-spikes. TAMC 2014: 352-365 - Romain Péchoux, Thanh Dinh Ta:
A Categorical Treatment of Malicious Behavioral Obfuscation. TAMC 2014: 280-299 - Manoj K. Raut:
An Incremental Algorithm for Computing Prime Implicates in Modal Logic. TAMC 2014: 188-202 - Bala Ravikumar, Duncan Innes:
An Improved Upper-Bound for Rivest et al.'s Half-Lie Problem. TAMC 2014: 23-38 - Biswanath Sethi, Nazim Fatès, Sukanta Das:
Reversibility of Elementary Cellular Automata under Fully Asynchronous Update. TAMC 2014: 39-49 - Yuan Tian, Rongxin Sun, Xueyong Zhu:
A Local-Global Approach to Solving Ideal Lattice Problems. TAMC 2014: 378-400 - Yuan Tian, Xueyong Zhu, Rongxin Sun:
Modular Form Approach to Solving Lattice Problems. TAMC 2014: 401-421 - Rajiv Veeraraghavan, Rakesh Kashyap, Archita Chopde, Swapan Bhattacharya:
A Dynamic Approach to Frequent Flyer Program. TAMC 2014: 271-279 - Peng Zhang:
Efficient Algorithms for the Label Cut Problems. TAMC 2014: 259-270 - T. V. Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper:
Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014. Proceedings. Lecture Notes in Computer Science 8402, Springer 2014, ISBN 978-3-319-06088-0 [contents]
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-10-06 15:17 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