Остановите войну!
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 30 matches
- 2006
- Stéphane Ballet:
An improvement of the construction of the D.V. and G.V. Chudnovsky algorithm for multiplication in finite fields. Theor. Comput. Sci. 352(1-3): 293-305 (2006) - Xuewen Bao, Frank K. Hwang, Qiao Li:
Rearrangeability of bit permutation networks. Theor. Comput. Sci. 352(1-3): 197-214 (2006) - Srecko Brlek, Serge Dulucq, A. Ladouceur, Laurent Vuillon:
Combinatorial properties of smooth infinite words. Theor. Comput. Sci. 352(1-3): 306-317 (2006) - F. H. Chang, J. Y. Guo, Frank K. Hwang:
Wide-sense nonblocking for multi-logdN networks under various routing strategies. Theor. Comput. Sci. 352(1-3): 232-239 (2006) - Thomas Colcombet, Damian Niwinski:
On the positional determinacy of edge-labeled games. Theor. Comput. Sci. 352(1-3): 190-196 (2006) - Gautam K. Das, Sandip Das, Subhas C. Nandy:
Range assignment for energy efficient broadcasting in linear radio networks. Theor. Comput. Sci. 352(1-3): 332-341 (2006) - Marie Ferbus-Zanda, Serge Grigorieff:
Kolmogorov complexities Kmax, Kmin on computable partially ordered sets. Theor. Comput. Sci. 352(1-3): 159-180 (2006) - Greg N. Frederickson, Roberto Solis-Oba:
Efficient algorithms for robustness in resource allocation and scheduling problems. Theor. Comput. Sci. 352(1-3): 250-265 (2006) - Amy Glen:
Occurrences of palindromes in characteristic Sturmian words. Theor. Comput. Sci. 352(1-3): 31-46 (2006) - Mohammad Taghi Hajiaghayi, Tom Leighton:
On the max-flow min-cut ratio for directed multicommodity flows. Theor. Comput. Sci. 352(1-3): 318-321 (2006) - Pawel Hitczenko, Jeremy R. Johnson, Hung-Jen Huang:
Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform. Theor. Comput. Sci. 352(1-3): 8-30 (2006) - Trinh N. D. Huynh, Wing-Kai Hon, Tak Wah Lam, Wing-Kin Sung:
Approximate string matching using compressed suffix arrays. Theor. Comput. Sci. 352(1-3): 240-249 (2006) - Oscar H. Ibarra, Zhe Dang:
On the solvability of a class of diophantine equations and applications. Theor. Comput. Sci. 352(1-3): 342-346 (2006) - Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Leen Stougie:
Erratum to "News from the online traveling repairman" [TCS 295 (1-3) (2003) 279-294]. Theor. Comput. Sci. 352(1-3): 347-348 (2006) - T. K. Subrahmonian Moothathu:
Set of periods of additive cellular automata. Theor. Comput. Sci. 352(1-3): 226-231 (2006) - Dhruv Mubayi, György Turán, Yi Zhao:
The DNF exception problem. Theor. Comput. Sci. 352(1-3): 85-96 (2006) - Gonzalo Navarro, Edgar Chávez:
A metric index for approximate string matching. Theor. Comput. Sci. 352(1-3): 266-279 (2006) - Alessandro Dal Palù, Enrico Pontelli, Desh Ranjan:
Sequential and parallel algorithms for the NCA problem on pure pointer machines. Theor. Comput. Sci. 352(1-3): 108-135 (2006) - Periklis A. Papakonstantinou:
Hierarchies for classes of priority algorithms for Job Scheduling. Theor. Comput. Sci. 352(1-3): 181-189 (2006) - Patricio V. Poblete, J. Ian Munro, Thomas Papadakis:
The binomial transform and the analysis of skip lists. Theor. Comput. Sci. 352(1-3): 136-158 (2006) - Genjiro Tanaka:
On syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups. Theor. Comput. Sci. 352(1-3): 57-70 (2006) - Véronique Terrier:
Closure properties of cellular automata. Theor. Comput. Sci. 352(1-3): 97-107 (2006) - Ioan Tomescu:
A characterization of the words occurring as factors in a minimum number of words. Theor. Comput. Sci. 352(1-3): 329-331 (2006) - Weili Wu, Hongwei Du, Xiaohua Jia, Yingshu Li, Scott C.-H. Huang:
Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theor. Comput. Sci. 352(1-3): 1-7 (2006) - E. C. Xavier, Flávio Keidi Miyazawa:
Approximation schemes for knapsack problems with shelf divisions. Theor. Comput. Sci. 352(1-3): 71-84 (2006) - Amr M. Youssef, Guang Gong:
On linear complexity of sequences over GF(2n). Theor. Comput. Sci. 352(1-3): 288-292 (2006) - Zhu Zhao, Zhongqi Dong, Yongge Wang:
Security analysis of a password-based authentication protocol proposed to IEEE 1363. Theor. Comput. Sci. 352(1-3): 280-287 (2006) - Daming Zhu, Lusheng Wang:
On the complexity of unsigned translocation distance. Theor. Comput. Sci. 352(1-3): 322-328 (2006) - Igor E. Zverovich:
Satgraphs and independent domination. Part 1. Theor. Comput. Sci. 352(1-3): 47-56 (2006) - Igor E. Zverovich, Olga I. Zverovich:
Independent domination in hereditary classes. Theor. Comput. Sci. 352(1-3): 215-225 (2006)
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-08-10 17:27 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