Остановите войну!
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 63 matches
- 2003
- Carme Àlvarez, Maria J. Blesa, Josep Díaz, Antonio Fernández, Maria J. Serna:
Adversarial Models for Priority-Based Networks. MFCS 2003: 142-151 - Kazuyuki Amano, Akira Maruoka:
On Optimal Merging Networks. MFCS 2003: 152-161 - Klaus Ambos-Spies:
Problems with Cannot Be Reduced to Any Proper Subproblems. MFCS 2003: 162-168 - Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch:
ACID-Unification Is NEXPTIME-Decidable. MFCS 2003: 169-178 - Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos:
Completeness in Differential Approximation Classes. MFCS 2003: 179-188 - Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, Masayuki Takeda:
On the Length of the Minimum Solution of Word Equations in One Variable. MFCS 2003: 189-197 - Cyril Banderier, René Beier, Kurt Mehlhorn:
Smoothed Analysis of Three Combinatorial Problems. MFCS 2003: 198-207 - Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda:
Inferring Strings from Graphs and Arrays. MFCS 2003: 208-217 - Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter:
Faster Algorithms for k-Medians in Trees. MFCS 2003: 218-227 - François Blanchard, Julien Cervelle, Enrico Formenti:
Periodicity and Transitivity for Cellular Automata in Besicovitch Topologies. MFCS 2003: 228-238 - Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos:
Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. MFCS 2003: 239-248 - Elmar Böhler, Christian Glaßer, Daniel Meister:
Error-Bounded Probabilistic Computations between MA and AM. MFCS 2003: 249-258 - Paul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger:
A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves. MFCS 2003: 259-268 - Michele Boreale, Maria Grazia Buscemi:
Symbolic Analysis of Crypto-Protocols Based on Modular Exponentiation. MFCS 2003: 269-278 - Michele Boreale, Fabio Gadducci:
Denotational Testing Semantics in Coinductive Form. MFCS 2003: 279-289 - Henrik Brosenne, Matthias Homeister, Stephan Waack:
Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. MFCS 2003: 290-299 - Antonio Bucciarelli, Antonino Salibra:
The Minimal Graph Model of Lambda Calculus. MFCS 2003: 300-307 - Harry Buhrman, Hein Röhrig:
Distributed Quantum Computing. MFCS 2003: 1-20 - Olivier Carton:
Unambiguous Automata on Bi-infinite Words. MFCS 2003: 308-317 - Ivana Cerná, Radek Pelánek:
Relating Hierarchy of Temporal Properties to Model Checking. MFCS 2003: 318-327 - Hubie Chen:
Arithmetic Constant-Depth Circuit Complexity Classes. MFCS 2003: 328-337 - Hubie Chen:
Inverse NP Problems. MFCS 2003: 338-347 - Zhi-Zhong Chen, Mitsuharu Kouno:
A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs. MFCS 2003: 348-357 - Víctor Dalmau, Daniel K. Ford:
Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity. MFCS 2003: 358-367 - Christian Delhommé, Teodor Knapik, D. Gnanaraj Thomas:
Using Transitive-Closure Logic for Deciding Linear Properties of Monoids. MFCS 2003: 378-387 - Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre:
Linear-Time Computation of Local Periods. MFCS 2003: 388-397 - Leah Epstein:
Two Dimensional Packing: The Power of Rotation. MFCS 2003: 398-407 - Leah Epstein, Tamir Tassa:
Approximation Schemes for the Min-Max Starting Time Problem. MFCS 2003: 408-418 - Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode:
Selfish Routing in Non-cooperative Networks: A Survey. MFCS 2003: 21-45 - Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen:
Quantum Testers for Hidden Group Properties. MFCS 2003: 419-428
skipping 33 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-23 11:03 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