![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 81 matches
- 2003
- Sammani D. Abdullahi, Martin E. Dyer
, Les G. Proll:
Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems. DMTCS 2003: 89-96 - Klaus Ambos-Spies, Edgar Busse:
Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata. DMTCS 2003: 97-108 - Marian Alexandru Baroni:
On the Order Dual of a Riesz Space. DMTCS 2003: 109-117 - Symeon Bozapalidis, Antonios Kalampakas
:
A Finite Complete Set of Equations Generating Graphs. DMTCS 2003: 118-128 - Gregory J. Chaitin:
Two Philosophical Applications of Algorithmic Information Theory. DMTCS 2003: 1-10 - Catalin Dima:
Regular Expressions with Timed Dominoes. DMTCS 2003: 141-154 - Cunsheng Ding, Jin Yuan:
Covering and Secret Sharing with Linear Codes. DMTCS 2003: 11-25 - Olivier Finkel:
On Infinitary Rational Relations and Borel Sets. DMTCS 2003: 155-167 - Frédéric Gardi:
Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems. DMTCS 2003: 168-180 - André Große, Harald Hempel:
On Functions and Relations. DMTCS 2003: 181-192 - Bjarni V. Halldórsson, Vineet Bafna, Nathan Edwards, Ross Lippert, Shibu Yooseph, Sorin Istrail:
Combinatorial Problems Arising in SNP and Haplotype Analysis. DMTCS 2003: 26-47 - Mustapha Kchikech, Olivier Togni:
Paths Coloring Algorithms in Mesh Networks. DMTCS 2003: 193-202 - Bakhadyr Khoussainov:
Finite State Strategies in One Player McNaughton Games. DMTCS 2003: 203-214 - Mark Korenblit, Vadim E. Levit:
On Algebraic Expressions of Series-Parallel and Fibonacci Graphs. DMTCS 2003: 215-224 - Sven Kosub:
Boolean NP-Partitions and Projective Closure. DMTCS 2003: 225-236 - Vadim E. Levit, Eugen Mandrescu:
On Unimodality of Independence Polynomials of Some Well-Covered Trees. DMTCS 2003: 237-256 - Alberto Del Lungo, Andrea Frosini, Simone Rinaldi:
ECO Method and the Exhaustive Generation of Convex Polyominoes. DMTCS 2003: 129-140 - Maurice Margenstern:
Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A Survey. DMTCS 2003: 48-72 - Val Pinciu:
A Coloring Algorithm for Finding Connected Guards in Art Galleries. DMTCS 2003: 257-264 - K. Subramani:
An Analysis of Quantified Linear Programs. DMTCS 2003: 265-277 - Etsuji Tomita, Tomokazu Seki:
An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique. DMTCS 2003: 278-289 - Timothy Walsh:
Generating Gray Codes in O(1) Worst-Case Time per Word. DMTCS 2003: 73-88 - Xizhong Zheng, George Barmpalias
:
On the Monotonic Computability of Semi-computable Real Numbers. DMTCS 2003: 290-300 - Cristian Calude, Michael J. Dinneen, Vincent Vajnovszki:
Discrete Mathematics and Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings. Lecture Notes in Computer Science 2731, Springer 2003, ISBN 3-540-40505-4 [contents] - 2001
- Peter Schuster, Luminita Vîta, Douglas S. Bridges:
Apartness as a Relation Between Subsets. DMTCS 2001: 203-214 - Hatem M. Bahig, Mohamed H. El-Zahar, Ken Nakamula:
Some Results for Some Conjectures in Addition Chains. DMTCS 2001: 47-54 - Verónica Becher
, Sergio Daicz, Gregory J. Chaitin:
A Highly Random Number. DMTCS 2001: 55-68 - Douglas S. Bridges:
Dini's Theorem: A Constructive Case Study. DMTCS 2001: 69-80 - Henning Fernau:
Even Linear Simple Matrix Languages: Formal Language Aspects. DMTCS 2001: 81-96 - George Georgescu, Afrodita Iorgulescu:
Pseudo-BCK Algebras: An Extension of BCK Algebras. DMTCS 2001: 97-114
skipping 51 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.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-06-30 16:26 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