Остановите войну!
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 567 matches
- 2011
- Uri Abraham:
Logical classification of distributed algorithms (Bakery algorithms as an example). Theor. Comput. Sci. 412(25): 2724-2745 (2011) - Fuad Abujarad, Sandeep S. Kulkarni:
Automated constraint-based addition of nonmasking and stabilizing fault-tolerance. Theor. Comput. Sci. 412(33): 4228-4246 (2011) - Luca Aceto, Taolue Chen, Anna Ingólfsdóttir, Bas Luttik, Jaco van de Pol:
On the axiomatizability of priority II. Theor. Comput. Sci. 412(28): 3035-3044 (2011) - Luca Aceto, Matteo Cimini, Anna Ingólfsdóttir, Mohammad Reza Mousavi, Michel A. Reniers:
SOS rule formats for zero and unit elements. Theor. Comput. Sci. 412(28): 3045-3071 (2011) - Jirí Adámek, Stefan Milius, Jirí Velebil:
On second-order iterative monads. Theor. Comput. Sci. 412(38): 4969-4988 (2011) - Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Faster parameterized algorithms for minor containment. Theor. Comput. Sci. 412(50): 7018-7028 (2011) - Foto N. Afrati:
Determinacy and query rewriting for conjunctive queries and views. Theor. Comput. Sci. 412(11): 1005-1021 (2011) - Manindra Agrawal, Angsheng Li:
Theory and applications of models of computation (TAMC 2008). Theor. Comput. Sci. 412(18): 1645 (2011) - Joaquín Aguado, Michael Mendler:
Constructive semantics for instantaneous reactions. Theor. Comput. Sci. 412(11): 931-961 (2011) - Yohji Akama:
Set systems: Order types, continuous nondeterministic deformations, and quasi-orders. Theor. Comput. Sci. 412(45): 6235-6251 (2011) - Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu, Takeyuki Tamura:
Exact algorithms for computing the tree edit distance between unordered trees. Theor. Comput. Sci. 412(4-5): 352-364 (2011) - Susanne Albers, Alberto Marchetti-Spaccamela:
Preface. Theor. Comput. Sci. 412(24): 2563 (2011) - Natasha Alechina, Mehdi Dastani, Brian Logan, John-Jules Ch. Meyer:
Reasoning about plan revision in BDI agent programs. Theor. Comput. Sci. 412(44): 6115-6134 (2011) - Artiom Alhazov, Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan:
P systems with minimal insertion and deletion. Theor. Comput. Sci. 412(1-2): 136-144 (2011) - Artiom Alhazov, Sergey Verlan:
Minimization strategies for maximally parallel multiset rewriting systems. Theor. Comput. Sci. 412(17): 1581-1591 (2011) - Paola Alimonti, Esteban Feuerstein, Luigi Laura, Umberto Nanni:
Linear time analysis of properties of conflict-free and general Petri nets. Theor. Comput. Sci. 412(4-5): 320-338 (2011) - Jean-Paul Allouche, Laurence Maillard-Teyssier:
Inconstancy of finite and infinite sequences. Theor. Comput. Sci. 412(22): 2268-2281 (2011) - Yaniv Altshuler, Alfred M. Bruckstein:
Static and expanding grid coverage with ant robots: Complexity results. Theor. Comput. Sci. 412(35): 4661-4674 (2011) - Eduardo Álvarez-Miranda, Xujin Chen, Jie Hu, Xiaodong Hu, Alfredo Candia-Véjar:
Deterministic risk control for cost-effective network connections. Theor. Comput. Sci. 412(3): 257-264 (2011) - Carme Àlvarez, Maria J. Blesa, Maria J. Serna:
The robustness of stability under link and node failures. Theor. Comput. Sci. 412(50): 6855-6878 (2011) - Kazuyuki Amano, Jun Tarui:
A well-mixed function with circuit complexity 5n: Tightness of the Lachish-Raz-type bounds. Theor. Comput. Sci. 412(18): 1646-1651 (2011) - Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey S. Goncharov:
Inductive inference and computable numberings. Theor. Comput. Sci. 412(18): 1652-1668 (2011) - Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat:
Approximate string matching with stuck address bits. Theor. Comput. Sci. 412(29): 3537-3544 (2011) - Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Efficient algorithms for consensus string problems minimizing both distance sum and radius. Theor. Comput. Sci. 412(39): 5239-5246 (2011) - Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal:
Sorting and selection on dynamic data. Theor. Comput. Sci. 412(24): 2564-2576 (2011) - Mikhail Andreev, Ilya P. Razenshteyn, Alexander Shen:
Not every domain of a plain decompressor contains the domain of a prefix-free one. Theor. Comput. Sci. 412(4-5): 482-486 (2011) - Hajnal Andréka, Szabolcs Mikulás, István Németi:
The equational theory of Kleene lattices. Theor. Comput. Sci. 412(52): 7099-7108 (2011) - Miguel E. Andrés, Catuscia Palamidessi, Peter van Rossum, Ana Sokolova:
Information hiding in probabilistic concurrent systems. Theor. Comput. Sci. 412(28): 3072-3089 (2011) - Enrico Angelelli, Carlo Filippi:
On the complexity of interval scheduling with a resource constraint. Theor. Comput. Sci. 412(29): 3650-3657 (2011) - Elliot Anshelevich, Bugra Çaskurlu:
Exact and approximate equilibria for optimal group network formation. Theor. Comput. Sci. 412(39): 5298-5314 (2011)
skipping 537 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-29 00:06 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