Остановите войну!
for scientists:
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 16 matches
- 2013
- Zhixiang Chen, Bin Fu, Yang Liu, Robert T. Schweller:
On testing monomials in multivariate polynomials. Theor. Comput. Sci. 497: 39-54 (2013) - Lin Chen, Guochuan Zhang:
Approximation algorithms for a bi-level knapsack problem. Theor. Comput. Sci. 497: 1-12 (2013) - Yukun Cheng, Wei Yu, Guochuan Zhang:
Strategy-proof approximation mechanisms for an obnoxious facility game on networks. Theor. Comput. Sci. 497: 154-163 (2013) - Zhenhua Duan, Nan Zhang, Maciej Koutny:
A complete proof system for propositional projection temporal logic. Theor. Comput. Sci. 497: 84-107 (2013) - Xiaofeng Gao, Zaixin Lu, Weili Wu, Bin Fu:
Algebraic data retrieval algorithms for multi-channel wireless data broadcast. Theor. Comput. Sci. 497: 123-130 (2013) - Fei Li:
A comprehensive study of an online packet scheduling algorithm. Theor. Comput. Sci. 497: 31-38 (2013) - Fei Li:
A near-optimal memoryless online algorithm for FIFO buffering two packet classes. Theor. Comput. Sci. 497: 164-172 (2013) - Deying Li, Zewen Liu, Yi Hong, Wenping Chen, Huan Ma:
Minimum energy multicast/broadcast routing with reception cost in wireless sensor networks. Theor. Comput. Sci. 497: 173-180 (2013) - Qinghai Liu, Xiaohui Huang, Zhao Zhang:
Optimally restricted edge connected elementary Harary graphs. Theor. Comput. Sci. 497: 131-138 (2013) - Hui Liu, Zewen Liu, Deying Li, Xianling Lu, Hongwei Du:
Approximation algorithms for minimum latency data aggregation in wireless sensor networks with directional antenna. Theor. Comput. Sci. 497: 139-153 (2013) - Ming Liu, Feifeng Zheng, Shijin Wang, Yinfeng Xu:
Approximation algorithms for parallel machine scheduling with linear deterioration. Theor. Comput. Sci. 497: 108-111 (2013) - Radwa El Shawi, Joachim Gudmundsson:
Fast query structures in anisotropic media. Theor. Comput. Sci. 497: 112-122 (2013) - Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, Yoshio Okamoto:
The complexity of the stamp folding problem. Theor. Comput. Sci. 497: 13-19 (2013) - Boting Yang:
Euclidean chains and their shortcuts. Theor. Comput. Sci. 497: 55-67 (2013) - Nan Zhang, Zhenhua Duan, Cong Tian:
A cylinder computation model for many-core parallel computing. Theor. Comput. Sci. 497: 68-83 (2013) - Yongding Zhu, Jinhui Xu:
Improved algorithms for the farthest colored Voronoi diagram of segments. Theor. Comput. Sci. 497: 20-30 (2013)
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-05-05 11:54 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