Остановите войну!
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 66 matches
- 2000
- Farid M. Ablayev, Aida Gainutdinova:
On the Lower Bounds for One-Way Quantum Automata. MFCS 2000: 132-140 - Samson Abramsky, Marina Lenisa:
Axiomatizing Fully Complete Models for ML Polymorphic Types. MFCS 2000: 141-151 - Klaus Ambos-Spies:
Measure Theoretic Completeness Notions for the Exponential Time Classes. MFCS 2000: 152-161 - Lali Barrière, Josep Fàbrega:
Edge-Bisection of Chordal Rings. MFCS 2000: 162-171 - David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien:
Equation Satisfiability and Program Satisfiability for Finite Monoids. MFCS 2000: 172-181 - Jean Berstel, Luc Boasson:
XML Grammars. MFCS 2000: 182-191 - Therese C. Biedl, Brona Brejová, Tomás Vinar:
Simplifying Flow Networks. MFCS 2000: 192-201 - Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang:
Balanced k-Colorings. MFCS 2000: 202-211 - Frank S. de Boer, Marcello M. Bonsangue:
A Compositional Model for Confluent Dynamic Data-Flow Networks. MFCS 2000: 212-221 - Beate Bollig:
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. MFCS 2000: 222-231 - Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit:
Expressiveness of Updatable Timed Automata. MFCS 2000: 232-242 - Thomas Buchholz, Andreas Klein, Martin Kutrib:
Iterative Arrays with Small Time Bounds. MFCS 2000: 243-252 - Rostislav Caha, Petr Gregor:
Embedding Fibonacci Cubes into Hypercubes with Omega(2cn) Faulty Nodes. MFCS 2000: 253-263 - Arturo Carpi, Aldo de Luca:
Periodic-Like Words. MFCS 2000: 264-274 - Olivier Carton, Wolfgang Thomas:
The Monadic Theory of Morphic Infinite Words and Generalizations. MFCS 2000: 275-284 - Francesc Comellas, Margarida Mitjana, Lata Narayanan, Jaroslav Opatrny:
Optical Routing of Uniform Instances in Tori. MFCS 2000: 285-294 - Silvano Dal-Zilio, Andrew D. Gordon:
Region Analysis and a pi-Calculus wiht Groups. MFCS 2000: 1-20 - James H. Davenport:
Abstract Data Types in Computer Algebra. MFCS 2000: 21-35 - Camil Demetrescu, Giuseppe F. Italiano:
What Do We Learn from Experimental Algorithmics? MFCS 2000: 36-51 - Mariangiola Dezani-Ciancaglini, Furio Honsell, Yoko Motohama:
Compositional Characterizations of lambda-Terms Using Intersection Types. MFCS 2000: 304-313 - Stefan Dobrev:
Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks. MFCS 2000: 314-322 - Arnaud Durand, Miki Hermann, Phokion G. Kolaitis:
Subtractive Reductions and Complete Problems for Counting Complexity Classes. MFCS 2000: 323-332 - Todd Ebert, Heribert Vollmer:
On the Autoreducibility of Random Sequences. MFCS 2000: 333-342 - Zoltán Ésik:
Iteration Theories of Boolean Functions. MFCS 2000: 343-352 - Clelia de Felice:
Factorizing Codes and Schützenberger Conjectures. MFCS 2000: 295-303 - Alain Finkel, Grégoire Sutre:
An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS. MFCS 2000: 353-362 - Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs. MFCS 2000: 363-372 - Philippa Gardner, Lucian Wischik:
Explicit Fusions. MFCS 2000: 373-382 - Jan Friso Groote, Jaco van de Pol:
State Space Reduction Using Partial tau-Confluence. MFCS 2000: 383-393 - Radu Grosu:
And/Or Hierarchies and Round Abstraction. MFCS 2000: 52-63
skipping 36 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-26 13:02 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