Остановите войну!
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 21 matches
- 1998
- Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir:
On a Question of A. Salomaa: The Equational Theory of Regular Expressions Over a Singleton Alphabet is not Finitely Based. Theor. Comput. Sci. 209(1-2): 163-178 (1998) - Eric Allender, Jia Jiao, Meena Mahajan, V. Vinay:
Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds. Theor. Comput. Sci. 209(1-2): 47-86 (1998) - Edoardo Amaldi, Viggo Kann:
On the Approximability of Minimizing Nonzero Variables or Unsatisfied Relations in Linear Systems. Theor. Comput. Sci. 209(1-2): 237-260 (1998) - Bruno Apolloni, Claudio Gentile:
Sample Size Lower Bounds in PAC Learning by Algorithmic Complexity Theory. Theor. Comput. Sci. 209(1-2): 141-162 (1998) - Martin Beaudry:
Languages Recognized by Finite Aperiodic Groupoids. Theor. Comput. Sci. 209(1-2): 299-317 (1998) - Philippe Béguin, Antonella Cresti:
General Information Dispersal Algorithms. Theor. Comput. Sci. 209(1-2): 87-105 (1998) - François Blanchard, Petr Kurka:
Language Complexity of Rotations and Sturmian Sequences. Theor. Comput. Sci. 209(1-2): 179-193 (1998) - Hans L. Bodlaender:
A Partial k-Arboretum of Graphs with Bounded Treewidth. Theor. Comput. Sci. 209(1-2): 1-45 (1998) - Dany Breslauer:
On Competitive On-Line Paging with Lookahead. Theor. Comput. Sci. 209(1-2): 365-375 (1998) - Charles J. Colbourn, Guoliang Xue:
A Linear Time Algorithm for Computing the Most Reliable Source on a Series-Parallel Graph with Unreliable Edges. Theor. Comput. Sci. 209(1-2): 331-345 (1998) - Erzsébet Csuhaj-Varjú, Alica Kelemenová:
Team Behaviour in Eco-Grammar Systems. Theor. Comput. Sci. 209(1-2): 213-224 (1998) - Marc Demange, Pascal Grisoni, Vangelis Th. Paschos:
Differential Approximation Algorithms for Some Combinatorial Optimization Problems. Theor. Comput. Sci. 209(1-2): 107-122 (1998) - T. Downarowicz, Y. Lacroix:
Merit Factors and Morse Sequences. Theor. Comput. Sci. 209(1-2): 377-387 (1998) - Rodney G. Downey, Michael R. Fellows:
Threshold Dominating Sets and an Improved Characterization of W[2]. Theor. Comput. Sci. 209(1-2): 123-140 (1998) - Luisa Gargano, Adele A. Rescigno:
Communication Complexity of Fault-Tolerant Information Diffusion. Theor. Comput. Sci. 209(1-2): 195-211 (1998) - Ewa Malesinska, Alessandro Panconesi:
On the Hardness of Allocating Frequences for Hybrid Networks. Theor. Comput. Sci. 209(1-2): 347-363 (1998) - Carsten Rössner, Jean-Pierre Seifert:
On the Hardness of Approximating Shortest Integer Relations among Rational Numbers. Theor. Comput. Sci. 209(1-2): 287-297 (1998) - Rimli Sengupta, H. Venkateswaran:
A Lower Bound for Monotone Arithmetic Circuits Computing 0-1 Permanent. Theor. Comput. Sci. 209(1-2): 389-398 (1998) - György Vaszil:
On Simulating Non-Returning PC Grammar Systems with Returning Systems. Theor. Comput. Sci. 209(1-2): 319-329 (1998) - Laurent Vuillon:
Combinatoire des motifs d'une suite sturmienne bidimensionnelle. Theor. Comput. Sci. 209(1-2): 261-285 (1998) - Marius Zimand:
On the Size of Classes with Weak Membership Properties. Theor. Comput. Sci. 209(1-2): 225-235 (1998)
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-07-19 13:36 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