Остановите войну!
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 46 matches
- 2003
- Tatsuya Akutsu, Satoru Miyano, Satoru Kuhara:
A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis. Theor. Comput. Sci. 292(2): 481-495 (2003) - Jean-Paul Allouche, Michael Baake, Julien Cassaigne, David Damanik:
Palindrome complexity. Theor. Comput. Sci. 292(1): 9-31 (2003) - Setsuo Arikawa, Koichi Furukawa, Shinichi Morishita, Hiroshi Motoda:
Preface. Theor. Comput. Sci. 292(2): 343-344 (2003) - Holger Austinat, Volker Diekert, Ulrich Hertrampf:
A structural property of regular frequency computations. Theor. Comput. Sci. 292(1): 33-43 (2003) - Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch:
Squaring transducers: an efficient procedure for deciding functionality and sequentiality. Theor. Comput. Sci. 292(1): 45-63 (2003) - Danièle Beauquier:
On probabilistic timed automata. Theor. Comput. Sci. 292(1): 65-84 (2003) - André Berthiaume, John D. Rogers:
Foreword. Theor. Comput. Sci. 292(3): 573 (2003) - Srecko Brlek, Christophe Reutenauer:
On a valuation of rational subsets of Zk Dédié à Jean Berstel. Theor. Comput. Sci. 292(1): 85-96 (2003) - Véronique Bruyère:
Cumulative defect. Theor. Comput. Sci. 292(1): 97-109 (2003) - Arturo Carpi, Aldo de Luca:
Semiperiodic words and root-conjugacy. Theor. Comput. Sci. 292(1): 111-130 (2003) - Wei-Mei Chen, Gen-Huey Chen:
Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures. Theor. Comput. Sci. 292(3): 667-677 (2003) - Christian Choffrut:
Minimizing subsequential transducers: a survey. Theor. Comput. Sci. 292(1): 131-143 (2003) - Robert Cori, Gilles Schaeffer:
Description trees and Tutte formulas. Theor. Comput. Sci. 292(1): 165-183 (2003) - Maxime Crochemore:
Reducing space for index implementation. Theor. Comput. Sci. 292(1): 185-197 (2003) - Jack Jie Dai:
A stronger Kolmogorov zero-one law for resource-bounded measure. Theor. Comput. Sci. 292(3): 723-732 (2003) - Andrzej Ehrenfeucht, Tero Harju, Ion Petre, David M. Prescott, Grzegorz Rozenberg:
Formal systems for gene assembly in ciliates. Theor. Comput. Sci. 292(1): 199-219 (2003) - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Forbidding-enforcing systems. Theor. Comput. Sci. 292(3): 611-638 (2003) - Lance Fortnow:
One complexity theorist's view of quantum computing. Theor. Comput. Sci. 292(3): 597-610 (2003) - Christiane Frougny:
On-line digit set conversion in real base. Theor. Comput. Sci. 292(1): 221-235 (2003) - João Gama:
Iterative Bayes. Theor. Comput. Sci. 292(2): 417-430 (2003) - Petr Hájek, Martin Holena:
Formal logics of discovery and hypothesis formation by machine. Theor. Comput. Sci. 292(2): 345-357 (2003) - Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda:
Uniform characterizations of polynomial-query learnabilities. Theor. Comput. Sci. 292(2): 377-385 (2003) - Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
A practical algorithm to find the best subsequence patterns. Theor. Comput. Sci. 292(2): 465-479 (2003) - Pawel Horodecki, John A. Smolin, Barbara M. Terhal, Ashish V. Thapliyal:
Rank two bipartite bound entangled states do not exist. Theor. Comput. Sci. 292(3): 589-596 (2003) - Hermann Jung, Maria J. Serna, Paul G. Spirakis:
An efficient deterministic parallel algorithm for two processors precedence constraint scheduling. Theor. Comput. Sci. 292(3): 639-652 (2003) - Juhani Karhumäki, Ján Manuch, Wojciech Plandowski:
A defect theorem for bi-infinite words. Theor. Comput. Sci. 292(1): 237-243 (2003) - Genshiro Kitagawa, Tomoyuki Higuchi, Fumiyo N. Kondo:
Smoothness prior approach to explore mean structure in large-scale time series. Theor. Comput. Sci. 292(2): 431-446 (2003) - Yoshimitsu Kudoh, Makoto Haraguchi, Yoshiaki Okubo:
Data abstractions for decision tree induction. Theor. Comput. Sci. 292(2): 387-416 (2003) - Steffen Lange, Gunter Grieser:
Variants of iterative learning. Theor. Comput. Sci. 292(2): 359-376 (2003) - Xuemin Lin, Peter Eades:
Towards area requirements for drawing hierarchically planar graphs. Theor. Comput. Sci. 292(3): 679-695 (2003)
skipping 16 more matches
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-06-06 09:02 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