![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 17 matches
- 1996
- Svante Carlsson, Jingsen Chen, Christer Mattsson:
Heaps with Bits. Theor. Comput. Sci. 164(1&2): 1-12 (1996) - John Case, Sanjay Jain, Arun Sharma:
Anomalous Learning Helps Succinctness. Theor. Comput. Sci. 164(1&2): 13-28 (1996) - Krzysztof Diks, Andrzej Pelc:
Reliable Computations on Faulty EREW PRAM. Theor. Comput. Sci. 164(1&2): 107-122 (1996) - Clelia de Felice:
An Application of Hajós Factorizations to Variable-Length Codes. Theor. Comput. Sci. 164(1&2): 223-252 (1996) - James Allen Fill:
Limits and Rates of Convergence for the Distribution of Search Cost Under the Move-to-Front Rule. Theor. Comput. Sci. 164(1&2): 185-206 (1996) - Alain Finkel, Isabelle Tellier:
A Polynomial Algorithm for the Membership Problem with Categorial Grammars. Theor. Comput. Sci. 164(1&2): 207-221 (1996) - Arvind Gupta, Naomi Nishimura:
The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees. Theor. Comput. Sci. 164(1&2): 287-298 (1996) - John Harrison:
On Almost Cylindrical Languages and the Decidability of the D0L and PWD0L Primitivity Problems. Theor. Comput. Sci. 164(1&2): 29-40 (1996) - Pascal Hubert:
Propriétés combinatoires des suites définies par le billard dans les triangles pavants. Theor. Comput. Sci. 164(1&2): 165-183 (1996) - Costas S. Iliopoulos, Kunsoo Park:
A Work-Time Optimal Algorithm for Computing All String Covers. Theor. Comput. Sci. 164(1&2): 299-310 (1996) - Jack H. Lutz, Elvira Mayordomo
:
Cook Versus Karp-Levin: Separating Completeness Notions if NP is not Small. Theor. Comput. Sci. 164(1&2): 141-163 (1996) - Martin Middendorf:
Two-Dimensional Partitioning Problems. Theor. Comput. Sci. 164(1&2): 73-106 (1996) - David Moews:
Coin-Sliding and Go. Theor. Comput. Sci. 164(1&2): 253-276 (1996) - Christophe Picouleau:
Worst-Case Analysis of Fast Heuristics for Packing Squares into a Square. Theor. Comput. Sci. 164(1&2): 59-72 (1996) - Kai Salomaa, Derick Wood, Sheng Yu:
Structural Equivalence and ET0L Grammars. Theor. Comput. Sci. 164(1&2): 123-140 (1996) - Víctor F. Sirvent:
Relationships Between the Dynamical Systems Associated to the Rauzy Substitutions. Theor. Comput. Sci. 164(1&2): 41-57 (1996) - Ioan Tomescu
:
On the Asymptotic Average Length of a Maximum Common Subsequence for Words Over a Finite Alphabet. Theor. Comput. Sci. 164(1&2): 277-285 (1996)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-06 10:20 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