![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
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 70 matches
- 2007
- Miklós Ajtai:
Generalizations of the Compactness Theorem and Gödel's Completeness Theorem for Nonstandard Finite Structures. TAMC 2007: 13-33 - Reid Andersen, Fan R. K. Chung:
Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm. TAMC 2007: 1-12 - George Barmpalias
, Andrew E. M. Lewis, Mariya Ivanova Soskova:
Working with the LR Degrees. TAMC 2007: 89-99 - Joseph Wun-Tat Chan, Tak Wah Lam, Kin-Sum Mak, Prudence W. H. Wong
:
Online Deadline Scheduling with Bounded Energy Efficiency. TAMC 2007: 416-427 - Qi Cheng, Elizabeth Murray:
On Deciding Deep Holes of Reed-Solomon Codes. TAMC 2007: 296-305 - Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas:
Approximation Algorithms for 3D Orthogonal Knapsack. TAMC 2007: 34-45 - Decheng Ding, Klaus Weihrauch, Yongcheng Wu:
Absolutely Non-effective Predicates and Functions in Computable Analysis. TAMC 2007: 595-604 - Michael Dom, Jiong Guo, Rolf Niedermeier:
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems. TAMC 2007: 680-691 - Zhenhua Duan, Cong Tian:
Decidability of Propositional Projection Temporal Logic with Infinite Models. TAMC 2007: 521-532 - Yun Fan:
There is an Sw-Cuppable Strongly c.e. Real. TAMC 2007: 212-221 - Rongquan Feng, Hongfeng Wu:
Encapsulated Scalar Multiplications and Line Functions in the Computation of Tate Pairing. TAMC 2007: 159-170 - Wangsen Feng, Li'ang Zhang, Wanling Qu, Hanpin Wang:
Approximation Algorithms for Maximum Edge Coloring Problem. TAMC 2007: 646-658 - Giordano Fusco, Eric Bach:
Phase Transition of Multivariate Polynomial Systems. TAMC 2007: 632-645 - Sushmita Gupta:
Feedback Arc Set Problem in Bipartite Tournaments. TAMC 2007: 354-361 - Markus Hinkelmann, Andreas Jakoby, Peer Stechert:
t -Private and Secure Auctions. TAMC 2007: 486-498 - Haiyang Hou, Guochuan Zhang:
The Hardness of Selective Network Design for Bottleneck Routing Games. TAMC 2007: 58-66 - Sun-Yuan Hsieh:
Path Embedding on Folded Hypercubes. TAMC 2007: 750-759 - Sun-Yuan Hsieh, Huang-Ming Gao, Shih-Cheng Yang:
On the Internal Steiner Tree Problem. TAMC 2007: 274-283 - Xiaoming Hu, Shangteng Huang:
A Provably Secure Blind Signature Scheme. TAMC 2007: 171-180 - Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai:
A Time Hierarchy Theorem for Nondeterministic Cellular Automata. TAMC 2007: 511-520 - Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer
:
Improving the Average Delay of Sorting. TAMC 2007: 330-341 - Akifumi Kawaguchi, Hiroshi Nagamochi:
Orthogonal Drawings for Plane Graphs with Specified Face Areas. TAMC 2007: 584-594 - Iordanis Kerenidis:
Quantum Multiparty Communication Complexity and Circuit Lower Bounds. TAMC 2007: 306-317 - Fanyu Kong, Jia Yu, Zhun Cai, Daxing Li:
New Left-to-Right Radix- r Signed-Digit Recoding Algorithm for Pairing-Based Cryptosystems. TAMC 2007: 189-198 - Stuart A. Kurtz, Janos Simon:
The Undecidability of the Generalized Collatz Problem. TAMC 2007: 542-553 - Angsheng Li:
Elementary Differences Among Jump Hierarchies. TAMC 2007: 79-88 - Minming Li
, Ze Feng, Ronald L. Graham, Frances F. Yao:
Approximately Optimal Trees for Group Key Management with Batch Updates. TAMC 2007: 284-295 - Zhimin Li, Xiang Li:
Learnable Algorithm on the Continuum. TAMC 2007: 408-415 - Xin Li, Tian Liu, Han Peng, Liyan Qian, Hongtao Sun, Jin Xu, Ke Xu, Jiaqi Zhu:
Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model. TAMC 2007: 624-631 - Yong Li, Jun-Hai Yong:
Efficient Exact Arithmetic over Constructive Reals. TAMC 2007: 440-449
skipping 40 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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 2025-02-16 12:19 CET 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