Остановите войну!
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 29 matches
- 2005
- Ali Aberkane, James D. Currie:
The Thue-Morse word contains circular 5/2+ power free words of every length. Theor. Comput. Sci. 332(1-3): 573-581 (2005) - Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière:
On the differential approximation of MIN SET COVER. Theor. Comput. Sci. 332(1-3): 497-513 (2005) - Jean Berstel, Luc Boasson, Michel Latteux:
Mixed languages. Theor. Comput. Sci. 332(1-3): 179-198 (2005) - Franz-Josef Brandenburg, Konstantin Skodinis:
Finite graph automata for linear and boundary graph languages. Theor. Comput. Sci. 332(1-3): 199-232 (2005) - Jesper Makholm Byskov, Bolette Ammitzbøll Madsen, Bjarke Skjernaa:
New algorithms for Exact Satisfiability. Theor. Comput. Sci. 332(1-3): 515-541 (2005) - Jean Cardinal, Stefan Langerman:
Designing small keyboards is hard. Theor. Comput. Sci. 332(1-3): 405-415 (2005) - A. Cincotti:
Three-player partizan games. Theor. Comput. Sci. 332(1-3): 367-389 (2005) - Maxime Crochemore, Jacques Désarménien, Dominique Perrin:
A note on the Burrows - CWheeler transformation. Theor. Comput. Sci. 332(1-3): 567-572 (2005) - Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström:
Counting models for 2SAT and 3SAT formulae. Theor. Comput. Sci. 332(1-3): 265-291 (2005) - Alain Daurat:
Determination of Q-convex sets by X-rays. Theor. Comput. Sci. 332(1-3): 19-45 (2005) - Marc Demange, Vangelis Th. Paschos:
On-line vertex-covering. Theor. Comput. Sci. 332(1-3): 83-108 (2005) - Bernhard Fuchs, Winfried Hochstättler, Walter Kern:
Online matching on a line. Theor. Comput. Sci. 332(1-3): 251-264 (2005) - Reza Gharavi, Venkat Anantharam:
An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices. Theor. Comput. Sci. 332(1-3): 543-557 (2005) - Longtao He, Binxing Fang, Jie Sui:
The wide window string matching algorithm. Theor. Comput. Sci. 332(1-3): 391-404 (2005) - H. J. Huang, Li Jiao, To-Yat Cheung:
Property-preserving subnet reductions for designing manufacturing systems with shared resources. Theor. Comput. Sci. 332(1-3): 461-485 (2005) - Nikola Jevtic, Alon Orlitsky, Narayana P. Santhanam:
A lower bound on compression of unknown alphabets. Theor. Comput. Sci. 332(1-3): 293-311 (2005) - Lila Kari, Petr Sosík:
Aspects of shuffle and deletion on trajectories. Theor. Comput. Sci. 332(1-3): 47-61 (2005) - Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu:
k-Center problems with minimum coverage. Theor. Comput. Sci. 332(1-3): 1-17 (2005) - Sylvain Lombardy, Jacques Sakarovitch:
Derivatives of rational expressions with multiplicity. Theor. Comput. Sci. 332(1-3): 141-177 (2005) - Hiroshi Nagamochi:
On the one-sided crossing minimization in a bipartite graph with large degrees. Theor. Comput. Sci. 332(1-3): 417-446 (2005) - Harumichi Nishimura, Masanao Ozawa:
Uniformity of quantum circuit families for error-free algorithms. Theor. Comput. Sci. 332(1-3): 487-496 (2005) - Marco Pedicini:
Greedy expansions and sets with deleted digits. Theor. Comput. Sci. 332(1-3): 313-336 (2005) - Steven S. Seiden, Peter P. Chen, Robert F. Lax, Jianhua Chen, Guoli Ding:
New bounds for randomized busing. Theor. Comput. Sci. 332(1-3): 63-81 (2005) - Maria J. Serna, Luca Trevisan, Fatos Xhafa:
The approximability of non-Boolean satisfiability problems and restricted integer programming. Theor. Comput. Sci. 332(1-3): 123-139 (2005) - Qingmin Shi, Joseph F. JáJá:
A new framework for addressing temporal range queries and some preliminary results. Theor. Comput. Sci. 332(1-3): 109-121 (2005) - Salvatore La Torre, Aniello Murano, Margherita Napoli:
Weak Muller acceptance conditions for tree automata. Theor. Comput. Sci. 332(1-3): 233-250 (2005) - Dekel Tsur:
Sequencing by hybridization with errors: handling longer sequences. Theor. Comput. Sci. 332(1-3): 559-566 (2005) - Klaus Weihrauch, Ning Zhong:
Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing. Theor. Comput. Sci. 332(1-3): 337-366 (2005) - Hong-Gwa Yeh, Xuding Zhu:
Resource-sharing system scheduling and circular chromatic number. Theor. Comput. Sci. 332(1-3): 447-460 (2005)
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-04-25 09:28 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