Остановите войну!
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 477 matches
- 2009
- Luigi Acerbi, Alberto Dennunzio, Enrico Formenti:
Conservation of some dynamical properties for operations on cellular automata. Theor. Comput. Sci. 410(38-40): 3685-3693 (2009) - Margareta Ackerman, Jeffrey O. Shallit:
Efficient enumeration of words in regular languages. Theor. Comput. Sci. 410(37): 3461-3470 (2009) - Heiner Ackermann, Heiko Röglin, Berthold Vöcking:
Pure Nash equilibria in player-specific and weighted congestion games. Theor. Comput. Sci. 410(17): 1552-1563 (2009) - Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez:
The complexity of clique graph recognition. Theor. Comput. Sci. 410(21-23): 2072-2083 (2009) - Artiom Alhazov, Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, Yurii Rogozhin:
On the size of computationally complete hybrid networks of evolutionary processors. Theor. Comput. Sci. 410(35): 3188-3197 (2009) - Artiom Alhazov, Ion Petre, Vladimir Rogojin:
The parallel complexity of signed graphs: Decidability results and an improved algorithm. Theor. Comput. Sci. 410(24-25): 2308-2315 (2009) - Jean-Paul Allouche, Narad Rampersad, Jeffrey O. Shallit:
Periodicity, repetitions, and orbits of an automatic sequence. Theor. Comput. Sci. 410(30-32): 2795-2803 (2009) - Noga Alon, Uri Stav:
Hardness of edge-modification problems. Theor. Comput. Sci. 410(47-49): 4920-4927 (2009) - María Alpuente, Santiago Escobar, José Iborra:
Termination of narrowing revisited. Theor. Comput. Sci. 410(46): 4608-4625 (2009) - Gianluca Amato, James Lipton, Robert McGrail:
On the algebraic structure of declarative programming languages. Theor. Comput. Sci. 410(46): 4626-4671 (2009) - Andris Ambainis, Nikolajs Nahimovs:
Improved constructions of quantum automata. Theor. Comput. Sci. 410(20): 1916-1922 (2009) - Omid Amini, Stéphane Pérennes, Ignasi Sau:
Hardness and approximation of traffic grooming. Theor. Comput. Sci. 410(38-40): 3751-3760 (2009) - Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat:
Efficient computations of l1 and l∞ rearrangement distances. Theor. Comput. Sci. 410(43): 4382-4390 (2009) - Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat:
Approximate string matching with address bit errors. Theor. Comput. Sci. 410(51): 5334-5346 (2009) - Eric Angel, Evripidis Bampis, Laurent Gourvès:
On the minimum hitting set of bundles problem. Theor. Comput. Sci. 410(45): 4534-4542 (2009) - Marcella Anselmo, Dora Giammarresi, Maria Madonia:
A computational model for tiling recognizable two-dimensional languages. Theor. Comput. Sci. 410(37): 3520-3529 (2009) - Marcella Anselmo, Maria Madonia:
Deterministic and unambiguous two-dimensional languages over one-letter alphabet. Theor. Comput. Sci. 410(16): 1477-1485 (2009) - Alberto Apostolico, Fabio Cunial:
The subsequence composition of a string. Theor. Comput. Sci. 410(43): 4360-4371 (2009) - Lars Arge, Christian Cachin, Andrzej Tarlecki:
Preface. Theor. Comput. Sci. 410(18): 1617 (2009) - Vikraman Arvind, Johannes Köbler, Wolfgang Lindner:
Parameterized learnability of juntas. Theor. Comput. Sci. 410(47-49): 4928-4936 (2009) - Vera Asodi, Christopher Umans:
The complexity of the matroid-greedoid partition problem. Theor. Comput. Sci. 410(8-10): 859-866 (2009) - Albert Atserias, Andrei A. Bulatov, Anuj Dawar:
Affine systems of equations and counting infinitary logic. Theor. Comput. Sci. 410(18): 1666-1683 (2009) - Jean-Yves Audibert, Rémi Munos, Csaba Szepesvári:
Exploration-exploitation tradeoff using variance estimates in multi-armed bandits. Theor. Comput. Sci. 410(19): 1876-1902 (2009) - John Augustine, Sudarshan Banerjee, Sandy Irani:
Strip packing with precedence constraints and strip packing with release times. Theor. Comput. Sci. 410(38-40): 3792-3803 (2009) - Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano:
On designing truthful mechanisms for online scheduling. Theor. Comput. Sci. 410(36): 3348-3356 (2009) - Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano:
Small stretch (alpha, beta)-spanners in the streaming model. Theor. Comput. Sci. 410(36): 3406-3413 (2009) - Baruch Awerbuch, Christian Scheideler:
Robust random number generation for peer-to-peer systems. Theor. Comput. Sci. 410(6-7): 453-466 (2009) - Ricardo Baeza-Yates, Véronique Bruyère, Olivier Delgrange, Rodrigo Scheihing:
On the size of Boyer-Moore automata. Theor. Comput. Sci. 410(43): 4432-4443 (2009) - Roberto Bagnara, Patricia M. Hill, Enea Zaffanella:
Applications of polyhedral computations to the analysis and verification of hardware and software systems. Theor. Comput. Sci. 410(46): 4672-4691 (2009) - Roberto Baldoni, Silvia Bonomi, Leonardo Querzoni, Sara Tucci Piergiovanni:
Investigating the existence and the regularity of Logarithmic Harary Graphs. Theor. Comput. Sci. 410(21-23): 2110-2121 (2009)
skipping 447 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-24 05:10 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