Остановите войну!
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 41 matches
- 2001
- Jorge Almeida, Pedro V. Silva:
SC-hyperdecidability of R. Theor. Comput. Sci. 255(1-2): 569-591 (2001) - Bruno Apolloni, Dario Malchiodi:
Gaining degrees of freedom in subsymbolic learning. Theor. Comput. Sci. 255(1-2): 295-321 (2001) - Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe:
Approximation algorithms for maximum two-dimensional pattern matching. Theor. Comput. Sci. 255(1-2): 51-62 (2001) - Vikraman Arvind, Johannes Köbler:
On pseudorandomness and resource-bounded measure. Theor. Comput. Sci. 255(1-2): 205-221 (2001) - Elena Barcucci, Simone Rinaldi:
Some linear recurrences and their combinatorial interpretation by means of regular languages. Theor. Comput. Sci. 255(1-2): 679-686 (2001) - Vincent D. Blondel, Olivier Bournez, Pascal Koiran, Christos H. Papadimitriou, John N. Tsitsiklis:
Deciding stability and mortality of piecewise affine dynamical systems. Theor. Comput. Sci. 255(1-2): 687-696 (2001) - Tiziana Calamoneri, Annalisa Massini:
Optimal three-dimensional layout of interconnection networks. Theor. Comput. Sci. 255(1-2): 263-279 (2001) - Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang:
Recursively enumerable reals and Chaitin Omega numbers. Theor. Comput. Sci. 255(1-2): 125-149 (2001) - Yu-Wei Chen, Kuo-Liang Chung:
Improved fault-tolerant sorting algorithm in hypercubes. Theor. Comput. Sci. 255(1-2): 649-658 (2001) - Chiuyuan Chen, Kaiping Wu:
Disproving a conjecture on planar visibility graphs. Theor. Comput. Sci. 255(1-2): 659-665 (2001) - Erzsébet Csuhaj-Varjú, György Vaszil:
On context-free parallel communicating grammar systems: synchronization, communication, and normal forms. Theor. Comput. Sci. 255(1-2): 511-538 (2001) - Felipe Cucker:
On weak and weighted computations over the real closure of Q. Theor. Comput. Sci. 255(1-2): 593-600 (2001) - Xavier Droubay, Jacques Justin, Giuseppe Pirillo:
Episturmian words and some constructions of de Luca and Rauzy. Theor. Comput. Sci. 255(1-2): 539-553 (2001) - Ivo Düntsch, Hui Wang, Stephen McCloskey:
A relation - algebraic approach to the region connection calculus. Theor. Comput. Sci. 255(1-2): 63-83 (2001) - Thomas Erlebach, Klaus Jansen:
The complexity of path coloring and call scheduling. Theor. Comput. Sci. 255(1-2): 33-50 (2001) - Tomás Feder:
Fanout limitations on constraint systems. Theor. Comput. Sci. 255(1-2): 281-293 (2001) - Olivier Finkel:
Locally finite languages. Theor. Comput. Sci. 255(1-2): 223-261 (2001) - Paul F. Fischer, Franco P. Preparata, John E. Savage:
Generalized scans and tridiagonal systems. Theor. Comput. Sci. 255(1-2): 423-436 (2001) - Hervé Fournier:
Sparse NP-complete problems over the reals with addition. Theor. Comput. Sci. 255(1-2): 607-610 (2001) - Vesa Halava, Mika Hirvensalo, Ronald de Wolf:
Marked PCP is decidable. Theor. Comput. Sci. 255(1-2): 193-204 (2001) - Juha Honkala:
On Parikh slender context-free languages. Theor. Comput. Sci. 255(1-2): 667-677 (2001) - Roberto Incitti:
The growth function of context-free languages. Theor. Comput. Sci. 255(1-2): 601-605 (2001) - Sanjay Jain:
Branch and bound on the network model. Theor. Comput. Sci. 255(1-2): 107-123 (2001) - Guohua Jin, Zhiyuan Li, Fujie Chen:
A theoretical foundation for program transformations to reduce cache thrashing due to true data sharing. Theor. Comput. Sci. 255(1-2): 449-481 (2001) - Jacques Justin, Giuseppe Pirillo:
Fractional powers in Sturmian words. Theor. Comput. Sci. 255(1-2): 363-376 (2001) - Jukka A. Koskinen:
Non-injective knapsack public-key cryptosystems. Theor. Comput. Sci. 255(1-2): 401-422 (2001) - Ravi Kumar, D. Sivakumar:
On the unique shortest lattice vector problem. Theor. Comput. Sci. 255(1-2): 641-648 (2001) - Luis-Miguel Lopez, Philippe Narbel:
Substitutions and interval exchange transformations of rotation class. Theor. Comput. Sci. 255(1-2): 323-344 (2001) - Sabrina Mantaci, Antonio Restivo:
Codes and equations on trees. Theor. Comput. Sci. 255(1-2): 483-509 (2001) - Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano:
Dynamically maintaining the widest k-dense corridor. Theor. Comput. Sci. 255(1-2): 627-639 (2001)
skipping 11 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-05-28 13:17 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