Остановите войну!
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
- 2004
- Vicente Ruiz de Angulo, Carme Torras:
Neural learning methods yielding functional invariance. Theor. Comput. Sci. 320(1): 111-121 (2004) - Joshua J. Arulanandham, Cristian Calude, Michael J. Dinneen:
A fast natural algorithm for searching. Theor. Comput. Sci. 320(1): 3-13 (2004) - Marie-Pierre Béal, Anne Bergeron, Sylvie Corteel, Mathieu Raffinot:
An algorithmic view of gene teams. Theor. Comput. Sci. 320(2-3): 395-418 (2004) - Asa Ben-Hur, Alexander Roitershtein, Hava T. Siegelmann:
On probabilistic analog automata. Theor. Comput. Sci. 320(2-3): 449-464 (2004) - André Berthiaume, Todd Bittner, Ljubomir Perkovic, Amber Settle, Janos Simon:
Bounding the firing synchronization problem on a ring. Theor. Comput. Sci. 320(2-3): 213-228 (2004) - Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich:
New spectral lower bounds on the bisection width of graphs. Theor. Comput. Sci. 320(2-3): 155-174 (2004) - Eli Biham, Gilles Brassard, Dan Kenigsberg, Tal Mor:
Quantum computing without entanglement. Theor. Comput. Sci. 320(1): 15-33 (2004) - Carlo Blundo, Paolo D'Arco, Vanesa Daza, Carles Padró:
Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures. Theor. Comput. Sci. 320(2-3): 269-291 (2004) - Christian Choffrut, Yael Haddad:
String-matching with OBDDs. Theor. Comput. Sci. 320(2-3): 187-198 (2004) - Simona Cocco, Rémi Monasson:
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances. Theor. Comput. Sci. 320(2-3): 345-372 (2004) - Anne Condon, Beth Davy, Baharak Rastegari, Shelly Zhao, Finbarr Tarrant:
Classifying RNA pseudoknotted structures. Theor. Comput. Sci. 320(1): 35-50 (2004) - Vilhelm Dahllöf, Peter Jonsson, Richard Beigel:
Algorithms for four variants of the exact satisfiability problem. Theor. Comput. Sci. 320(2-3): 373-394 (2004) - Mark Daley, Lila Kari, Ian McQuillan:
Families of languages defined by ciliate bio-operations. Theor. Comput. Sci. 320(1): 51-69 (2004) - Michelangelo Diligenti, Marco Gori, Marco Maggini:
Neural computation, social networks, and topological spectra. Theor. Comput. Sci. 320(1): 71-87 (2004) - Michael Domaratzki:
Deletion along trajectories. Theor. Comput. Sci. 320(2-3): 293-313 (2004) - Gillian Z. Elston, Gretchen Ostheimer:
On groups whose word problem is solved by a~counter automaton. Theor. Comput. Sci. 320(2-3): 175-185 (2004) - Patrick Healy, Ago Kuusik:
Algorithms for multi-level graph planarity testing and layout. Theor. Comput. Sci. 320(2-3): 331-344 (2004) - John M. Hitchcock:
The size of SPP. Theor. Comput. Sci. 320(2-3): 495-503 (2004) - Markus Hunziker, António Machiavelo, Jihun Park:
Chebyshev polynomials over finite fields and reversibility of -automata on square grids. Theor. Comput. Sci. 320(2-3): 465-483 (2004) - Oscar H. Ibarra:
On the computational complexity of membrane systems. Theor. Comput. Sci. 320(1): 89-109 (2004) - Liying Kang, Moo Young Sohn, T. C. Edwin Cheng:
Paired-domination in inflated graphs. Theor. Comput. Sci. 320(2-3): 485-494 (2004) - Martin Middendorf, David F. Manlove:
Combined super-/substring and super-/subsequence problems. Theor. Comput. Sci. 320(2-3): 247-267 (2004) - Alexander Okhotin:
On the number of nonterminals in linear conjunctive grammars. Theor. Comput. Sci. 320(2-3): 419-448 (2004) - Olivier Powell:
A note on measuring in P. Theor. Comput. Sci. 320(2-3): 229-246 (2004) - Adam Prügel-Bennett:
When a genetic algorithm outperforms hill-climbing. Theor. Comput. Sci. 320(1): 135-153 (2004) - Grzegorz Rozenberg:
Preface. Theor. Comput. Sci. 320(1): 1-2 (2004) - Arto Salomaa, Derick Wood, Sheng Yu:
On the state complexity of reversals of regular languages. Theor. Comput. Sci. 320(2-3): 315-329 (2004) - Tobias Storch, Ingo Wegener:
Real royal road functions for constant population size. Theor. Comput. Sci. 320(1): 123-134 (2004) - Jinjiang Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng:
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan. Theor. Comput. Sci. 320(2-3): 199-212 (2004)
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-27 13: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